Testing trivializing maps in the Hybrid Monte Carlo algorithm

Details Testing trivializing maps in the Hybrid Monte Carlo algorithm Testing trivializing maps in the Hybrid Monte Carlo algorithm

2011-02-09

arxiv.org/abs/1102.1852v1

Comput.Phys.Commun.182:2107-2114,2011

Physics

High Energy Physics

High Energy Physics - Lattice

18 pages, 7 figures

Scientific paper

10.1016/j.cpc.2011.05.004

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.

Affiliated with

Also associated with

No associations

Rating

Testing trivializing maps in the Hybrid Monte Carlo algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Testing trivializing maps in the Hybrid Monte Carlo algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing trivializing maps in the Hybrid Monte Carlo algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-650261