Application of preconditioned block BiCGGR to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
arXiv:0907.3261 · doi:10.1016/j.cpc.2009.12.025
Abstract
There exist two major problems in application of the conventional block BiCGSTAB method to the O(a)-improved Wilson-Dirac equation with multiple right-hand-sides: One is the deviation between the true and the recursive residuals. The other is the convergence failure observed at smaller quark masses for enlarged number of the right-hand-sides. The block BiCGGR algorithm which was recently proposed by the authors succeeds in solving the former problem. In this article we show that a preconditioning technique allows us to improve the convergence behavior for increasing number of the right-hand-sides.
arXiv comment10 pages, 3 figures
References in corpus (9)
- 2+1 Flavor Lattice QCD toward the Physical Point
- Light Hadron Spectroscopy with Two Flavors of Dynamical Quarks on the Lattice
- Local coherence and deflation of the low quark modes in lattice QCD
- Adaptive Multigrid Algorithm for Lattice QCD
- Computing and deflating eigenvalues while solving multiple right hand side linear systems in Quantum Chromodynamics
- Deflated GMRES for Systems with Multiple Shifts and Multiple Right-Hand Sides
- Dynamical Quark Effects on Light Quark Masses
- Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
- Deflated Iterative Methods for Linear Equations with Multiple Right-Hand Sides
Cited by in corpus (5)
- Effective noise reduction techniques for disconnected loops in Lattice QCD
- Modified Block BiCGSTAB for Lattice QCD
- Pushing Memory Bandwidth Limitations Through Efficient Implementations of Block-Krylov Space Solvers on GPUs
- RHMC with Block Solvers and Multiple Pseudofermions
- Block cross-interactive residual smoothing for Lanczos-type solvers for linear systems with multiple right-hand sides