{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:58:02Z","timestamp":1767913082058,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"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":"publisher","award":["11901361"],"award-info":[{"award-number":["11901361"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2018BG002"],"award-info":[{"award-number":["ZR2018BG002"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11401305"],"award-info":[{"award-number":["11401305"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s40314-019-0962-x","type":"journal-article","created":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T18:10:22Z","timestamp":1569953422000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rayleigh quotient minimization method for symmetric eigenvalue problems"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9171-0889","authenticated-orcid":false,"given":"Cun-Qiang","family":"Miao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,1]]},"reference":[{"key":"962_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.laa.2017.01.018","volume":"520","author":"Z-Z Bai","year":"2017","unstructured":"Bai Z-Z, Miao C-Q (2017) On local quadratic convergence of inexact simplified Jacobi\u2013Davidson method. Linear Algebra Appl 520:215\u2013241","journal-title":"Linear Algebra Appl"},{"key":"962_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.aml.2017.03.021","volume":"72","author":"Z-Z Bai","year":"2017","unstructured":"Bai Z-Z, Miao C-Q (2017) On local quadratic convergence of inexact simplified Jacobi\u2013Davidson method for interior eigenpairs of Hermitian eigenproblems. Appl Math Lett 72:23\u201328","journal-title":"Appl Math Lett"},{"key":"962_CR3","doi-asserted-by":"publisher","first-page":"2396","DOI":"10.1016\/j.camwa.2018.12.025","volume":"77","author":"Z-Z Bai","year":"2019","unstructured":"Bai Z-Z, Miao C-Q, Jian S (2019) On multistep Rayleigh quotient iterations for Hermitian eigenvalue problems. Comput Math Appl 77:2396\u20132406","journal-title":"Comput Math Appl"},{"key":"962_CR4","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 (1994) The Davidson method. SIAM J Sci Comput 15:62\u201376","journal-title":"SIAM J Sci Comput"},{"key":"962_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/(SICI)1099-1506(199904\/05)6:3<235::AID-NLA166>3.0.CO;2-8","volume":"6","author":"M Genseberger","year":"1999","unstructured":"Genseberger M, Sleijpen GLG (1999) Alternative correction equations in the Jacobi\u2013Davidson method. Numer Linear Algebra Appl 6:235\u2013253","journal-title":"Numer Linear Algebra Appl"},{"key":"962_CR6","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BF02162162","volume":"10","author":"AA Goldstein","year":"1967","unstructured":"Goldstein AA, Price JF (1967) An effective algorithm for minimization. Numer Math 10:184\u2013189","journal-title":"Numer Math"},{"key":"962_CR7","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/S1064827500382579","volume":"24","author":"GH Golub","year":"1999","unstructured":"Golub GH, Ye Q (1999) An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems. SIAM J Sci Comput 24:312\u2013334","journal-title":"SIAM J Sci Comput"},{"key":"962_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1137\/S0895479888151111","volume":"15","author":"RG Grimes","year":"1994","unstructured":"Grimes RG, Lewis JG, Simon HD (1994) A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems. SIAM J Matrix Anal Appl 15:228\u2013272","journal-title":"SIAM J Matrix Anal Appl"},{"key":"962_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.6028\/jres.047.008","volume":"47","author":"MR Hestenes","year":"1951","unstructured":"Hestenes MR, Karush W (1951) 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","journal-title":"J Res Nat Bur Stand"},{"key":"962_CR10","first-page":"10198","volume":"219","author":"S Jian","year":"2013","unstructured":"Jian S (2013) A block preconditioned steepest descent method for symmetric eigenvalue problems. Appl Math Comput 219:10198\u201310217","journal-title":"Appl Math Comput"},{"key":"962_CR11","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.camwa.2010.05.034","volume":"60","author":"W Jiang","year":"2010","unstructured":"Jiang W, Wu G (2010) A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems. Comput Math Appl 60:873\u2013889","journal-title":"Comput Math Appl"},{"key":"962_CR12","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1137\/S1064827500366124","volume":"23","author":"AV Knyazev","year":"2001","unstructured":"Knyazev AV (2001) Toward the optimal preconditioned eigensolver: locally optimal block preconditioned conjugate gradient method. SIAM J Sci Comput 23:517\u2013541","journal-title":"SIAM J Sci Comput"},{"key":"962_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.4208\/eajam.160816.131016a","volume":"7","author":"C-Q Miao","year":"2017","unstructured":"Miao C-Q (2017) A filtered-Davidson method for large symmetric eigenvalue problems. East Asian J Appl Math 7:21\u201334","journal-title":"East Asian J Appl Math"},{"key":"962_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.cam.2018.05.001","volume":"343","author":"C-Q Miao","year":"2018","unstructured":"Miao C-Q (2018a) Computing eigenpairs in augmented Krylov subspace produced by Jacobi\u2013Davidson correction equation. J Comput Appl Math 343:363\u2013372","journal-title":"J Comput Appl Math"},{"key":"962_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-018-0627-7","author":"C-Q Miao","year":"2018","unstructured":"Miao C-Q (2018b) Filtered Krylov-like sequence method for symmetric eigenvalue problems. Numer Algorithms. \n                    https:\/\/doi.org\/10.1007\/s11075-018-0627-7","journal-title":"Numer Algorithms"},{"key":"962_CR16","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1137\/0914037","volume":"14","author":"RB Morgan","year":"1993","unstructured":"Morgan RB, Scott DS (1993) Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems. SIAM J Sci Comput 14:585\u2013593","journal-title":"SIAM J Sci Comput"},{"key":"962_CR17","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical optimization, 2nd edn. Springer, New York","edition":"2"},{"key":"962_CR18","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.laa.2005.06.039","volume":"415","author":"E Ovtchinnikov","year":"2006","unstructured":"Ovtchinnikov E (2006a) Cluster robustness of preconditioned gradient subspace iteration eigensolvers. Linear Algebra Appl 415:140\u2013166","journal-title":"Linear Algebra Appl"},{"key":"962_CR19","doi-asserted-by":"publisher","first-page":"2668","DOI":"10.1137\/040620643","volume":"43","author":"EE Ovtchinnikov","year":"2006","unstructured":"Ovtchinnikov EE (2006b) Sharp convergence estimates for the preconditioned steepest descent method for Hermitian eigenvalue problems. SIAM J Numer Anal 43:2668\u20132689","journal-title":"SIAM J Numer Anal"},{"key":"962_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971163","volume-title":"The symmetric eigenvalue problems","author":"BN Parlett","year":"1998","unstructured":"Parlett BN (1998) The symmetric eigenvalue problems. SIAM, Philadelphia"},{"key":"962_CR21","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/0717059","volume":"17","author":"Y Saad","year":"1980","unstructured":"Saad Y (1980) On the rates of convergence of the Lanczos and the block-Lanczos methods. SIAM J Numer Anal 17:687\u2013706","journal-title":"SIAM J Numer Anal"},{"key":"962_CR22","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 (1984) Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems. Math Comput 42:567\u2013588","journal-title":"Math Comput"},{"key":"962_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative methods for sparse linear systems","author":"Y Saad","year":"2003","unstructured":"Saad Y (2003) Iterative methods for sparse linear systems, 2nd edn. SIAM, Philadelphia","edition":"2"},{"key":"962_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 (2011) Numerical methods for large eigenvalue problems, 2nd edn. SIAM, Philadelphia","edition":"2"},{"key":"962_CR25","first-page":"105","volume":"5","author":"BA Samokish","year":"1958","unstructured":"Samokish BA (1958) The steepest descent method for an eigenvalue problem with semi-bounded operators. Izv Vyssh Uchebn Zaved Mat 5:105\u2013114","journal-title":"Izv Vyssh Uchebn Zaved Mat"},{"key":"962_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0895479894270427","volume":"17","author":"GLG Sleijpen","year":"1996","unstructured":"Sleijpen GLG, Van der Vorst HA (1996) A Jacobi\u2013Davidson iteration method for linear eigenvalue problems. SIAM J Matrix Anal Appl 17:401\u2013425","journal-title":"SIAM J Matrix Anal Appl"},{"key":"962_CR27","first-page":"163","volume":"7","author":"A Stathopoulos","year":"1998","unstructured":"Stathopoulos A, Saad Y (1998) Restarting techniques for the (Jacobi-) Davidson symmetric eigenvalue methods. Electron Trans Numer Anal 7:163\u2013181","journal-title":"Electron Trans Numer Anal"},{"key":"962_CR28","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/nla.490","volume":"13","author":"Y-K Zhou","year":"2006","unstructured":"Zhou Y-K (2006) Studies on Jacobi\u2013Davidson, Rayleigh quotient iteration, inverse iteration generalized Davidson and Newton updates. Numer Linear Algebra Appl 13:621\u2013642","journal-title":"Numer Linear Algebra Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-019-0962-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-019-0962-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-019-0962-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T23:16:07Z","timestamp":1601421367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-019-0962-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,1]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["962"],"URL":"https:\/\/doi.org\/10.1007\/s40314-019-0962-x","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,1]]},"assertion":[{"value":"19 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"155"}}