Two harmonic Jacobi--Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
arXiv:2201.02903 · doi:10.1007/s10915-022-01993-7
Abstract
Two harmonic extraction based Jacobi--Davidson (JD) type algorithms are proposed to compute a partial generalized singular value decomposition (GSVD) of a large regular matrix pair. They are called cross product-free (CPF) and inverse-free (IF) harmonic JDGSVD algorithms, abbreviated as CPF-HJDGSVD and IF-HJDGSVD, respectively. Compared with the standard extraction based JDGSVD algorithm, the harmonic extraction based algorithms converge more regularly and suit better for computing GSVD components corresponding to interior generalized singular values. Thick-restart CPF-HJDGSVD and IF-HJDGSVD algorithms with some deflation and purgation techniques are developed to compute more than one GSVD components. Numerical experiments confirm the superiority of CPF-HJDGSVD and IF-HJDGSVD to the standard extraction based JDGSVD algorithm.
arXiv comment24 pages, 5 figures
References in corpus (7)
- On Inner Iterations in the Shift-Invert Residual Arnoldi Method and the Jacobi--Davidson Method
- A Preconditioned Hybrid SVD Method for Computing Accurately Singular Triplets of Large Matrices
- A Joint Bidiagonalization Based Algorithm for Large Scale Linear Discrete Ill-posed Problems in General-Form Regularization
- Harmonic and Refined Harmonic Shift-Invert Residual Arnoldi and Jacobi--Davidson Methods for Interior Eigenvalue Problems
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
- The joint bidiagonalization process with partial reorthogonalization
- Generalized Davidson and multidirectional-type methods for the generalized singular value decomposition
Cited by in corpus (3)
- The joint bidiagonalization method for large GSVD computations in finite precision
- Refined and refined harmonic Jacobi--Davidson methods for computing several GSVD components of a large regular matrix pair
- A CJ-FEAST GSVDsolver for computing a partial GSVD of a large matrix pair with the generalized singular values in a given interval