Contribution to a conference proceedings/Contribution to a book

FZJ-2015-02057

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Isoefficiency Analysis of Parallel QMR-Like Iterative Methods and its Implications on Parallel Algorithm Design

Bücker, H. M.

1996
Institut für Informatik, 1996 Clausthal-Zellerfeld

Please use a persistent id in citations: http://hdl.handle.net/2128/11934

Abstract: A specific problem arising out of electrostatics is taken as an example to demonstrate the process of, firstly, transforming a physical problem into a mathematical model and, secondly, its numerical solution by generating a system of linear equations via finite difference approximations. The resulting nonsymmetric sparse linear system is solved by a class of iterative methods that is defined by taking the Quasi-Minimal Residual(QMR) method as a typical member. A performance model called isoefficiency concept is used to analyze the behavior of such methods implemented on parallel distributed memory computers with two-dimensional mesh topology. The isoefficiency concept is employed to compare two different mappings of data to processors as well as to give hints how QMR-like iterative methods should be designed with respect to parallel computing.

---

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)

---

Database coverage:

---