K 10
svn:author
V 4
maho
K 8
svn:date
V 27
2003-07-12T06:26:00.000000Z
K 7
svn:log
V 553
(forced commit)
Added SuperLU_MT, which
contains a set of subroutines to solve a sparse linear system
A*X=B. It uses Gaussian elimination with partial pivoting (GEPP).
The columns of A may be preordered before factorization; the
preordering for sparsity is completely separate from the factorization.

SuperLU_MT is a parallel extension to the serial SuperLU library.

SuperLU_MT (math/superlu_mt) and SuperLU (math/superlu) are
employing quite different implimentation, so we decided
to make separete ports.

Pointed out by:	kris
Pointy hat to:	myself

END