%0 Conference Paper
%A Bücker, H. Martin
%T Isoefficiency Analysis of Parallel QMR-Like Iterative Methods and its Implications on Parallel Algorithm Design
%V 96/1
%C Clausthal-Zellerfeld
%I Institut für Informatik, 1996
%M FZJ-2015-02057
%B Informatik-Bericht
%P 28-49
%D 1996
%< Workshop über Parallelverarbeitung, Lessach (Österreich)
%X 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.
%B 14th Workshop on Parallel Processing
%C 25 Sep 1995 - 29 Sep 1995, Lessach (Austria)
Y2 25 Sep 1995 - 29 Sep 1995
M2 Lessach, Austria
%F PUB:(DE-HGF)8 ; PUB:(DE-HGF)7
%9 Contribution to a conference proceedingsContribution to a book
%U https://juser.fz-juelich.de/record/188733