summaryrefslogtreecommitdiff
path: root/math/superlu/DESCR
diff options
context:
space:
mode:
Diffstat (limited to 'math/superlu/DESCR')
-rw-r--r--math/superlu/DESCR8
1 files changed, 8 insertions, 0 deletions
diff --git a/math/superlu/DESCR b/math/superlu/DESCR
new file mode 100644
index 00000000000..ff615a572a1
--- /dev/null
+++ b/math/superlu/DESCR
@@ -0,0 +1,8 @@
+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.