Source Package: SuperLUMT (4.0.1-6.fc43)
Single precision real SuperLU routines for shared memory parallel machines
Subroutines to solve sparse linear systems for shared memory parallel machines. 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.
Package information
- Homepage
- [https://portal.nersc.gov/project/sparse/superlu/]
- License
- BSD-3-Clause
- Downstream package maintainer
- sagitterObserved Nov 19, 2026 [source]
The following binary packages are built from this source package:
- SuperLUMT
Single precision real SuperLU routines for shared memory parallel machines
- SuperLUMT64
Single precision real SuperLU routines (64bit INTEGER)
- SuperLUMT64-complex
Single precision complex SuperLU routines (64bit INTEGER)
- SuperLUMT64-complex16
Double precision complex SuperLU routines (64bit INTEGER)
- SuperLUMT64-devel
The MUMPS headers and development-related files (64bit INTEGER)
- SuperLUMT64-double
Double precision real SuperLU routines (64bit INTEGER)
- SuperLUMT-common
Documentation files for SuperLUMT
- SuperLUMT-complex
Single precision complex SuperLU routines for shared memory parallel machines
- SuperLUMT-complex16
Double precision complex SuperLU routines for shared memory parallel machines
- SuperLUMT-devel
The SuperLUMT headers and development-related files
- SuperLUMT-double
Double precision real SuperLU routines for shared memory parallel machines
