Subroutines to solve sparse linear systems
2.42 MB
built 2026-10-12 11:39:59 GMT
Description
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.
Dependencies
12 totalRequires9
- cmake
- csh
- gcc
- gcc-gfortran
- make
- metis-devel
- pkgconfig(flexiblas)
- rpmlib(CompressedFileNames) <= 3.0.4-1
- rpmlib(FileDigests) <= 4.6.0-1
Provides3
- SuperLU = 7.0.1-5.fc45
- SuperLU-devel = 7.0.1-5.fc45
- SuperLU-doc = 7.0.1-5.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances
Files
6Name  |
Size |
|---|---|
| SuperLU-7.0.1-fix_version.patch | 387.00 B |
| SuperLU-fedora-make.inc.in | 1.16 KB |
| SuperLU-fix_example_builds.patch | 2.04 KB |
| SuperLU.spec | 11.80 KB |
| superlu-7.0.1.tar.gz | 2.40 MB |
| superlu-removemc64.patch | 71.59 KB |
Files 1–6 of 6
Component of
buildroots that installed this RPMNo Buildroots