Modified Block BiCGSTAB for Lattice QCD

Abstract

We present results for application of block BiCGSTAB algorithm modified by the QR decomposition and the SAP preconditioner to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD on a $32^3\times 64$ lattice at almost physical quark masses. The QR decomposition improves convergence behaviors in the block BiCGSTAB algorithm suppressing deviation between true residual and recursive one. The SAP preconditioner applied to the domain-decomposed lattice helps us minimize communication overhead. We find remarkable cost reduction thanks to cache tuning and reduction of number of iterations.

5 pages, 2 figures, 1 table

References in corpus (2)

• Scaling study of dynamical smeared-link clover fermions
• Renormalization Group Analysis of Lattice Theories and Improved Lattice Action. II -- four-dimensional non-abelian SU(N) gauge model

Cited by in corpus (10)

• $\Lambda \Lambda$ and N$\Xi$ interactions from Lattice QCD near the physical point
• $N\Omega$ dibaryon from lattice QCD near the physical point
• Most Strange Dibaryon from Lattice QCD
• 1+1+1 flavor QCD + QED simulation at the physical point
• Pushing Memory Bandwidth Limitations Through Efficient Implementations of Block-Krylov Space Solvers on GPUs
• Baryon interactions from lattice QCD with physical masses -- Overview and $S=0,-4$ sectors --
• RHMC with Block Solvers and Multiple Pseudofermions
• Cross-interactive residual smoothing for global and block Lanczos-type solvers for linear systems with multiple right-hand sides
• A Study of Space-Time Discretizations for the Dirac Equation
• Block cross-interactive residual smoothing for Lanczos-type solvers for linear systems with multiple right-hand sides