Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
arXiv:0903.4936 · doi:10.1016/j.cpc.2009.09.006
Abstract
It is well known that the block Krylov subspace solvers work efficiently for some cases of the solution of differential equations with multiple right-hand sides. In lattice QCD calculation of physical quantities on a given configuration demands us to solve the Dirac equation with multiple sources. We show that a new block Krylov subspace algorithm recently proposed by the authors reduces the computational cost significantly without loosing numerical accuracy for the solution of the O(a)-improved Wilson-Dirac equation.
arXiv comment12 pages, 5 figures
References in corpus (8)
- 2+1 Flavor Lattice QCD toward the Physical Point
- Local coherence and deflation of the low quark modes in lattice QCD
- Accelerating Wilson Fermion Matrix Inversions by Means of the Stabilized Biconjugate Gradient Algorithm
- 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
- Deflated Iterative Methods for Linear Equations with Multiple Right-Hand Sides
Cited by in corpus (11)
- Modified Block BiCGSTAB for Lattice QCD
- Pushing Memory Bandwidth Limitations Through Efficient Implementations of Block-Krylov Space Solvers on GPUs
- Application of preconditioned block BiCGGR to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
- RHMC with Block Solvers and Multiple Pseudofermions
- A Study of Space-Time Discretizations for the Dirac Equation
- Cross-interactive residual smoothing for global and block Lanczos-type solvers for linear systems with multiple right-hand sides
- Structured condition number for multiple right-hand side linear systems with parameterized quasiseparable coefficient matrix
- Preconditioning the Restarted and Shifted Block FOM Algorithm for Matrix Exponential Computation
- A SQMRCGstab Algorithm for Families of Shifted Linear Systems
- A new deflated block GCROT() method for the solution of linear systems with multiple right-hand sides
- Block cross-interactive residual smoothing for Lanczos-type solvers for linear systems with multiple right-hand sides