1997/08/27 by Ivan Horváth, Ivan Horvath, A.D. Kennedy +1 · 14 citations
Mathematics · Physics and Astronomy · #Algorithm #Computer science #Field (mathematics) #Mathematical Approximation and Integration #Mathematical optimization #Mathematics #Monte Carlo method #Physics #Scientific Research and Discoveries #Statistical physics #Statistics #Theoretical and Computational Physics #hep-lat
paper · pdf · doi:10.1016/s0550-3213(98)81018-3
published in Nuclear Physics B 510(1-2), 367-400 (Elsevier BV) · LaTeX, 33 pages, 3 postscript figures
arxiv created 1997/08/27 · openalex publication_date 1998/01/01 · arxiv updated 2015/06/25 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
We analyze the autocorrelations for the LHMC algorithm in the context of free field theory. In this case this is just Adler's overrelaxation algorithm. We consider the algorithm with even/odd, lexicographic, and random updates, and show that its efficiency depends crucially on this ordering of sites when optimized for a given class of operators. In particular, we show that, contrary to previous expectations, it is possible to eliminate critical slowing down (z[int]=0) for a class of interesting observables, including the magnetic susceptibility: this can be done with lexicographic updates but is not possible with even/odd (z[int]=1) or random (z[int]=2) updates. We are considering the dynamical critical exponent z[int] for integrated autocorrelations rather than for the exponential autocorrelation time; this is reasonable because it is the integrated autocorrelation which determines the cost of a Monte Carlo computation.