Related papers: Improving Multigrid and Conventional Relaxation Al…
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…
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…
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…
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…
We present promising initial results of our adaptive multigrid solver developed for application directly to the non-Hermitian Wilson-Dirac system in 4 dimensions, as opposed to the solver developed in [1] for the corresponding normal…
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…
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…
We discuss the application of hybrid over-relaxation, even-odd preconditioning and a modified local updating procedure to the local bosonic fermion algorithm. Studies on autocorrelation times and the tuning of the parameters of the…
The Adaptive Aggregation-based Domain Decomposition Multigrid method (arXiv:1303.1377) is extended for two degenerate flavors of twisted mass fermions. By fine-tuning the parameters we achieve a speed-up of the order of hundred times…
We discuss critical slowing-down of several gauge-fixing algorithms for the so-called lambda-gauges in the SU(2) case at zero temperature. For these gauges we also evaluate the gluon propagator using different definitions of the lattice…
Staggered fermion shift symmetries correspond to translations of the fermion field within the unit cell of a hypercubic lattice. They satisfy an algebra and in four Euclidean dimensions can be related to a discrete subgroup of an $SU(4)$…
During the last decade, Neural Networks (NNs) have proved to be extremely effective tools in many fields of engineering, including autonomous vehicles, medical diagnosis and search engines, and even in art creation. Indeed, NNs often…
We describe an adaptive multigrid algorithm for solving inverses of the domain-wall fermion operator. Our multigrid algorithm uses an adaptive projection of near-null vectors of the domain-wall operator onto coarser four-dimensional…
This thesis is focused on the implementation and the application of a novel kind of algorithm which is expected to overcome the limitations of older schemes. This new algorithm is named Multiboson Method. It allows to simulate an arbitrary…
Distributed model training suffers from communication bottlenecks due to frequent model updates transmitted across compute nodes. To alleviate these bottlenecks, practitioners use gradient compression techniques like sparsification,…
We discuss the recently proposed multiboson domain-decomposed factorization of the gauge-field dependence of the fermion determinant in lattice QCD. In particular, we focus on the case of a lattice divided in an arbitrary number of thick…
This paper presents a model and implementation techniques for speeding up constraint propagation. Three fundamental approaches to improving constraint propagation based on propagators as implementations of constraints are explored: keeping…
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…
A modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD is presented. A larger basis of test vectors than that used in conventional multigrid is calculated by the smoother and truncated by…
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…