Square Root Modified Bryson-Frazier Smoother

We derive here an algorithm for a complete square root implementation of the modified Bryson-Frazier (MBF) smoother. The MBF algorithm computes the smoothed covariance as the difference of two symmetric matrices. Numerical errors in this differencing can result in the covariance matrix not being pos...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automatic control Jg. 56; H. 2; S. 452 - 456
1. Verfasser: Gibbs, R G
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.02.2011
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:0018-9286, 1558-2523
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We derive here an algorithm for a complete square root implementation of the modified Bryson-Frazier (MBF) smoother. The MBF algorithm computes the smoothed covariance as the difference of two symmetric matrices. Numerical errors in this differencing can result in the covariance matrix not being positive semi-definite. Earlier algorithms implemented the computation of intermediate quantities in square root form but still computed the smoothed covariance as the difference of two matrices. We show how to compute the square root of the smoothed covariance by solving an equation in the form CCT = AAT - BBT using QR decomposition with hyperbolic Householder transformations.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2010.2089753