This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
[1]
E.R. Davidson , The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices, J. Comput. Phys., 17(1975), pp. 87–94.
[2]
H.R. Fang and Y. Saad , A filtered Lanczos procedure for extreme and interior eigenvalue problems, SIAM J. Sci. Comput., 34(2012), pp. A2220–A2246.
[3]
G.H. Golub and Q. Ye , Inexact inverse iteration for generalized eigenvalue problems, BIT, 40(2000), pp. 671–684.
[5]
A.V. Knyazev , Toward the optimal preconditioned eigensolver: locally optimal block preconditioned conjugate gradient method, SIAM J. Sci. Comput., 23(2001), pp. 517–541.
[6]
Y.-L. Lai , K.-Y. Lin and W.-W. Lin , An inexact inverse iteration for large sparse eigenvalue problems, Numer. Linear Algebra Appl., 4(1997), pp. 425–437.
[7]
R.B. Morgan , Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices, J. Comput. Phys., 101(1992), pp. 287–291.
[8]
R.B. Morgan and D.S. Scott , Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices, SIAM J. Sci. Statisst. Copmut., 7(1986), pp. 817–825.
[9]
Y. Notay , Convergence analysis of inexact Rayleigh quotient iteration, SIAM J. Matrix Anal. Appl., 24(2003), pp. 627–644.
[10]
E. Ovtchinnikov , Cluster robustness of preconditioned gradient subspace iteration eigensolvers, Linear Algebra Appl., 415(2006), pp. 140–166.
[11]
E.E. Ovtchinnikov , Sharp convergence estimates for the preconditioned steepest descent method for Hermitian eigenvalue problems, SIAM J. Numer. Anal., 43(2006), pp. 2668–2689.
[12]
B.N. Parlett , The Symmetric Eigenvalue Problems, SIAM, Philadelphia, PA, 1998.
[13]
Y. Saad , Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems, Math. Comp., 42(1984), pp. 567–588.
[14]
Y. Saad , Numerical Methods for Large Eigenvalue Problems, Second Edition, SIAM, Philadelphia, PA, 2011.
[15]
Y. Saad , On the rates of convergence of the Lanczos and the Block-Lanczos methods, SIAM J. Numer. Anal., 17(1980), pp. 687–706.
[16]
G.L.G. Sleijpen , A.G.L. Booten , D.R. Fokkema and H.A. Van Der Vorst , Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems, BIT, 36(1996), pp. 595–633.
[17]
G.L.G. Sleijpen and H.A. Van Der Vorst , A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl., 17(1996), pp. 401–425.
[18]
D.C. Sorensen , Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13(1992), pp. 357–385.
[19]
J. Van Den Eshof , The convergence of Jacobi-Davidson iterations for Hermitian eigenproblems, Numer. Linear Algebra Appl., 9(2002), pp. 163–179.
[20]
F. Xue and H. C. Elman , Convergence analysis of iterative solvers in inexact Rayleigh quotient iteration, SIAM J. Matrix Anal. Appl., 31(2009), pp. 877–899.
[21]
Y.-K. Zhou and Y. Saad , A Chebyshev-Davidson algorithm for large symmetric eigenproblems, SIAM J. Matrix Anal. Appl., 29(2007), pp. 954–971.
Loading metrics...