From 86ccd99d8d9a87d03f2f327766a02cc13849b54d Mon Sep 17 00:00:00 2001 From: Gael Guennebaud Date: Wed, 5 Nov 2008 13:47:55 +0000 Subject: Several improvements in sparse module: * add a LDL^T factorization with solver using code from T. Davis's LDL library (LPGL2.1+) * various bug fixes in trianfular solver, matrix product, etc. * improve cmake files for the supported libraries * split the sparse unit test * etc. --- bench/sparse_cholesky.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'bench/sparse_cholesky.cpp') diff --git a/bench/sparse_cholesky.cpp b/bench/sparse_cholesky.cpp index 0a17848a0..5e07fac9b 100644 --- a/bench/sparse_cholesky.cpp +++ b/bench/sparse_cholesky.cpp @@ -70,7 +70,7 @@ void doEigen(const char* name, const EigenSparseSelfAdjointMatrix& sm1, int flag std::cout << ":\t" << timer.value() << endl; std::cout << " nnz: " << sm1.nonZeros() << " => " << chol.matrixL().nonZeros() << "\n"; - std::cout << "sparse\n" << chol.matrixL() << "%\n"; +// std::cout << "sparse\n" << chol.matrixL() << "%\n"; } int main(int argc, char *argv[]) @@ -118,7 +118,7 @@ int main(int argc, char *argv[]) if (!ei_isMuchSmallerThan(ei_abs(chol.matrixL()(i,j)), 0.1)) count++; std::cout << "dense: " << "nnz = " << count << "\n"; - std::cout << "dense:\n" << m1 << "\n\n" << chol.matrixL() << endl; +// std::cout << "dense:\n" << m1 << "\n\n" << chol.matrixL() << endl; } #endif -- cgit v1.2.3