相关论文: Algorithm Shootout: R versus RHMC

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…

Improved staggered fermion formulations are a popular choice for lattice QCD calculations. Historically, the algorithm used for such calculations has been the inexact R algorithm, which has systematic errors that only vanish as the square…

The past few years have seen considerable progress in algorithmic development for the generation of gauge fields including the effects of dynamical fermions. The Rational Hybrid Monte Carlo (RHMC) algorithm, where Hybrid Monte Carlo is…

We describe an implementation of the Rational Hybrid Monte Carlo (RHMC) algorithm for dynamical computations with two flavours of staggered quarks. We discuss several variants of the method, the performance and possible sources of error for…

We carry out a comparative study among five-dimensional formulations of chirally symmetric fermions about the algorithmic performance, chiral symmetry violation and topological tunneling to find a computationally inexpensive formulation…

The feasibility of using lattice chiral fermions which are free of $O(a)$ errors for both the heavy and light quarks is examined. The fact that the effective quark propagators in these fermions have the same form as that in the continuum…

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…

We present our implementation of the RHMC algorithm for staggered fermions on Graphics Processing Units using the NVIDIA CUDA programming language. While previous studies exclusively deal with the Dirac matrix inversion problem, our code…

We describe an HMC algorithm for dynamical overlap fermions which makes use of their good chiral properties. We test the algorithm in the Schwinger model. Topological sectors are readily changed even in the massless case.

Tempering is used to change the quark mass while remaining in equilibrium between the trajectories of a standard hybrid Monte Carlo simulation of four flavours of staggered fermions. The algorithm is faster for small enough quark masses,…

We compare the performance of the PHMC algorithm with the one of the HMC algorithm in practical simulations of lattice QCD. We show that the PHMC algorithm can lead to an acceleration of numerical simulations. It is demonstrated that the…

Mass preconditioned HMC and DD-HMC are among the most popular algorithms to simulate Wilson fermions. We present a comparison of the performance of the two algorithms for realistic quark masses and lattice sizes. In particular, we use the…

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 consider recent progress in algorithms for generating gauge field configurations that include the dynamical effects of light fermions. We survey what has been achieved in recent state-of-the-art computations, and examine the trade-offs…

This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…

As a feasibility study for a scaling test we investigate the behavior of algorithms for dynamical fermions in the N_f=2 Schroedinger functional at an intermediate volume of 1 fm^4. Simulations were performed using HMC with two…

We introduce a new algorithm which we call the {Rational Hybrid Monte Carlo} Algorithm (RHMC). This method uses a rational approximation to the fermionic kernel together with a noisy Kennedy-Kuti acceptance step to give an efficient…

The recent solution to the fermion sign problem allows, for the first time, the use of cluster algorithm techniques to compute certain fermionic path integrals. To illustrate the underlying ideas behind the progress, a cluster algorithm is…

In order to develop fast inversion algorithms we have used overlap solvers in two dimensions. Lattice QED theory with U(1) group symmetry in two dimensional space-times dimensions has always been a testing ground for algorithms. By the…

We investigate the algorithms for dynamical overlap fermions aiming at improving the performance for large-scale simulations. We look for the best combination of Hybrid Monte Carlo options and iterative quark solvers with respect to the…