H/sup /spl infin// bounds for least-squares estimators

We obtain upper and lower bounds for the H/sup /spl infin// norm of the Kalman filter and the recursive-least-squares (RLS) algorithm, with respect to prediction and filtered errors. These bounds can be used to study the robustness properties of such estimators. One main conclusion is that, unlike H...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 46; no. 2; pp. 309 - 314
Main Authors Hassibi, B., Kaliath, T.
Format Journal Article
LanguageEnglish
Published IEEE 01.02.2001
Subjects
Adaptive filters
Computer errors
Estimation theory
Filtering algorithms
Information systems
Laboratories
Least squares approximation
Nonlinear filters
Resonance light scattering
Robustness
Online AccessGet full text
ISSN0018-9286
DOI10.1109/9.905700

Cover

More Information
Summary:We obtain upper and lower bounds for the H/sup /spl infin// norm of the Kalman filter and the recursive-least-squares (RLS) algorithm, with respect to prediction and filtered errors. These bounds can be used to study the robustness properties of such estimators. One main conclusion is that, unlike H/sup /spl infin//-optimal estimators which do not allow for any amplification of the disturbances, the least-squares estimators do allow for such amplification. This fact can be especially pronounced in the prediction error case, whereas in the filtered error case the energy amplification is at most four. Moreover, it is shown that the H/sup /spl infin// norm for RLS is data dependent, whereas for least-mean-squares (LMS) algorithms and normalized LMS, the H/sup /spl infin// norm is simply unity.
ISSN:0018-9286
DOI:10.1109/9.905700