On global convergence of subspace projection methods for Hermitian eigenvalue problems

References

• K. Aishima, Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems, Numer. Math. 131 (2015), pp. 405–423. doi: 10.1007/s00211-015-0699-4
   Web of Science ®Google Scholar
• K. Aishima, On convergence of iterative projection methods for symmetric eigenvalue problems, J. Comput. Appl. Math. 311 (2017), pp. 513–521. doi: 10.1016/j.cam.2016.08.035
   Web of Science ®Google Scholar
• Z.-Z. Bai and C.-Q. Miao, On local quadratic convergence of inexact simplified Jacobi-Davidson method, Linear Algebra Appl. 520 (2017), pp. 215–241. doi: 10.1016/j.laa.2017.01.018
   Web of Science ®Google Scholar
• Z.-Z. Bai and C.-Q. Miao, On local quadratic convergence of inexact simplified Jacobi-Davidson method for interior eigenpairs of Hermitian eigenproblems, Appl. Math. Lett. 72 (2017), pp. 23–28. doi: 10.1016/j.aml.2017.03.021
   Web of Science ®Google Scholar
• B. Beckermann, S. Guttel, and R. Vandebril, On the convergence of rational Ritz values, SIAM J. Matrix Anal. Appl. 31 (2010), pp. 1740–1774. doi: 10.1137/090755412
   Web of Science ®Google Scholar
• M. Crouzeix, B. Philippe, and M. Sadkane, The Davidson method, SIAM J. Sci. Comput. 15 (1994), pp. 62–76. doi: 10.1137/0915004
   Web of Science ®Google Scholar
• 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. doi: 10.1016/0021-9991(75)90065-0
   Web of Science ®Google Scholar
• 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. doi: 10.1137/110836535
   Web of Science ®Google Scholar
• G.H. Golub and Q. Ye, An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems, SIAM J. Sci. Copmut. 24 (2002), pp. 312–334. doi: 10.1137/S1064827500382579
   Web of Science ®Google Scholar
• R.B. Lehoucq and K. Meerbergen, Using generalized Cayley transformations within an inexact rational Krylov sequence method, SIAM J. Matrix Anal. Appl. 20 (1998), pp. 131–148. doi: 10.1137/S0895479896311220
   Web of Science ®Google Scholar
• C.-Q. Miao, Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation, J. Comput. Appl. Math. 343 (2018), pp. 363–372. doi: 10.1016/j.cam.2018.05.001
   Web of Science ®Google Scholar
• C.-Q. Miao, Filtered Krylov-like sequence method for symmetric eigenvalue problems, Numer. Algorithms (2018). DOI:10.1007/s11075-018-0627-7.
   PubMed Web of Science ®Google Scholar
• R.B. Morgan, Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices, J. Comput. Phys. 101 (1992), pp. 287–291. doi: 10.1016/0021-9991(92)90006-K
   Web of Science ®Google Scholar
• R.B. Morgan and D.S. Scott, Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices, SIAM J. Sci. Statist. Comput. 7 (1986), pp. 817–825. doi: 10.1137/0907054
   Web of Science ®Google Scholar
• R.B. Morgan and D.S. Scott, Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems, SIAM J. Sci. Comput. 14 (1993), pp. 585–593. doi: 10.1137/0914037
   Web of Science ®Google Scholar
• Y. Notay, Combination of Jacob-Davidson and conjugate gradients for the partial symmetric eigenproblem, Numer. Linear Algebra Appl. 9 (2002), pp. 21–44. doi: 10.1002/nla.246
   Web of Science ®Google Scholar
• B.N. Parlett, The Symmetric Eigenvalue Problem, SIAM, Philadelphia, PA, 1998.
   Google Scholar
• A. Ruhe, Rational Krylov sequence methods for eigenvalue computation, Linear Algebra Appl. 58 (1984), pp. 391–405. doi: 10.1016/0024-3795(84)90221-0
   Web of Science ®Google Scholar
• A. Ruhe, Rational Krylov: A practical algorithm for large sparse nonsymmetric matrix pencils, SIAM J. Sci. Comput. 19 (1998), pp. 1535–1551. doi: 10.1137/S1064827595285597
   Web of Science ®Google Scholar
• Y. Saad, Numerical Methods for Large Eigenvalue Problems, 2nd ed., SIAM, Philadelphia, PA, 2011.
   Google Scholar
• 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. doi: 10.1137/S0895479894270427
   Web of Science ®Google Scholar
• 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 Numer. Math. 36 (1996), pp. 595–633. doi: 10.1007/BF01731936
   Google Scholar
• D.B. Szyld and F. Xue, Local convergence analysis of inexact Newton-type algorithms for general nonlinear eigenvalue problems, Numer. Math. 123 (2013), pp. 333–362. doi: 10.1007/s00211-012-0489-1
   Web of Science ®Google Scholar