An Implementation of the TFQMR-Algorithm on a Distributed Memory Machine.

Abstract

For the solution of linear systems of equations with unsymmetric coefficient matrices, R.W. Freund [J. Sci. Comput. 14 (1993), 470-482] recently proposed an iterative algorithm called Transpose-Free Quasi-Minimal Residual method. This paper presents implementation details and timings of this algorithm on an Intel iPSC860, a hypercube-based parallel computer with distributed memory.