Fast QR algorithms based on backward prediction errors: A new implementation and its finite precision performance
The solution of a recursive least-squares (RLS) problem is frequently performed using QR algorithms which are known in different versions. Fast QR algorithms can be subdivided according to the error type (a posteriori vs. a priori) as well as according to the type of the prediction error (forward vs. backward). In this way, four types of fast QR algorithms can be obtained according to this classification. This paper gives a systematic description of those algorithms which are based on the backward prediction errors. For each of the algorithms, two versions are discussed in detail. The computational complexity of the algorithms is compared, and their performance is illustrated using numerical simulations.
- Fixed-point error analysis of the QR-recursive least square algorithm
- scientific article; zbMATH DE number 125137
- Fast square-root RLS adaptive filtering algorithms
- Fast residual computation for sliding window recursive least squares methods
- Numerical characteristics of fast recursive least squares transversal adaptation algorithms - A comparative study
- Fast residual computation for sliding window recursive least squares methods
- A lattice algorithm dual to the extended inverse QR algorithm
- QR-decomposition-based least-squares lattice interpolators
- Fixed-point error analysis of the QR-recursive least square algorithm
- Multichannel fast QRD-RLS adaptive filtering: block-channel and sequential-channel algorithms based on updating backward prediction errors
This page was built for publication: Fast QR algorithms based on backward prediction errors: A new implementation and its finite precision performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1429409)