Laplacians.jl icon indicating copy to clipboard operation
Laplacians.jl copied to clipboard

General solver for SDD matrices

Open mengxixi opened this issue 5 years ago • 2 comments

In the documentation here it says it's possible to write a wrapper for general SDD matrices that don't necessarily satisfy the M-matrix condition, given that the doc I'm referring to is quite old, I was wondering has this been implemented yet? If not, are there plans for it in the future? Thanks!

mengxixi avatar Jul 13 '19 23:07 mengxixi

That is a good question. We never implemented one. If you need that, I could easily write one. The easy version would be a little inefficient, but it need to be too bad.

Perhaps the reason I never wrote one is that the right way of doing it depends on the sort of problems to be solved. Will your systems be positive definite?

danspielman avatar Jul 18 '19 21:07 danspielman

Not necessarily, but if there is an easy and efficient implementation that works only for positive definite systems it would still be great, as we can afford to increase the diagonal slightly to make it PD (our systems are positive semidefinite). I guess it could just be a wrapper around the approxchol_sddm solver? This is the one I'm mainly using at the moment.

mengxixi avatar Jul 18 '19 23:07 mengxixi