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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control Vol. 34; no. 6; pp. 656 - 658
Main Authors: Porat, B., Friedlander, B.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.06.1989
Institute of Electrical and Electronics Engineers
Subjects:
Applied sciences
Array signal processing
Computer science; control theory; systems
Control theory. Systems
Covariance matrix
Equations
Exact sciences and technology
Instruments
Modelling and identification
Numerical stability
Parameter estimation
Resonance light scattering
Robustness
Signal processing algorithms
Spectral analysis
Parameter estimation
Dynamic system
Square root
Recursive method
Overdetermination
Mathematical method
Algorithm
Instrumental variable algorithm
Numerical stability
ISSN:0018-9286
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9286
DOI:10.1109/9.24243