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 | 7.0.1-1.fc43 | - |
| Fedora 42 | 7.0.1-1.fc42 | - |
| Fedora 41 | 6.0.1-6.fc41 | - |
| Fedora EPEL 9 | 6.0.1-5.el9 | - |
| Fedora EPEL 10.1 | 7.0.1-1.el10_1 | - |
| Fedora EPEL 10.0 | 7.0.0-1.el10_0 | - |
File a new bug report »
Package Info
Related Packages
Package Info
- Upstream: https://portal.nersc.gov/project/sparse/superlu/
- License(s): BSD-2-Clause AND GPL-2.0-or-later
- 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