| Re: [eigen] 3.2.0-beta1 released! |
[ Thread Index |
Date Index
| More lists.tuxfamily.org/eigen Archives
]
- To: eigen <eigen@xxxxxxxxxxxxxxxxxxx>
- Subject: Re: [eigen] 3.2.0-beta1 released!
- From: Gael Guennebaud <gael.guennebaud@xxxxxxxxx>
- Date: Thu, 7 Mar 2013 18:49:03 +0100
- Cc: Keir Mierle <mierle@xxxxxxxxx>
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=x-received:mime-version:in-reply-to:references:from:date:message-id :subject:to:cc:content-type; bh=Svx2vb7fA5Lw2ceevg+5XK2FK8ukc8ngTj2INZ/vnRY=; b=zWPBpAWJSSDjj3kta9vjGhYzJL0qjX7MCKtzAAuJGyxTg/Nxt9McSgXEO32/cNXL1Z eUKasG96vpLeU2Of7bDL8OoWV//E/uPob0mE7/jx6w/YTqFiCZSy1fE0Cxu5VwIFBsBQ TTbLc6kTuG8DgKP+TVdt00W+tEuAdrozZHlUfAh+d8jusGuVxC3eQzK0mJ0QXB0waHy2 OHrEEtzykJpSISpyfyk8gCJ0OAS4KiJU6GSbjcD1JVMCwVxkxkvDQqR1bhxo7AJnRvI5 7ncwFyAVyL5wsowHDCSzeMjMqxUxWCAvZ/TvDfc3BVBQGFiRjsylaGMnMseh7ANup5Rq iLVg==
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
http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/table_of_contents.html).
gael