Adaptive Step Size for Hybrid Monte Carlo Algorithm
arXiv:hep-lat/9606020 · doi:10.1103/PhysRevE.55.3658
Abstract
We implement an adaptive step size method for the Hybrid Monte Carlo a lgorithm. The adaptive step size is given by solving a symmetric error equation. An integr ator with such an adaptive step size is reversible. Although we observe appreciable variations of the step size, the overhead of the method exceeds its benefits. We propose an explanation for this phenomenon.
13 pages, 5 Postscript figures, latex
References in corpus (9)
- A New Approach to the Problem of Dynamical Quarks in Numerical Simulations of Lattice QCD
- Systematic errors of Lüscher's fermion method and its extensions
- Non-hermitian Exact Local Bosonic Algorithm for Dynamical Quarks
- Full QCD with the Lüscher local bosonic action
- A new simulation algorithm for lattice QCD with dynamical quarks
- Progress on lattice QCD algorithms
- Improvements of Lüscher's local bosonic fermion algorithm
- Study of a new simulation algorithm for dynamical quarks on the APE-100 parallel computer
- Performance Tests of the Kramers Equation and Boson Algorithms for Simulations of QCD