Refined and refined harmonic Jacobi--Davidson methods for computing several GSVD components of a large regular matrix pair
arXiv:2309.17266 · doi:10.1007/s11075-024-01901-0
Abstract
Three refined and refined harmonic extraction-based Jacobi--Davidson (JD) type methods are proposed, and their thick-restart algorithms with deflation and purgation are developed to compute several generalized singular value decomposition (GSVD) components of a large regular matrix pair. The new methods are called refined cross product-free (RCPF), refined cross product-free harmonic (RCPF-harmonic) and refined inverse-free harmonic (RIF-harmonic) JDGSVD algorithms, abbreviated as RCPF-JDGSVD, RCPF-HJDGSVD and RIF-HJDGSVD, respectively. The new JDGSVD methods are more efficient than the corresponding standard and harmonic extraction-based JDSVD methods proposed previously by the authors, and can overcome the erratic behavior and intrinsic possible non-convergence of the latter ones. Numerical experiments illustrate that RCPF-JDGSVD performs better for the computation of extreme GSVD components while RCPF-HJDGSVD and RIF-HJDGSVD suit better for that of interior GSVD components.
arXiv comment27 pages, 4 figures
References in corpus (6)
- A Preconditioned Hybrid SVD Method for Computing Accurately Singular Triplets of Large Matrices
- On Inner Iterations in the Shift-Invert Residual Arnoldi Method and the Jacobi--Davidson Method
- 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
- 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 (GSVD) of a large matrix pair