Analysis of a constrained forgetting factor recursive least squares algorithm in system identification

In this paper, we deal with deterministic dominance of stochastic equations. The obtained results lead to the evaluation of tight upper-bounds upon the parameter tracking error of the forgetting factor recursive least squares (RLS) algorithm applied to the identification of time-varying systems.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of 35th IEEE Conference on Decision and Control Jg. 1; S. 1079 - 1080 vol.1
1. Verfasser: Carrette, P.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 1996
Schlagworte:
Algorithm design and analysis
Equations
Least squares approximation
Least squares methods
Parameter estimation
Recursive estimation
Resonance light scattering
Stochastic processes
System identification
Time varying systems
ISBN:9780780335905, 0780335902
ISSN:0191-2216
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we deal with deterministic dominance of stochastic equations. The obtained results lead to the evaluation of tight upper-bounds upon the parameter tracking error of the forgetting factor recursive least squares (RLS) algorithm applied to the identification of time-varying systems.
ISBN:9780780335905
0780335902
ISSN:0191-2216
DOI:10.1109/CDC.1996.574645