Block RLS using row Householder reflections
The authors introduce new row Householder and row hyperbolic Householder reflections to zero a contiguous sequence of entries in a row of a matrix when applied from the left. These reflections are used to develop efficient algorithms for recursive least squares (RLS) problems of the sliding window type. These algorithms are based upon rank-\(k\) modification to the inverse Cholesky factor \(R^{-1}\) of the covariance matrix. Numerical experiments show that these algorithms are rich in matrix- matrix BLAS-3 computations, making them even more economical on high performance architectures than \(k\) applications of rank-1 modification schemes.
- Recursive least-squares using a hybrid Householder algorithm on massively parallel SIMD systems.
- Hyperbolic Householder Transforms
- Fast residual computation for sliding window recursive least squares methods
- scientific article; zbMATH DE number 800018
- The fast recursive row-Householder subspace tracking algorithm
- A Storage-Efficient WY Representation for Products of Householder Transformations
- Accurate Downdating of Least Squares Solutions
- Adaptive Lanczos methods for recursive condition estimation
- Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing
- Block RLS using row Householder reflections
- Cholesky Factor Updating Techniques for Rank 2 Matrix Modifications
- Fast Adaptive Condition Estimation
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 4215266 (Why is no real title available?)
- scientific article; zbMATH DE number 43706 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- Hyperbolic householder transformations
- Least squares modifications with inverse factorizations: Parallel implications
- Methods for Modifying Matrix Factorizations
- Modification of the Householder Method Based on the Compact WY Representation
- Perturbation Bounds for the $QR$ Factorization of a Matrix
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Stability Analysis of a Householder-Based Algorithm for Downdating the Cholesky Factorization
- The Effects of Rounding Error on an Algorithm for Downdating a Cholesky Factorization
- Block RLS using row Householder reflections
- Inverse updating and downdating for weighted linear least squares using \(M\)-invariant reflections
- Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999
- Dedication to Robert J. Plemmons
- The fast recursive row-Householder subspace tracking algorithm
- Square-root Householder subspace tracking
- Fast inverse Cholesky decomposition for rectangular Toeplitz-block matrix
- A vectorized systolic array for parallel weight extraction of block RLS
- scientific article; zbMATH DE number 800018 (Why is no real title available?)
- Updating the principal angle decomposition
This page was built for publication: Block RLS using row Householder reflections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260781)