The fast recursive row-Householder subspace tracking algorithm
From MaRDI portal
Publication:1957690
DOI10.1016/j.sigpro.2009.04.012zbMath1197.94126OpenAlexW2037229515MaRDI QIDQ1957690
Publication date: 27 September 2010
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2009.04.012
eigenvalueseigenvectorsHouseholdersubspace trackingorthogonal iterationBiSVDFAPILORAFPASTQS-factorization
Related Items (5)
Square-root Householder subspace tracking ⋮ A novel adaptive V-BLAST algorithm based on subspace tracking and Hermitian matrix perturbation theorem ⋮ Updating the principal angle decomposition ⋮ The Householder compressor theorem and its application in subspace tracking ⋮ Sliding window adaptive SVD using the unsymmetric Householder partial compressor
Cites Work
- Unnamed Item
- On the efficient update of rectangular LU-factorizations subject to low rank modifications
- Linear prediction theory. A mathematical basis for adaptive systems
- Block RLS using row Householder reflections
- Square Hankel SVD subspace tracking algorithms
- Computational aspects of F. L. Bauer's simultaneous iteration method
- Fast orthogonal iteration adaptive algorithms for the generalized symmetric eigenproblem
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Methods for Modifying Matrix Factorizations
- Adaptive power techniques for blind channel estimation in CDMA systems
- Fast approximated power iteration subspace tracking
- Bi-iterative least-square method for subspace tracking
This page was built for publication: The fast recursive row-Householder subspace tracking algorithm