Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD

DOI10.1016/J.CPC.2009.09.006zbMATH Open1205.81131arXiv0903.4936OpenAlexW2041588636MaRDI QIDQ615008FDOQ615008

Hiroto Tadano, Yoshinobu Kuramashi, Tetsuya Sakurai

Publication date: 5 January 2011

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

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.

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

Recommendations

• Application of preconditioned block BiCGGR to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
• A deflated conjugate gradient method for multiple right hand sides and multiple shifts
• Solution of the Dirac equation in lattice QCD using a domain decomposition method
• Krylov subspace methods for the Dirac equation
• Adaptive aggregation-based domain decomposition multigrid for the lattice Wilson-Dirac operator

zbMATH Keywords

multiple right-hand sideslattice gauge theoryblock Krylov subspacelattice Dirac equation

Mathematics Subject Classification ID

Yang-Mills and other gauge theories in quantum field theory (81T13) Strong interaction, including quantum chromodynamics (81V05) Quantum field theory on lattices (81T25)

Cites Work

• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• A block version of BiCGSTAB for linear systems with multiple right-hand sides
• Block BiCGGR: A new block Krylov subspace method for computing high accuracy solutions
• Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromodynamics
• Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
• Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides

Cited In (12)

• Application of preconditioned block BiCGGR to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
• Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems
• An improvement in DS-biCGstab(\(l\)) and its application for linear systems in lattice QCD
• A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides
• Cross-Interactive Residual Smoothing for Global and Block Lanczos-Type Solvers for Linear Systems with Multiple Right-Hand Sides
• A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
• On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems
• A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations
• KSPHPDDM and PCHPDDM: extending PETSc with advanced Krylov methods and robust multilevel overlapping Schwarz preconditioners
• Structured condition number for multiple right-hand side linear systems with parameterized quasiseparable coefficient matrix
• A shifted block FOM algorithm with deflated restarting for matrix exponential computations
• The block Hessenberg process for matrix equations

This page was built for publication: Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q615008)