Cool!
Looks good, I got a few comments but my phone wont let me comment.
Ill do this and merge later tonight.

Indeed the precision is satisfactory :)
On 18 Aug 2013 11:51, "Soumyajit De" <notifications@github.com> wrote:

> In tests/unit/mathematics/logdet/RationalApproximation_unittest.cc:
>
> > +
> > +	// clear all aggregators
> > +	aggregators.clear_array();
> > +
> > +#if EIGEN_VERSION_AT_LEAST(3,1,0)
> > +	// compute the trace of log(m) using Eigen3 that uses Schur-Parlett algorithm
> > +	Map<MatrixXd> eig_m(m.matrix, m.num_rows, m.num_cols);
> > +	float64_t trace_log_m=eig_m.log().diagonal().sum();
> > +#else
> > +	float64_t trace_log_m=-11.51292546497021618279;
> > +#endif // EIGEN_VERSION_AT_LEAST(3,1,0)
> > +
> > +#ifdef HAVE_ARPREC
> > +	EXPECT_NEAR(result, trace_log_m, 1E-13);
> > +#else
> > +	EXPECT_NEAR(result, trace_log_m, 1E-07);
>
> @karlnapf <https://github.com/karlnapf> this was satisfactory :) CG-M
> gives one step convergence for basis vectors and we get equally impressive
> accuracy as that of direct solvers. will add more tests.
>
> —
> Reply to this email directly or view it on GitHub<https://github.com/shogun-toolbox/shogun/pull/1437/files#r5831285>
> .
>