devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Clang-format tests, examples, libraries, benchmarks, etc.

Browse Source
This commit is contained in:
Antonio Sánchez
2023-12-05 21:22:55 +00:00
committed by Rasmus Munk Larsen
parent 3252ecc7a4
commit 46e9cdb7fe
876 changed files with 33453 additions and 37795 deletions
Download Patch File Download Diff File Expand all files Collapse all files

165
bench/sparse_trisolver.cpp
View File

@@ -1,8 +1,9 @@
//g++ -O3 -g0 -DNDEBUG sparse_product.cpp -I.. -I/home/gael/Coding/LinearAlgebra/mtl4/ -DDENSITY=0.005 -DSIZE=10000 && ./a.out
//g++ -O3 -g0 -DNDEBUG sparse_product.cpp -I.. -I/home/gael/Coding/LinearAlgebra/mtl4/ -DDENSITY=0.05 -DSIZE=2000 && ./a.out
// -DNOGMM -DNOMTL
// -I /home/gael/Coding/LinearAlgebra/CSparse/Include/ /home/gael/Coding/LinearAlgebra/CSparse/Lib/libcsparse.a
// g++ -O3 -g0 -DNDEBUG sparse_product.cpp -I.. -I/home/gael/Coding/LinearAlgebra/mtl4/ -DDENSITY=0.005 -DSIZE=10000 &&
// ./a.out g++ -O3 -g0 -DNDEBUG sparse_product.cpp -I.. -I/home/gael/Coding/LinearAlgebra/mtl4/ -DDENSITY=0.05
// -DSIZE=2000 && ./a.out
// -DNOGMM -DNOMTL
// -I /home/gael/Coding/LinearAlgebra/CSparse/Include/ /home/gael/Coding/LinearAlgebra/CSparse/Lib/libcsparse.a
#ifndef SIZE
#define SIZE 10000
@@ -26,163 +27,158 @@
#define NBTRIES 10
#endif
#define BENCH(X) \
timer.reset(); \
for (int _j=0; _j<NBTRIES; ++_j) { \
timer.start(); \
for (int _k=0; _k<REPEAT; ++_k) { \
X \
} timer.stop(); }
#define BENCH(X) \
timer.reset(); \
for (int _j = 0; _j < NBTRIES; ++_j) { \
timer.start(); \
for (int _k = 0; _k < REPEAT; ++_k) { \
X \
} \
timer.stop(); \
}
typedef SparseMatrix<Scalar,UpperTriangular> EigenSparseTriMatrix;
typedef SparseMatrix<Scalar,RowMajorBit|UpperTriangular> EigenSparseTriMatrixRow;
typedef SparseMatrix<Scalar, UpperTriangular> EigenSparseTriMatrix;
typedef SparseMatrix<Scalar, RowMajorBit | UpperTriangular> EigenSparseTriMatrixRow;
void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst)
{
dst.startFill(rows*cols*density);
for(int j = 0; j < cols; j++)
{
for(int i = 0; i < j; i++)
{
Scalar v = (internal::random<float>(0,1) < density) ? internal::random<Scalar>() : 0;
if (v!=0)
dst.fill(i,j) = v;
void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix &dst) {
dst.startFill(rows * cols * density);
for (int j = 0; j < cols; j++) {
for (int i = 0; i < j; i++) {
Scalar v = (internal::random<float>(0, 1) < density) ? internal::random<Scalar>() : 0;
if (v != 0) dst.fill(i, j) = v;
}
dst.fill(j,j) = internal::random<Scalar>();
dst.fill(j, j) = internal::random<Scalar>();
}
dst.endFill();
}
int main(int argc, char *argv[])
{
int main(int argc, char *argv[]) {
int rows = SIZE;
int cols = SIZE;
float density = DENSITY;
BenchTimer timer;
#if 1
EigenSparseTriMatrix sm1(rows,cols);
typedef Matrix<Scalar,Dynamic,1> DenseVector;
#if 1
EigenSparseTriMatrix sm1(rows, cols);
typedef Matrix<Scalar, Dynamic, 1> DenseVector;
DenseVector b = DenseVector::Random(cols);
DenseVector x = DenseVector::Random(cols);
bool densedone = false;
for (float density = DENSITY; density>=MINDENSITY; density*=0.5)
{
for (float density = DENSITY; density >= MINDENSITY; density *= 0.5) {
EigenSparseTriMatrix sm1(rows, cols);
fillMatrix(density, rows, cols, sm1);
// dense matrices
#ifdef DENSEMATRIX
if (!densedone)
{
// dense matrices
#ifdef DENSEMATRIX
if (!densedone) {
densedone = true;
std::cout << "Eigen Dense\t" << density*100 << "%\n";
DenseMatrix m1(rows,cols);
Matrix<Scalar,Dynamic,Dynamic,Dynamic,Dynamic,RowMajorBit> m2(rows,cols);
std::cout << "Eigen Dense\t" << density * 100 << "%\n";
DenseMatrix m1(rows, cols);
Matrix<Scalar, Dynamic, Dynamic, Dynamic, Dynamic, RowMajorBit> m2(rows, cols);
eiToDense(sm1, m1);
m2 = m1;
BENCH(x = m1.marked<UpperTriangular>().solveTriangular(b);)
std::cout << " colmajor^-1 * b:\t" << timer.value() << endl;
// std::cerr << x.transpose() << "\n";
// std::cerr << x.transpose() << "\n";
BENCH(x = m2.marked<UpperTriangular>().solveTriangular(b);)
std::cout << " rowmajor^-1 * b:\t" << timer.value() << endl;
// std::cerr << x.transpose() << "\n";
// std::cerr << x.transpose() << "\n";
}
#endif
#endif
// eigen sparse matrices
{
std::cout << "Eigen sparse\t" << density*100 << "%\n";
std::cout << "Eigen sparse\t" << density * 100 << "%\n";
EigenSparseTriMatrixRow sm2 = sm1;
BENCH(x = sm1.solveTriangular(b);)
std::cout << " colmajor^-1 * b:\t" << timer.value() << endl;
// std::cerr << x.transpose() << "\n";
// std::cerr << x.transpose() << "\n";
BENCH(x = sm2.solveTriangular(b);)
std::cout << " rowmajor^-1 * b:\t" << timer.value() << endl;
// std::cerr << x.transpose() << "\n";
// std::cerr << x.transpose() << "\n";
// x = b;
// BENCH(sm1.inverseProductInPlace(x);)
// std::cout << " colmajor^-1 * b:\t" << timer.value() << " (inplace)" << endl;
// std::cerr << x.transpose() << "\n";
//
// x = b;
// BENCH(sm2.inverseProductInPlace(x);)
// std::cout << " rowmajor^-1 * b:\t" << timer.value() << " (inplace)" << endl;
// std::cerr << x.transpose() << "\n";
// x = b;
// BENCH(sm1.inverseProductInPlace(x);)
// std::cout << " colmajor^-1 * b:\t" << timer.value() << " (inplace)" << endl;
// std::cerr << x.transpose() << "\n";
//
// x = b;
// BENCH(sm2.inverseProductInPlace(x);)
// std::cout << " rowmajor^-1 * b:\t" << timer.value() << " (inplace)" << endl;
// std::cerr << x.transpose() << "\n";
}
// CSparse
#ifdef CSPARSE
// CSparse
#ifdef CSPARSE
{
std::cout << "CSparse \t" << density*100 << "%\n";
std::cout << "CSparse \t" << density * 100 << "%\n";
cs *m1;
eiToCSparse(sm1, m1);
BENCH(x = b; if (!cs_lsolve (m1, x.data())){std::cerr << "cs_lsolve failed\n"; break;}; )
BENCH(x = b; if (!cs_lsolve(m1, x.data())) {
std::cerr << "cs_lsolve failed\n";
break;
};)
std::cout << " colmajor^-1 * b:\t" << timer.value() << endl;
}
#endif
#endif
// GMM++
#ifndef NOGMM
// GMM++
#ifndef NOGMM
{
std::cout << "GMM++ sparse\t" << density*100 << "%\n";
GmmSparse m1(rows,cols);
std::cout << "GMM++ sparse\t" << density * 100 << "%\n";
GmmSparse m1(rows, cols);
gmm::csr_matrix<Scalar> m2;
eiToGmm(sm1, m1);
gmm::copy(m1,m2);
gmm::copy(m1, m2);
std::vector<Scalar> gmmX(cols), gmmB(cols);
Map<Matrix<Scalar,Dynamic,1> >(&gmmX[0], cols) = x;
Map<Matrix<Scalar,Dynamic,1> >(&gmmB[0], cols) = b;
Map<Matrix<Scalar, Dynamic, 1> >(&gmmX[0], cols) = x;
Map<Matrix<Scalar, Dynamic, 1> >(&gmmB[0], cols) = b;
gmmX = gmmB;
BENCH(gmm::upper_tri_solve(m1, gmmX, false);)
std::cout << " colmajor^-1 * b:\t" << timer.value() << endl;
// std::cerr << Map<Matrix<Scalar,Dynamic,1> >(&gmmX[0], cols).transpose() << "\n";
// std::cerr << Map<Matrix<Scalar,Dynamic,1> >(&gmmX[0], cols).transpose() << "\n";
gmmX = gmmB;
BENCH(gmm::upper_tri_solve(m2, gmmX, false);)
timer.stop();
std::cout << " rowmajor^-1 * b:\t" << timer.value() << endl;
// std::cerr << Map<Matrix<Scalar,Dynamic,1> >(&gmmX[0], cols).transpose() << "\n";
// std::cerr << Map<Matrix<Scalar,Dynamic,1> >(&gmmX[0], cols).transpose() << "\n";
}
#endif
#endif
// MTL4
#ifndef NOMTL
// MTL4
#ifndef NOMTL
{
std::cout << "MTL4\t" << density*100 << "%\n";
MtlSparse m1(rows,cols);
MtlSparseRowMajor m2(rows,cols);
std::cout << "MTL4\t" << density * 100 << "%\n";
MtlSparse m1(rows, cols);
MtlSparseRowMajor m2(rows, cols);
eiToMtl(sm1, m1);
m2 = m1;
mtl::dense_vector<Scalar> x(rows, 1.0);
mtl::dense_vector<Scalar> b(rows, 1.0);
BENCH(x = mtl::upper_trisolve(m1,b);)
BENCH(x = mtl::upper_trisolve(m1, b);)
std::cout << " colmajor^-1 * b:\t" << timer.value() << endl;
// std::cerr << x << "\n";
// std::cerr << x << "\n";
BENCH(x = mtl::upper_trisolve(m2,b);)
BENCH(x = mtl::upper_trisolve(m2, b);)
std::cout << " rowmajor^-1 * b:\t" << timer.value() << endl;
// std::cerr << x << "\n";
// std::cerr << x << "\n";
}
#endif
#endif
std::cout << "\n\n";
}
#endif
#endif
#if 0
#if 0
// bench small matrices (in-place versus return bye value)
{
timer.reset();
@@ -213,8 +209,7 @@ int main(int argc, char *argv[])
}
std::cout << "4x4 IP :\t" << timer.value() << endl;
}
#endif
#endif
return 0;
}