Testing trivializing maps in the Hybrid Monte Carlo algorithm

DOI10.1016/J.CPC.2011.05.004MaRDI QIDQ2275557zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Georg P. Engel, Stefan Schaefer

Publication date 9 August 2011

Published in Computer Physics Communications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1102.1852

zbMATH Keywords

\(CP^{N-1}\)critical slowing downHybrid Monte Carlotopological chargetrivializing map

Mathematics Subject Classification ID

Monte Carlo methods (65C05)

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.

Recommendations

• Trivializing maps, the Wilson flow and the HMC algorithm
• Accelerating the hybrid Monte Carlo algorithm
• Testing a Fourier-accelerated hybrid Monte Carlo algorithm
• Speeding up the hybrid Monte Carlo algorithm for dynamical fermions
• The hybrid Monte Carlo algorithm on parallel computers

Cites work

• dependence of SU(N) gauge theories
• Critical slowing down and error analysis in lattice QCD simulations
• Monte Carlo errors with less errors
• Trivializing maps, the Wilson flow and the HMC algorithm

Cited in

(5)

• Metadynamics surfing on topology barriers: the \(\mathbb C\mathbb P^{N-1}\) case
• scientific article; zbMATH DE number 5005874 (Why is no real title available?)
• Testing of mixing models for Monte Carlo probability density function simulations
• Hybrid Monte Carlo simulation with Fourier acceleration of the \(N = 2\) principal chiral model in two dimensions
• Trivializing maps, the Wilson flow and the HMC algorithm

This page was built for publication: Testing trivializing maps in the Hybrid Monte Carlo algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275557)