Comparison of Multi-quark Matrix Inversion Algorithms

Abstract

We test iterative algorithms, MR, QMR${\gamma }_5$ and BiCG${\gamma }_5$, to compare their efficiency in matrix inversion with multi-quarks (shifted matrices) within one iteration process. Our results on the 8^3 x 12 and 16^3 x 24 show that MR admits multi-quark calculation with less memory requirement, whereas QMR is faster for the single quark calculation.

4 pages, Latex, 6 figures, UK/96-13, poster at Lattice '96

References in corpus (4)

• Many Masses on One Stroke: Economic Computation of Quark Propagators
• Accelerating Wilson Fermion Matrix Inversions by Means of the Stabilized Biconjugate Gradient Algorithm
• Progress on lattice QCD algorithms
• Extrapolation Methods for the Dirac Inverter in Hybrid Monte Carlo

Cited by in corpus (3)

• Strangeness and charmness content of nucleon from overlap fermions on 2+1-flavor domain-wall fermion configurations
• Nucleon isovector scalar charge from overlap fermions
• Lattice QCD and the Neutron Electric Dipole Moment