We test iterative algorithms, MR, QMRγ5 and BiCGγ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.
Cite
@article{arxiv.hep-lat/9611009,
title = {Comparison of Multi-quark Matrix Inversion Algorithms},
author = {He-Ping Ying and Shao-Jing Dong and Keh-Fei Liu},
journal= {arXiv preprint arXiv:hep-lat/9611009},
year = {2016}
}
Comments
4 pages, Latex, 6 figures, UK/96-13, poster at Lattice '96