GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-06-04 18:54:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

update cholesky benchmark

Browse Source
This commit is contained in:
Gael Guennebaud 2009-02-03 19:05:10 +00:00
parent b9a82be727
commit b0dd22cc72
1 changed files with 21 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

39
bench/benchCholesky.cpp
View File

@ -9,7 +9,7 @@
// -DSCALAR=double // -DSCALAR=double
#include <Eigen/Array> #include <Eigen/Array>
#include <Eigen/LLT> #include <Eigen/Cholesky>
#include <bench/BenchUtil.h> #include <bench/BenchUtil.h>
using namespace Eigen; using namespace Eigen;
@ -76,7 +76,8 @@ __attribute__ ((noinline)) void benchLLT(const MatrixType& m)
else else
std::cout << "fixed "; std::cout << "fixed ";
std::cout << covMat.rows() << " \t" std::cout << covMat.rows() << " \t"
<< (timerNoSqrt.value() * REPEAT) / repeats << "s \t" << (timerNoSqrt.value() * REPEAT) / repeats << "s "
<< "(" << 1e-6 * cost*repeats/timerNoSqrt.value() << " MFLOPS)\t"
<< (timerSqrt.value() * REPEAT) / repeats << "s " << (timerSqrt.value() * REPEAT) / repeats << "s "
<< "(" << 1e-6 * cost*repeats/timerSqrt.value() << " MFLOPS)\n"; << "(" << 1e-6 * cost*repeats/timerSqrt.value() << " MFLOPS)\n";
@ -116,25 +117,25 @@ __attribute__ ((noinline)) void benchLLT(const MatrixType& m)
int main(int argc, char* argv[]) int main(int argc, char* argv[])
{ {
const int dynsizes[] = {/*4,6,8,12,16,24,32,49,64,67,128,129,130,131,132,*/256,257,258,259,260,512,900,0}; // const int dynsizes[] = {/*4,6,8,12,16,24,32,49,64,67,128,129,130,131,132,*/256,257,258,259,260,512,900,0};
std::cout << "size no sqrt standard"; std::cout << "size no sqrt standard";
#ifdef BENCH_GSL // #ifdef BENCH_GSL
std::cout << " GSL (standard + double + ATLAS) "; // std::cout << " GSL (standard + double + ATLAS) ";
#endif // #endif
std::cout << "\n"; std::cout << "\n";
//
// for (uint i=0; dynsizes[i]>0; ++i)
// benchLLT(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i]));
for (uint i=0; dynsizes[i]>0; ++i) benchLLT(Matrix<Scalar,2,2>());
benchLLT(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i])); benchLLT(Matrix<Scalar,3,3>());
benchLLT(Matrix<Scalar,4,4>());
// benchLLT(Matrix<Scalar,2,2>()); benchLLT(Matrix<Scalar,5,5>());
// benchLLT(Matrix<Scalar,3,3>()); benchLLT(Matrix<Scalar,6,6>());
// benchLLT(Matrix<Scalar,4,4>()); benchLLT(Matrix<Scalar,7,7>());
// benchLLT(Matrix<Scalar,5,5>()); benchLLT(Matrix<Scalar,8,8>());
// benchLLT(Matrix<Scalar,6,6>()); benchLLT(Matrix<Scalar,12,12>());
// benchLLT(Matrix<Scalar,7,7>()); benchLLT(Matrix<Scalar,16,16>());
// benchLLT(Matrix<Scalar,8,8>());
// benchLLT(Matrix<Scalar,12,12>());
// benchLLT(Matrix<Scalar,16,16>());
return 0; return 0;
} }