Registered Member
|
Dear All,
I'm trying to solve the sparse matrix with SuperLU backend. I'm using the test function very similar to one in this post viewtopic.php?f=74&t=84904&p=142935&hilit=superlu#p142935
Here is the result:
Eigen sparse tests are passed, so the SuperLU itself is installed correctly and works. I can't figure out what I'm doing wrong... |
Registered Member
|
I used SuperLU myself, the current implementation is indeed far from being finished.
Though: I could not reproduce your problem. My settings: I use double, not float. I do not factorize using the constructor, but using
I can also confirm that the succeeded() function does not work for the external bindings. Where the binding is quite buggy is memory consumption. You can use SuperLU only once during application lifetime when using large matrices because every call of 'compute(A)' will add new space the SuperLU buffer. On the mailing list I posted a code for the MUMPS backend some weeks ago. Maybe you check this out? Best regards Sebastian |
Registered Member
|
It seems that my problem is in the random matrix - sometimes it works, sometimes does not. However, I still can't get it working with double...
I'll probably try suggested MUMPS backend. |
Registered Member
|
I think we should eliminate the possibility that RandomSetter has a bug.
Did you consider to fill your matrix using DynamicSparseMatrix? When filling a matrix in random order, I usually use that one (you can directly add coefficients using mat.coeffRef(i,j)+=val) and then I convert it to a SparseMatrix. It is also very fast! |
Registered users: abc72656, Bing [Bot], daret, Google [Bot], Sogou [Bot], Yahoo [Bot]