Re: [eigen] 3.2.0-beta1 released!

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.

Makes sense.

> 2. Are these factorizations threaded? if not are there any plans on adding
> threading support.

Not yet, and no real plan for that.

Thanks,

Sameer

Gael.

> Thanks,
> Sameer
>
>
>
>
>
> On Thu, Mar 7, 2013 at 12:36 AM, Gael Guennebaud <gael.guennebaud@xxxxxxxxx>
> wrote:
>>
>> Hi,
>>
>> I'm pleased to announce that Eigen 3.2.0-beta1 has been released
>> today, on March 7, 2013.
>>
>> The source archive is at:
>> http://bitbucket.org/eigen/eigen/get/3.2-beta1.tar.bz2
>>
>> This beta version introduces built-in LU and QR factorizations for
>> sparse matrices, a real-QZ factorization and a generalized eigen
>> solver for dense matrices, a new Ref<> class to ease writing generic
>> but non-template functions taking Eigen objects as arguments, wrappers
>> to the Metis and SuiteSparse QR libraries, as well as a couple of
>> minor enhancements and bug fixes.
>>
>> Complete changelog:
>> http://eigen.tuxfamily.org/index.php?title=ChangeLog#Eigen_3.2-beta1
>>
>> cheers,
>> Gael
>>
>>
>