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
Descripción
Sumario: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.

Ejemplares similares