5 Commits

Author	SHA1	Message	Date
Gael Guennebaud	a9688f0b71	- add diagonal * sparse product as an expression ... - split sparse_basic unit test - various fixes in sparse module	2009-02-09 09:59:30 +00:00
Benoit Jacob	9e00d94543	* the Upper->UpperTriangular change ... * finally get ei_add_test right	2008-12-20 13:36:12 +00:00
Gael Guennebaud	5066fe8bbe	* sparse LU: add extraction of L,U,P, and Q, as well as determinant ... for both backends. * extended a bit the sparse unit tests	2008-10-20 17:03:09 +00:00
Gael Guennebaud	f44316e5f8	UmfPack support: add support for complex<double>	2008-10-20 00:39:11 +00:00
Gael Guennebaud	3a231c2349	sparse module: add support for umfpack, the sparse direct LU ... 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 !	2008-10-19 22:44:21 +00:00