Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
CrossRef Search
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
You requested this document:
1. On the numerical stability and accuracy of the conventional recursive least squares algorithm
Liavas, A.P.; Regalia, P.A.;
Signal Processing, IEEE Transactions on [see also Acoustics, Speech, and Signal Processing, IEEE Transactions on]
Volume 47,  Issue 1,  Jan. 1999 Page(s):88 - 96
Abstract:

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
Abstract | Full Text: PDF(352 KB)    IEEE JNL
 
» Key
IEEE JNL IEEE Journal or Magazine
IEE JNL IEE Journal or Magazine
IEEE CNF IEEE Conference Proceeding
IEE CNF IEE Conference Proceeding
IEEE STD IEEE Standard
 
 
Indexed by IEE Inspec
© Copyright 2008 IEEE – All Rights Reserved