Cargando…
Testing trivializing maps in the Hybrid Monte Carlo algorithm
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...
Autores principales: | Engel, Georg P., Schaefer, Stefan |
---|---|
Lenguaje: | eng |
Publicado: |
2011
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1016/j.cpc.2011.05.004 http://cds.cern.ch/record/1328154 |
Ejemplares similares
-
Testing trivializing maps in the Hybrid Monte Carlo algorithm
por: Engel, Georg P., et al.
Publicado: (2011) -
Autocorrelations in Hybrid Monte Carlo Simulations
por: Schaefer, Stefan, et al.
Publicado: (2010) -
A Polynomial Hybrid Monte Carlo Algorithm
por: Frezzotti, Roberto, et al.
Publicado: (1997) -
Experiences with the Polynomial Hybrid Monte Carlo Algorithm
por: Frezzotti, Roberto, et al.
Publicado: (1997) -
Trivializing maps, the Wilson flow and the HMC algorithm
por: Lüscher, Martin
Publicado: (2009)