% IMPORTANT: The following is UTF-8 encoded. This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.
@INPROCEEDINGS{Bcker:188733,
author = {Bücker, H. Martin},
title = {{I}soefficiency {A}nalysis of {P}arallel {QMR}-{L}ike
{I}terative {M}ethods and its {I}mplications on {P}arallel
{A}lgorithm {D}esign},
volume = {96/1},
address = {Clausthal-Zellerfeld},
publisher = {Institut für Informatik, 1996},
reportid = {FZJ-2015-02057},
series = {Informatik-Bericht},
pages = {28-49},
year = {1996},
comment = {Workshop über Parallelverarbeitung, Lessach (Österreich)},
booktitle = {Workshop über Parallelverarbeitung,
Lessach (Österreich)},
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.},
month = {Sep},
date = {1995-09-25},
organization = {14th Workshop on Parallel Processing,
Lessach (Austria), 25 Sep 1995 - 29 Sep
1995},
cin = {ZAM / JSC},
cid = {I:(DE-Juel1)VDB62 / I:(DE-Juel1)JSC-20090406},
pnm = {899 - ohne Topic (POF2-899)},
pid = {G:(DE-HGF)POF2-899},
typ = {PUB:(DE-HGF)8 / PUB:(DE-HGF)7},
url = {https://juser.fz-juelich.de/record/188733},
}