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
✦ LIBER ✦
Exponential convergence of recursive least squares with exponential forgetting factor —adaptive control
✍ Scribed by Richard M. Johnstone; Brian D.O. Anderson
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 430 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
✦ Synopsis
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 exponentially stable. Keywork Adaptive control, Exponential stability, Recursive least squares. ' With further structural assumptions, multivariable plants could be considered,
📜 SIMILAR VOLUMES
Exponential convergence of recursive lea
✍
Richard M. Johnstone; C. Richard Johnson Jr.; Robert R. Bitmead; Brian D.O. Ande
📂
Article
📅
1982
🏛
Elsevier Science
🌐
English
⚖ 401 KB
Recursive Least Squares Estimator with M
✍
Hong-zhi An; Zhi-guo Li
📂
Article
📅
2002
🏛
Institute of Applied Mathematics, Chinese Academy
🌐
English
⚖ 232 KB
Convergence analysis of the least-square
✍
Rafael M. Canetti; Martín D. España
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 371 KB
On the exponential rate of convergence o
✍
B.L.S. Prakasa Rao
📂
Article
📅
1984
🏛
Elsevier Science
🌐
English
⚖ 153 KB
Exponential convergence of a model refer
✍
Soura Dasgupta; Brian D.O. Anderson; Ah-Chung Tsoi
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 465 KB