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.
You can contact the maintainers of this package via email at
SuperLU dash maintainers at fedoraproject dot org.