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

We analyze the autocorrelations for the Local Hybrid Monte Carlo algorithm [A.D. Kennedy, Nucl. Phys. B (Proc. Suppl.) 30 (1993) 96] in the context of free field theory. In this case this is just Adler's overrelaxation algorithm [S.L. Adler, Phys. Rev. D 23 (1981) 2901]. 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 tint for integrated autocorrelations rather than for the exponential autocorrelation time; this is reasonable because it is the integrated autocorrelation which determines the cost of. Monte Carlo computation. (C) 1998 Elsevier Science B.V.