Summary: A set of subroutines to solve a sparse linear system A*X=B

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.
SuperLU provides functionality for both real and complex matrices, in both
single and double precision.

URL: https://github.com/xiaoyeli/superlu
License: BSD and GPLv2+

Maintainer: daviddavid