| 1 |
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
|
| 2 |
Matrix multiplication covers the approach given in "Solving Problems on Concurrent Processors" as well as Cannon's algorithm.
|
| 3 |
We review those applications -- especially Computational electromagnetics and Chemistry -- where full matrices are commonly used
|
| 4 |
Of course sparse matrices are far more important than full matrices!
|
