Some new algorithms for recursive estimation in constant, linear, discrete-time systems

Certain recently developed fast algorithms for recursive estimation in constant continuous-time linear systems are extended to discrete-time systems. The main feature is the replacement of the Riccati-type difference equation that is generally used for such problems by another set of difference equations that we call of Chandrasekhar-type. The total number of operations in the new algorithm is in general less than with the Riccati-equation based Kalman filter, with significant reductions being obtained in several important special cases. The algorithms are derived via a factorization of increments of the Riccati equation variable, a method that can be extended to nonsymmetric Riccati equations as well.