%0 Generic %1 deforcrand1996adaptive %A de Forcrand, Philippe %A Takaishi, Tetsuya %D 1996 %K lattice simulation %R 10.1103/PhysRevE.55.3658 %T Adaptive Step Size for Hybrid Monte Carlo Algorithm %U http://arxiv.org/abs/hep-lat/9606020 %X 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.

@misc{deforcrand1996adaptive, 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.}, added-at = {2020-05-01T16:00:03.000+0200}, author = {de Forcrand, Philippe and Takaishi, Tetsuya}, biburl = {https://www.bibsonomy.org/bibtex/2266cc640f834f479cbf56b17b1e6f0e8/cmcneile}, description = {Adaptive Step Size for Hybrid Monte Carlo Algorithm}, doi = {10.1103/PhysRevE.55.3658}, interhash = {5b4dec1139ff4684a0bdb69daa409620}, intrahash = {266cc640f834f479cbf56b17b1e6f0e8}, keywords = {lattice simulation}, note = {cite arxiv:hep-lat/9606020Comment: 13 pages, 5 Postscript figures, latex}, timestamp = {2020-05-01T16:00:03.000+0200}, title = {Adaptive Step Size for Hybrid Monte Carlo Algorithm}, url = {http://arxiv.org/abs/hep-lat/9606020}, year = 1996 }