Posted by Scott Betts on September 05, 1997 at 14:32:19:
In Reply to: Re: Solving sparse, non-symmetric matrix without pivoting posted by Scott Betts on September 05, 1997 at 14:00:34:
: : I have a sparse, non-symmetric matrix that does not require
: : pivoting to solve. Is there software to solve this problem, or do I need to use something like SuperLU (that has the extra overhead of pivoting)?
: : Thanks,
: : Mike
: I've forwarded your question to the Lapack
: gurus. They should be able to help you. Their email
: address is firstname.lastname@example.org.
: Hope this helps!
They responded to you via email, but just in
case you didn't get it, or others have the same problem,
here is their reply:
The short answer is that there is a plethora of sparse matrix
packages available, and most of them are public domain. Do
you plan to use a direct method or an iterative method? Are
these large sparse problems? Will you be using a serial
algorithm or parallel? I'm not sure if any of the packages
allows for no pivoting. They have names like SPARSPAK, SPARSKIT,
You can access the NHSE homepage and do a search of the netlib
database for sparse packages:
And you can try looking at the URLs:
and refer to the entries for ARPACK and CAPSS.
You can also try searching for petsc, it's a parallel sparse
I would suggest contacting the authors of some of these
packages and see what they can suggest.
Hope this helps.