Lecture 12.
Coding matrix multiplication and Gaussian
elimination.
In class together we developed
algorithms for matrix multiplication and Gaussian elimination. At one point the
two algorithms were side by side on adjacent boards. This showed in a
transparent way the similarities (and differences) between these two
algorithms.
We also saw some
code for back substitution.
I
closed the class by discussing how permutation matrices could be used to cope
with partial pivoting.
Posted: Fri - October 7, 2005 at 01:48 PM