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: | , |
|---|---|
| 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 |