A Parallel SSOR Preconditioner for Lattice QCD
S. Fischer, A. Frommer, U. Glaessner, Th. Lippert, G. Ritzenhoefer, K. Schilling
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 with Wilson fermions 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 243 x 40 lattice.
Create a lesson
Related papers
Evidence of Taste-Symmetry restoration for Kähler-Dirac fermions on Euclidean Dynamical Triangulations
Mingwei Dai, Walter Freeman, Mason Grieb et al.
Hamiltonian framework for Chiral Gauge Theories on a Disk Boundary
Srimoyee Sen
Finite-size scaling analysis of three dimensional Z(2) and O(2) spin models with non-vanishing symmetry breaking parameter
Jishnu Goswami, Frithjof Karsch, Sabarnya Mitra
Bjorken sum rule down to the elastic region from the lattice
J. A. Crawford, A. Hannaford-Gunn, R. Horsley et al.
Performance Portable SU(N) Lattice Gauge Theory Simulation with Kokkos
Wei Sun
Sampling SU(N) gauge theory on a 2D lattice from independent plaquettes via holonomies and corner reweighting
Javad Komijani