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 orthogonal and hyperbolic rotations, as necessitated by the nature of the ORIV algorithm.<
>