Parallelization of the rational Arnoldi algorithm

Berljafa, Mario and Güttel, Stefan (2016) Parallelization of the rational Arnoldi algorithm. [MIMS Preprint]

This is the latest version of this item.

[thumbnail of paper_rev_mims.pdf] PDF
paper_rev_mims.pdf
Download (863kB)

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 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.

Item Type: MIMS Preprint
Uncontrolled Keywords: rational Krylov, orthogonalization, parallelization
Subjects: MSC 2010, the AMS's Mathematics Subject Classification > 65 Numerical analysis
MSC 2010, the AMS's Mathematics Subject Classification > 68 Computer science
Depositing User: Stefan Güttel
Date Deposited: 21 Sep 2016
Last Modified: 08 Nov 2017 18:18
URI: https://eprints.maths.manchester.ac.uk/id/eprint/2503

Available Versions of this Item

Actions (login required)

View Item View Item