Re: [eigen] 3.2.0-beta1 released!

[ Thread Index | Date Index | More Archives ]

On Thu, Mar 7, 2013 at 6:30 PM, Sameer Agarwal <sameeragarwal@xxxxxxxxxx> wrote:
>> Rewriting the sparse Cholesky algorithm itself is not really
>> difficult. The main issue actually comes from the related approximate
>> minimum degree ordering algorithm which is LGPL too, and not funny to
>> re-implement. And a sparse cholesky solver without a good reordering
>> algorithm is quite useless.

an idea would be to connect to the boost graph library that include
various ordering algorithms (see section 22.12


Mail converted by MHonArc 2.6.19+