论文信息 - The Implicitly Restarted Arnoldi Method - 字舞流文

The Implicitly Restarted Arnoldi Method

[1] Danny C. Sorensen,et al. Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations , 2005, SIAM Rev..

[2] John Rossi,et al. Convergence of Restarted Krylov Subspaces to Invariant Subspaces , 2004, SIAM J. Matrix Anal. Appl..

[3] D. Sorensen. Numerical methods for large eigenvalue problems , 2002, Acta Numerica.

[4] Chao Yang,et al. ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods , 1998, Software, environments, tools.

[5] Karl Meerbergen,et al. Implicitly restarted Arnoldi with purification for the shift-invert transformation , 1997, Math. Comput..

[6] D. Calvetti,et al. Iterative methods for the computation of a few eigenvalues of a large symmetric matrix , 1996 .

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

[8] J. G. Lewis,et al. A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems , 1994, SIAM J. Matrix Anal. Appl..

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

[10] Jack J. Dongarra,et al. An extended set of FORTRAN basic linear algebra subprograms , 1988, TOMS.

[11] D. Gaier,et al. Lectures on complex approximation , 1987 .