%0 Journal Article
%A Fischer, S.
%A Frommer, A.
%A Glässner, U.
%A Lippert, Th.
%A Ritzenhöfer, G.
%A Schilling, K.
%T A parallel SSOR preconditioner for lattice QCD
%J Computer physics communications
%V 98
%N 1-2
%@ 0010-4655
%C Amsterdam
%I North Holland Publ. Co.
%M FZJ-2019-01077
%P 20 - 34
%D 1996
%X 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.
%F PUB:(DE-HGF)16
%9 Journal Article
%R 10.1016/0010-4655(96)00089-6
%U https://juser.fz-juelich.de/record/860302