A global optimization method for Landau gauge fixing in lattice QCD

DOI10.1016/J.CPC.2003.12.001zbMATH Open1196.81035arXivhep-lat/0309184OpenAlexW2056687287MaRDI QIDQ709482FDOQ709482

D. Kharzeev

Publication date: 18 October 2010

Published in: Computer Physics Communications (Search for Journal in Brave)

Abstract: An algorithm for gauge fixing to the minimal Landau gauge in lattice QCD is described. The method, a combination of an evolutionary algorithm with a steepest descent method, is able to solve the problem of the nonperturbative gauge fixing. The performance of the combined algorithm is investigated on $8^4$, $$, and $16^4$, $$, lattice SU(3) gauge configurations.

Full work available at URL: https://arxiv.org/abs/hep-lat/0309184

Mathematics Subject Classification ID

Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to quantum theory (81-04) Quantum field theory; related classical field theories (81T99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some remarks on the Gribov ambiguity
• Every gauge orbit passes inside the Gribov horizon
• Problems on lattice gauge fixing
• Fundamental modular region, Boltzmann factor and area law in lattice theory
• Zooming-in on the \(\text{SU}(2)\) fundamental domain

Cited In (4)

• Dependence of the propagators on the sampling of Gribov copies inside the first Gribov region of Landau gauge
• Coulomb, Landau and maximally abelian gauge fixing in lattice QCD with multi-gpus
• A profile likelihood analysis of the constrained MSSM with genetic algorithms
• Evolutionary fitting methods for the extraction of mass spectra in lattice field theory

Uses Software

• Genocop

This page was built for publication: A global optimization method for Landau gauge fixing in lattice QCD

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709482)