General Algorithm For Improved Lattice Actions on Parallel Computing Architectures

Preprint
Publisher Website
Google Scholar
  • 17 January 2000
Abstract
Quantum field theories underlie all of our understanding of the fundamental forces of nature. The only known first principles approach to the study of quantum field theories [such as quantum chromodynamics (QCD) relevant to the strong interaction] away from the perturbative (i.e., weak-coupling) regime is the use of Monte Carlo methods on a hypercubic space-time lattice. These methods consume enormous computing power for large lattices and it is essential that increasingly efficient algorithms be developed to perform standard tasks in these lattice calculations. Here we present a general algorithm for QCD that allows one to put any planar improved gluonic lattice action onto a parallel computing architecture. This algorithm has been succesfully employed by us in a variety of lattice QCD calculations using improved lattice actions on a 128 node Thinking Machines CM-5.

This publication has 0 references indexed in Scilit: