Fetching the paper…

Reading the bibliography…

2011

Testing trivializing maps in the Hybrid Monte Carlo algorithm

Engel, Georg P., Schaefer, Stefan

Original
PDF
Post on X

Understand

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.

Testing trivializing maps in the Hybrid Monte Carlo algorithm · Around

Built on

E. Rabinovici and S. Samuel, The CP N-1
1981
Earlier work this paper cites.
S. Duane, A. D. Kennedy, B. J. Pendleton, and D. Roweth, Hybrid Monte Carlo
1987
Earlier work this paper cites.
M. Campostrini, P. Rossi, and E. Vicari, Monte Carlo simulation of CP N-1
1992
Earlier work this paper cites.

Similar

L. Del Debbio, H. Panagopoulos, and E. Vicari, θ \theta dependence of SU( N N ) gauge theories
2002
Cited alongside, same era.
L. Del Debbio, G. M. Manca, and E. Vicari, Critical slowing down of topological modes
2004
Cited alongside, same era.
S. Schaefer, R. Sommer, and F. Virotta, Critical slowing down and error analysis in lattice QCD simulations
Cited in the paper.

Then

M. Lüscher, Trivializing maps, the Wilson flow and the HMC algorithm
Original
2010
Later among the works it cites.
M. Lüscher, Topology, the Wilson flow and the HMC algorithm
Original
2010
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…