Source Package: SuperLU (7.0.1-2.fc43)
Subroutines to solve sparse linear systems
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-2-Clause AND GPL-2.0-or-later
- Downstream package maintainer
- besser82, sagitterObserved Nov 19, 2026 [source]
The following binary packages are built from this source package:
- SuperLU
Subroutines to solve sparse linear systems
- SuperLU-devel
Header files and libraries for SuperLU development
- SuperLU-doc
Documentation and Examples for SuperLU
