Analyzed about 21 hours ago
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.
169K
lines of code
0
current contributors
25 days
since last commit
0
users on Open Hub