Two-way bidiagonalization scheme for downdating the singular-value decomposition
From MaRDI portal
Publication:1894465
DOI10.1016/0024-3795(93)00273-3zbMath0833.65033OpenAlexW2029765191MaRDI QIDQ1894465
Haesun Park, Sabine Van Huffel
Publication date: 24 March 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(93)00273-3
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Recursive approximation of the dominant eigenspace of an indefinite matrix ⋮ A fast algorithm for the recursive calculation of dominant singular subspaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
- Implementation of adaptive array algorithms
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- The Effects of Rounding Error on an Algorithm for Downdating a Cholesky Factorization
- Accurate Downdating of Least Squares Solutions
- Updating the singular value decomposition
This page was built for publication: Two-way bidiagonalization scheme for downdating the singular-value decomposition