Related papers: A Parallel SSOR Preconditioner for Lattice QCD
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…
We report on a parallelized implementation of SSOR preconditioning for O(a) improved lattice QCD with Schr\"odinger functional boundary conditions. Numerical simulations in the quenched approximation at parameters in the light quark mass…
Efficient algorithms for the solution of partial differential equations on parallel computers are often based on domain decomposition methods. Schwarz preconditioners combined with standard Krylov space solvers are widely used in this…
We apply a recent proposal to speed up the Hybrid-Monte-Carlo simulation of systems with dynamical fermions to two flavour QCD with clover-improvement. The basic idea of our proposal is to split the fermion matrix into two factors with a…
We discuss the implementation of a Sheikholeslami-Wohlert term for simulations of lattice QCD with dynamical Wilson fermions as required by Symanzik's improvement program. We show that for the Hybrid Monte Carlo or Kramers equation…
SSOR preconditioning of fermion matrix inversions which is parallelized using a locally-lexicographic lattice sub-division, has been shown to be very efficient for standard Wilson fermions. We demonstrate here the power of this method for…
The combination of a non-overlapping Schwarz preconditioner and the Hybrid Monte Carlo (HMC) algorithm is shown to yield an efficient simulation algorithm for two-flavour lattice QCD with Wilson quarks. Extensive tests are performed, on…
The numerical and computational aspects of chiral fermions in lattice quantum chromodynamics are extremely demanding. In the overlap framework, the computation of the fermion propagator leads to a nested iteration where the matrix vector…
We study the algorithmic optimization and performance tuning of the Lattice QCD clover-fermion solver for the K computer. We implement the L\"uscher's SAP preconditioner with sub-blocking in which the lattice block in a node is further…
In Lattice QCD computations a substantial amount of work is spent in solving the Dirac equation. In the recent past it has been observed that conventional Krylov solvers tend to critically slow down for large lattices and small quark…
We construct a locally-lexicographic SSOR preconditioner to accelerate the parallel iterative solution of linear systems of equations for two improved discretizations of lattice fermions: the Sheikholeslami-Wohlert scheme where a…
We give some new performance results for the Hybrid Monte Carlo (HMC) simulation of dynamical clover-improved Wilson fermions using an improved pseudo-fermion action. The generalisation of even-odd preconditioning for the standard Wilson…
Different recently developed Krylov space methods for solving linear systems are studied and compared for the solution of the Dirac equation on the lattice. Stabilized Biconjugate Gradient (BiCGstab2) is shown to be a robust and efficient…
The Hybrid Monte Carlo algorithm for the simulation of QCD with dynamical staggered fermions is compared with Kramers equation algorithm. We find substantially different autocorrelation times for local and nonlocal observables. The…
A modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD is presented. A larger basis of test vectors than that used in conventional multigrid is calculated by the smoother and truncated by…
We review the numerical analysis' understanding of Krylov subspace methods for solving (non-hermitian) systems of equations and discuss its implications for lattice gauge theory computations using the example of the Wilson fermion matrix.…
We present a comparison of a number of iterative solvers of linear systems of equations for obtaining the fermion propagator in lattice QCD. In particular, we consider chirally invariant overlap and chirally improved Wilson (maximally)…
We present an adaptive multigrid Dirac solver developed for Wilson clover fermions which offers order-of-magnitude reductions in solution time compared to conventional Krylov solvers. The solver incorporates even-odd preconditioning and…
We present details of our investigation of the Parallel Tempering algorithm. We consider the application of action matching technology to the selection of parameters. We then present a simple model of the autocorrelations for a particular…
In lattice QCD computations a substantial amount of work is spent in solving discretized versions of the Dirac equation. Conventional Krylov solvers show critical slowing down for large system sizes and physically interesting parameter…