The square-root overdetermined recursive instrumental variable algorithm
A square-root version of the overdetermined recursive instrumental variable (ORIV) algorithm is derived. This version improves the numerical stability of the algorithm, and avoids the problem of positive-definiteness of the inverse covariance matrix. The algorithm uses square-root arrays, and both o...
Uložené v:
| Vydané v: | IEEE transactions on automatic control Ročník 34; číslo 6; s. 656 - 658 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY
IEEE
01.06.1989
Institute of Electrical and Electronics Engineers |
| Predmet: | |
| ISSN: | 0018-9286 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | A square-root version of the overdetermined recursive instrumental variable (ORIV) algorithm is derived. This version improves the numerical stability of the algorithm, and avoids the problem of positive-definiteness of the inverse covariance matrix. The algorithm uses square-root arrays, and both orthogonal and hyperbolic rotations, as necessitated by the nature of the ORIV algorithm.< > |
|---|---|
| Bibliografia: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0018-9286 |
| DOI: | 10.1109/9.24243 |