HTML version of Scripted Foils prepared 29 December 1996

Foil 15 Notes on the use of full matrices

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 178.5
1 From the previous discussion, we see that matrix multiplication is actually very rarely used in scientific computing for large N. (Yet it's a favorite computer science algorithm!)
2 Full matrix equation solvers are sometimes used but not very common. Of course equation solvers are incredibly important for sparse matrices because if the matrix is large
  • the physics of the problem will make it sparse
  • it will be insoluble unless it is sparse
3 In solving , formally , but this is NOT normally the best numerical method.
4 If is sparse, both and the better LU decomposition are NOT sparse.
Table Font Size

© 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