% 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{GLSSNER:860338,
author = {GLÄSSNER, UWE and GÜSKEN, STEPHAN and LIPPERT, THOMAS and
RITZENHÖFER, GERO and SCHILLING, KLAUS and FROMMER,
ANDREAS},
title = {{HOW} {TO} {COMPUTE} {GREEN}'{S} {FUNCTIONS} {FOR} {ENTIRE}
{MASS} {TRAJECTORIES} {WITHIN} {KRYLOV} {SOLVERS}},
journal = {International journal of modern physics / C Computational
physics and physical computation C},
volume = {07},
number = {05},
issn = {1793-6586},
address = {Singapore [u.a.]},
publisher = {World Scientific},
reportid = {FZJ-2019-01113},
pages = {635 - 644},
year = {1996},
abstract = {The availability of efficient Krylov subspace solvers plays
a vital role in the solution of a variety of numerical
problems in computational science. Here we consider lattice
field theory. We present a new general numerical method to
compute many Green's functions for complex non-singular
matrices within one iteration process. Our procedure applies
to matrices of structure A = D − m, with m proportional to
the unit matrix, and can be integrated within any Krylov
subspace solver. We can compute the derivatives x(n) of the
solution vector x with respect to the parameter m and
construct the Taylor expansion of x around m. We demonstrate
the advantages of our method using a minimal residual
solver. Here the procedure requires one intermediate vector
for each Green's function to compute. As real-life example,
we determine a mass trajectory of the Wilson fermion matrix
for lattice QCD. Here we find that we can obtain Green's
functions at all masses ≥ m at the price of one inversion
at mass m.},
ddc = {530},
typ = {PUB:(DE-HGF)16},
doi = {10.1142/S0129183196000533},
url = {https://juser.fz-juelich.de/record/860338},
}