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

@ARTICLE{Lippert:860308,
      author       = {Lippert, Thomas},
      title        = {{P}arallel {SSOR} preconditioning for lattice {QCD}},
      journal      = {Parallel computing},
      volume       = {25},
      number       = {10-11},
      issn         = {0167-8191},
      address      = {Amsterdam [u.a.]},
      publisher    = {North-Holland, Elsevier Science},
      reportid     = {FZJ-2019-01083},
      pages        = {1357 - 1370},
      year         = {1999},
      abstract     = {The locally lexicographic symmetric successive
                      overrelaxation algorithm (ll-SSOR) is the most effective
                      parallel preconditioner known for iterative solvers used in
                      lattice gauge theory. After reviewing the basic properties
                      of ll-SSOR, the focus of this contribution is put on its
                      parallel aspects: the administrative overhead of the
                      parallel implementation of ll-SSOR, which is due to many
                      conditional operations, decreases its efficiency by a factor
                      of up to one third. A simple generalization of the algorithm
                      is proposed that allows the application of the lexicographic
                      ordering along specified axes, while along the other
                      dimensions odd–even preconditioning is used. In this way
                      one can tune the preconditioner towards optimal performance
                      by balancing ll-SSOR effectivity and administrative
                      overhead.},
      ddc          = {620},
      typ          = {PUB:(DE-HGF)16},
      doi          = {10.1016/S0167-8191(99)00055-1},
      url          = {https://juser.fz-juelich.de/record/860308},
}