相关论文: Some Comments on Multigrid Methods for Computing P…
Multigrid methods were invented for the solution of discretized partial differential equations in ordered systems. The slowness of traditional algorithms is overcome by updates on various length scales. In this article we discuss…
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…
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…
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…
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…
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…
A Dirac choice for the averaging kernel $C$ is implemented numerically. This improved kernel will be needed in gauge covariant multigrid computations for propagators of staggered fermions. Results for $C$ and the variational coarse grid…
Lattice regularization of chiral fermions is an important development of the theory of elementary particles. Nontheless, brute force computer simulations are very expensive, if not prohibitive. In this letter I exploit the non-interacting…
The convergence rate of a multigrid method depends on the properties of the smoother and the so-called grid transfer operator. In this paper we define and analyze new grid transfer operators with a generic cutting size which are applicable…
Practical modifications of deterministic multigrid and conventional relaxation algorithms are discussed. New parameters need not be tuned but are determined by the algorithms themselves. One modification can be thought of as ``updating on a…
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…
This paper provides an overview of the main ideas driving the bootstrap algebraic multigrid methodology, including compatible relaxation and algebraic distances for defining effective coarsening strategies, the least squares method for…
The goal of this primer is to provide a relatively short exposition of the basics of multigrid methods, simplified by focusing on fundamental concepts in a variational setting. This is done by way of a quadratic energy minimization…
Computing at the exascale level is expected to be affected by a significantly higher rate of faults, due to increased component counts as well as power considerations. Therefore, current day numerical algorithms need to be reexamined as to…
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…
We use Bayes' probability theorem to analyze many-pole fits of hadron propagators. An alternative method of estimating values and uncertainties of the fit parameters is offered, which has certain advantages over the conventional methods.…
Multigrid is a powerful solver for large-scale linear systems arising from discretized partial differential equations. The convergence theory of multigrid methods for symmetric positive definite problems has been well developed over the…
Multigrid is one of the most efficient methods for solving large-scale linear systems that arise from discretized partial differential equations. As a foundation for multigrid analysis, two-grid theory plays an important role in motivating…
We introduce a concept of multiplicity lattices of 2-multiarrangements, determine the combinatorics and geometry of that lattice, and give a criterion and method to construct a basis for derivation modules effectively.
This is the second of two papers devoted to the perturbative computation of the ghost and gluon propagators in SU(3) Lattice Gauge Theory. Such a computation should enable a comparison with results from lattice simulations in order to…