A fast algorithm for the recursive calculation of dominant singular subspaces
From MaRDI portal
Publication:932707
DOI10.1016/j.cam.2006.12.032zbMath1154.65319MaRDI QIDQ932707
Marc Van Barel, Nicola Mastronardi, Raf Vandebril
Publication date: 11 July 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2006.12.032
15A23: Factorization of matrices
15A09: Theory of matrix inversion and generalized inverses
15A15: Determinants, permanents, traces, other special matrix functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On computing the eigenvectors of a class of structured matrices
- An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
- Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values
- Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
- A note on the recursive calculation of dominant singular subspaces
- Two-way bidiagonalization scheme for downdating the singular-value decomposition
- Recursive Calculation of Dominant Singular Subspaces