Harmonic and Refined Harmonic Shift-Invert Residual Arnoldi and Jacobi--Davidson Methods for Interior Eigenvalue Problems
arXiv:1210.4658 · doi:10.1016/j.cam.2014.12.043
Abstract
This paper concerns the harmonic shift-invert residual Arnoldi (HSIRA) and Jacobi--Davidson (HJD) methods as well as their refined variants RHSIRA and RHJD for the interior eigenvalue problem. Each method needs to solve an inner linear system to expand the subspace successively. When the linear systems are solved only approximately, we are led to the inexact methods. We prove that the inexact HSIRA, RHSIRA, HJD and RHJD methods mimic their exact counterparts well when the inner linear systems are solved with only low or modest accuracy. We show that (i) the exact HSIRA and HJD expand subspaces better than the exact SIRA and JD and (ii) the exact RHSIRA and RHJD expand subspaces better than the exact HSIRA and HJD. Based on the theory, we design stopping criteria for inner solves. To be practical, we present restarted HSIRA, HJD, RHSIRA and RHJD algorithms. Numerical results demonstrate that these algorithms are much more efficient than the restarted standard SIRA and JD algorithms and furthermore the refined harmonic algorithms outperform the harmonic ones very substantially.
15 pages, 4 figures
References in corpus (1)
Cited by in corpus (6)
- 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
- Refined and refined harmonic Jacobi--Davidson methods for computing several GSVD components of a large regular matrix pair
- Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems
- On inner iterations of Jacobi-Davidson type methods for large SVD computations
- On the correction equation of the Jacobi-Davidson method