% 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:860310,
      author       = {Lippert, T. and Schilling, K. and Petkov, N.},
      title        = {{Q}uark propagator on the {C}onnection {M}achine},
      journal      = {Parallel computing},
      volume       = {18},
      number       = {12},
      issn         = {0167-8191},
      address      = {Amsterdam [u.a.]},
      publisher    = {North-Holland, Elsevier Science},
      reportid     = {FZJ-2019-01085},
      pages        = {1291 - 1299},
      year         = {1992},
      abstract     = {The computation of the fermion propagator in lattice
                      Quantum Chromodynamics requires the solution of a large
                      system of linear equations. We discuss and compare the
                      structure, implementation and performance of two linear
                      equation solvers, the Jacobi algorithm and the Conjugate
                      Gradient algorithm, on the Connection Machine CM-2. We
                      investigate the computer time needed for next neighbor
                      communication versus the time required for floating point
                      operations on 84 and 164 lattices. We compare the
                      convergence behavior of Conjugate Gradient and Jacobi as
                      applied to gauge configurations at β = 0.0 and 6.0.},
      ddc          = {620},
      typ          = {PUB:(DE-HGF)16},
      doi          = {10.1016/0167-8191(92)90120-V},
      url          = {https://juser.fz-juelich.de/record/860310},
}