Cart (Loading....) | Create Account
Close category search window

An algorithm for RLS identification parameters that vary quickly with time

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
$31 $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

2 Author(s)
Bobrow, J.E. ; Dept. of Mech. & Aerosp. Eng., California Univ., Irvine, CA, USA ; Murray, W.

An alternative to the standard recursive least-squares (RLS) algorithm for fixed-order systems with exponential data weighting is presented. The approach uses Givens orthogonal transformations to update the Cholesky factor of the information matrix without ever needing to form it. The resulting algorithm gives higher-precision control and is less sensitive to ill-conditioning when compared to other reported approaches. It is demonstrated by an example that ill-conditioned problems with parameters that vary quickly can be modified to stabilize erratic parameter fluctuations

Published in:

Automatic Control, IEEE Transactions on  (Volume:38 ,  Issue: 2 )

Date of Publication:

Feb 1993

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.