An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
From MaRDI portal
Publication:4443811
DOI10.1137/S0895479802404192zbMath1063.65030OpenAlexW1965497533MaRDI QIDQ4443811
Publication date: 18 January 2004
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479802404192
convergencesingular value decompositionnumerical experimentsimplicit restartsingular vectorexact shiftsrefined Ritz vectorrefined shiftsRitz valuerefined bidiagonalization Lanczos method
Related Items
Adaptive cross approximation for ill-posed problems, The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision, A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices, An implicitly restarted block Lanczos bidiagonalization method using Leja shifts, Mixed and componentwise condition numbers for a linear function of the solution of the total least squares problem, Restarted block Lanczos bidiagonalization methods, On the condition number of the total least squares problem, An augmented LSQR method, A compact heart iteration for low-rank approximations of large matrices, A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices, GCV for Tikhonov regularization by partial SVD, Hybrid iterative refined restarted Lanczos bidiagonalization methods, Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets, A Krylov-Schur approach to the truncated SVD, Some properties of LSQR for large sparse linear least squares problems, An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval, A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices, Some results on the regularization of LSQR for large-scale discrete ill-posed problems, Computing the smallest singular triplets of a large matrix, The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors, Lanczos method for large-scale quaternion singular value decomposition, On choices of formulations of computing the generalized singular value decomposition of a large matrix pair, An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets, A cross-product approach for low-rank approximations of large matrices, PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations, Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems, On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations, A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
Uses Software
