Exponential convergence of recursive least squares with exponential forgetting factor

Richard Johnstone, C Richard Johnson, Robert R. Bitmead, Brian Anderson

Research output: Contribution to conferencePaperpeer-review

Abstract

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.
Original languageEnglish
Pages994-997
Number of pages4
DOIs
Publication statusPublished - 1982
Event21st IEEE Conference on Decision and Control - Holiday Inn-International Drive, Orlando, United States
Duration: 8 Dec 198210 Dec 1982

Conference

Conference21st IEEE Conference on Decision and Control
Country/TerritoryUnited States
CityOrlando
Period8/12/8210/12/82

Fingerprint

Dive into the research topics of 'Exponential convergence of recursive least squares with exponential forgetting factor'. Together they form a unique fingerprint.

Cite this