Idealized Multigrid Algorithm for Staggered Fermions

Abstract

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.

11 pages, no figures, DESY 93-046; can be formatted with plain LaTeX article style

References in corpus (3)

• Multigrid Methods for the Computation of Propagators in Gauge Fields
• Improving Multigrid and Conventional Relaxation Algorithms for Propagators
• Neural multigrid for gauge theories and other disordered systems

Cited by in corpus (6)

• Universal fluctuations in spectra of the lattice Dirac operator
• A random matrix model for chiral symmetry breaking
• Universal scaling of the valence quark mass dependence of the chiral condensate
• Spectrum of the Dirac Operator and Multigrid Algorithm with Dynamical Staggered Fermions
• Linear Algebra with Disordered Sparse Matrices that have Spatial Structure: Theory and Computation
• Some Comments on Multigrid Methods for Computing Propagators