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.
- RPM
- SuperLU-7.0.1-1.fc42.x86_64.rpm
- Summary
- Subroutines to solve sparse linear systems
- URL
- https://portal.nersc.gov/project/sparse/superlu/
- Group
- Unspecified
- License
- BSD-2-Clause AND GPL-2.0-or-later
- Source
-
SuperLU-7.0.1-1.fc42.src.rpm
- Checksum
- 4175cf46c4b18a6afa30ad1962752c65054a540a217bbd2ef2d1b73370b882b2
- Signing Signature
- RSA/SHA512, Sun 05 Apr 2026 06:29:09 PM AEST, Key ID d760880122ab8392
- Build Date
- 2025/05/19 01:45:53
- Requires
- Provides
-
SuperLU = 7.0.1-1.fc42
SuperLU(x86-64) = 7.0.1-1.fc42
libsuperlu.so.7