{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T16:59:39Z","timestamp":1780073979358,"version":"3.54.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11901361"],"award-info":[{"award-number":["11901361"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10915-020-01360-4","type":"journal-article","created":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T08:05:48Z","timestamp":1605513948000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On Chebyshev\u2013Davidson Method for Symmetric Generalized Eigenvalue Problems"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9171-0889","authenticated-orcid":false,"given":"Cun-Qiang","family":"Miao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,16]]},"reference":[{"key":"1360_CR1","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\u2013Chebyshev 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":"1360_CR2","doi-asserted-by":"publisher","first-page":"154101","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":"1360_CR3","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":"1360_CR4","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":"1360_CR5","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":"1360_CR6","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":"1360_CR7","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":"1360_CR8","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\u2013Davidson 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":"1360_CR9","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":"1360_CR10","doi-asserted-by":"publisher","first-page":"A2100","DOI":"10.1137\/140980090","volume":"37","author":"S Guttel","year":"2015","unstructured":"Guttel, S., Polizzi, E., Tang, P.T.P., Viaud, G.: Zolotarev quadrature rules and load balancing for the FEAST eigensolver. SIAM J. Sci. Copmut. 37, A2100\u2013A2122 (2015)","journal-title":"SIAM J. Sci. Copmut."},{"key":"1360_CR11","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. Res. Nat. Bur. Stand. 47, 45\u201361 (1951)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"1360_CR12","doi-asserted-by":"publisher","first-page":"1927","DOI":"10.1016\/j.cam.2009.09.029","volume":"233","author":"T Ikegami","year":"2010","unstructured":"Ikegami, T., Sakurai, T., Nagashima, U.: A filter diagonalization for generalized eigenvalue problems based on the Sakurai\u2013Sugiura projection method. J. Comput. Appl. Math. 233, 1927\u20131936 (2010)","journal-title":"J. Comput. Appl. Math."},{"key":"1360_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s11075-015-9987-4","volume":"71","author":"A Imakura","year":"2016","unstructured":"Imakura, A., Du, L., Sakurai, T.: Error bounds of Rayleigh\u2013Ritz type contour integral-based eigensolver for solving generalized eigenvalue problems. Numer. Algorithms 71, 103\u2013120 (2016)","journal-title":"Numer. Algorithms"},{"key":"1360_CR14","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":"1360_CR15","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":"1360_CR16","unstructured":"Li, Y.-Z., Yang, H.-Z.: Spectrum slicing for sparse Hermitian definite matrices based on Zolotarev\u2019s functions. arxiv:1701.08935"},{"key":"1360_CR17","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":"1360_CR18","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":"1360_CR19","doi-asserted-by":"publisher","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":"1360_CR20","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":"1360_CR21","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/140990334","volume":"58","author":"Y Nakatsukasa","year":"2016","unstructured":"Nakatsukasa, Y., Freund, R.W.: Computing fundamental matrix decompositions accurately via the matrix sign function in two iterations: the power of Zolotarev\u2019s functions. SIAM Rev. 58, 461\u2013493 (2016)","journal-title":"SIAM Rev."},{"key":"1360_CR22","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 (1998)"},{"key":"1360_CR23","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. Comput. 42, 567\u2013588 (1984)","journal-title":"Math. Comput."},{"key":"1360_CR24","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 (2011)","edition":"2"},{"key":"1360_CR25","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01388686","volume":"64","author":"M Sadkane","year":"1993","unstructured":"Sadkane, M.: A block Arnoldi\u2013Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices. Numer. Math. 64, 181\u2013193 (1993)","journal-title":"Numer. Math."},{"key":"1360_CR26","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0377-0427(03)00565-X","volume":"159","author":"T Sakurai","year":"2003","unstructured":"Sakurai, T., Sugiura, H.: A projection method for generalized eigenvalue problems using numerical integration. J. Comput. Appl. Math. 159, 119\u2013128 (2003)","journal-title":"J. Comput. Appl. Math."},{"key":"1360_CR27","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\u2013Davidson type methods for generalized eigenproblems and polynomial eigenproblems. BIT Numer. Math. 36, 595\u2013633 (1996)","journal-title":"BIT Numer. Math."},{"key":"1360_CR28","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\u2013Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17, 401\u2013425 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1360_CR29","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":"1360_CR30","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1137\/13090866X","volume":"35","author":"PTP Tang","year":"2014","unstructured":"Tang, P.T.P., Polizzi, E.: FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection. SIAM J. Matrix Anal. Appl. 35, 354\u2013390 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1360_CR31","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":"1360_CR32","doi-asserted-by":"publisher","first-page":"A3020","DOI":"10.1137\/16M1061965","volume":"38","author":"Y-Z Xi","year":"2016","unstructured":"Xi, Y.-Z., Saad, Y.: Computing partial spectra with least-squares rational filters. SIAM J. Sci. Comput. 38, A3020\u2013A3045 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"1360_CR33","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\u2013Davidson method with inner-outer restart for large eigenvalue problems. J. Comput. Phys. 229, 9188\u20139200 (2010)","journal-title":"J. Comput. Phys."},{"key":"1360_CR34","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\u2013Davidson algorithm for large symmetric eigenproblems. SIAM J. Matrix Anal. Appl. 29, 954\u2013971 (2007)","journal-title":"SIAM J. Matrix Anal. Appl."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-020-01360-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-020-01360-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-020-01360-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:12:53Z","timestamp":1607530373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-020-01360-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,16]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1360"],"URL":"https:\/\/doi.org\/10.1007\/s10915-020-01360-4","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,16]]},"assertion":[{"value":"9 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The author declares that there are no conflicts of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"53"}}