| Commit message (Collapse) | Author | Age |
|
|
|
|
|
| |
unsupported/
(see the ML for details)
|
| |
|
|
|
|
| |
and remove the respective bit flags
|
|
|
|
| |
it never made very precise sense. but now does it still make any?
|
|
|
|
|
| |
- split sparse_basic unit test
- various fixes in sparse module
|
|
|
|
| |
* finally get ei_add_test right
|
|
|
|
|
| |
for both backends.
* extended a bit the sparse unit tests
|
| |
|
|
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 !
|