A timing comparison of the conjugate gradient and Gauss-Seidel parallel algorithms in a one-dimensional flow equation using PVM

  • Authors:
  • Luke Olszewski

  • Affiliations:
  • Georgia Southern University, Statesboro, GA

  • Venue:
  • ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

The development of parallel processing came about due to the ineffectiveness of a single processor to accommodate the solutions of large scale problems in a reasonable amount of time. In this paper, we shall introduce one such problem, and discuss the implementation of two parallel algorithms applied to the linear approximations. This study will illustrate how an approximation method which has a faster rate of convergence may not necessarily produce the best solution time.