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.
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 5.3.0-5.fc39 | - |
Fedora 38 | 5.3.0-4.fc38 | - |
Fedora 37 | 5.3.0-3.fc37 | - |
Fedora 36 | 5.3.0-2.fc36 | - |
EPEL 9 | 5.3.0-2.el9 | - |
EPEL 7 | 5.2.0-5.el7 | - |
You can contact the maintainers of this package via email at
SuperLU dash maintainers at fedoraproject dot org
.