The University of Montana
Department of Mathematical Sciences
Technical report #29/2010
Krylov space approximate Kalman filtering
Johnathan M. Bardsley†, Marylesa Howard†, and Albert Parker*
† Department of Mathematical Sciences, University of Montana, Missoula, Montana, 59812, USA.
* Center for Biolm Engineering, Montana State University, Bozeman, Montana, 59717, USA.
AbstractThe Kalman filter is a technique for estimating a time-varying state given a dynamical model for, and indirect measurements of, the state. It is used, for example, on the control problems associated with a variety of navigation systems. Even in the case of nonlinear state and/or measurement models, standard implementations require only linear algebra. However, for sufficiently large-scale problems, such as arise in weather forecasting and oceanography, the matrix inversion and storage requirements of the Kalman filter are prohibitive, and hence, approximations must be made. In this paper, we describe how the conjugate gradient iteration can be used within the Kalman filter for quadratic minimization, as well as for obtaining low-rank, low-storage approximations of the covariance and inverse-covariance matrices required for its implementation. The approach requires that we exploit the connection between the conjugate gradient and Lanczos iterations. Copyright © 2000 John Wiley & Sons, Ltd.
Keywords: Krylov subspace methods, Kalman filter, data assimilation, inverse problems.
Download Technical Report: Pdf (187 KB)