Restarted block Lanczos bidiagonalization methods
From MaRDI portal
Publication:870765
DOI10.1007/s11075-006-9057-zzbMath1110.65027OpenAlexW2047811252MaRDI QIDQ870765
Publication date: 15 March 2007
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-006-9057-z
numerical examplesaugmentationsingular vectorsKrylov subspacespartial singular value decompositionRitz vectorsimplicit shiftsrestarted iterative method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items
On the computation of a truncated SVD of a large linear discrete ill-posed problem, A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices, Split-and-combine singular value decomposition for large-scale matrix, An implicitly restarted block Lanczos bidiagonalization method using Leja shifts, Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem, Projected Tikhonov regularization of large-scale discrete ill-posed problems, An augmented LSQR method, A compact heart iteration for low-rank approximations of large matrices, GCV for Tikhonov regularization by partial SVD, Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods, Eigenvalue Characterization and Computation for the Laplacian on General 2-D Domains, The minimal-norm Gauss-Newton method and some of its regularized variants, A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices, Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces, Computing the smallest singular triplets of a large matrix, Probabilistic upper bounds for the matrix two-norm, Fast computation of convolution operations via low-rank approximation, Augmented block Householder Arnoldi method, Analysis of directed networks via partial singular value decomposition and Gauss quadrature, 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, na26, A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices, Stable Computation of Generalized Matrix Functions via Polynomial Interpolation, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restarted block-GMRES with deflation of eigenvalues
- Computing interior eigenvalues of large matrices
- An implicit shift bidiagonalization algorithm for ill-posed systems
- 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
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- A Jacobi--Davidson Type SVD Method
- Implicitly Restarted Arnoldi Methods and Subspace Iteration
- Numerical methods for large eigenvalue problems
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Using Linear Algebra for Intelligent Information Retrieval
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
