Registered Member
|
Hi All,
this is similar to Naval's question here: viewtopic.php?f=74&t=120694 My setting: I have a non-quadratic sparse matrix (N+1xN) with rank N and want to solve it. Now I am left with SparseQR as the other solvers require a quadratic matrix, right? I use
and then
gives no compiler warning, but a very similar Assertion failed during the run:
If I compile in release mode I get a segfault... Unfortunately, I cannot find enough info to solve this on my own, so here's my cry for help! addendum: If I change the Ordering method to NaturalOdering, (which seems kind of justified as the coefficients in my matrix are all in a tight range and there are similarly many coefficients in one column) analyzePattern() runs fine, but I get a problem from within factorize()
Still, there seems to be a problem with a matrix having more rows than columns... thanks a bunch Hecke |
Moderator
|
Can you try with the latest "stable" branch (https://bitbucket.org/eigen/eigen/get/3.2.tar.bz2) or even the devel branch to make sure this issue has not been solved already. Otherwise, please save you matrix to a zipped file so that we can check what's going wrong.
|
Registered Member
|
Hey Ggael,
I was really hoping for you to chime in. Thanks a lot! I used the latest stable version, and trying the unstable one leads to the same error. You find the matrix producing the error here: http://www.nld.ds.mpg.de/~hecke/archiv/phi_matrix.zip If I can be of any help, please let me know. cheers Hecke |
Moderator
|
hm, it works very well for me.
Perhaps try to call phi_matrix_.makeCompress() before passing it to SparseQR?
|
Registered Member
|
Great, Ggael,
that did the trick. you are my hero! thanks. Hecke |
Moderator
|
|
Registered Member
|
Yep, now it is hard to miss
thanks again Hecke |
Registered users: Bing [Bot], claydoh, Google [Bot], rblackwell, Yahoo [Bot]