The Improved BiCGStab Method for Large and Sparse Unsymmetric Linear Systems on Parallel Distributed Memory Architectures

  • Authors:
  • Affiliations:
  • Venue:
  • ICA3PP '02 Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, an improved version of the BiCGStab(IBiCGStab) method for the solutions of large andsparse linear systems of equations with unsymmetriccoefficient matrices is proposed. The method combineselements of numerical stability and parallel algorithmdesign without increasing the computational costs. Thealgorithm is derived such that all inner products of asingle iteration step are independent and communication time required for inner product can be overlappedefficiently with computation time of vector updates.Therefore, the cost of global communication which represents the bottleneck of the parallel performance canbe signifficantly reduced. The resulting IBiCGStab algorithm maintains the favorable properties of the originalmethod while not increasing computational costs. Datadistribution suitable for both irregularly and regularlystructured matrices based on the analysis of the non-zero matrix elements is presented. Communicationscheme is supported by overlapping execution of computation and communication to reduce waiting times.The efficiency of this method is demonstrated by numerical experimental results carried out on a massivelyparallel distributed memory system.