Progress in Lattice Field Theory Algorithms

TL;DR

This paper reviews recent advances in algorithms for lattice field theories, including the Multicanonical method and the relationship between Hybrid algorithms, while clarifying the role of the dynamical critical exponent in computational efficiency.

Contribution

It introduces and explains new algorithmic approaches and clarifies theoretical aspects of computational cost in lattice field theory simulations.

Findings

Introduction of the Multicanonical algorithm

Analysis of Hybrid Overrelaxation and Hybrid Monte Carlo relations

Clarification of the dynamical critical exponent z's role in computational cost

Abstract

I present a summary of recent algorithmic developments for lattice field theories. In particular I give a pedagogical introduction to the new Multicanonical algorithm, and discuss the relation between the Hybrid Overrelaxation and Hybrid Monte Carlo algorithms. I also attempt to clarify the role of the dynamical critical exponent z and its connection with `computational cost.' [Includes four PostScript figures]