Coarsest-level improvements in multigrid for lattice QCD on large-scale computers

DOI10.1016/j.cpc.2023.108869arXiv2205.09104OpenAlexW4385431137MaRDI QIDQ6051367

Unnamed Author, Andreas Frommer, Jesus Espinoza-Valverde, Matthias Rottmann

Publication date: 20 September 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.09104

zbMATH Keywords

preconditioningdeflationalgebraic multigrid methodslattice QCD Dirac-Wilson discretizationtwisted mass discretization

Mathematics Subject Classification ID

Numerical analysis (65-XX) Statistical mechanics, structure of matter (82-XX)

Related Items (1)

Optimizing shift selection in multilevel Monte Carlo for disconnected diagrams in lattice QCD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of the Dirac equation in lattice QCD using a domain decomposition method
• Computing interior eigenvalues of large matrices
• On the evaluation of polynomial coefficients
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromodynamics
• Recursive Krylov‐based multigrid cycles
• Recycling Krylov Subspaces for Sequences of Linear Systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
• Truncation Strategies for Optimal Krylov Subspace Methods
• GMRES with Deflated Restarting
• Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
• Polynomial Preconditioned Arnoldi with Stability Control

This page was built for publication: Coarsest-level improvements in multigrid for lattice QCD on large-scale computers