论文信息 - Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix

Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix

Abstract In this paper, we present a new algorithm, which is called weighted restarting algorithm for computing the eigenvalues of a nonsymmetric matrix. It has been applied to the weighted Arnoldi method, developed by [A. Essai, Weighted FOM and GMRES for solving nonsymmetric linear systems, Numer. Algorithm 18 (1998) 277–292]. The implementation of the algorithm has been tested by numerical examples, the results show that the algorithm converges fast and works with high accuracy.

H. Saberi Najafi | H. Ghazvini

[1] Kesheng Wu,et al. Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods , 1998, SIAM J. Sci. Comput..

[2] Y. Saad,et al. Numerical solution of large nonsymmetric eigenvalue problems , 1989 .

[3] Azeddine Essai. Weighted FOM and GMRES for solving nonsymmetric linear systems , 2004, Numerical Algorithms.

[4] Ronald B. Morgan,et al. On restarting the Arnoldi method for large nonsymmetric eigenvalue problems , 1996, Math. Comput..

[5] H. Saberi Najafi,et al. A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix , 2004, Appl. Math. Comput..

[6] W. Arnoldi. The principle of minimized iterations in the solution of the matrix eigenvalue problem , 1951 .

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