On Inner Iterations in the Shift-Invert Residual Arnoldi Method and the Jacobi--Davidson Method

Abstract

Using a new analysis approach, we establish a general convergence theory of the Shift-Invert Residual Arnoldi (SIRA) method for computing a simple eigenvalue nearest to a given target $\sigma$ and the associated eigenvector. In SIRA, a subspace expansion vector at each step is obtained by solving a certain inner linear system. We prove that the inexact SIRA method mimics the exact SIRA well, that is, the former uses almost the same outer iterations to achieve the convergence as the latter does if all the inner linear systems are iteratively solved with {\em low} or {\em modest} accuracy during outer iterations. Based on the theory, we design practical stopping criteria for inner solves. Our analysis is on one step expansion of subspace and the approach applies to the Jacobi--Davidson (JD) method with the fixed target $\sigma$ as well, and a similar general convergence theory is obtained for it. Numerical experiments confirm our theory and demonstrate that the inexact SIRA and JD are similarly effective and are considerably superior to the inexact SIA.

20 pages, 8 figures

References in corpus (1)

• On Convergence of the Inexact Rayleigh Quotient Iteration with MINRES

Cited by in corpus (11)

• Harmonic and Refined Harmonic Shift-Invert Residual Arnoldi and Jacobi--Davidson Methods for Interior Eigenvalue Problems
• iSIRA: Integrated Shift-Invert Residual Arnoldi Method for Graph Laplacian Matrices from Big Data
• 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
• An inexact Noda iteration for computing the smallest eigenpair of a large irreducible monotone matrix
• A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible M-matrix
• The inexact residual iteration method for quadratic eigenvalue problem and the analysis of convergence
• On inner iterations of Jacobi-Davidson type methods for large SVD computations
• Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems
• On the correction equation of the Jacobi-Davidson method