|
|
Ublas : |
From: Michael Stevens (mail_at_[hidden])
Date: 2005-03-18 11:37:30
On Friday 18 March 2005 15:52, Andreas Klöckner wrote:
> Nope, not yet. Dr. Tim Davis (UMFPACK's author) has apparently devised a
> sparse Cholesky algorithm that can be implemented in ~80 lines of
> code. Might be worth looking at, even reimplementing, to avoid another
> kludgy binding.
Sparse Cholesky in 80 lines that certainly would be interesting!
> BTW, I believe that the patches in my original email fix important bugs
> in UBlas. They fix a crash and a compiler error. I wonder why no-one has
> at least said what they don't like about them.
Don't feel disheartened! Although many people are actively involved with uBLAS
there are on a couple who can make such commits. It is also always good to
have a second opinion on such changes. For myself I was also wondering if the
fix should prompt the documentation to be improved with regard to how
compressed_matrix is internally manipulated.
Have a good weekend also!
Michael
--
___________________________________
Michael Stevens Systems Engineering
34128 Kassel, Germany
Phone/Fax: +49 561 5218038
Navigation Systems, Estimation and
Bayesian Filtering
http://bayesclasses.sf.net
___________________________________