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

@TECHREPORT{Bcker:190257,
      author       = {Bücker, Martin and Basermann, Achim},
      title        = {{A} {C}omparison of {QMR}, {CGS} and {TFQMR} on a
                      {D}istributed {M}emory {M}achine},
      number       = {KFA-ZAM-IB-9412},
      address      = {Jülich},
      publisher    = {Zentralinstitut für Angewandte Mathematik},
      reportid     = {FZJ-2015-03170, KFA-ZAM-IB-9412},
      pages        = {14 p.},
      year         = {1994},
      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.},
      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)29},
      url          = {https://juser.fz-juelich.de/record/190257},
}