Related papers: Multigrid Methods for Propagators in Lattice Gauge…
Multigrid (MG) methods for the computation of propagators of staggered fermions in non-Abelian gauge fields are discussed. MG could work in principle in arbitrarily disordered systems. The practical variational MG methods tested so far with…
I make three conceptual points regarding multigrid methods for computing propagators in lattice gauge theory: 1) The class of operators handled by the algorithm must be stable under coarsening. 2) Problems related by symmetry should have…
NOTE: this is a shortened version of the abstract of the paper. Multigrid methods for propagators in gauge fields are investigated. Gauge fields are incorporated in algorithms in a covariant way. This avoids the necessity for gauge fixing…
The construction of multigrid operators for disordered linear lattice operators, in particular the fermion matrix in lattice gauge theories, by means of algebraic multigrid and block LU decomposition is discussed. In this formalism, the…
We present evidence that multigrid works for wave equations in disordered systems, e.g. in the presence of gauge fields, no matter how strong the disorder, but one needs to introduce a "neural computations" point of view into large scale…
The multigrid methodology is reviewed. By integrating numerical processes at all scales of a problem, it seeks to perform various computational tasks at a cost that rises as slowly as possible as a function of $n$, the number of degrees of…
We study a multigrid method for solving large linear systems of equations with tensor product structure. Such systems are obtained from stochastic finite element discretization of stochastic partial differential equations such as the…
The Iteratively Smoothing Unigrid algorithm (ISU), a new multigrid method for computing propagators in Lattice Gauge Theory, is explained. The main idea is to compute good (i.e.\ smooth) interpolation operators in an iterative way. This…
We study a multigrid method for nonabelian lattice gauge theory, the time slice blocking, in two and four dimensions. For SU(2) gauge fields in two dimensions, critical slowing down is almost completely eliminated by this method. This…
We present a new multigrid solver that is suitable for the Dirac operator in the presence of disordered gauge fields. The key behind the success of the algorithm is an adaptive projection onto the coarse grids that preserves the near null…
This work develops a nonlinear multigrid method for diffusion problems discretized by cell-centered finite volume methods on general unstructured grids. The multigrid hierarchy is constructed algebraically using aggregation of degrees of…
The present work develops hybrid multigrid methods for high-order discontinuous Galerkin discretizations of elliptic problems. Fast matrix-free operator evaluation on tensor product elements is used to devise a computationally efficient PDE…
We present evidence that multigrid (MG) works for wave equations in disordered systems, e.g. in the presence of gauge fields, no matter how strong the disorder. We introduce a "neural computations" point of view into large scale…
We analyze the kinematics of multigrid Monte Carlo algorithms by investigating acceptance rates for nonlocal Metropolis updates. With the help of a simple criterion we can decide whether or not a multigrid algorithm will have a chance to…
An overview is given over the recently developed and now widely used Monte Carlo algorithms with reduced or eliminated critical slowing down. The basic techniques are overrelaxation, cluster algorithms and multigrid methods. With these…
We discuss a program for replacing standard perturbative methods with Monte Carlo simulations in short distance lattice gauge theory calculations.
Critical slowing down in Krylov methods for the Dirac operator presents a major obstacle to further advances in lattice field theory as it approaches the continuum solution. Here we formulate a multi-grid algorithm for the Kogut-Susskind…
Multigrid methods have proven to be an invaluable tool to efficiently solve large sparse linear systems arising in the discretization of partial differential equations (PDEs). Algebraic multigrid methods and in particular adaptive algebraic…
Due to its optimal complexity, the multigrid (MG) method is one of the most popular approaches for solving large-scale linear systems arising from the discretization of partial differential equations. However, the parallel implementation of…
Constructing fast numerical solvers for partial differential equations (PDEs) is crucial for many scientific disciplines. A leading technique for solving large-scale PDEs is using multigrid methods. At the core of a multigrid solver is the…