Report

FZJ-2015-03170

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png A Comparison of QMR, CGS and TFQMR on a Distributed Memory Machine

Bücker, M. ; Basermann, A.

1994
Zentralinstitut für Angewandte Mathematik Jülich

Report No.: KFA-ZAM-IB-9412

Abstract: For the solution of systems of linear equations with general non-Hermitian nonsingular coefficient matrices, an implementation of three different algorithms on a parallel machine with distributed memory is proposed. Each of the three algorithms, QMR, CGS and TFQMR, contains two matrix-vector products that dominate the execution time. While the matrix-vector products of CGS and TFQMR are dependent this is not valid for QMR. The two matrix-vector products of QMR can be computed simultaneously. This paper shows how the performance of a parallel implementation is increased by exploiting this property. Timing results of all three algorithms on an Intel PARAGON XP/S 10 system are presented.

---

Contributing Institute(s):

1. Zentralinstitut für Angewandte Mathematik (ZAM)
2. Jülich Supercomputing Center (JSC)

Research Program(s):

1. 899 - ohne Topic (POF2-899) (POF2-899)

---