README  README  README  README  README  README  README  README  README  README

Parallel version of sparse matrix for Sequent...

---------------------------

Author: Joe Hummel, UC-Ivine, Summer 1993. 

To build the code, simply do:
  
         make

To execute, then do "sm"; the code outputs the total execution along with
the solution vector for the (random) matrix.  To remove the current version 
when you want to do a clean make, do "make clean".  See the file "main.h" 
for controlling what gets built at compile-time; also look at "sparse.h" 
for other parameters you may want to tune.

Warning: the solutions obtained are very unstable (given the range of 
values and their randomness?), so changing just one pivot choice yields
a radically different solution vector.  Or, just try introducting a tiny
error in the factorization, you again get a radically different solution. 

Have fun!  

  - joe (jhummel@ics.uci.edu)

---------------------------

README  README  README  README  README  README  README  README  README  README
