Related papers: Accelerating Dynamical Fermion Computations using …
I discuss the behaviour of algorithms for dynamical fermions as the sea-quark mass decreases. I focus on the Hybrid-Monte-Carlo (HMC) algorithm applied to two degenerate flavours of Wilson fermions. First, I briefly review the performance…
Close to the chiral limit, many calculations in numerical lattice QCD can potentially be accelerated using low-mode deflation techniques. In this paper it is shown that the recently introduced domain-decomposed deflation subspaces can be…
The pseudofermion action of the Hybrid Monte Carlo (HMC) algorithm for dynamical fermions is modified to directly incorporate Incomplete LU (ILU) factorisation. This reduces the stochastic noise and allows a larger molecular dynamics…
We propose a modification of the Hybrid-Monte-Carlo algorithm that allows for a larger step-size of the integration scheme at constant acceptance rate. The key ingredient is the splitting of the pseudo-fermion action into two parts. We test…
The increase with time of computer resources devoted to simulations of full QCD is spectacular. Yet the reduction of systematic errors is comparatively slow. This is due to the algorithmic complexity of the problem. I review, in elementary…
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…
A unique feature of the hybrid quantum Monte Carlo (HQMC) method is the potential to simulate negative sign free lattice fermion models with subcubic scaling in system size. Here we will revisit the algorithm for various models. We will…
We present an exact local bosonic algorithm for the simulation of dynamical fermions in lattice QCD. It is based on a non-hermitian polynomial approximation of the inverse of the quark matrix and a global Metropolis accept/reject correction…
We present a set of related Hybrid Monte Carlo methods to simulate an arbitrary number of dynamical overlap fermions. Each fermion is represented by a chiral pseudo-fermion field. The new algorithm reduces critical slowing down in the…
In this article we present our implementation of a Hybrid Monte Carlo algorithm for Lattice Gauge Theory using two degenerate flavours of Wilson-Dirac fermions on a Fermi GPU. We find that using registers instead of global memory speeds up…
The predominant method for generating Lattice QCD configurations is Hybrid Monte Carlo (HMC). In order to speed up this generation, a wide range of preconditioning techniques that modify the lattice action have been devised. This work…
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…
The advantages of using Multi-Step corrections for simulations of lattice gauge theories with dynamical fermions will be discussed. This technique is suited for algorithms based on the Multi-Boson representation of the dynamical fermions as…
We present a polynomial Hybrid Monte Carlo (PHMC) algorithm as an exact simulation algorithm with dynamical Kogut-Susskind fermions. The algorithm uses a Hermitian polynomial approximation for the fractional power of the KS fermion matrix.…
Polynomial approximations to the inverse of the fermion matrix are used to filter the dynamics of the upper energy scales in HMC simulations. The use of a multiple time-scale integration scheme allows the filtered pseudofermions to be…
We develop an implementation for a recently proposed Noisy Monte Carlo approach to the simulation of lattice QCD with dynamical fermions by incorporating the full fermion determinant directly. Our algorithm uses a quenched gauge field…
Lattice QCD calculations including the effects of one or more non-degenerate sea quark flavors are conventionally performed using the Rational Hybrid Monte Carlo (RHMC) algorithm, which computes the square root of the determinant of…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
We compare the performances of the exact one-flavor algorithm (EOFA) and the rational hybrid Monte Carlo algorithm (RHMC), for dynamical simulations of lattice QCD with domain-wall fermion.
The R algorithm is widely used for simulating two flavours of dynamical staggered fermions. We give a simple proof that the algorithm converges to the desired probability distribution to within O(dt^2) errors, but show that the relevant…