Re: [eigen] SimpliciaLDLT::analyzePattern_preordered

[Sameer Agarwal <sameeragarwal@xxxxxxxxxx>]

Gael,

Is there an eta for a new release for Eigen in which this code will be released?

Without this, there is a significant performance regression in Ceres.

Thanks,

Sameer

On Sun, Jul 20, 2014 at 7:49 AM, Sameer Agarwal <sameeragarwal@xxxxxxxxxx> wrote:

Thank you Gael. Much appreciated. 

Sameer

On Sun, Jul 20, 2014 at 5:24 AM, Gael Guennebaud <gael.guennebaud@xxxxxxxxx> wrote:

Done in the devel branch: https://bitbucket.org/eigen/eigen/commits/e29d27b8aebf/

Gaël.

On Sun, Jul 20, 2014 at 12:11 AM, Sameer Agarwal <sameeragarwal@xxxxxxxxxx> wrote:

Hi Gael,

The NaturalOrdering template parameter will do just fine. Since my matrix is generally speaking already permuted.

Thanks,

Sameer

On Sat, Jul 19, 2014 at 1:31 PM, Gael Guennebaud <gael.guennebaud@xxxxxxxxx> wrote:

Hi,

we should rather add a third template parameter to let the user choose the ordering method, currently :AMDOrdering<> or NaturalOrdering<> as in SparseQR and SparseLU. Perhaps we could also add a "PredefinedOrdering<>" class to ease the use of a custom precomputed ordering. Meanwhile, it's probably ok to use this undocumented method as a temporary workaround.

cheers,

Gaël.

On Fri, Jul 18, 2014 at 4:56 PM, Sameer Agarwal <sameeragarwal@xxxxxxxxxx> wrote:

Hi,

Is there a reason why analyzePattern_preordered is not documented in the public API for SimplicialLDLT?

There are situations in which, an ordering is computed via some indirect means or the natural ordering of the matrix is good enough that we do not want to spend time finding an ordering all over again. In such cases, this is a very useful method to have.

Is it okay to depend on this method in user code?

Thanks,

Sameer