Testing trivializing maps in the Hybrid Monte Carlo algorithm

DOI10.1016/j.cpc.2011.05.004zbMath1290.65001arXiv1102.1852OpenAlexW2129429302WikidataQ38257151 ScholiaQ38257151MaRDI QIDQ2275557

Georg P. Engel, Stefan Schaefer

Publication date: 9 August 2011

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

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

zbMATH Keywords

topological chargecritical slowing downHybrid Monte Carlo\(CP^{N-1}\)trivializing map

Mathematics Subject Classification ID

Monte Carlo methods (65C05)

Related Items (1)

Metadynamics surfing on topology barriers: the \(\mathbb C\mathbb P^{N-1}\) case

Cites Work

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

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