liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Performance Analysis of the Forgetting Factor RLS Algorithms
Academica Sinica, China.
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
Université Pierre et Marie Curie, France.
1992 (English)Report (Other academic)
Abstract [en]

An analysis is given of the performance of the standard forgetting factor recursive least squares (RLS) algorithm when used for tracking time-varying linear regression models. Three basic results are obtained: (1) the ‘P-matrix’ in the algorithm remains bounded if and only if the (time-varying) covariance matrix of the regressors is uniformly non-singular; (2) if so, the parameter tracking error covariance matrix is of the order O(μ + γ2/μ), where μ = 1 - λ, λ is the forgetting factor and γ is a quantity reflecting the speed of the parameter variations; (3) this covariance matrix can be arbitrarily well approximated (for small enough μ) by an expression that is easy to compute.

Place, publisher, year, edition, pages
Linköping: Linköping University , 1992.
LiTH-ISY-I, ISSN 8765-4321 ; 1433
Keyword [en]
Adaptation, Least squares, Tracking, Recursive identification
National Category
Control Engineering
URN: urn:nbn:se:liu:diva-55573OAI: diva2:316342
Available from: 2010-04-30 Created: 2010-04-30 Last updated: 2013-07-30

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Ljung, Lennart
By organisation
Automatic ControlThe Institute of Technology
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 39 hits
ReferencesLink to record
Permanent link

Direct link