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.

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