Scripted HTML version of Foils prepared 29 December 1996

Foil 7 Review of Matrices seen in PDE's

From CPS615-Linear Programming and Whirlwind Full Matrix Discussion Delivered Lectures of CPS615 Basic Simulation Track for Computational Science -- 5 Decemr 96. by Geoffrey C. Fox *
Secs 247.6
We have studied partial differential equations, for example
and shown how they translate into matrix equations.
These matrices were "sparse". The operator only linked a few states ( values in , components of ).
"Full" matrices are those with "essentially all" elements nonzero. More precisely, it is not worth exploiting the zero's.
  • i.e. treat zero's as "ordinary" numbers with a*0=0 and a+0=a implemented using floating point unit and not by omitting computation!

© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Thu Aug 14 1997