{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T20:58:00Z","timestamp":1771102680603,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T00:00:00Z","timestamp":1698105600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T00:00:00Z","timestamp":1698105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901361"],"award-info":[{"award-number":["11901361"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2021JJ40708"],"award-info":[{"award-number":["2021JJ40708"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["12001048"],"award-info":[{"award-number":["12001048"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10444-023-10078-4","type":"journal-article","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T05:02:05Z","timestamp":1698123725000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems"],"prefix":"10.1007","volume":"49","author":[{"given":"Cun-Qiang","family":"Miao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1504-9774","authenticated-orcid":false,"given":"Lan","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,24]]},"reference":[{"key":"10078_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s00211-015-0699-4","volume":"131","author":"K Aishima","year":"2015","unstructured":"Aishima, K.: Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems. Numer. Math. 131, 405\u2013423 (2015)","journal-title":"Numer. Math."},{"key":"10078_CR2","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.cam.2016.08.035","volume":"311","author":"K Aishima","year":"2017","unstructured":"Aishima, K.: On convergence of iterative projection methods for symmetric eigenvalue problems. J. Comput. Appl. Math. 311, 513\u2013521 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"10078_CR3","doi-asserted-by":"publisher","first-page":"7477","DOI":"10.1016\/j.jcp.2010.06.030","volume":"229","author":"CR Anderson","year":"2010","unstructured":"Anderson, C.R.: A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices. J. Comput. Phys. 229, 7477\u20137487 (2010)","journal-title":"J. Comput. Phys."},{"key":"10078_CR4","doi-asserted-by":"publisher","DOI":"10.1063\/1.4964861","volume":"15","author":"AS Banerjee","year":"2016","unstructured":"Banerjee, A.S., Lin, L., Hu, W., Yang, C., Pask, J.E.: Chebyshev polynomial filtered subspace iteration in the discontinuous Galerkin method for large-scale electronic structure calculations. J. Chem. Phys. 15, 154101 (2016)","journal-title":"J. Chem. Phys."},{"key":"10078_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/060675435","volume":"30","author":"C Bekas","year":"2008","unstructured":"Bekas, C., Kokiopoulou, E., Saad, Y.: Computation of large invariant subspaces using polynomial filtered Lanczos iterations with applications in density functional theory. SIAM J. Matrix Anal. Appl. 30, 397\u2013418 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10078_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF02162089","volume":"9","author":"WW Bradbury","year":"1996","unstructured":"Bradbury, W.W., Fletcher, R.: New iterative methods for solution of the eigenproblem. Numer. Math. 9, 259\u2013267 (1996)","journal-title":"Numer. Math."},{"key":"10078_CR7","doi-asserted-by":"publisher","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":"10078_CR8","doi-asserted-by":"publisher","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":"10078_CR9","doi-asserted-by":"publisher","first-page":"A2220","DOI":"10.1137\/110836535","volume":"34","author":"HR Fang","year":"2012","unstructured":"Fang, H.R., Saad, Y.: A filtered Lanczos procedure for extreme and interior eigenvalue problems. SIAM J. Sci. Comput. 34, A2220\u2013A2246 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"10078_CR10","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1137\/S1064827596300073","volume":"20","author":"DR Fokkema","year":"1998","unstructured":"Fokkema, D.R., Sleijpen, G.L.G., van der Vorst, H.A.: Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils. SIAM J. Sci. Comput. 20, 94\u2013125 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"10078_CR11","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/S1064827500382579","volume":"24","author":"GH Golub","year":"2002","unstructured":"Golub, G.H., Ye, Q.: An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems. SIAM J. Sci. Copmut. 24, 312\u2013334 (2002)","journal-title":"SIAM J. Sci. Copmut."},{"key":"10078_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.6028\/jres.047.008","volume":"47","author":"MR Hestenes","year":"1951","unstructured":"Hestenes, M.R., Karush, W.: A method of gradients for the calculation of the characteristic roots and vectors of a real symmetric matrix. J. Research Nat. Bur. Standards 47, 45\u201361 (1951)","journal-title":"J. Research Nat. Bur. Standards"},{"key":"10078_CR13","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.jcp.2006.02.007","volume":"218","author":"U Hetmaniuk","year":"2006","unstructured":"Hetmaniuk, U., Lehoucq, R.: Basis selection in LOBPCG. J. Comput. Phys. 218, 324\u2013332 (2006)","journal-title":"J. Comput. Phys."},{"key":"10078_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0168-9274(99)00008-2","volume":"32","author":"Z-X Jia","year":"2000","unstructured":"Jia, Z.-X.: A refined subspace iteration algorithm for large sparse eigenproblems. Appl. Numer. Math. 32, 35\u201352 (2000)","journal-title":"Appl. Numer. Math."},{"key":"10078_CR15","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1090\/S0025-5718-00-01208-4","volume":"70","author":"Z-X Jia","year":"2001","unstructured":"Jia, Z.-X., Stewart, G.W.: An analysis of the Rayleigh-Ritz method for approximating eigenspaces. Math. Comp. 70, 637\u2013647 (2001)","journal-title":"Math. Comp."},{"key":"10078_CR16","doi-asserted-by":"publisher","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":"10078_CR17","unstructured":"Knyazev, A.V.: Hard and soft locking in iterative methods for symmetric eigenvalue problems. In: Presentation at the eighth copper mountain conference on iterative methods, (2004)"},{"key":"10078_CR18","doi-asserted-by":"publisher","first-page":"2224","DOI":"10.1137\/060661624","volume":"29","author":"AV Knyazev","year":"2007","unstructured":"Knyazev, A.V., Argentati, M.E., Lashuk, I., Ovtchinnikov, E.E.: Block locally optimal preconditioned eigenvalue xolvers (BLOPEX) in HYPRE and PETSc. SIAM J. Sci. Comput. 29, 2224\u20132239 (2007)","journal-title":"SIAM J. Sci. Comput."},{"key":"10078_CR19","doi-asserted-by":"publisher","first-page":"A2512","DOI":"10.1137\/15M1054493","volume":"38","author":"R-P Li","year":"2016","unstructured":"Li, R.-P., Xi, Y.-Z., Vecharynski, E., Yang, C., Saad, Y.: A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems. SIAM J. Sci. Comput. 38, A2512\u2013A2534 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"10078_CR20","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s11075-018-0627-7","volume":"82","author":"C-Q Miao","year":"2019","unstructured":"Miao, C.-Q.: Filtered Krylov-like sequence method for symmetric eigenvalue problems. Numer. Algorithms 82, 791\u2013807 (2019)","journal-title":"Numer. Algorithms"},{"key":"10078_CR21","doi-asserted-by":"publisher","unstructured":"Miao, C.-Q.: On Chebyshev-Davidson method for symmetric generalized eigenvalue problems. J. Sci. Comput. 85, (2020). https:\/\/doi.org\/10.1007\/s10915-020-01360-4","DOI":"10.1007\/s10915-020-01360-4"},{"key":"10078_CR22","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0021-9991(92)90006-K","volume":"101","author":"RB Morgan","year":"1992","unstructured":"Morgan, R.B.: Generalizations of Davidson\u2019s method for computing eigenvalues of large nonsymmetric matrices. J. Comput. Phys. 101, 287\u2013291 (1992)","journal-title":"J. Comput. Phys."},{"key":"10078_CR23","first-page":"817","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. Statisst. Copmut. 7, 817\u2013825 (1986)","journal-title":"SIAM J. Sci. Statisst. Copmut."},{"key":"10078_CR24","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1137\/0914037","volume":"14","author":"RB Morgan","year":"1993","unstructured":"Morgan, R.B., Scott, D.S.: Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems. SIAM J. Sci. Comput. 14, 585\u2013593 (1993)","journal-title":"SIAM J. Sci. Comput."},{"key":"10078_CR25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971163","volume-title":"The Symmetric Eigenvalue Problem","author":"BN Parlett","year":"1998","unstructured":"Parlett, B.N.: The Symmetric Eigenvalue Problem. SIAM, Philadelphia, PA (1998)"},{"key":"10078_CR26","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1090\/S0025-5718-1984-0736453-8","volume":"42","author":"Y Saad","year":"1984","unstructured":"Saad, Y.: Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems. Math. Comp. 42, 567\u2013588 (1984)","journal-title":"Math. Comp."},{"key":"10078_CR27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970739","volume-title":"Numerical Methods for Large Eigenvalue Problems","author":"Y Saad","year":"2011","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalue Problems, 2nd edn. SIAM, Philadelphia, PA (2011)","edition":"2"},{"key":"10078_CR28","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01388686","volume":"64","author":"M Sadkane","year":"1993","unstructured":"Sadkane, M.: A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices. Numer. Math. 64, 181\u2013193 (1993)","journal-title":"Numer. Math."},{"key":"10078_CR29","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/BF01731936","volume":"36","author":"GLG Sleijpen","year":"1996","unstructured":"Sleijpen, G.L.G., Booten, A.G.L., Fokkema, D.R., van der Vorst, H.A.: Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems. BIT Numer. Math. 36, 595\u2013633 (1996)","journal-title":"BIT Numer. Math."},{"key":"10078_CR30","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895479894270427","volume":"17","author":"GLG Sleijpen","year":"1996","unstructured":"Sleijpen, G.L.G., van der Vorst, H.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":"10078_CR31","doi-asserted-by":"publisher","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-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13, 357\u2013385 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10078_CR32","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/1731022.1731031","volume":"37","author":"A Stathopoulos","year":"2010","unstructured":"Stathopoulos, A., McCombs, J.R.: PRIMME: preconditioned iterative multi-method eigensolver: methods and software description. ACM T. Math. Software 37, 21:1-21:30 (2010)","journal-title":"ACM T. Math. Software"},{"key":"10078_CR33","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jcp.2015.02.030","volume":"290","author":"E Vecharynski","year":"2015","unstructured":"Vecharynski, E., Yang, C., Pask, J.E.: A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix. J. Comput. Phys. 290, 73\u201389 (2015)","journal-title":"J. Comput. Phys."},{"key":"10078_CR34","doi-asserted-by":"publisher","first-page":"9188","DOI":"10.1016\/j.jcp.2010.08.032","volume":"229","author":"Y-K Zhou","year":"2010","unstructured":"Zhou, Y.-K.: A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems. J. Comput. Phys. 229, 9188\u20139200 (2010)","journal-title":"J. Comput. Phys."},{"key":"10078_CR35","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/050630404","volume":"29","author":"Y-K Zhou","year":"2007","unstructured":"Zhou, Y.-K., Saad, Y.: A Chebyshev-Davidson algorithm for large symmetric eigenproblems. SIAM J. Matrix Anal. Appl. 29, 954\u2013971 (2007)","journal-title":"SIAM J. Matrix Anal. Appl."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-023-10078-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-023-10078-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-023-10078-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T12:25:16Z","timestamp":1703247916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-023-10078-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,24]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["10078"],"URL":"https:\/\/doi.org\/10.1007\/s10444-023-10078-4","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,24]]},"assertion":[{"value":"3 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"78"}}