SuperLU
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.
Releases Overview
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 5.3.0-1.fc36 | - |
| Fedora 35 | 5.2.2-2.fc35 | - |
| Fedora 34 | 5.2.2-1.fc34 | - |
| EPEL 7 | 5.2.0-5.el7 | - |
Package Info
Related Packages
- Upstream: https://portal.nersc.gov/project/sparse/superlu/
- License(s): BSD and GPLv2+
- Maintainers: sagitter, besser82
Related Packages
You can contact the maintainers of this package via email at
SuperLU dash maintainers at fedoraproject dot org.
Sources on Pagure