By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
P. Carrette ; CESAME, Louvain-la-Neuve, Belgium

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

Published in:

Decision and Control, 1996., Proceedings of the 35th IEEE Conference on  (Volume:1 )

Date of Conference:

11-13 Dec 1996