{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:35:04Z","timestamp":1787337304648,"version":"build-2736575974"},"reference-count":37,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2006,1]]},"abstract":"<jats:p>Iterative eigenvalue solvers for large, sparse matrices may miss some of the required eigenvalues that are of high algebraic multiplicity or tightly clustered. Block methods, locking, a posteriori validation, or simply increasing the required accuracy are often used to avoid missing or to detect a missed eigenvalue, but each has its own shortcomings in robustness or performance. To resolve these shortcomings, we have developed a postprocessing algorithm, iterative validation of eigensolvers (IVE), that combines the advantages of each technique. IVE detects numerically multiple eigenvalues among the approximate eigenvalues returned by a given solver, adjusts the block size accordingly, then calls the given solver using locking to compute a new approximation in the subspace orthogonal to the current approximate eigenvectors. This process is repeated until no additional missed eigenvalues can be identified. IVE is general and can be applied as a wrapper to any Rayleigh\u2013Ritz\u2010based, Hermitian eigensolver. Our experiments show that IVE is very effective in computing missed eigenvalues even with eigensolvers that lack locking or block capabilities, although such capabilities may further enhance robustness. By focusing on robustness in a postprocessing stage, IVE allows the user to decouple the notion of robustness from that of performance when choosing the block size or the convergence tolerance.<\/jats:p>","DOI":"10.1137\/050627617","type":"journal-article","created":{"date-parts":[[2006,12,26]],"date-time":"2006-12-26T11:06:15Z","timestamp":1167131175000},"page":"2337-2358","source":"Crossref","is-referenced-by-count":10,"title":["Iterative Validation of Eigensolvers: A Scheme for Improving the Reliability of Hermitian Eigenvalue Solvers"],"prefix":"10.1137","volume":"28","author":[{"given":"James R.","family":"McCombs","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Stathopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,12,21]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827501397949"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1145\/838250.838257"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897317806"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst, eds.\n                      Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide\n                      , SIAM, Philadelphia, 2000.","DOI":"10.1137\/1.9780898719581"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/13.1.76"},{"key":"R6","unstructured":"T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein,\n                      Introduction to Algorithms\n                      , 2nd ed., MIT Press, Cambridge, MA, 2003."},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(75)90065-0"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"J. J. Dongarra, I. S. Duff, D. C. Sorensen, and H. A. van der Vorst,\n                      Numerical Linear Algebra for High Performance Computers\n                      , SIAM, Philadelphia, 1998.","DOI":"10.1137\/1.9780898719611"},{"key":"R9","unstructured":"I. Duff, R. G. Grimes, and J. G. Lewis,\n                      Users\u2019 Guide for the Harwell\u2010Boeing Sparse Matrix Collection (Release I)\n                      , Technical Report TR\/PA\/92\/86, CERFACS, Toulouse, France, Oct. 1992."},{"key":"R10","unstructured":"R. Geus,\n                      The Jacobi\u2010Davidson Algorithm for Solving Large Sparse Symmetric Eigenvalue Problems with Application to the Design of Accelerator Cavities\n                      , Ph.D. thesis, ETH, Zurich, Switzerland, 2002."},{"key":"R11","unstructured":"G. H. Golub and C. F. Van Loan,\n                      Matrix Computations\n                      , John Hopkins University Press, Baltimore, MD, 1989."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"G. H. Golub and R. Underwood,\n                      The block Lanczos method for computing eigenvalues\n                      , in Mathematical Software III, J. R. Rice, ed., Academic Press, New York, 1977, pp. 361\u2013377.","DOI":"10.1016\/B978-0-12-587260-7.50018-2"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479888151111"},{"key":"R14","unstructured":"C. Hsu and J. Demmel,\n                      Effects of Block Size on the Block Lanczos Algorithm\n                      , Technical report, Department of Mathematics, University of California, Berkeley, June 2003."},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827500366124"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144504445376"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.6028\/jres.045.026"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895281484"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"R. B. Lehoucq, D. C. Sorensen, and C. Yang,\n                      ARPACK USERS GUIDE: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods\n                      , SIAM, Philadelphia, 1998.","DOI":"10.1137\/1.9780898719628"},{"key":"R20","unstructured":"J. R. McCombs and A. Stathopoulos,\n                      PRIMME: PReconditioned Iterative Multimethod Eigensolver\n                      , http:\/\/www.cs.wm.edu\/\u223candreas\/software\/."},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.07.024"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-96-00745-4"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1137\/0907054"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"B. N. Parlett,\n                      The Symmetric Eigenvalue Problem\n                      , SIAM, Philadelphia, 1998.","DOI":"10.1137\/1.9781611971163"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02219773"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1137\/0717059"},{"key":"R27","unstructured":"Y. Saad,\n                      Numerical Methods for Large Eigenvalue Problems\n                      , Manchester University Press, Manchester, UK, 1992."},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01731936"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894270427"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1137\/0613025"},{"key":"R31","unstructured":"D. C. Sorensen,\n                      Deflation for Implicitly Restarted Arnoldi Methods\n                      , Technical Report TR98\u201312, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1998."},{"key":"R32","unstructured":"A. Stathopoulos,\n                      Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part I: Seeking One Eigenvalue\n                      , SIAM J. Sci. Comput., to appear."},{"key":"R33","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4655(94)90073-6"},{"key":"R34","first-page":"163","volume":"7","author":"Stathopoulos A.","year":"1998","journal-title":"Electron. Trans. Numer. Algebra"},{"key":"R35","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304162"},{"key":"R36","doi-asserted-by":"publisher","DOI":"10.1145\/355945.355952"},{"key":"R37","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(99)00259-X"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/050627617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:55:45Z","timestamp":1787334945000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/050627617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["10.1137\/050627617"],"URL":"https:\/\/doi.org\/10.1137\/050627617","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,1]]}}}