Higher-order hybrid Monte Carlo algorithms

Journal Article · Mon Jul 03 04:00:00 EDT 1989 · Phys. Rev. Lett.; (United States)

DOI:https://doi.org/10.1103/PhysRevLett.63.9· OSTI ID:5872959

Creutz, M; Gocksch, A

We present a simple recursive iteration of the leapfrog discretization of Newton's equations which leads to a removal of the finite-step-size error to any desired order. This is done in a manner that preserves phase-space areas and reversibility, as required for use in the hybrid Monte Carlo method for simulating fermionic fields. The resulting asymptotic volume dependence is exp((ln/ital V/)/sup 1/2/). We test the scheme on the (2+1)-dimensional Hubbard model.

• Research Organization: Physics Department, Rutgers Universtiy, Piscataway, New Jersey 08855(US); Physics Department, Brookhaven National Laboratory, Upton, New York 11973; Physics Department, Brookhaven National Laboratory, Upton, New York 11973
• DOE Contract Number: AC02-76CH00016
• OSTI ID: 5872959
• Journal Information: Phys. Rev. Lett.; (United States), Journal Name: Phys. Rev. Lett.; (United States) Vol. 63:1; ISSN PRLTA
• Country of Publication: United States
• Language: English

Related Subjects

657002* -- Theoretical & Mathematical Physics-- Classical & Quantum Mechanics
71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
ALGORITHMS
CRYSTAL MODELS
FIELD THEORIES
FUNCTIONS
HAMILTONIAN FUNCTION
ITERATIVE METHODS
LATTICE FIELD THEORY
MATHEMATICAL LOGIC
MATHEMATICAL MODELS
MATHEMATICAL SPACE
MONTE CARLO METHOD
PHASE SPACE
QUANTUM FIELD THEORY
SPACE
TWO-DIMENSIONAL CALCULATIONS