summaryrefslogtreecommitdiff
path: root/libraries/superlu/README
diff options
context:
space:
mode:
Diffstat (limited to 'libraries/superlu/README')
-rw-r--r--libraries/superlu/README18
1 files changed, 18 insertions, 0 deletions
diff --git a/libraries/superlu/README b/libraries/superlu/README
new file mode 100644
index 0000000000..0a5b15de31
--- /dev/null
+++ b/libraries/superlu/README
@@ -0,0 +1,18 @@
+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).
+
+NOTE:
+OpenBLAS can be used instead of blas, and is recommended for better
+performance.