Error Propagation Properties of Recursive Least-Squares Adaptation Algorithms
1984 (English)In: Proceedings of the 9th IFAC World Congress, Pergamon , 1984, 70-74 p.Conference paper (Refereed)
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
Pergamon , 1984. 70-74 p.
System identification, Recursive identification, Least-Squares Algorithm, Numerical properties
IdentifiersURN: urn:nbn:se:liu:diva-102285ISBN: 0080316662OAI: oai:DiVA.org:liu-102285DiVA: diva2:675916
9th IFAC World Congress, Budapest, Hungary, 2-6 July, 1984