{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:41:44Z","timestamp":1787330504537,"version":"build-2736575974"},"reference-count":32,"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":[[2017,1]]},"abstract":"<jats:p>Rational Krylov methods are applicable to a wide range of scientific computing problems, and the rational Arnoldi algorithm is a commonly used procedure for computing an orthonormal basis of a rational Krylov space. Typically, the computationally most expensive component of this algorithm is the solution of a large linear system of equations at each iteration. We explore the option of solving several linear systems simultaneously, thus constructing the rational Krylov basis in parallel. If this is not done carefully, the basis being orthogonalized may become badly conditioned, leading to numerical instabilities in the orthogonalization process. We introduce the new concept of continuation pairs, which gives rise to a near-optimal parallelization strategy that allows us to control the growth of the condition number of this nonorthogonal basis. As a consequence we obtain a significantly more accurate and reliable parallel rational Arnoldi algorithm. The computational benefits are illustrated using several numerical examples from different application areas.<\/jats:p>","DOI":"10.1137\/16m1079178","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T16:24:40Z","timestamp":1509035080000},"page":"S197-S221","source":"Crossref","is-referenced-by-count":10,"title":["Parallelization of the Rational Arnoldi Algorithm"],"prefix":"10.1137","volume":"39","author":[{"given":"Mario","family":"Berljafa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"G\u00fcttel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2017,10,26]]},"reference":[{"key":"atypb1","volume-title":"Oberwolfach Model Reduction Benchmark Collection, data collection","author":"Collection Benchmark","year":"2003"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719581"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1002\/gamm.201310003"},{"key":"atypb4","volume-title":"MIMS EPrint","author":"Berljafa M.","year":"2014"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1137\/140998081"},{"key":"atypb6","volume-title":"MIMS EPrint","author":"Berljafa M.","year":"2015"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1093\/gji\/ggv224"},{"key":"atypb8","first-page":"1","volume":"38","author":"Davis T. A.","year":"2011","journal-title":"ACM Trans. Math. Software"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/100813257"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/080742403"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02141740"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/22.4.521"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/140964655"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1002\/nla.366"},{"key":"atypb16","unstructured":"E. Grimme,\n                      Krylov Projection Methods for Model Reduction\n                      , Ph.D. thesis, University of Illinois at Urbana-Champaign, Champaign, IL, 1997."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/060666123"},{"key":"atypb18","unstructured":"S. G\u00fcttel,\n                      Rational Krylov Methods for Operator Functions\n                      , Ph.D. thesis, Institut f\u00fcr Numerische Mathematik und Optimierung der Technischen Universit\u00e4t Bergakademie Freiberg, Freiberg, Germany, 2010."},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1002\/gamm.201310002"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/130935045"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1007\/s10492-005-0036-9"},{"key":"atypb22","first-page":"1","volume":"616","author":"Lassaux G.","year":"2003","journal-title":"AIAA Paper"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896311220"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801384937"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1680020205"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(84)90221-0"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595285597"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0095377"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(01)00413-X"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1137\/140976698"},{"key":"atypb32","first-page":"3","volume-title":"North--Holland","author":"Van der Vorst H. A.","year":"2002"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1079178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:09:28Z","timestamp":1787328568000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1079178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["10.1137\/16M1079178"],"URL":"https:\/\/doi.org\/10.1137\/16m1079178","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}