Fedora Packages

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-38.fc40 -
Fedora 40 3.1.0-38.fc40 -
Fedora 39 3.1.0-36.fc39 -
Fedora 38 3.1.0-35.fc38 -
EPEL 9 3.1.0-33.el9 -
EPEL 8 3.1.0-24.el8 -
EPEL 7 3.1.0-24.el7 -
File a new bug report »
Package Info
Related Packages

You can contact the maintainers of this package via email at SuperLUMT dash maintainers at fedoraproject dot org.



Sources on Pagure