A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices
From MaRDI portal
Publication:5230648
DOI10.1137/18M1222004zbMath1420.65047OpenAlexW2961695462MaRDI QIDQ5230648
Steven Goldenberg, Eloy Romero, Andreas Stathopoulos
Publication date: 28 August 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1222004
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Linear transformations, semilinear transformations (15A04)
Related Items (2)
Hybrid iterative refined restarted Lanczos bidiagonalization methods ⋮ Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- Restarted block Lanczos bidiagonalization methods
- Iterative algorithms for Gram-Schmidt orthogonalization
- Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
- Principal component analysis.
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- A Jacobi--Davidson Type SVD Method
- The university of Florida sparse matrix collection
- A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- 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
- A Block Orthogonalization Procedure with Constant Synchronization Requirements
- On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
- Iterative Validation of Eigensolvers: A Scheme for Improving the Reliability of Hermitian Eigenvalue Solvers
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse
This page was built for publication: A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices
