Testing trivializing maps in the Hybrid Monte Carlo algorithm

Georg P Engel; Stefan Schaefer

doi:10.1016/j.cpc.2011.05.004

Testing trivializing maps in the Hybrid Monte Carlo algorithm

Comput Phys Commun. 2011 Oct;182(10):2107-2114. doi: 10.1016/j.cpc.2011.05.004.

Authors

Georg P Engel¹, Stefan Schaefer

Affiliation

¹ Institut für Physik, FB Theoretische Physik, Universität Graz, A-8010 Graz, Austria.

Abstract

We test a recent proposal to use approximate trivializing maps in a field theory to speed up Hybrid Monte Carlo simulations. Simulating the CPN-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.