A SuperLU object can be constructed to solve
a SparseGenColLinSOE object. It obtains the solution by making calls on the
the SuperLU library developed at UC Berkeley by Prof. James Demmel,
Xiaoye S. Li and John R. Gilbert.
The SuperLU library contains a set of subroutines to solve a sparse
linear system AX=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 and a number of ordering schemes are provided.