Adaptive Multigrid Algorithm for Lattice QCD
arXiv:0707.4018 · doi:10.1103/PhysRevLett.100.041601
Abstract
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 space. The resulting algorithm has weak dependence on the gauge coupling and exhibits very little critical slowing down in the chiral limit. Results are presented for the Wilson Dirac operator of the 2d U(1) Schwinger model.
4 pages, 2 figures
References in corpus (4)
Cited by in corpus (44)
- Solving Lattice QCD systems of equations using mixed precision solvers on GPUs
- Effective noise reduction techniques for disconnected loops in Lattice QCD
- 50 Years of Quantum Chromodynamics
- Adaptive multigrid algorithm for the lattice Wilson-Dirac operator
- Valence parton distribution of pion from lattice QCD: Approaching continuum
- Precision Nucleon Charges and Form Factors Using 2+1-flavor Lattice QCD
- Adaptive Aggregation-based Domain Decomposition Multigrid for Twisted Mass Fermions
- Nuclear matrix elements from lattice QCD for electroweak and beyond-Standard-Model processes
- Continuum-extrapolated NNLO Valence PDF of Pion at the Physical Point
- Status and Future Perspectives for Lattice Gauge Theory Calculations to the Exascale and Beyond
- Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
- Quantum annealing for systems of polynomial equations
- Multigrid approach in shifted linear systems for the non-degenerated twisted mass operator
- Multigrid for Staggered Lattice Fermions
- Uncertainty Quantification in Lattice QCD Calculations for Nuclear Physics
- QCD Predictions for Meson Electromagnetic Form Factors at High Momenta: Testing Factorization in Exclusive Processes
- Lattice QCD Calculation of -dependent Meson Distribution Amplitudes at Physical Pion Mass with Threshold Logarithm Resummation
- Pushing Memory Bandwidth Limitations Through Efficient Implementations of Block-Krylov Space Solvers on GPUs
- Parallelizing the QUDA Library for Multi-GPU Calculations in Lattice Quantum Chromodynamics
- Three-dimensional Imaging of Pion using Lattice QCD: Generalized Parton Distributions
- Multigrid deflation for Lattice QCD
- Multigrid for Chiral Lattice Fermions: Domain Wall
- An adaptive aggregation based domain decomposition multilevel method for the lattice wilson dirac operator: multilevel results
- Adaptive Aggregation Based Domain Decomposition Multigrid for the Lattice Wilson Dirac Operator
- Strange metals and planckian transport in a gapless phase from spatially random interactions
- Neural-network preconditioners for solving the Dirac equation in lattice gauge theory
- Object-oriented implementation of algebraic multi-grid solver for lattice QCD on SIMD architectures and GPU clusters
- Toward large-scale Hybrid Monte Carlo simulations of the Hubbard model on graphics processing units
- Energy Efficiency trends in HPC: what high-energy and astrophysicists need to know
- Application of preconditioned block BiCGGR to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
- A multigrid accelerated eigensolver for the Hermitian Wilson-Dirac operator in lattice QCD
- Hierarchically deflated conjugate residual
- Comparison of Domain Wall Fermion Multigrid Methods
- QCD on GPUs: cost effective supercomputing
- The role of multigrid algorithms for LQCD
- Multigrid Preconditioning for the Overlap Operator in Lattice QCD
- Solving DWF Dirac Equation Using Multi-splitting Preconditioned Conjugate Gradient with Tensor Cores on NVIDIA GPUs
- Aggregation-based Multilevel Methods for Lattice QCD
- Optimizing Staggered Multigrid for Exascale performance
- Recent algorithm and machine developments for lattice QCD
- Galerkin Formulation of Path Integrals in Lattice Field Theory
- The removal of critical slowing down
- Porting DDalphaAMG solver to K computer
- Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs