{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T11:36:12Z","timestamp":1773920172321,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s00211-026-01525-7","type":"journal-article","created":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T10:33:25Z","timestamp":1769510005000},"page":"627-652","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A preconditioned inverse iteration with an improved convergence guarantee"],"prefix":"10.1007","volume":"158","author":[{"given":"Foivos","family":"Alimisis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Kressner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nian","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Vandereycken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,27]]},"reference":[{"key":"1525_CR1","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds, p. 224. Princeton University Press, Princeton, NJ (2008)"},{"issue":"1","key":"1525_CR2","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1007\/s10957-024-02538-8","volume":"203","author":"F Alimisis","year":"2024","unstructured":"Alimisis, F., Vandereycken, B.: Geodesic convexity of the symmetric eigenvalue problem and convergence of steepest descent. J. Optim. Theory Appl. 203(1), 920\u2013959 (2024). https:\/\/doi.org\/10.1007\/s10957-024-02538-8","journal-title":"J. Optim. Theory Appl."},{"key":"1525_CR3","doi-asserted-by":"publisher","unstructured":"Alimisis, F., Vary, S., Vandereycken, B.: A Nesterov-style accelerated gradient descent algorithm for the symmetric eigenvalue problem. arXiv preprint: 2406.18433 (2024). https:\/\/doi.org\/10.48550\/arXiv.2406.18433","DOI":"10.48550\/arXiv.2406.18433"},{"key":"1525_CR4","unstructured":"Alimisis, F., Davies, P., Vandereycken, B., Alistarh, D.: Distributed principal component analysis with limited communication. In: Ranzato, M., Beygelzimer, A., Dauphin, Y., Liang, P.S., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems, vol. 34, pp. 2823\u20132834. Curran Associates, Inc., Red Hook, NY, USA (2021). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2021\/file\/1680e9fa7b4dd5d62ece800239bb53bd-Paper.pdf"},{"key":"1525_CR5","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1017\/9781009166164","volume-title":"An Introduction to Optimization on Smooth Manifolds","author":"N Boumal","year":"2023","unstructured":"Boumal, N.: An Introduction to Optimization on Smooth Manifolds, p. 338. Cambridge University Press, Cambridge (2023)"},{"key":"1525_CR6","doi-asserted-by":"publisher","unstructured":"Brenner, S.C., Scott, L.R.: The mathematical theory of finite element methods, 3rd edn. Texts in Applied Mathematics, vol. 15, p. 397. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-75934-0","DOI":"10.1007\/978-0-387-75934-0"},{"key":"1525_CR7","doi-asserted-by":"publisher","unstructured":"Briggs, W.L., Henson, V.E., McCormick, S.F.: A Multigrid tutorial, 2nd edn., p. 193. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2000). https:\/\/doi.org\/10.1137\/1.9780898719505","DOI":"10.1137\/1.9780898719505"},{"key":"1525_CR8","unstructured":"Golub, G.H., Van\u00a0Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins Studies in the Mathematical Sciences, p. 756. Johns Hopkins University Press, Baltimore, MD (2013)"},{"key":"1525_CR9","doi-asserted-by":"publisher","unstructured":"Knyazev, A.V.: Toward the optimal preconditioned eigensolver: locally optimal block preconditioned conjugate gradient method. 23, 517\u2013541 (2001). https:\/\/doi.org\/10.1137\/S1064827500366124","DOI":"10.1137\/S1064827500366124"},{"key":"1525_CR10","doi-asserted-by":"publisher","unstructured":"Knyazev, A.V., Neymeyr, K.: A geometric theory for preconditioned inverse iteration. III. A short and sharp convergence estimate for generalized eigenvalue problems. vol. 358, pp. 95\u2013114 (2003). https:\/\/doi.org\/10.1016\/S0024-3795(01)00461-X","DOI":"10.1016\/S0024-3795(01)00461-X"},{"issue":"4","key":"1525_CR11","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1007\/s11075-023-01550-9","volume":"94","author":"D Kressner","year":"2023","unstructured":"Kressner, D., Ma, Y., Shao, M.: A mixed precision LOBPCG algorithm. Numer. Algorithms 94(4), 1653\u20131671 (2023). https:\/\/doi.org\/10.1007\/s11075-023-01550-9","journal-title":"Numer. Algorithms"},{"key":"1525_CR12","doi-asserted-by":"crossref","unstructured":"Kyng, R., Sachdeva, S.: Approximate Gaussian elimination for Laplacians\u2014fast, sparse, and simple. In: 57th Annual IEEE Symposium on Foundations of Computer Science\u2014FOCS 2016, pp. 573\u2013582. IEEE Computer Soc., Los Alamitos, CA (2016)","DOI":"10.1109\/FOCS.2016.68"},{"issue":"2","key":"1525_CR13","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1137\/100818509","volume":"34","author":"A Napov","year":"2012","unstructured":"Napov, A., Notay, Y.: An algebraic multigrid method with guaranteed convergence rate. SIAM J. Sci. Comput. 34(2), 1079\u20131109 (2012). https:\/\/doi.org\/10.1137\/100818509","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"1525_CR14","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$O(1\/k^{2})$$. Dokl. Akad. Nauk SSSR 269(3), 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"1525_CR15","doi-asserted-by":"publisher","unstructured":"Neymeyr, K.: A geometric theory for preconditioned inverse iteration. I. Extrema of the Rayleigh quotient. Linear Algebra Appl. 322(1-3), 61\u201385 (2001). https:\/\/doi.org\/10.1016\/S0024-3795(00)00239-1","DOI":"10.1016\/S0024-3795(00)00239-1"},{"issue":"1\u20133","key":"1525_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0024-3795(00)00236-6","volume":"322","author":"K Neymeyr","year":"2001","unstructured":"Neymeyr, K.: A geometric theory for preconditioned inverse iteration. II. Convergence estimates. Linear Algebra Appl. 322(1\u20133), 87\u2013104 (2001). https:\/\/doi.org\/10.1016\/S0024-3795(00)00236-6","journal-title":"II. Convergence estimates. Linear Algebra Appl."},{"issue":"4","key":"1525_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/nla.272","volume":"9","author":"K Neymeyr","year":"2002","unstructured":"Neymeyr, K.: A posteriori error estimation for elliptic eigenproblems. Numer. Linear Algebra Appl. 9(4), 263\u2013279 (2002). https:\/\/doi.org\/10.1002\/nla.272","journal-title":"Numer. Linear Algebra Appl."},{"key":"1525_CR18","unstructured":"Notay, Y.: AGMG software and documentation. http:\/\/agmg.eu"},{"key":"1525_CR19","first-page":"123","volume":"37","author":"Y Notay","year":"2010","unstructured":"Notay, Y.: An aggregation-based algebraic multigrid method. Electron. Trans. Numer. Anal. 37, 123\u2013146 (2010)","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"1","key":"1525_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00211-025-01451-0","volume":"157","author":"N Shao","year":"2025","unstructured":"Shao, N., Chen, W.: Riemannian acceleration with preconditioning for symmetric eigenvalue problems. Numer. Math. 157(1), 307\u2013354 (2025). https:\/\/doi.org\/10.1007\/s00211-025-01451-0","journal-title":"Numer. Math."},{"issue":"1","key":"1525_CR21","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1137\/24M1641440","volume":"46","author":"N Shao","year":"2025","unstructured":"Shao, N., Chen, W., Bai, Z.: EPIC: a provable accelerated eigensolver based on preconditioning and implicit convexity. SIAM J. Matrix Anal. Appl. 46(1), 45\u201373 (2025). https:\/\/doi.org\/10.1137\/24M1641440","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1525_CR22","doi-asserted-by":"crossref","unstructured":"Smith, S.T.: Optimization techniques on Riemannian manifolds. In: Hamiltonian and Gradient Flows, Algorithms and Control. Fields Inst. Commun., vol. 3, pp. 113\u2013136. Amer. Math. Soc., Providence, RI (1994)","DOI":"10.1090\/fic\/003\/09"},{"key":"1525_CR23","doi-asserted-by":"publisher","DOI":"10.1145\/1731022.1731031","author":"A Stathopoulos","year":"2010","unstructured":"Stathopoulos, A., McCombs, J.R.: PRIMME: preconditioned iterative multimethod eigensolver\u2013methods and software description. ACM Trans. Math. Software (2010). https:\/\/doi.org\/10.1145\/1731022.1731031","journal-title":"ACM Trans. Math. Software"},{"key":"1525_CR24","doi-asserted-by":"publisher","unstructured":"Toselli, A., Widlund, O.: Domain Decomposition Methods\u2014algorithms and Theory. Springer Series in Computational Mathematics, vol. 34, p. 450. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/b137868","DOI":"10.1007\/b137868"},{"key":"1525_CR25","doi-asserted-by":"publisher","unstructured":"Trefethen, L.N., Bau, D.: III Numerical Linear Algebra, p. 361. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1997). https:\/\/doi.org\/10.1137\/1.9780898719574","DOI":"10.1137\/1.9780898719574"},{"issue":"4","key":"1525_CR26","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1137\/1034116","volume":"34","author":"J Xu","year":"1992","unstructured":"Xu, J.: Iterative methods by space decomposition and subspace correction. SIAM Rev. 34(4), 581\u2013613 (1992). https:\/\/doi.org\/10.1137\/1034116","journal-title":"SIAM Rev."}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-026-01525-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00211-026-01525-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-026-01525-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T06:48:09Z","timestamp":1773902889000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00211-026-01525-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,27]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1525"],"URL":"https:\/\/doi.org\/10.1007\/s00211-026-01525-7","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,27]]},"assertion":[{"value":"19 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}