𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exponential convergence of recursive least squares with exponential forgetting factor

✍ Scribed by Richard M. Johnstone; C. Richard Johnson Jr.; Robert R. Bitmead; Brian D.O. Anderson


Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
401 KB
Volume
2
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

✦ Synopsis


This paper demonstrates that, provided the system input is persistently exciting, the recursive least squares estimation algorithm with exponential forgetting factor is exponentially convergent.

Further, it is shown that the incorporation of the exponential forgetting factor is necessary to attain this convergence and that the persistence of excitation is virtually necessary. The result holds for stable finite-dimensional, linear, time-invariant systems but has its chief implications to the robustness of the parameter estimator when these conditions fail.


πŸ“œ SIMILAR VOLUMES


Exponential convergence of recursive lea
✍ Richard M. Johnstone; Brian D.O. Anderson πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 430 KB

In this paper we demonstrate that provided the setpoint sequence is persistently exciting and the plant is linear, finite-dimensional, time-invariant and possesses a stable inverse, a trajectory-following adaptive control algorithm, with exponential forgetting recursive least squares, is exponential

Convergence analysis of the RLS identifi
✍ B. Lindoff; J. Holst πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 171 KB πŸ‘ 2 views

The recursive least-squares (RLS) identiΓΏcation algorithm is often extended with exponential forgetting as a tool for parameter estimation in time-varying stochastic systems. The statistical properties of the parameter estimates obtained from such an extended RLS-algorithm depend in a non-linear way