Title and abstract for

Parallel Full Matrix Algorithms

Given by Geoffrey C. Fox, Nancy J. McCracken at CPS615 Basic Simulation Track for Computational Science on Fall Semester 95. Foils prepared 6 December 96
which leads to edit sector initialized at overall parameters
Summary of Addons which lists all addon files pointed to in foilset
This is a SINGLE file Containing all Foils in nonIMAGE (i.e. HTML) form
This contains all WebWisdom links preceded by those referenced in this foilset
This contains an Index of Foilset Suitable for Printing (There is no easy way of Printing all foils -- just the index)
This just contains Title of Foilset and Links
This CPS615 module covers basic full matrix parallel algorithms with a discussion of matrix multiplication, LU decomposition with latter covered for banded as well as true full case
Matrix multiplication covers the approach given in "Solving Problems on Concurrent Processors" as well as Cannon's algorithm.
We review those applications -- especially Computational electromagnetics and Chemistry -- where full matrices are commonly used
Of course sparse matrices are far more important than full matrices!
© on Tue Oct 7 1997