{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T05:36:35Z","timestamp":1771997795266,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,1,9]],"date-time":"2015-01-09T00:00:00Z","timestamp":1420761600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00211-015-0699-4","type":"journal-article","created":{"date-parts":[[2015,1,8]],"date-time":"2015-01-08T15:21:18Z","timestamp":1420730478000},"page":"405-423","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Global convergence of the restarted Lanczos and Jacobi\u2013Davidson methods for symmetric eigenvalue problems"],"prefix":"10.1007","volume":"131","author":[{"given":"Kensuke","family":"Aishima","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,9]]},"reference":[{"key":"699_CR1","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/BF01731924","volume":"36","author":"J Baglama","year":"1996","unstructured":"Baglama, J., Calvetti, D., Reichel, L.: Iterative methods for the computation of a few eigenvalues of a large symmetric matrix. BIT 36, 400\u2013421 (1996)","journal-title":"BIT"},{"key":"699_CR2","doi-asserted-by":"crossref","first-page":"1650","DOI":"10.1137\/S1064827501397949","volume":"24","author":"J Baglama","year":"2003","unstructured":"Baglama, J., Calvetti, D., Reichel, L.: IRBL: an implicitly restarted block Lanczos method for largescale Hermitian eigenproblems. SIAM J. Sci. Comput. 24, 1650\u20131677 (2003)","journal-title":"SIAM J. Sci. Comput."},{"key":"699_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719581","volume-title":"Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide","author":"Z Bai","year":"2000","unstructured":"Bai, Z., Demmel, J., Dongarra, J., Ruhe, A., van der Vorst, H.: Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide. SIAM, Philadelphia (2000)"},{"key":"699_CR4","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1137\/S0895479801398608","volume":"25","author":"C Beattie","year":"2004","unstructured":"Beattie, C., Embree, M., Rossi, J.: Convergence of restarted Krylov subspaces to invariant subspaces. SIAM J. Matrix Anal. Appl. 25, 1074\u20131109 (2004)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"699_CR5","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1137\/S0036144503433077","volume":"47","author":"C Beattie","year":"2005","unstructured":"Beattie, C., Embree, M., Sorensen, D.C.: Convergence of polynomial restart Krylov methods for eigenvalue computations. SIAM Rev. 47, 492\u2013515 (2005)","journal-title":"SIAM Rev."},{"key":"699_CR6","first-page":"1","volume":"2","author":"D Calvetti","year":"1994","unstructured":"Calvetti, D., Reichel, L., Sorensen, D.C.: An implicitly restarted Lanczos method for large symmetric eigenvalue problems. Electron. Trans. Numer. Anal. 2, 1\u201321 (1994)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"699_CR7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1137\/0915004","volume":"15","author":"M Crouzeix","year":"1994","unstructured":"Crouzeix, M., Philippe, B., Sadkane, M.: The Davidson method. SIAM J. Sci. Comput. 15, 62\u201376 (1994)","journal-title":"SIAM J. Sci. Comput."},{"key":"699_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01930896","volume":"18","author":"JK Cullum","year":"1978","unstructured":"Cullum, J.K.: The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, symmetric, sparse matrix. BIT 18, 265\u2013275 (1978)","journal-title":"BIT"},{"key":"699_CR9","doi-asserted-by":"crossref","unstructured":"Cullum, J.K., Donath, W.E.: A block Lanczos algorithm for computing the $$q$$ q algebraically largest eigenvalues and a corresponding eigenspace for large, sparse symmetric matrices. In: Proceedings of the 1994 IEEE Conference on Decision and Control, pp. 505\u2013509 IEEE Press, Piscataway, NJ (1974)","DOI":"10.1109\/CDC.1974.270490"},{"key":"699_CR10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0021-9991(75)90065-0","volume":"17","author":"ER Davidson","year":"1975","unstructured":"Davidson, E.R.: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. J. Comput. Phys. 17, 87\u201394 (1975)","journal-title":"J. Comput. Phys."},{"key":"699_CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971446","volume-title":"Applied Numerical Linear Algebra","author":"J Demmel","year":"1997","unstructured":"Demmel, J.: Applied Numerical Linear Algebra. SIAM, Philadelphia (1997)"},{"key":"699_CR12","first-page":"364","volume-title":"Mathematical Software III","author":"GH Golub","year":"1977","unstructured":"Golub, G.H., Underwood, R.: The block Lanczos method for computing eigenvalues. In: Rice, J. (ed.) Mathematical Software III, pp. 364\u2013377. Academic Press, New York (1977)"},{"key":"699_CR13","doi-asserted-by":"crossref","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edition. Johns Hopkins University (2013)","DOI":"10.56021\/9781421407944"},{"key":"699_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0024-3795(01)00494-3","volume":"358","author":"ME Hochstenbach","year":"2003","unstructured":"Hochstenbach, M.E., Sleijpen, G.L.G.: Two-sided and alternating Jacobi\u2013Davidson. Linear Algebra Appl. 358, 145\u2013172 (2003)","journal-title":"Linear Algebra Appl."},{"key":"699_CR15","doi-asserted-by":"crossref","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edition. Cambridge University (2012)","DOI":"10.1017\/CBO9781139020411"},{"key":"699_CR16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.2140\/pjm.1951.1.233","volume":"1","author":"W Karush","year":"1951","unstructured":"Karush, W.: An iterative method for finding characteristic vectors of a symmetric matrix. Pac. J. Math. 1, 233\u2013248 (1951)","journal-title":"Pac. J. Math."},{"key":"699_CR17","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1137\/S1064827500366124","volume":"23","author":"AV Knyazev","year":"2001","unstructured":"Knyazev, A.V.: Toward the optimal preconditioned eigensolver: locally optimal block preconditioned conjugate gradient method. SIAM J. Sci. Comput. 23, 517\u2013541 (2001)","journal-title":"SIAM J. Sci. Comput."},{"key":"699_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0024-3795(91)90379-B","volume":"154\u2013156","author":"AV Knyazev","year":"1991","unstructured":"Knyazev, A.V., Skorokhodov, A.L.: On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem. Linear Algebra Appl. 154\u2013156, 245\u2013257 (1991)","journal-title":"Linear Algebra Appl."},{"key":"699_CR19","doi-asserted-by":"crossref","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C Lanczos","year":"1950","unstructured":"Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Stand. 45, 255\u2013282 (1950)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"699_CR20","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1090\/S0025-5718-09-02258-3","volume":"79","author":"RC Li","year":"2010","unstructured":"Li, R.C.: Sharpness in rates of convergence for the symmetric Lanczos method. Math. Comput. 79, 419\u2013435 (2010)","journal-title":"Math. Comput."},{"key":"699_CR21","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1137\/0907054","volume":"7","author":"RB Morgan","year":"1986","unstructured":"Morgan, R.B., Scott, D.S.: Generalizations of Davidson\u2019s method for computing eigenvalues of sparse symmetric matrices. SIAM J. Sci. Stat. Comput. 7, 817\u2013825 (1986)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"699_CR22","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/S0895479803430941","volume":"26","author":"Y Notay","year":"2005","unstructured":"Notay, Y.: Is Jacobi\u2013Davidson faster than Davidson? SIAM J. Matrix Anal. Appl. 26, 522\u2013543 (2005)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"699_CR23","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1137\/S0036142902411756","volume":"41","author":"E Ovtchinnikov","year":"2003","unstructured":"Ovtchinnikov, E.: Convergence estimates for the generalized Davidson method for symmetric eigenvalue problems I: the preconditioning aspect. SIAM J. Numer. Anal. 41, 258\u2013271 (2003)","journal-title":"SIAM J. Numer. Anal."},{"key":"699_CR24","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0036142902411768","volume":"41","author":"E Ovtchinnikov","year":"2003","unstructured":"Ovtchinnikov, E.: Convergence estimates for the generalized Davidson method for symmetric eigenvalue problems II: the preconditioning aspect. SIAM J. Numer. Anal. 41, 272\u2013286 (2003)","journal-title":"SIAM J. Numer. Anal."},{"key":"699_CR25","volume-title":"The Symmetric Eigenvalue Problem","author":"BN Parlett","year":"1980","unstructured":"Parlett, B.N.: The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs (1980)"},{"key":"699_CR26","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1090\/S0025-5718-1979-0521282-9","volume":"33","author":"A Ruhe","year":"1979","unstructured":"Ruhe, A.: Implementation aspects of band Lanczos algorithms for computation of eigenvalues of large sparse symmetric matrices. Math. Comput. 33, 680\u2013687 (1979)","journal-title":"Math. Comput."},{"key":"699_CR27","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0895479894270427","volume":"17","author":"GLG Sleijpen","year":"1996","unstructured":"Sleijpen, G.L.G., van der Vorst, A.: A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17, 401\u2013425 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"699_CR28","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/0613025","volume":"13","author":"DC Sorensen","year":"1992","unstructured":"Sorensen, D.C.: Implicit application of polynomial filters in a $$k$$ k -step Arnoldi method. SIAM J. Matrix Anal. Appl. 13, 357\u2013385 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"699_CR29","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1137\/050631574","volume":"29","author":"A Stathopoulos","year":"2007","unstructured":"Stathopoulos, A.: Nearly optimal preconditioned methods for Hermitian eigenproblems under limited memory. Part I: seeking one eigenvalue. SIAM J. Sci. Comput. 29, 481\u2013514 (2007)","journal-title":"SIAM J. Sci. Comput."},{"key":"699_CR30","doi-asserted-by":"crossref","first-page":"2162","DOI":"10.1137\/060661910","volume":"29","author":"A Stathopoulos","year":"2007","unstructured":"Stathopoulos, A., Mccombs, J.R.: Nearly optimal preconditioned methods for Hermitian eigenproblems under limited memory. Part II: seeking many eigenvalues. SIAM J. Sci. Comput. 29, 2162\u20132188 (2007)","journal-title":"SIAM J. Sci. Comput."},{"key":"699_CR31","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1137\/S0895479898334605","volume":"22","author":"K Wu","year":"2000","unstructured":"Wu, K., Simon, H.: Thick-restarted Lanczos method for large symmetric eigenvalue problems. SIAM J. Matrix Anal. Appl. 22, 602\u2013616 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"699_CR32","doi-asserted-by":"crossref","unstructured":"Yamazaki, I., Bai, Z., Simon, H.D., Wang, L.-W., Wu, K.: Adaptive projection subspace dimension for the thick-restart Lanczos method. ACM Trans. Math. Softw. 37, (2010) (Article No. 27). doi: 10.1145\/1824801.1824805","DOI":"10.1145\/1824801.1824805"}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-015-0699-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00211-015-0699-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-015-0699-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T17:25:16Z","timestamp":1690824316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00211-015-0699-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,9]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["699"],"URL":"https:\/\/doi.org\/10.1007\/s00211-015-0699-4","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,9]]}}}