Gram-Schmidt algorithms for covariance propagation†
- 1 February 1977
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 25 (2) , 243-260
- https://doi.org/10.1080/00207177708922225
Abstract
This paper addresses the time propagation of triangular covariance factors. Attention is focused on the square-root free factorization, P =:UDUT , where U is unit upper triangular and D is diagonal. An efficient and reliable algorithm for U-D propagation is derived which employs Gram-Schmidt orthogonalization. Partitioning the state vector to distinguish bias and coloured process noise parameters increases mapping efficiency. Cost comparisons of the U-D, Schmidt square-root covariance and conventional covariance propagation methods are made using weighted arithmetic operation counts. The U-D time update is shown to be less costly than the Schmidt method ; and, except in unusual circumstances, it is within 20% of the cost of conventional propagation.Keywords
This publication has 7 references indexed in Scilit:
- Fast triangular formulation of the square root filter.AIAA Journal, 1973
- A Comparison of Discrete Linear Filtering AlgorithmsIEEE Transactions on Aerospace and Electronic Systems, 1973
- Discrete square root filtering: A survey of current techniquesIEEE Transactions on Automatic Control, 1971
- Experiments on error growth associated with some linear least-squares proceduresMathematics of Computation, 1968
- Solving linear least squares problems by Gram-Schmidt orthogonalizationBIT Numerical Mathematics, 1967
- Experiments on Gram-Schmidt orthogonalizationMathematics of Computation, 1966
- A New Approach to Linear Filtering and Prediction ProblemsJournal of Basic Engineering, 1960