October 15, 2001
We present an exact dynamical QCD simulation algorithm for the $O(a)$-improved Wilson fermion with odd number of flavors. Our algorithm is an extension of the non-Hermitian polynomials HMC algorithm proposed by Takaishi and de Forcrand previously. In our algorithm, the systematic errors caused by the polynomial approximation of the inverse of Dirac operator is removed by a noisy-Metropolis test. For one flavor quark it is achieved by taking the square root of the correction matrix explicitly. We test our algorithm for the case of $N_f=1+1$ on a moderately large lattice size ($16^3\times48$). The $N_f=2+1$ case is also investigated.
Similar papers 1
December 26, 2001
We present a polynomial hybrid Monte Carlo (PHMC) algorithm for lattice QCD with odd numbers of flavors of O(a)-improved Wilson quark action. The algorithm makes use of the non-Hermitian Chebyshev polynomial to approximate the inverse square root of the fermion matrix required for an odd number of flavors. The systematic error from the polynomial approximation is removed by a noisy Metropolis test for which a new method is developed. Investigating the property of our PHMC alg...
August 11, 2001
We discuss hybrid Monte Carlo algorithms for odd-flavor lattice QCD simulations. The algorithms include a polynomial approximation which enables us to simulate odd-flavor QCD in the framework of the hybrid Monte Carlo algorithm. In order to make the algorithms exact, the correction factor to the polynomial approximation is also included in an economical, stochastic way. We test the algorithms for $n_f=1$, 1+1 and 2+1 flavors and compare results with other algorithms.
August 27, 2002
We propose an exact simulation algorithm for lattice QCD with dynamical Kogut-Susskind fermion in which the N_f-flavor fermion operator is defined as the N_f/4-th root of the Kogut-Susskind (KS) fermion operator. The algorithm is an extension of the Polynomial Hybrid Monte Carlo (PHMC) algorithm to KS fermions. The fractional power of the KS fermion operator is approximated with a Hermitian Chebyshev polynomial, with which we can construct an algorithm for any number of flavo...
March 20, 2002
I report on cost estimates and algorithmic performance in simulations using 2 flavours of non-perturbatively O(a) improved Wilson quarks together with the Wilson plaquette action.
September 27, 2005
We present a detailed design of a (P)HMC simulation algorithm for N_f = 2 + 1 + 1 maximally twisted Wilson quark flavours. The algorithm retains even/odd and mass-shift preconditionings combined with multiple Molecular Dynamics time scales for both the light mass degenerate, u and d, quarks and the heavy mass non-degenerate, s and c, quarks. Various non-standard aspects of the algorithm are discussed, among which those connected to the use of a polynomial approximation for th...
October 10, 2006
We report on a study of 2+1 flavor lattice QCD with the $O(a)$-improved Wilson quarks on a $16^3\times 32$ lattice at the lattice spacing $1/a\approx 2$GeV employing Luescher's domain-decomposed HMC(LDDHMC) algorithm. This is dedicated to a preliminary study for the PACS-CS project which plans to complete the Wilson-clover $N_f=2+1$ program lowering the up-down quark masses close to the physical values as much as possible. We focus on three issues: (i) how light quark masses ...
March 23, 1998
We consider O(a) improvement for two flavor lattice QCD. The improvement term in the action is computed non-perturbatively for a large range of the bare coupling. The position of the critical line and higher order lattice artifacts remaining after improvement are estimated. We also discuss the behavior of the HMC algorithm in our simulations.
November 11, 2019
In master-field simulations of lattice QCD, the expectation values of interest are obtained from a single or at most a few representative gauge-field configurations on very large lattices. If the light quarks are included, the generation of these fields using standard techniques is however challenging in view of various algorithmic instabilities and precision issues. Ways to overcome these problems are described here for the case of the O(a)-improved Wilson formulation of lat...
March 18, 1996
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 of the systematic errors. We show that this algorithm is a real alternative to the Hybrid Monte Carlo algorithm.
September 25, 2006
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 well as for the Hybrid Monte-Carlo (HMC) algorithm and variants of the latter, like the Polynomial-HMC. Especially the latter has the power to deal with an odd number of fermion fields--an essential feature necessary for realistic QCD-simu...