By Topic

On the numerical stability and accuracy of the conventional recursive least squares algorithm

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)
Liavas, A.P. ; Dept. Signal et Image, Inst. Nat. des Telecommun., Evry, France ; Regalia, P.A.

We study the nonlinear round-off error accumulation system of the conventional recursive least squares algorithm, and we derive bounds for the relative precision of the computations in terms of the conditioning of the problem and the exponential forgetting factor, which guarantee the numerical stability of the finite-precision implementation of the algorithm; the positive definiteness of the finite-precision inverse data covariance matrix is also guaranteed. Bounds for the accumulated round-off errors in the inverse data covariance matrix are also derived. In our simulations, the measured accumulated roundoffs satisfied, in steady state, the analytically predicted bounds. We consider the phenomenon of explosive divergence using a simplified approach; we identify the situations that are likely to lead to this phenomenon; simulations confirm our findings

Published in:

Signal Processing, IEEE Transactions on  (Volume:47 ,  Issue: 1 )