Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:hep-lat/9708024 · Nuclear Physics B

The Local Hybrid Monte Carlo algorithm for free field theory: Reexamining overrelaxation

Ivan Horváth A, Anthony D. Kennedy

Published Jan 1, 1998• 15 citations
arXivHTMLPDF
DOI
10.1016/s0550-3213(98)81018-3

Related papers

Dynamical critical properties of the Hybrid Monte Carlo algorithm

Sourendu Gupta A

Nuclear Physics B•Feb 1, 1992•13 citations

Hybrid Monte Carlo algorithm for the double exchange model

J.L. Alonso, L.A. Fernández, F. Guinea +2 more

arXiv:cond-mat/0007450•Nuclear Physics B•Mar 1, 2001•114 citations

Critical dynamics of the hybrid Monte Carlo algorithm

B. Mehlig, António Luis Ferreira, Dieter W. Heermann

Physics Letters B•Sep 1, 1992•7 citations

Possible barrier at z≈1 for local algorithms

Georgios Bathas, Herbert Neuberger B

It is shown that a certain class of generalizations of overrelaxation algorithms is incapable of further reducing the dynamical exponent $z$ below its standard overrelaxed value of $z\ensuremath{\approx}1$. The mean-field value is unity and is obtained in a theory that is free in the static limit, while the effect of interactions and dimensionality could be estimated with dynamical renormalization-group methods. The generalizations are obtained by viewing overrelaxation as a slightly deformed deterministic algorithm and should, therefore, hold for hybrid Monte Carlo algorithms as well.

Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields•May 15, 1992•4 citations

Computational quantum field theory

R. Grobe

Bulletin of the American Physical Society•May 17, 2006•0 citations

Monte Carlo Algorithms for the Fully Frustrated XY Model

S. Große Pawig, K. Pinn

We investigate local update algorithms for the fully frustrated XY model on a square lattice. In addition to the standard updating procedures like the Metropolis or heat bath algorithm we include overrelaxation sweeps, implemented through single spin updates that preserve the energy of the configuration. The dynamical critical exponent (of order two) stays more or less unchanged. However, the integrated autocorrelation times of the algorithm can be significantly reduced.

arXiv:cond-mat/9807137•International Journal of Modern Physics C•Jul 1, 1998•17 citations
It is shown that a certain class of generalizations of overrelaxation algorithms is incapable of further reducing the dynamical exponent zzz below its standard overrelaxed value of $z\ensuremath{\approx}1$. The mean-field value is unity and is obtained in a theory that is free in the static limit, while the effect of interactions and dimensionality could be estimated with dynamical renormalization-group methods. The generalizations are obtained by viewing overrelaxation as a slightly deformed deterministic algorithm and should, therefore, hold for hybrid Monte Carlo algorithms as well.