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.
This requires: blas
Maintained by: Bloyburt
Keywords: maths,math,mathematics,matrix,matrices,superlu,library
ChangeLog: superlu
Homepage:
https://portal.nersc.gov/project/sparse/superlu/
Download SlackBuild:
superlu.tar.gz
superlu.tar.gz.asc (FAQ)
(the SlackBuild does not include the source)
Individual Files: |
README |
slack-desc |
superlu.SlackBuild |
superlu.info |
© 2006-2023 SlackBuilds.org Project. All rights reserved.
Slackware® is a registered trademark of
Patrick Volkerding
Linux® is a registered trademark of
Linus Torvalds