A Study on the Convergence Analysis of the Inexact Simplified Jacobi–Davidson Method

The Jacobi–Davidson iteration method is very efficient in solving Hermitian eigenvalue problems. If the correction equation involved in the Jacobi–Davidson iteration is solved accurately, the simplified Jacobi–Davidson iteration is equivalent to the Rayleigh quotient iteration which achieves cubic c...

Full description

Saved in:
Bibliographic Details
Main Authors: Jutao Zhao, Pengfei Guo
Format: Article
Language:English
Published: Wiley 2021-01-01
Series:Journal of Mathematics
Online Access:http://dx.doi.org/10.1155/2021/2123897
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Jacobi–Davidson iteration method is very efficient in solving Hermitian eigenvalue problems. If the correction equation involved in the Jacobi–Davidson iteration is solved accurately, the simplified Jacobi–Davidson iteration is equivalent to the Rayleigh quotient iteration which achieves cubic convergence rate locally. When the involved linear system is solved by an iteration method, these two methods are also equivalent. In this paper, we present the convergence analysis of the simplified Jacobi–Davidson method and present the estimate of iteration numbers of the inner correction equation. Furthermore, based on the convergence factor, we can see how the accuracy of the inner iteration controls the outer iteration.
ISSN:2314-4785