CERN-PH-TH/2011-023 Testing trivializing maps in the Hybrid Monte

We test a recent proposal to use approximate trivializing maps in a field theory to speed up Hybrid Monte Carlo simulations. Simulating the CPN−1model, we find a small improvement with the leading order transformation, which is however compensated by the additional compu-tational 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.