# A Parallel SSOR Preconditioner for Lattice QCD

## TL;DR

This paper introduces a parallel SSOR preconditioner for lattice QCD that significantly reduces iteration counts and CPU time compared to traditional methods, enhancing computational efficiency.

## Contribution

The paper presents a novel parallel SSOR preconditioning scheme tailored for lattice QCD, improving convergence and computational speed over existing odd-even preconditioning methods.

## Key findings

- Reduces iteration count by a factor of 2
- Achieves 30-70% CPU time savings
- Effective in Hybrid Monte Carlo and quark propagator calculations

## 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.