New insights into the RLS algorithm
Summary: The recursive least squares (RLS) algorithm is one of the most popular adaptive algorithms that can be found in the literature, due to the fact that it is easily and exactly derived from the normal equations. In this paper, we give another interpretation of the RLS algorithm and show the importance of linear interpolation error energies in the RLS structure. We also give a very efficient way to recursively estimate the condition number of the input signal covariance matrix thanks to fast versions of the RLS algorithm. Finally, we quantify the misalignment of the RLS algorithm with respect to the condition number.
- RLS parameter convergence with overparameterized models
- Tracking the condition number for RLS in signal processing
- Neural network for the exact RLS adaptive algorithm
- Clipped input RLS applied to vehicle tracking
- A partially decoupled RLS algorithm for Volterra filters
- Application of recursive least square in single station passive location
- Rotation-based RLS algorithms: unified derivations, numerical properties, and parallel implementations
- A robust recursive least squares algorithm
- Compensation of the RLS algorithm for output nonlinearities
- Exact initialization of the recursive least-squares algorithm
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Analysis of the direct and indirect a posteriori RLSL algorithm
- The KaGE RLS algorithm
- scientific article; zbMATH DE number 5270828 (Why is no real title available?)
- Condition Monitoring of Electrolytic Capacitors via ESR Estimation with Recursive Least Squares and Sliding Mode Techniques
- Analysis of overshoot phenomena in initialisation stage of RLS algorithm
This page was built for publication: New insights into the RLS algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773713)