PARALLELIZATION OF THE RATIONAL ARNOLDI ALGORITHM

Research output: Contribution to journalArticle

Abstract

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.


Read More: http://epubs.siam.org/doi/abs/10.1137/16M1079178

Bibliographical metadata

Original languageEnglish
JournalSIAM Journal on Scientific Computing
DOIs
StatePublished - 26 Oct 2017