library for solving sparse linear equation 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.

Maintainer: The OpenBSD ports mailing-list <ports@openbsd.org>

WWW: https://portal.nersc.gov/project/sparse/superlu/
