Cost of the Generalised Hybrid Monte Carlo Algorithm for Free Field Theory

Details Cost of the Generalised Hybrid Monte Carlo Algorithm for Free Field Theory Cost of the Generalised Hybrid Monte Carlo Algorithm for Free Field Theory

2000-08-21

arxiv.org/abs/hep-lat/0008020v1

Nucl.Phys. B607 (2001) 456-510

Physics

High Energy Physics

High Energy Physics - Lattice

54 pages, 3 figures

Scientific paper

10.1016/S0550-3213(01)00129-8

We study analytically the computational cost of the Generalised Hybrid Monte Carlo (GHMC) algorithm for free field theory. We calculate the Metropolis acceptance probability for leapfrog and higher-order discretisations of the Molecular Dynamics (MD) equations of motion. We show how to calculate autocorrelation functions of arbitrary polynomial operators, and use these to optimise the GHMC momentum mixing angle, the trajectory length, and the integration stepsize for the special cases of linear and quadratic operators. We show that long trajectories are optimal for GHMC, and that standard HMC is more efficient than algorithms based on Second Order Langevin Monte Carlo (L2MC), sometimes known as Kramers Equation. We show that contrary to naive expectations HMC and L2MC have the same volume dependence, but their dynamical critical exponents are z = 1 and z = 3/2 respectively.

Affiliated with

Also associated with

No associations

Rating

Cost of the Generalised Hybrid Monte Carlo Algorithm for Free Field Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cost of the Generalised Hybrid Monte Carlo Algorithm for Free Field Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cost of the Generalised Hybrid Monte Carlo Algorithm for Free Field Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314176