The IBiCG method for large and sparse linear systems

208. L. T. Yang and R. P. Brent, The improved parallel BiCG method for large and sparse linear systems on distributed memory architectures, Information Journal (special issue on parallel computing), 6, 3 (2003), 349-360.

Preliminary version appeared in Workshop Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS-PDSECA02), Fort Lauderdale, Florida, April 2002, 233-240.

Preprint: ps (210K).

Conference paper: pdf (458K).


For the solution of large and sparse linear systems of equations with unsymmetric coefficient matrices, we propose an improved version (IBiCG) of the BiConjugate Gradient method (BiCG) of Bicker and Sauren [LNCS 1253, 1997] by using the Lanczos process as a major component combining elements of numerical stability and parallel algorithm design. The efficiency of the method is demonstrated by numerical experiments carried out on a massively parallel distributed memory system.

[For a longer abstract, see the paper.]

Go to next publication

Return to Richard Brent's index page