论文信息 - A new shift scheme for the harmonic Arnoldi method

A new shift scheme for the harmonic Arnoldi method

The implicitly restarted harmonic Arnoldi algorithm by Morgan used those unwanted harmonic Ritz values as shifts-called Morgan's harmonic shifts. In this paper, a new shift scheme is given for the harmonic Arnoldi algorithm. We first analyze the harmonic Ritz values w"k"+"1,...,w"m of A from the orthogonal complement of span of those wanted harmonic Ritz vectors with respect to K"m(A,v"1), then present an implicitly restarted harmonic Arnoldi algorithm with w"k"+"1,...,w"m as shifts. Finally, through the numerical experiments, we mainly draw comparisons on our algorithm and Morgan's algorithm, and show our algorithm often performed better than Morgan's one.

Guizhi Chen | Jianhua Lin | Jianhua Lin | Guizhi Chen

[1] Danny C. Sorensen,et al. Implicit Application of Polynomial Filters in a k-Step Arnoldi Method , 1992, SIAM J. Matrix Anal. Appl..

[2] R. Morgan. Computing Interior Eigenvalues of Large Matrices , 1991 .

[3] John G. Lewis,et al. Sparse matrix test problems , 1982, SGNM.

[4] Zhongxiao Jia,et al. The Refined Harmonic Arnoldi Method and an Implicitly Restarted Refined Algorithm for Computing Interior Eigenpairs of Large Matrices , 2001 .

[5] Ronald B. Morgan,et al. Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations , 2000, SIAM J. Matrix Anal. Appl..

[6] Valeria Simoncini,et al. Variable Accuracy of Matrix-Vector Products in Projection Methods for Eigencomputation , 2005, SIAM J. Numer. Anal..

[7] R. Morgan,et al. Harmonic projection methods for large non-symmetric eigenvalue problems , 1998 .

[8] Jack Dongarra,et al. A Test Matrix Collection for Non-Hermitian Eigenvalue Problems , 1997 .