We test iterative algorithms, MR, QMR(gamma 5) and BiCG(gamma 5), to c
ompare their efficiency in matrix inversion with multi-quarks (shifted
matrices) within one iteration process. Our results on the 8(3)x12 an
d 16(3)x24 show that MR admits multi-quark calculation with less memor
y requirement, whereas QMR is faster for the single quark calculation.