Initial import of SuperLU version 1.1.

A library of routines for performing sparse factorization.

PR:		5131
Submitted by:	Pedro Giffuni <giffunip@asme.org>

1 files changed, 26 insertions, 0 deletions

diff --git a/math/superlu/pkg-descr b/math/superlu/pkg-descr
new file mode 100644
index 000000000000..8ef7fc666807
--- /dev/null
+++ b/math/superlu/pkg-descr
@@ -0,0 +1,26 @@
+
+			SuperLU Version 1.0
+			===================
+
+SuperLU 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 is implemented in ANSI C, and must be compiled with standard
+ANSI C compilers. It provides functionality for both real and complex
+matrices, in both single and double precision. The file names for the
+single-precision real version start with letter "s" (such as sgstrf.c);
+the file names for the double-precision real version start with letter "d"
+(such as dgstrf.c); the file names for the single-precision complex
+version start with letter "c" (such as cgstrf.c); the file names
+for the double-precision complex version start with letter "z"
+(such as zgstrf.c).
+
+			===================
+			
+	http://www.cs.berkeley.edu/~xiaoye/superlu.html
+Authors:
+        Jim Demmel      demmel@cs.berkeley.edu
+        John Gilbert    gilbert@parc.xerox.com
+        Xiaoye S. Li    xiaoye@cs.berkeley.edu