{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:12:10Z","timestamp":1774955530186,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2025JJ60046"],"award-info":[{"award-number":["2025JJ60046"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific Research Program of Hunan Provincial Department of Education","award":["23B0851"],"award-info":[{"award-number":["23B0851"]}]},{"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2021JJ40708"],"award-info":[{"award-number":["2021JJ40708"]}],"id":[{"id":"10.13039\/501100001809","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":[[2026,2]]},"DOI":"10.1007\/s10444-026-10287-7","type":"journal-article","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T10:42:34Z","timestamp":1770892954000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Chebyshev accelerating technique for solving generalized non-symmetric eigenvalue problems"],"prefix":"10.1007","volume":"52","author":[{"given":"Lan","family":"Cheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9171-0889","authenticated-orcid":false,"given":"Cun-Qiang","family":"Miao","sequence":"additional","affiliation":[]},{"given":"Yue-Yang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,12]]},"reference":[{"key":"10287_CR1","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1007\/s11075-018-00653-y","volume":"82","author":"Z-Z Bai","year":"2019","unstructured":"Bai, Z.-Z., Miao, C.-Q.: Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces. Numer. Algorithms 82, 1251\u20131277 (2019)","journal-title":"Numer. Algorithms"},{"key":"10287_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976632","volume-title":"Matrix Analysis and Computations","author":"Z-Z Bai","year":"2021","unstructured":"Bai, Z.-Z., Pan, J.-Y.: Matrix Analysis and Computations. SIAM, Philadelphia, PA (2021)"},{"key":"10287_CR3","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":"10287_CR4","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":"10287_CR5","doi-asserted-by":"publisher","unstructured":"Miao, C.-Q., Cheng, L.: On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems. Adv. Comput. Math. 49 (2023). https:\/\/doi.org\/10.1007\/s10444-023-10078-4","DOI":"10.1007\/s10444-023-10078-4"},{"key":"10287_CR6","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":"10287_CR7","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":"10287_CR8","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":"10287_CR9","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":"10287_CR10","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":"10287_CR11","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":"10287_CR12","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":"10287_CR13","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-026-10287-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-026-10287-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-026-10287-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:26:53Z","timestamp":1774952813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-026-10287-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["10287"],"URL":"https:\/\/doi.org\/10.1007\/s10444-026-10287-7","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"10 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2026","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":"13"}}