Idealized multigrid algorithm for staggered fermions

Journal Article · Wed Sep 01 00:00:00 EDT 1993 · Physical Review, D (Particles Fields); (United States)

DOI:https://doi.org/10.1103/PhysRevD.48.R1926· OSTI ID:6244837

Kalkreuter, T ^[1]

---

1. II. Institut fuer Theoretische Physik, Universitaet Hamburg, Luruper Chaussee 149, D-22761 Hamburg (Germany)

An idealized multigrid algorithm for the computation of propagators of staggered fermions is investigated. Exemplified in four-dimensional SU(2) gauge fields, it is shown that the idealized algorithm preserves criticality under coarsening. The same is not true when the coarse grid operator is defined by the Galerkin prescription. Relaxation times in computations of propagators are small, and critical slowing is strongly reduced (or eliminated) in the idealized algorithm. Unfortunately, this algorithm is not practical for production runs, but the investigations presented here answer important questions of principle.

• OSTI ID: 6244837
• Journal Information: Physical Review, D (Particles Fields); (United States), Vol. 48:5; ISSN 0556-2821
• Country of Publication: United States
• Language: English

Related Subjects

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS
FERMIONS
PROPAGATOR
LATTICE FIELD THEORY
ALGORITHMS
FOUR-DIMENSIONAL CALCULATIONS
MONTE CARLO METHOD
RELAXATION TIME
SLOWING-DOWN
SU-2 GROUPS
CALCULATION METHODS
FIELD THEORIES
LIE GROUPS
MATHEMATICAL LOGIC
QUANTUM FIELD THEORY
SU GROUPS
SYMMETRY GROUPS
662110* - General Theory of Particles & Fields- Theory of Fields & Strings- (1992-)