[SciPy-User] solving large sparse linear system with Laplacian matrix

Robert Cimrman cimrman3@ntc.zcu...
Fri Oct 30 11:13:31 CDT 2009

josef.pktd@gmail.com wrote:
> On Fri, Oct 30, 2009 at 11:36 AM, Emmanuelle Gouillart
> <emmanuelle.gouillart@normalesup.org> wrote:
>>        Hello,
>>        thank you very much for all your answers!
>>        Josef, the scipy.sparse.linalg.factorized(A) tip works like a
>> charm for solving efficiently for all right hand sides -- and the memory
>> requirement is comparable to scipy.sparse.linalg.spsolve, so I guess the
>> factorized matrices are not very dense... I can solve my system with
>> N=10^6 in a few tens of seconds, which is really cool!
> If this works, you could also try
> scipy.sparse.linalg.splu
> Based on the description, it works for square matrices, so maybe it is more
> optimized for your case than factorized.
> There is also umfpack, but since I don't have it, I don't know what's in there.

FYI: both splu() and factorized() use umfpack, when available...


More information about the SciPy-User mailing list