Sequential square root filtering and smoothing of discrete linear systems
Automatica (Journal of IFAC)
Brief paper: Finite difference implementation of distributed parameter filters
Automatica (Journal of IFAC)
| Hi-index | 22.15 |
The discrete linear filtering problem is treated by factoring the filter error covariance matrix as P = UDU^T. Efficient and stable measurement updating recursions are developed for the unit upper triangular factor, U, and the diagonal factor, D. This paper treats only the parameter estimation problem; effects of mapping, inclusion of process noise and other aspects of filtering are treated in separate publications. The algorithm is simple and, except for the fact that square roots are not involved, can be likened to square root filtering. Like the square root filter our algorithm guarantees nonnegativity of the computed covariance matrix. As is the case with the Kalman filter, our algorithm is well suited for use in real time. Attributes of our factorization update include: efficient one point at a time processing that requires little more computation than does the optimal but numerically unstable conventional Kalman measurement update algorithm; stability that compares with the square root filter and the variable dimension flexibility that is enjoyed by the square root information filter. These properties are the subject of this paper.