Papers on Krylov Subspace Methods for the Eigenproblem

[1]  Anne Greenbaum,et al.  Iterative methods for solving linear systems , 1997, Frontiers in applied mathematics.

[2]  G. Stewart.  Matrix Algorithms, Volume II: Eigensystems , 2001 .

[3]  J. Demmel,et al.  On swapping diagonal blocks in real Schur form , 1993 .

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

[5]  Ronald B. Morgan,et al.  GMRES WITH DEFLATED , 2008 .

[6]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[7]  J. Grcar.  Analyses of the lanczos algorithm and of the approximation problem in richardson's method , 1981 .

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

[9]  Z. Jia,et al.  Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems , 1997 .

[10]  Zhongxiao Jia,et al.  An analysis of the Rayleigh-Ritz method for approximating eigenspaces , 2001, Math. Comput..

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

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

[13]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[14]  Kesheng Wu,et al.  Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems , 2000, SIAM J. Matrix Anal. Appl..

[15]  G. Stewart,et al.  Matrix Perturbation Theory , 1990 .

[16]  Gene H. Golub,et al.  Matrix computations , 1983 .

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

[18]  Y Saad,et al.  Numerical methods for large eigenvalue problems : theory and algorithms , 1992 .

[19]  H. Simon.  Analysis of the symmetric Lanczos algorithm with reorthogonalization methods , 1984 .

[20]  Gerard L. G. Sleijpen,et al.  Jacobi-Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils , 1998, SIAM J. Sci. Comput..

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

[22]  H. Simon.  The Lanczos algorithm with partial reorthogonalization , 1984 .

[23]  Gerard L. G. Sleijpen,et al.  Alternative correction equations in the Jacobi-Davidson method , 1999, Numer. Linear Algebra Appl..

[24]  Danny C. Sorensen,et al.  Deflation Techniques for an Implicitly Restarted Arnoldi Iteration , 1996, SIAM J. Matrix Anal. Appl..

[25]  David S. Watkins,et al.  Forward Stability and Transmission of Shifts in the QR Algorithm , 1995, SIAM J. Matrix Anal. Appl..

[26]  Jennifer A. Scott,et al.  An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices , 1995, TOMS.

[27]  G. W. Stewart,et al.  A Krylov-Schur Algorithm for Large Eigenproblems , 2001, SIAM J. Matrix Anal. Appl..