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 CP^{N-1} model, we find a small improvement with the leading order transformation, which is however compensated by the additional computational overhead. The sc...

Descripción completa

Detalles Bibliográficos
Autores principales: Engel, Georg P., Schaefer, Stefan
Lenguaje:eng
Publicado: 2011
Materias:
Particle Physics - Lattice
Acceso en línea:https://dx.doi.org/10.1016/j.cpc.2011.05.004
http://cds.cern.ch/record/1328154
_version_ 1780921694348640256
author Engel, Georg P.
Schaefer, Stefan
author_facet Engel, Georg P.
Schaefer, Stefan
author_sort Engel, Georg P.
collection CERN
description 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.
id cern-1328154
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2011
record_format invenio
spelling cern-13281542023-10-04T06:50:26Zdoi:10.1016/j.cpc.2011.05.004http://cds.cern.ch/record/1328154engEngel, Georg P.Schaefer, StefanTesting trivializing maps in the Hybrid Monte Carlo algorithmParticle Physics - LatticeWe 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.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.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.arXiv:1102.1852CERN-PH-TH-2011-023CERN-PH-TH-2011-023oai:cds.cern.ch:13281542011-02-10
spellingShingle Particle Physics - Lattice
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 Particle Physics - Lattice
url https://dx.doi.org/10.1016/j.cpc.2011.05.004
http://cds.cern.ch/record/1328154
work_keys_str_mv AT engelgeorgp testingtrivializingmapsinthehybridmontecarloalgorithm
AT schaeferstefan testingtrivializingmapsinthehybridmontecarloalgorithm

Ejemplares similares