On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations

DOI10.1137/18M1192019zbMath1420.65049arXiv1711.05372OpenAlexW2964348904MaRDI QIDQ5230610

Jinzhi Huang, Zhongxiao Jia

Publication date: 28 August 2019

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.05372

zbMATH Keywords

singular tripletsinner iterationsubspace expansionharmonic extractionJDSVD methodrefined harmonic extraction

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10)

Related Items (4)

Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair ⋮ A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair ⋮ Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets ⋮ A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices

Uses Software

• PRIMME
• SparseMatrix
• PHSVDS
• PRIMME_SVDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Krylov-Schur approach to the truncated SVD
• A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
• Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
• A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization
• Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
• Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
• Some theoretical comparisons of refined Ritz vectors and Ritz vectors
• Using cross-product matrices to compute the SVD
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
• An analysis of the Rayleigh--Ritz method for approximating eigenspaces
• Matrix Algorithms
• A Jacobi--Davidson Type SVD Method
• The university of Florida sparse matrix collection
• Numerical Methods for Large Eigenvalue Problems
• A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
• A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices
• Controlling Inner Iterations in the Jacobi–Davidson Method
• An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
• A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
• Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
• The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
• Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
• The Convergence of Harmonic Ritz Vectors and Harmonic Ritz Values, Revisited
• PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations

This page was built for publication: On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations