arXiv · 1102.1852
Testing trivializing maps in the Hybrid Monte Carlo algorithm
Abstract
We test a recent proposal to use approximate trivializing maps in a field theory to speed up Hybrid Monte Carlo simulations. Simulating the CP^{N-1} model, we find a small improvement with the leading order transformation, which is however compensated by the additional computational overhead. The scaling of the algorithm towards the continuum is not changed. In particular, the effect of the topological modes on the autocorrelation times is studied.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Georg P. Engel, Stefan Schaefer. 2011-02-09. Testing trivializing maps in the Hybrid Monte Carlo algorithm. https://doi.org/10.1016/j.cpc.2011.05.004
Cite the original work for its findings. Save a collection to share your selection of sources.