Searched refs:nnzPerCol (Results 1 - 3 of 3) sorted by relevance

/external/eigen/bench/
H A Dsparse_product.cpp107 for (int nnzPerCol = NNZPERCOL; nnzPerCol>1; nnzPerCol/=1.1)
111 fillMatrix2(nnzPerCol, rows, cols, sm1);
112 fillMatrix2(nnzPerCol, rows, cols, sm2);
118 std::cout << "Eigen Dense\t" << nnzPerCol << "%\n"; local
227 std::cout << "CSparse \t" << nnzPerCol << "%\n"; local
253 std::cout << "ublas\t" << nnzPerCol << "%\n"; local
266 std::cout << "GMM++ sparse\t" << nnzPerCol << "%\n"; local
297 std::cout << "MTL4\t" << nnzPerCol << " local
[all...]
H A Dspmv.cpp42 int nnzPerCol = 40; local
59 nnzPerCol = atoi(argv[i]+1);
80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
87 while (nnzPerCol>=4)
89 std::cout << "nnz: " << nnzPerCol << "\n"; local
91 fillMatrix2(nnzPerCol, rows, cols, sm);
224 if(nnzPerCol==1)
226 nnzPerCol -= nnzPerCol/2;
H A DBenchSparseUtil.h42 void fillMatrix2(int nnzPerCol, int rows, int cols, EigenSparseMatrix& dst) argument
44 // std::cout << "alloc " << nnzPerCol*cols << "\n";
45 dst.reserve(nnzPerCol*cols);
49 for(int i = 0; i < nnzPerCol; i++)

Completed in 831 milliseconds