Paper detail

Cost of Generalised HMC Algorithms for Free Field Theory

We study analytically the computational cost of the Generalised Hybrid Monte Carlo (GHMC) algorithm for free field theory. We calculate the autocorrelation functions of operators quadratic in the fields, and optimise the GHMC momentum mixing angle, the trajectory length, and the integration stepsize. We show that long trajectories are optimal for GHMC, and that standard HMC is much more efficient than algorithms based on the Second Order Langevin (L2MC) or 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.

preprint2000arXivOpen access

Signal facts

What is known right now

Open access2 authors1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.