Evolutionary Algorithms Applied to Landau-Gauge Fixing
arXiv:hep-lat/9809143 · doi:10.1016/S0920-5632(99)85228-1
Abstract
Current algorithms used to put a lattice gauge configuration into Landau gauge either suffer from the problem of critical slowing-down or involve an additional computational expense to overcome it. Evolutionary Algorithms (EAs), which have been widely applied to other global optimisation problems, may be of use in gauge fixing. Also, being global, they should not suffer from critical slowing-down as do local gradient based algorithms. We apply EA's and also a Steepest Descent (SD) based method to the problem of Landau Gauge Fixing and compare their performance.
LATTICE98(algorithms), 3 pages, 6 figures
References in corpus (1)
Cited by in corpus (5)
- A Profile Likelihood Analysis of the Constrained MSSM with Genetic Algorithms
- Quark propagator in Landau and Laplacian gauges with overlap fermions
- Gluon Propagator on Coarse Lattices in Laplacian Gauges
- Evolutionary Fitting Methods for the Extraction of Mass Spectra in Lattice Field Theory
- New methods for old problems: vacua of maximal D = 7 supergravities