{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T06:54:00Z","timestamp":1787381640151,"version":"build-2736575974"},"reference-count":35,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/501100004497","name":"Onderzoeksraad, KU Leuven","doi-asserted-by":"publisher","award":["C14\/16\/056"],"award-info":[{"award-number":["C14\/16\/056"]}],"id":[{"id":"10.13039\/501100004497","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004497","name":"Onderzoeksraad, KU Leuven","doi-asserted-by":"publisher","award":["OT\/14\/074"],"award-info":[{"award-number":["OT\/14\/074"]}],"id":[{"id":"10.13039\/501100004497","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>We propose a rational QZ method for the solution of the dense, unsymmetric generalized eigenvalue problem. This generalization of the classical QZ method operates implicitly on a Hessenberg, Hessenberg pencil instead of on a Hessenberg, triangular pencil. Whereas the QZ method performs nested subspace iteration driven by a polynomial, the rational QZ method allows for nested subspace iteration driven by a rational function; this creates the additional freedom of selecting poles. In this article we study Hessenberg, Hessenberg pencils, link them to rational Krylov subspaces, propose a direct reduction method to such a pencil, and introduce the implicit rational QZ step. The link with rational Krylov subspaces allows us to prove essential uniqueness (implicit Q theorem) of the rational QZ iterates as well as convergence of the proposed method. In the proofs, we operate directly on the pencil instead of rephrasing it all in terms of a single matrix. Numerical experiments are included to illustrate competitiveness in terms of speed and accuracy with the classical approach. Two other types of experiments exemplify new possibilities. First we illustrate that good pole selection can be used to deflate the original problem during the reduction phase, and second we use the rational QZ method to implicitly filter a rational Krylov subspace in an iterative method.<\/jats:p>","DOI":"10.1137\/18m1170480","type":"journal-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T10:49:17Z","timestamp":1565088557000},"page":"943-972","source":"Crossref","is-referenced-by-count":8,"title":["A Rational QZ Method"],"prefix":"10.1137","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0236-4353","authenticated-orcid":true,"given":"Daan","family":"Camps","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karl","family":"Meerbergen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2119-8696","authenticated-orcid":true,"given":"Raf","family":"Vandebril","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/42792"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/140998081"},{"key":"atypb3","first-page":"125","author":"Boisvert R. F.","year":"1997","journal-title":"UK"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(99)00089-8"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02510361"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1145\/1236463.1236469"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1137\/120891393"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/4.3.265"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/4.4.332"},{"key":"atypb10","unstructured":"G. H. Golub and C. F. Van Loan,\n                      Matrix Computations\n                      , 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/05064521X"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02142813"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1145\/355719.355725"},{"key":"atypb14","unstructured":"D. Kressner,\n                      Numerical Methods for General and Structured Eigenvalue Problems\n                      , Lect. Notes Comput. Sci. Eng. 46, Springer, New York, 2005."},{"key":"atypb15","first-page":"100","volume":"43","author":"Mach T.","year":"2014","journal-title":"Electron. Trans. Numer. Anal."},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1137\/0710024"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.79.115112"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(84)90221-0"},{"key":"atypb19","first-page":"149","author":"Ruhe A.","year":"1994","journal-title":"New York"},{"key":"atypb20","doi-asserted-by":"crossref","unstructured":"A. Ruhe,\n                      Rational Krylov algorithms for nonsymmetric eigenvalue problems,II:Matrix pairs\n                      , Linear Algebra Appl., 197-198 (1994), pp. 283-296.","DOI":"10.1016\/0024-3795(94)90492-8"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595285597"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(03)00565-X"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1137\/0613025"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2015.07.012"},{"key":"atypb25","unstructured":"R. Van Beeumen, K. Meerbergen, and W. Michiels,\n                      Subspace iteration for generalized eigenvalue problems via contour integration and rational Krylov methods\n                      , submitted, 2017."},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1137\/0902010"},{"key":"atypb27","unstructured":"R. Vandebril, M. Van Barel, and N. Mastronardi,\n                      Matrix Computations and Semiseparable Matrices, Volume II: Eigenvalue and Singular Value Methods\n                      , Johns Hopkins University Press, Baltimore, MD, 2008."},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1137\/11085219X"},{"key":"atypb29","first-page":"17","volume":"40","author":"Vandebril R.","year":"2013","journal-title":"Electron. Trans. Numer. Anal."},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1137\/0712062"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896299950"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899360376"},{"key":"atypb33","doi-asserted-by":"crossref","unstructured":"D. S. Watkins,\n                      The Matrix Eigenvalue Problem: GR and Krylov Subspace Methods\n                      , SIAM, Philadelphia, 2007.","DOI":"10.1137\/1.9780898717808"},{"key":"atypb34","doi-asserted-by":"crossref","first-page":"387","DOI":"10.4169\/amer.math.monthly.118.05.387","author":"Watkins D. S.","year":"2011","journal-title":"Monthly, ("},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1137\/S089547989122377X"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M1170480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:36:07Z","timestamp":1787326567000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M1170480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1137\/18M1170480"],"URL":"https:\/\/doi.org\/10.1137\/18m1170480","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}