% 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{FROMMER:860337,
author = {FROMMER, ANDREAS and NÖCKEL, BERTOLD and GÜSKEN, STEPHAN
and LIPPERT, THOMAS and SCHILLING, KLAUS},
title = {{MANY} {MASSES} {ON} {ONE} {STROKE}: {ECONOMIC}
{COMPUTATION} {OF} {QUARK} {PROPAGATORS}},
journal = {International journal of modern physics / C Computational
physics and physical computation C},
volume = {06},
number = {05},
issn = {1793-6586},
address = {Singapore [u.a.]},
publisher = {World Scientific},
reportid = {FZJ-2019-01112},
pages = {627 - 638},
year = {1995},
abstract = {The computational effort in the calculation of Wilson
fermion quark propagators in Lattice Quantum Chromodynamics
can be considerably reduced by exploiting the Wilson fermion
matrix structure in inversion algorithms based on the
non-symmetric Lanczos process. We consider two such methods:
QMR (quasi minimal residual) and BCG (biconjugate
gradients).Based on the decomposition M/κ = 1/κ−D of the
Wilson mass matrix, using QMR, one can carry out inversions
on a whole trajectory of masses simultaneously, merely at
the computational expense of a single propagator
computation. In other words, one has to compute the
propagator corresponding to the lightest mass only, while
all the heavier masses are given for free, at the price of
extra storage.Moreover, the symmetry γ5M = M†γ5 can be
used to cut the computational effort in QMR and BCG by a
factor of two. We show that both methods then become — in
the critical regime of small quark masses — competitive to
BiCGStab and significantly better than the standard MR
method, with optimal relaxation factor, and CG as applied to
the normal equations.},
ddc = {530},
typ = {PUB:(DE-HGF)16},
doi = {10.1142/S0129183195000538},
url = {https://juser.fz-juelich.de/record/860337},
}