Skip to main content

Part of the book series: Springer Series in Information Sciences ((SSINF,volume 17))

  • 448 Accesses

Abstract

The limiting (or steady-state) Kalman filter provides a very effi­cient method for estimating the state vector in a time-invariant linear system in real-time. However, if the state vector is of very high dimension n, and only a few components are of interest, this filter gives an abundance of useless information, an elimination of which should improve the efficiency of the filtering process. A decoupling method is introduced in this chapter for this purpose. It allows us to decompose an n-dimensional limiting Kalman filtering equation into n independent one-dimensional recursive for mulas so that we may drop the ones that are of little interest.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chui, C.K., Chen, G. (1987). Decoupling of Filtering Equations. In: Kalman Filtering with Real-Time Applications. Springer Series in Information Sciences, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02508-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-02508-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-02510-9

  • Online ISBN: 978-3-662-02508-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics