Published 1998 | Version v1
Report Open

Evolutionary algorithms applied to Landau-gauge fixing

Creators

  • 1. University of Melbourne, Parkville, VIC (Australia). School of Physics
  • 2. Commonwealth Scientific and Industrial Research Organisation (CSIRO), MST, Clayton South, VIC (Australia)

Description

Current algorithms used to put a lattice gauge configuration into Landau gauge either suffer from the problem of critical slowing-down or involve an additions 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. (authors)

Availability note (English)

Available from INIS in electronic form

Files

31005506.pdf

Files (90.5 kB)

Name Size Download all
md5:01bf75a24e8294c664d71f23d5cea68c
90.5 kB Preview Download

Additional details

Publishing Information

Imprint Pagination
3 p.
Report number
UM-P--98/47

INIS

Country of Publication
Australia
Country of Input or Organization
Australia
INIS RN
31005506
Subject category
S72: PHYSICS OF ELEMENTARY PARTICLES AND FIELDS;
Resource subtype / Literary indicator
Numerical Data
Descriptors DEI
ALGORITHMS; GAUGE INVARIANCE; ITERATIVE METHODS; LATTICE FIELD THEORY; STATISTICAL MECHANICS; THEORETICAL DATA
Descriptors DEC
CALCULATION METHODS; CONSTRUCTIVE FIELD THEORY; DATA; FIELD THEORIES; INFORMATION; INVARIANCE PRINCIPLES; MATHEMATICAL LOGIC; MECHANICS; NUMERICAL DATA; QUANTUM FIELD THEORY

Optional Information

Notes
9 refs., 5 figs.
Secondary number(s)
RCHEP--98/13