Adaptive Step Size for Hybrid Monte Carlo Algorithm
Philippe de Forcrand, Tetsuya Takaishi
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.
Create a lesson
Related papers
Efficient Quantum Simulations of Yang-Mills theory with Maximal-tree Gauge
Tianyin Li, Ying-Ying Li, Xiaoyang Wang et al.
Physics-informed quantum algorithms for glueball-like excitations in a Z2 lattice gauge theory
Dan-Bo Zhang
Anomalous behavior of Wilson fermions in the presence of monopoles
Manuel Cortina, Rajamani Narayanan, Ray Romero
Direct lattice QCD calculation of the θ-induced CP-violating pion-nucleon coupling
Chuan-Yang Li, Jun Hua, Jian Liang et al.
Calculation of neutron electric dipole moment from Lattice QCD
Thomas Blum, Fangcheng He, Taku Izubuchi et al.
Exponential-in-Nc2 cost reduction of product-formula-based quantum simulations of quantum chromodynamics
Zohreh Davoudi, Jesse R. Stryker