% 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{Fischer:860302,
author = {Fischer, S. and Frommer, A. and Glässner, U. and Lippert,
Th. and Ritzenhöfer, G. and Schilling, K.},
title = {{A} parallel {SSOR} preconditioner for lattice {QCD}},
journal = {Computer physics communications},
volume = {98},
number = {1-2},
issn = {0010-4655},
address = {Amsterdam},
publisher = {North Holland Publ. Co.},
reportid = {FZJ-2019-01077},
pages = {20 - 34},
year = {1996},
abstract = {We present a parallelizable SSOR preconditioning scheme for
Krylov subspace iterative solvers which proves to be
efficient in lattice QCD applications involving Wilson
fermions. Our preconditioner is based on a locally
lexicographic ordering of the lattice points. In actual
Hybrid Monte Carlo applications with the bi-conjugate
gradient stabilized method BiCGstab, we achieve a gain
factor of about 2 in the number of iterations compared to
conventional odd-even preconditioning. Whether this
translates into similar reductions in run time will depend
on the parallel computer in use. We discuss implementation
issues using the ‘Eisenstat-trick’ and machine specific
advantages of the method for the APE100/Quadrics parallel
computer. In a full QCD simulation on a 512-processor
Quadrics QH4 we find a gain in cpu-time of a factor of 1.7
over odd-even preconditioning for a $24^3$ × 40 lattice.},
ddc = {530},
typ = {PUB:(DE-HGF)16},
doi = {10.1016/0010-4655(96)00089-6},
url = {https://juser.fz-juelich.de/record/860302},
}