A Parallel SSOR Preconditioner for Lattice QCD

Abstract

A parallelizable SSOR preconditioning scheme for Krylov subspace iterative solvers in lattice QCD applications involving Wilson fermions is presented. In actual Hybrid Monte Carlo and quark propagator calculations it helps to reduce the number of iterations by a factor of 2 compared to conventional odd-even preconditioning. This corresponds to a gain in cpu-time of 30\% - 70\% over odd-even preconditioning.Comment: Talk presented at LATTICE96(algorithms), 3 pages, LaTeX file, 3 epsf-files include