Testing Algorithms for Finite Temperature Lattice QCD

Abstract

We discuss recent algorithmic improvements in simulating finite temperature QCD on a lattice. In particular, the Rational Hybrid Monte Carlo(RHMC) algorithm is employed to generate lattice configurations for 2+1 flavor QCD. Unlike the Hybrid R Algorithm, RHMC is reversible, admitting a Metropolis accept/reject step that eliminates the $\mathcal{O}(\delta t^2)$ errors inherent in the R Algorithm. We also employ several algorithmic speed-ups, including multiple time scales, the use of a more efficient numerical integrator, and Hasenbusch pre-conditioning of the fermion force.

Comments: 4 pages, 2 figures, poster presented at International Conference on Strong and Electroweak Matter 2006 (SEWM2006), BNL, May 10-13, 2006