On covariance propagation using matrix continued fractions
- 1 August 1979
- journal article
- research article
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 10 (8) , 913-925
- https://doi.org/10.1080/00207727908941631
Abstract
The use of matrix continued fractions provides new methods to study the covariance matrix of the discrete Kalman filter. This approach can be used to obtain approximations to the covariance matrix using a reduced number of calculations and computer storage. Sequential bounds can also be calculated from this procedure and the bias resulting from the use of these bounds is determined. This approach has application for very large dimensional systems in which it is not possible, in practice, to store large matrices in computer memory or to perform many matrix computations.Keywords
This publication has 13 references indexed in Scilit:
- Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problemsIEEE Transactions on Automatic Control, 1978
- Additional properties and applications of matrix continued fraction†International Journal of Systems Science, 1977
- Control of divergence in Kalman filtersElectronics Letters, 1976
- Some new algorithms for recursive estimation in constant, linear, discrete-time systemsIEEE Transactions on Automatic Control, 1974
- The continued fraction representation of transfer functions and model simplification †International Journal of Control, 1973
- On a game problem involving systems with time delayIEEE Transactions on Automatic Control, 1973
- Noncommutative Continued FractionsSIAM Journal on Mathematical Analysis, 1971
- Recursive fading memory filteringInformation Sciences, 1971
- Conditions for asymptotic stability of the discrete minimum-variance linear estimatorIEEE Transactions on Automatic Control, 1968
- Controllability and Observability of Linear Discrete-time Systems†International Journal of Control, 1965