aboutsummaryrefslogtreecommitdiffhomepage
path: root/Eigen/src/Sparse/UmfPackSupport.h
Commit message (Collapse)AuthorAge
* - add diagonal * sparse product as an expressionGravatar Gael Guennebaud2009-02-09
| | | | | - split sparse_basic unit test - various fixes in sparse module
* * the Upper->UpperTriangular changeGravatar Benoit Jacob2008-12-20
| | | | * finally get ei_add_test right
* * sparse LU: add extraction of L,U,P, and Q, as well as determinantGravatar Gael Guennebaud2008-10-20
| | | | | for both backends. * extended a bit the sparse unit tests
* UmfPack support: add support for complex<double>Gravatar Gael Guennebaud2008-10-20
|
* sparse module: add support for umfpack, the sparse direct LUGravatar Gael Guennebaud2008-10-19
solver from suitesparse (as cholmod). It seems to be even faster than SuperLU and it was much simpler to interface ! Well, the factorization is faster, but for the solve part, SuperLU is quite faster. On the other hand the solve part represents only a fraction of the whole procedure. Moreover, I bench random matrices that does not represents real cases, and I'm not sure at all I use both libraries with their best settings !