Kalman Filter Sensitivity Evaluation With Orthogonal and J-Orthogonal Transformations

This technical note addresses the array square-root Kalman filtering/smoothing algorithms with the conventional orthogonal and J -orthogonal transformations. In the adaptive filtering context, J -orthogonal matrices arise in computation of the square-root of the covariance (or smoothed covariance) b...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on automatic control Ročník 58; číslo 7; s. 1798 - 1804
Hlavní autori: Kulikova, M. V., Pacheco, A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.07.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Array square-root algorithms
Arrays
Economic models
Equations
filter sensitivity equations
J -orthogonal matrices
Kalman filter
Kalman filters
Matrix decomposition
Maximum likelihood estimation
Sensitivity
Sensitivity analysis
Studies
Symmetric matrices
ISSN:0018-9286, 1558-2523
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This technical note addresses the array square-root Kalman filtering/smoothing algorithms with the conventional orthogonal and J -orthogonal transformations. In the adaptive filtering context, J -orthogonal matrices arise in computation of the square-root of the covariance (or smoothed covariance) by solving an equation of the form CCT = DDT - BBT . The latter implies an application of the QR decomposition with J -orthogonal transformations in each iteration step. In this paper, we extend functionality of array square-root Kalman filtering schemes and develop an elegant and simple method for computation of the derivatives of the filter variables to unknown system parameters required in a variety of applications. For instance, our result can be implemented for an efficient sensitivity analysis, and in gradient-search optimization algorithms for the maximum likelihood estimation of unknown system parameters. It also replaces the standard approach based on direct differentiation of the conventional Kalman filtering equations (with their inherent numerical instability) and, hence, improves the robustness of computations against roundoff errors.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2012.2231572