Higher-order hybrid Monte Carlo algorithms
- 3 July 1989
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 63 (1) , 9-12
- https://doi.org/10.1103/physrevlett.63.9
Abstract
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[(lnV]. We test the scheme on the (2+1)-dimensional Hubbard model.
Keywords
This publication has 6 references indexed in Scilit:
- Global Monte Carlo algorithms for many-fermion systemsPhysical Review D, 1988
- Tuning the hybrid Monte Carlo algorithmPhysical Review D, 1988
- Hybrid Monte CarloPhysics Letters B, 1987
- Testing an exact algorithm for simulation of fermionic QCDPhysical Review D, 1987
- Langevin simulations of lattice field theoriesPhysical Review D, 1985
- Microcanonical Simulation of Fermionic SystemsPhysical Review Letters, 1983