Fermionic Monte Carlo algorithms for lattice QCD
arXiv:hep-lat/9702009
Abstract
The increase with time of computer resources devoted to simulations of full QCD is spectacular. Yet the reduction of systematic errors is comparatively slow. This is due to the algorithmic complexity of the problem. I review, in elementary terms, the origin of this complexity, and estimate it for 3 exact fermion algorithms.
10 pages, latex, uses sprocl.sty; contribution to the "Int. conf. on multi-scale phenomena and their simulation," 30/Sept-4/Oct/96, Bielefeld, Germany