{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:34:02Z","timestamp":1787337242463,"version":"build-2736575974"},"reference-count":33,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2001,1]]},"abstract":"<jats:p>This paper studies the solution of quadratic eigenvalue problems by the quadratic residual iteration method. The focus is on applications arising from finite-element simulations in acoustics. One approach is the shift-and-invert Arnoldi method applied to the linearized problem. When more than one eigenvalue is wanted, it is advisable to use locking or deflation of converged eigenvectors (or Schur vectors). In order to avoid unlimited growth of the subspace dimension, one can restart the method by purging unwanted eigenvectors (or Schur vectors). Both locking and restarting use the partial Schur form. The disadvantage of this approach is that the dimension of the linearized problem is twice that of the quadratic problem. The quadratic residual iteration and Jacobi--Davidson methods directly solve the quadratic problem. Unfortunately, the Schur form is not defined, nor are locking and restarting. This paper shows a link between methods for solving quadratic eigenvalue problems and the linearized problem. It aims to combine the benefits of the quadratic and the linearized approaches by employing a locking and restarting scheme based on the Schur form of the linearized problem in quadratic residual iteration and Jacobi--Davidson. Numerical experiments illustrate quadratic residual iteration and Jacobi--Davidson for computing the linear Schur form. It also makes a comparison with the shift-and-invert Arnoldi method.<\/jats:p>","DOI":"10.1137\/s106482759935174x","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1814-1839","source":"Crossref","is-referenced-by-count":38,"title":["Locking and Restarting Quadratic Eigenvalue Solvers"],"prefix":"10.1137","volume":"22","author":[{"given":"Karl","family":"Meerbergen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,25]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/0915004"},{"key":"R2","first-page":"772","volume":"30","author":"Daniel J.","year":"1976","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02510361"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1980-0583502-2"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596300073"},{"key":"R6","unstructured":"G. Golub and C. Van Loan,\n                      Matrix Computations\n                      , 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996."},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479888151111"},{"key":"R8","unstructured":"Harwell Subroutine Library. A Catalogue of Subroutines (Release 12)\n                      , 1996."},{"key":"R8","unstructured":"Information: Nick Brealey, AEA Technology, 477 Harwell, Didcot, Oxon, OX11 0RA, UK (hsl@aeat.co.uk)."},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1137\/0911067"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896311220"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895281484"},{"key":"R12","unstructured":"K. Meerbergen,\n                      Robust Methods for the Calculation of Rightmost Eigenvalues of Large Eigenvalue Problems\n                      , Ph.D. thesis, Department of Computer Science, K. U. Leuven, Leuven, Belgium, 1996."},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/16.3.297"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894274255"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(92)90006-K"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-96-00745-4"},{"key":"R17","unstructured":"R. Morgan and K. Meerbergen,\n                      Inexact methods\n                      , in Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst, eds., SIAM, Philadelphia, 2000."},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(92)90315-P"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/0722055"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595285597"},{"key":"R21","unstructured":"Y. Saad,\n                      Numerical Methods for Large Eigenvalue Problems. Algorithms and Architectures for Advanced Scientific Computing\n                      , Manchester University Press, Manchester, UK, 1992."},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1137\/0907058"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1016\/0020-7225(70)90081-9"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1145\/212066.212091"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1002\/nag.1610100502"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01731936"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894270427"},{"key":"R28","first-page":"8","volume":"29","author":"Sleijpen G. L. G.","year":"1996","journal-title":"SIAM News"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1137\/0613025"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01462265"},{"key":"R31","doi-asserted-by":"publisher","unstructured":"Fran\u00e7oise Tisseur, Backward error and condition of polynomial eigenvalue problems, Proceedings of the International Workshop on Accurate Solution of Eigenvalue Problems (University Park, PA, 1998), Vol. 309, 2000, 339\u201336110.1016\/S0024-3795(99)00063-41758374","DOI":"10.1016\/S0024-3795(99)00063-4"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0207(19990630)45:6<765::AID-NME607>3.0.CO;2-A"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S106482759935174X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:51:54Z","timestamp":1787334714000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S106482759935174X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["10.1137\/S106482759935174X"],"URL":"https:\/\/doi.org\/10.1137\/s106482759935174x","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}