Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods

DOI10.1553/ETNA_VOL58S164MaRDI QIDQ6163324zbMATH OpenOpenAlexFDO

Authors James Baglama, Vasilije Perović

Publication date 9 June 2023

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL http://etna.mcs.kent.edu/volumes/2021-2030/vol58/abstract.php?vol=58&pages=164-176

zbMATH Keywords

(partial/truncated) singular value decompositiondeflationLanczos bidiagonalizationthresholding

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)

Recommendations

• Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
• Hybrid iterative refined restarted Lanczos bidiagonalization methods
• Improving approximate singular triplets in Lanczos bidiagonalization method
• An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
• An implicitly restarted Lanczos bidiagonalization method with refined vector

Cites work

• A randomized algorithm for the decomposition of matrices
• A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
• A Singular Value Thresholding Algorithm for Matrix Completion
• A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
• Accuracy of singular vectors obtained by projection-based SVD methods
• Analysis of directed networks via partial singular value decomposition and Gauss quadrature
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
• Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• scientific article; zbMATH DE number 5161643 (Why is no real title available?)
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• Hybrid iterative refined restarted Lanczos bidiagonalization methods
• Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
• On the computation of a truncated SVD of a large linear discrete ill-posed problem
• PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations
• Principal component analysis.
• Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
• Restarted block Lanczos bidiagonalization methods
• Templates for the Solution of Algebraic Eigenvalue Problems
• The University of Florida sparse matrix collection
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices

Cited in

(2)

• Deflated Krylov Iterations in Domain Decomposition Methods
• A hybrid algorithm for computing a partial singular value decomposition satisfying a given threshold

This page was built for publication: Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163324)