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 β¦
Bi-loop recursive least squares algorithm with forgetting factors
β Scribed by Wen-Chun Yu; Neng-Yih Shih
- Book ID
- 115515054
- Publisher
- IEEE
- Year
- 2006
- Tongue
- English
- Weight
- 162 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1070-9908
No coin nor oath required. For personal study only.
π 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
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
Recursive least-square algorithm with ud
β
Hiroshi Tsubokawa; Shigeo Tsujii; Hajime Kubota
π
Article
π
1992
π
John Wiley and Sons
π
English
β 706 KB
Recursive least squares with stabilized
β
Marc Moonen; Joos Vandewalle
π
Article
π
1990
π
Elsevier Science
π
English
β 683 KB
Convergence analysis of recursive identi
β
R.Lozano L.
π
Article
π
1983
π
Elsevier Science
π
English
β 207 KB
Floating-point error analysis for recurs
β
Hiroshi Tsubokawa; Hajime Kubota; Shigeo Tsujii
π
Article
π
1991
π
John Wiley and Sons
π
English
β 650 KB