September 4, 2002
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. The systematic error from the polynomial approximation is removed by the Kennedy-Kuti noisy Metropolis test so that the algorithm becomes exact at a finite molecular dynamics step size. We performed numerical tests with $N_f$$=$2 case on several lattice sizes. We found that the PHMC algorithm works on a moderately large lattice of $16^4$ at $\beta$$=$5.7, $m$$=$0.02 ($m_{\mathrm{PS}}/m_{\mathrm{V}}$$\sim$0.69) with a reasonable computational time.
Similar papers 1
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...
August 12, 1998
We give a detailed description of the so-called Polynomial Hybrid Monte Carlo (PHMC) algorithm. The effects of the correction factor, which is introduced to render the algorithm exact, are discussed, stressing their relevance for the statistical fluctuations and (almost) zero mode contributions to physical observables. We also investigate rounding-error effects and propose several ways to reduce memory requirements.
September 14, 1998
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 algorithm with no molecular dynamics integration step-size errors.
February 14, 1997
We present a simulation algorithm for dynamical fermions that combines the multiboson technique with the Hybrid Monte Carlo algorithm. We find that the algorithm gives a substantial gain over the standard methods in practical simulations. We point out the ability of the algorithm to treat fermion zeromodes in a clean and controllable manner.
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...
September 12, 1997
We discuss a simulation algorithm for dynamical fermions, which combines the multiboson technique with the Hybrid Monte Carlo algorithm. The algorithm turns out to give a substantial gain over standard methods in practical simulations and to be suitable for dealing with fermion zero modes in a clean and controllable way.
January 3, 1998
We compare the performance of the Kramers Equation Monte Carlo (KMC) Algorithm with that of the Hybrid Monte Carlo (HMC) algorithm for numerical simulations with dynamical Kogut-Susskind fermions. Using the lattice Gross-Neveu model in 2 space-time dimensions, we calculate the integrated autocorrelation time of different observables at a number of couplings in the scaling region on 16^2 and 32^2 lattices while varying the parameters of the algorithms for optimal performance. ...
August 26, 1998
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 PHMC algorithm generates configurations carrying small isolated eigenvalues of the lattice Dirac operator and hence leads to a sampling of configuration space that is different from that of the HMC algorithm.
October 15, 1996
We introduce a dynamical fermion algorithm which is based on the hybrid Monte Carlo (HMC) algorithm, but without pseudofermions. The molecular dynamics steps in HMC are retained except the derivatives with respect to the gauge fields are calculated with the $Z_2$ noise. The determinant ratios are estimated with the Pa\`{d}e - $Z_2$ method. Finally, we use the Kennedy-Kuti linear accept/reject method for the Monte Carlo step which is shown to respect detailed balance. We comme...
October 9, 2007
We present two improvements to our previous dynamical overlap HMC algorithm. We introduce a new method of differentiating the eigenvectors of the Kernel operator, which removes an instability in the fermionic force. Secondly, by simulating part of the fermion determinant exactly, without pseudo-fermions, we are able to increase the rate of topological tunnelling by a factor of more than ten, reducing the auto-correlation.