Gram-Schmidt algorithms for covariance propagation
- 1 December 1975
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 14, 489-498
- https://doi.org/10.1109/cdc.1975.270739
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 colored 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 0 references indexed in Scilit: