superlu

library for solving sparse linear equation systems

Index | math

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.

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

Library Dependencies