{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:35:57Z","timestamp":1787322957715,"version":"3.56.0"},"reference-count":40,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[1996,10]]},"abstract":"<jats:p>A deflation procedure is introduced that is designed to improve the convergence of an implicitly restarted Arnoldi iteration for computing a few eigenvalues of a large matrix. As the iteration progresses, the Ritz value approximations of the eigenvalues converge at different rates. A numerically stable scheme is introduced that implicitly deflates the converged approximations from the iteration. We present two forms of implicit deflation. The first, a locking operation, decouples converged Ritz values and associated vectors from the active part of the iteration. The second, a purging operation, removes unwanted but converged Ritz pairs. Convergence of the iteration is improved and a reduction in computational effort is also achieved. The deflation strategies make it possible to compute multiple or clustered eigenvalues with a single vector restart method. A block method is not required. These schemes are analyzed with respect to numerical stability, and computational results are presented.<\/jats:p>","DOI":"10.1137\/s0895479895281484","type":"journal-article","created":{"date-parts":[[2005,2,27]],"date-time":"2005-02-27T07:15:07Z","timestamp":1109488507000},"page":"789-821","source":"Crossref","is-referenced-by-count":505,"title":["Deflation Techniques for an Implicitly Restarted Arnoldi Iteration"],"prefix":"10.1137","volume":"17","author":[{"given":"R. B.","family":"Lehoucq","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D. C.","family":"Sorensen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/42792"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90286-W"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/361573.361582"},{"key":"R4","unstructured":"M. Bennani, T. Braconnier,  Stopping Criteria for Eigensolvers, Tech. report, TR\/PA\/93\/25, CERFACS, Toulouse, France,  1993"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8196-7_23"},{"key":"R6","unstructured":"T. Braconnier,  The Arnoldi-Tchebycheff Algorithm for Solving Large Nonsymmetric Eigenproblems, Tech. report, TR\/PA\/93\/25, CERFACS, Toulouse, France,  1993"},{"key":"R7","volume":"2","author":"Calvetti D.","year":"1994","journal-title":"Electron. Trans. Numer. Anal."},{"key":"R8","volume-title":"Eigenvalues of matrices","author":"Chatelin Fran\u00e7oise","year":"1993"},{"key":"R9","unstructured":"F. Chatelin, V. Frays\u00e9e,  Qualitative Computing: Elements of a Theory for Finite-Precision Computation, Tech. report, CERFACS and THOMSON-CSF, Lecture Notes for the Commett European Course, Orsay, France,  1993, June 8\u201310"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"J. Cullum, W. E. Donath,  A block Lanczos algorithm for computing the\n                      q\n                      algebraically largest eigenvalues and a corresponding eigenspace for large, sparse symmetric matrices,  Proc. 1974 IEEE Conference on Decision and Control, New York,  1974,  505\u2013509","DOI":"10.1109\/CDC.1974.270490"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0613013"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1145\/152613.152614"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/39373"},{"key":"R14","unstructured":"S. Godet-Thobie, Ph.D. Thesis,  Eigenvalues of Large Highly Nonnormal Matrices, University Paris IX, Dauphine, Paris, France,  1993, Tech. report TH\/PA\/93\/06, CERFACS, Toulouse, France, 1993"},{"key":"R15","volume-title":"Matrix computations","author":"Golub Gene H.","year":"1989"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1979.1102170"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-587260-7.50018-2"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479888151111"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01990348"},{"key":"R20","unstructured":"N. J. Higham,  The Test Matrix Toolbox for Matlab, Numerical Analysis Report, 237, University of Manchester, England,  1993"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1951.1.233"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.6028\/jres.045.026"},{"key":"R23","unstructured":"R. B. Lehoucq, Ph.D. Thesis,  Analysis and Implementation of an Implicitly Restarted Iteration, Rice University, Houston, TX,  1995, May; Tech. report TR95-13, Dept. of Computational and Applied Mathematics, Rice University, Houston, TX, 1993"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"R. B. Lehoucq, D. C. Sorensen, P. Vu,  ARPACK: An Implementation of the Implicitly Re-started Arnoldi Iteration That Computes Some of the Eigenvalues and Eigenvectors of a Large Sparse Matrix,  1995, Available from netlib@ornl.gov under the directory scalapack","DOI":"10.21236\/ADA447560"},{"key":"R25","unstructured":"C. C. Paige, Ph.D. Thesis,  The Computation of Eigenvalues and Eigenvectors of Very Large Sparse Matrices, University of London, London, England,  1971"},{"key":"R26","volume-title":"The symmetric eigenvalue problem","author":"Parlett Beresford N.","year":"1980"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1137\/0614022"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(85)90213-7"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01936867"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90169-X"},{"key":"R31","volume-title":"Numerical methods for large eigenvalue problems","author":"Saad Youcef","year":"1992"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388686"},{"key":"R33","doi-asserted-by":"publisher","DOI":"10.1145\/212066.212091"},{"key":"R34","doi-asserted-by":"publisher","DOI":"10.1137\/0613025"},{"key":"R35","doi-asserted-by":"publisher","DOI":"10.1145\/355694.355700"},{"key":"R36","doi-asserted-by":"publisher","DOI":"10.1137\/0714030"},{"key":"R37","doi-asserted-by":"publisher","DOI":"10.1145\/355945.355948"},{"key":"R38","doi-asserted-by":"publisher","DOI":"10.1137\/0716016"},{"key":"R39","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479893245991"},{"key":"R40","volume-title":"The algebraic eigenvalue problem","author":"Wilkinson J. H.","year":"1965"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0895479895281484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:35:32Z","timestamp":1787319332000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0895479895281484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["10.1137\/S0895479895281484"],"URL":"https:\/\/doi.org\/10.1137\/s0895479895281484","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}