Error Propagation Properties of Recursive Least Squares Adaptation Algorithms
1985 (English)In: Automatica, ISSN 0005-1098, Vol. 21, no 2, 157-167 p.Article in journal (Refereed) Published
The numerical properties of implementations of the recursive least-squares identification algorithm are of great importance for their continuous use in various adaptive schemes. Here we investigate how an error that is introduced at an arbitrary point in the algorithm propagates. It is shown that conventional LS algorithms, including Bierman's UD-factorization algorithm are exponentially stable with respect to such errors, i.e. the effect of the error decays exponentially. The base of the decay is equal to the forgetting factor. The same is true for fast lattice algorithms. The fast least-squares algorithm, sometimes known as the ‘fast Kalman algorithm’ is however shown to be unstable with respect to such errors.
Place, publisher, year, edition, pages
Elsevier, 1985. Vol. 21, no 2, 157-167 p.
System identification, Recursive identification, Least-squares algorithm, Numerical properties
IdentifiersURN: urn:nbn:se:liu:diva-103948DOI: 10.1016/0005-1098(85)90110-4OAI: oai:DiVA.org:liu-103948DiVA: diva2:693282