Square-root Bryson-Frazier smoothing algorithms

Some new square-root algorithms for Bryson-Frazier smoothing formulas are suggested: square-root algorithms and a fast square-root (or so-called Chandrasekhar type) algorithm. The new square-root algorithms use square-root arrays composed of smoothed estimates and their error covariances. These algo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on automatic control Ročník 40; číslo 4; s. 761 - 766
Hlavní autoři: PooGyeon Park, Kailath, T.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.04.1995
Institute of Electrical and Electronics Engineers
Témata:
ISSN:0018-9286
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Some new square-root algorithms for Bryson-Frazier smoothing formulas are suggested: square-root algorithms and a fast square-root (or so-called Chandrasekhar type) algorithm. The new square-root algorithms use square-root arrays composed of smoothed estimates and their error covariances. These algorithms provide many advantages over the conventional algorithms with respect to systolic array and parallel implementations as well as numerical stability and conditioning. For the case of constant-parameter systems, a fast square-root algorithm is suggested, which requires less computation than others.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9286
DOI:10.1109/9.376092