Testing trivializing maps in the Hybrid Monte Carlo algorithm

Mostrar otras versiones (1)

We test a recent proposal to use approximate trivializing maps in a field theory to speed up Hybrid Monte Carlo simulations. Simulating the [Formula: see text] model, we find a small improvement with the leading order transformation, which is however compensated by the additional computational overh...

Descripción completa

Detalles Bibliográficos
Autores principales: Engel, Georg P., Schaefer, Stefan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: North-Holland Pub. Co 2011
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3160775/
https://www.ncbi.nlm.nih.gov/pubmed/21969733
http://dx.doi.org/10.1016/j.cpc.2011.05.004
_version_ 1782210581280849920
author Engel, Georg P.
Schaefer, Stefan
author_facet Engel, Georg P.
Schaefer, Stefan
author_sort Engel, Georg P.
collection PubMed
description We test a recent proposal to use approximate trivializing maps in a field theory to speed up Hybrid Monte Carlo simulations. Simulating the [Formula: see text] 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.
format Online
Article
Text
id pubmed-3160775
institution National Center for Biotechnology Information
language English
publishDate 2011
publisher North-Holland Pub. Co
record_format MEDLINE/PubMed
spelling pubmed-31607752011-10-01 Testing trivializing maps in the Hybrid Monte Carlo algorithm Engel, Georg P. Schaefer, Stefan Comput Phys Commun Article We test a recent proposal to use approximate trivializing maps in a field theory to speed up Hybrid Monte Carlo simulations. Simulating the [Formula: see text] 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. North-Holland Pub. Co 2011-10 /pmc/articles/PMC3160775/ /pubmed/21969733 http://dx.doi.org/10.1016/j.cpc.2011.05.004 Text en © 2011 Elsevier B.V. https://creativecommons.org/licenses/by-nc-nd/3.0/ Open Access under CC BY-NC-ND 3.0 (https://creativecommons.org/licenses/by-nc-nd/3.0/) license
spellingShingle Article
Engel, Georg P.
Schaefer, Stefan
Testing trivializing maps in the Hybrid Monte Carlo algorithm
title Testing trivializing maps in the Hybrid Monte Carlo algorithm
title_full Testing trivializing maps in the Hybrid Monte Carlo algorithm
title_fullStr Testing trivializing maps in the Hybrid Monte Carlo algorithm
title_full_unstemmed Testing trivializing maps in the Hybrid Monte Carlo algorithm
title_short Testing trivializing maps in the Hybrid Monte Carlo algorithm
title_sort testing trivializing maps in the hybrid monte carlo algorithm
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3160775/
https://www.ncbi.nlm.nih.gov/pubmed/21969733
http://dx.doi.org/10.1016/j.cpc.2011.05.004
work_keys_str_mv AT engelgeorgp testingtrivializingmapsinthehybridmontecarloalgorithm
AT schaeferstefan testingtrivializingmapsinthehybridmontecarloalgorithm

Ejemplares similares