Block Algorithms for Quark Propagator Calculation
Stephen M. Pickles, UKQCD Collaboration
Abstract
Computing quark propagators in lattice QCD is equivalent to solving large, sparse linear systems with multiple right-hand sides. Block algorithms attempt to accelerate the convergence of iterative Krylov-subspace methods by solving the multiple systems simultaneously. This paper compares a block generalisation of the quasi-minimal residual method (QMR), Block Conjugate Gradient on the normal equation, Block Lanczos and (γ5-symmetric) Block BiConjugate Gradient.
Create a lesson
Related papers
Confining strings in the reconfined phase of trace deformed three dimensional SU(2) Yang-Mills theory
Claudio Bonati, Michele Caselle, Alessio Negro et al.
Generalizable Equivariant Diffusion Models for Non-Abelian Lattice Gauge Theory: Analytical Foundations and Numerical Scaling Tests
Gert Aarts, Diaa E. Habibi, Andreas Ipp et al.
2+1 flavor light hadron spectrum with PACS10 configurations
K. -I. Ishikawa, N. Ishizuka, Y. Kuramashi et al.
Precision determination of Bc and Bc* meson decay constants from lattice QCD
Navdeep Singh Dhindsa, Debsubhra Chakraborty, Nilmani Mathur
Meson spectroscopy from lattice QCD
Andrew W. Jackura
Generative sampling with physics-informed kernels
Friederike Ihssen, Renzo Kapust, Jan M. Pawlowski