SuperLUMT
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.
Releases Overview
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 3.1.0-31.fc35 | - |
| Fedora 35 | 3.1.0-31.fc35 | - |
| Fedora 34 | 3.1.0-30.fc34 | - |
| EPEL 8 | 3.1.0-24.el8 | - |
| EPEL 7 | 3.1.0-24.el7 | - |
Package Info
Related Packages
- Upstream: http://crd-legacy.lbl.gov/~xiaoye/SuperLU/
- License(s): BSD
- Maintainer: sagitter
Related Packages
You can contact the maintainers of this package via email at
SuperLUMT dash maintainers at fedoraproject dot org.
Sources on Pagure