SuperLU - Subroutines to solve sparse linear systems
| Website: | https://portal.nersc.gov/project/sparse/superlu/ |
|---|---|
| License: | BSD and GPLv2+ |
| Vendor: | Alcance Libre, Inc. |
- 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.
Packages
| SuperLU-5.2.2-2.aldos.i686 [173 KiB] |
Changelog
by Joel Barrios (2022-07-10):
- Rebuild with GCC 8.5. |