scholarly journals Measure of autocorrelation times of local hybrid Monte Carlo algorithm for lattice QCD

1993 ◽  
Vol 315 (1-2) ◽  
pp. 152-156 ◽  
Author(s):  
Paolo Marenzoni ◽  
Luigi Pugnetti ◽  
Pietro Rossi
2000 ◽  
Vol 62 (11) ◽  
Author(s):  
Bálint Joó ◽  
Brian Pendleton ◽  
Anthony D. Kennedy ◽  
Alan C. Irving ◽  
James C. Sexton ◽  
...  

2002 ◽  
Vol 65 (9) ◽  
Author(s):  
S. Aoki ◽  
R. Burkhalter ◽  
M. Fukugita ◽  
S. Hashimoto ◽  
K-I. Ishikawa ◽  
...  

2002 ◽  
Vol 13 (03) ◽  
pp. 343-365 ◽  
Author(s):  
TETSUYA TAKAISHI ◽  
PHILIPPE de FORCRAND

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 nf = 1, 1 + 1 and 2 + 1 flavors and compare results with other algorithms.


2002 ◽  
Vol 528 (3-4) ◽  
pp. 301-305 ◽  
Author(s):  
Simon Catterall ◽  
Sergey Karamov

1988 ◽  
Vol 03 (14) ◽  
pp. 1367-1378 ◽  
Author(s):  
RAJAN GUPTA ◽  
GREGORY W. KILCUP ◽  
APOORVA PATEL ◽  
STEPHEN R. SHARPE ◽  
PHILIPPE DE FORCRAND

We show that the overrelaxed algorithm of Creutz and of Brown and Woch is the optimal local update algorithm for simulation of pure gauge SU(3). Our comparison criterion includes computer efficiency and decorrelation times. We also investigate the rate of decorrelation for the Hybrid Monte Carlo algorithm.


Sign in / Sign up

Export Citation Format

Share Document