Implicit Kalman filtering.
For an implicitly defined discrete system, a new algorithm for Kalman filtering is developed and an efficient numerical implementation scheme is proposed. Unlike the traditional explicit approach, the implicit filter can be readily applied to ill-conditioned systems and allows for generalization to descriptor systems. The implementation of the implicit filter depends on the solution of the congruence matrix equation (A1)(Px)(AT1) = Py. We develop a general iterative method for the solution of this equation, and prove necessary and sufficient conditions for convergence. It is shown that when the system matrices of an implicit system are sparse, the implicit Kalman filter requires significantly less computer time and storage to implement as compared to the traditional explicit Kalman filter. Simulation results are presented to illustrate and substantiate the theoretical developments.
Skliar
M
M
Department of Chemical and Fuels Engineering, University of Utah, Salt Lake City 84112, USA. Mikhail.Skliar@m.cc.utah.edu
Ramirez
W F
WF
D000465:Algorithms; D003198:Computer Simulation; D001330:Electronic Data Processing; D008433:Mathematics; D008962:Models, Theoretical; D013269:Stochastic Processes