Basic HTML version of Foils prepared October 1995

Foil 5 Implementation of the Gauss-Jordan Program

From Intro HPF September 27, 1995 CPS615 Basic Simulation Track for Computational Science -- Fall Semester 95. by Tom Haupt and Nancy McCracken


Consider the decomposition into roughly equal blocks of the N x N+1 augmented matrix: c = [ a | b ], given here in a 9 x 10 example where some processors have 9 elements and the last column of processors has 12 elements:
In the first iteration of the algorithm, consider that each processor has roughly n x n elements and find the running time of each part of the algorithm:
  • Divide first row:
  • Transform remaining rows:



© on Tue Oct 7 1997