% 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:155246,
      author       = {Bücker, H. Martin and Sauren, Manfred},
      title        = {{A} variant of the biconjugate gradient method suitable for
                      massively parallel computing},
      volume       = {1253},
      address      = {Berlin, Heidelberg},
      publisher    = {Springer Berlin Heidelberg},
      reportid     = {FZJ-2014-04420},
      isbn         = {978-3-540-63138-5 (print)},
      series       = {Lecture Notes in Computer Science},
      pages        = {72 - 79},
      year         = {1997},
      comment      = {Solving Irregularly Structured Problems in Parallel},
      booktitle     = {Solving Irregularly Structured
                       Problems in Parallel},
      abstract     = {Starting from a specific implementation of the Lanczos
                      biorthogonalization algorithm, an iterative process for the
                      solution of systems of linear equations with general
                      non-Hermitian coefficient matrix is derived. Due to the
                      orthogonalization of the underlying Lanczos process the
                      resulting iterative scheme involves inner products leading
                      to global communication and synchronization on parallel
                      processors. For massively parallel computers, these effects
                      cause considerable delays often preventing the scalability
                      of the implementation. In the process proposed, all inner
                      product-like operations of an iteration step are independent
                      such that the implementation consists of only a single
                      global synchronization point per iteration. In exact
                      arithmetic, the process is shown to be mathematically
                      equivalent to the biconjugate gradient method. The
                      efficiency of this new variant is demonstrated by numerical
                      experiments on a PARAGON system using up to 121 processors.},
      month         = {Jun},
      date          = {1997-06-11},
      organization  = {Fourth International Symposium on
                       Solving Irregularly Structured Problems
                       in Parallel, Paderborn (Germany), 11
                       Jun 1997 - 13 Jun 1997},
      cin          = {ZAM / JSC},
      ddc          = {004},
      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},
      doi          = {10.1007/3-540-63138-0_7},
      url          = {https://juser.fz-juelich.de/record/155246},
}