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 [Formula: see text] model, we find a small improvement with the leading order transformation, which is however compensated by the additional computational overh...
Autores principales: | Engel, Georg P., Schaefer, Stefan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
North-Holland Pub. Co
2011
|
Materias: | |
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 |
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) -
Acceptances and autocorrelations in the hybrid Monte Carlo algorithm
por: Gupta, S
Publicado: (1992) -
Dynamical properties of the hybrid Monte Carlo algorithm
por: Gupta, S
Publicado: (1992) -
A Polynomial Hybrid Monte Carlo Algorithm
por: Frezzotti, Roberto, et al.
Publicado: (1997)