Searched defs:cols (Results 101 - 125 of 357) sorted by relevance

1234567891011>>

/external/eigen/Eigen/src/Core/products/
H A DParallelizer.h86 void parallelize_gemm(const Functor& func, Index rows, Index cols, bool transpose) argument
96 func(0,rows, 0,cols);
108 return func(0,rows, 0,cols);
110 Index size = transpose ? cols : rows;
120 return func(0,rows, 0,cols);
126 std::swap(rows,cols);
128 Index blockCols = (cols / threads) & ~Index(0x3);
140 Index actualBlockCols = (i+1==threads) ? cols-c0 : blockCols;
146 func(0, cols, r0, actualBlockRows, info);
148 func(r0, actualBlockRows, 0,cols, inf
[all...]
/external/eigen/Eigen/src/Eigen2Support/
H A DMinor.h66 && col >= 0 && col < matrix.cols());
72 inline Index cols() const { return m_matrix.cols() - 1; } function in class:Eigen::Minor
/external/eigen/Eigen/src/IterativeLinearSolvers/
H A DBasicPreconditioners.h46 DiagonalPreconditioner(const MatType& mat) : m_invdiag(mat.cols())
52 Index cols() const { return m_invdiag.size(); } function in class:Eigen::DiagonalPreconditioner
63 m_invdiag.resize(mat.cols());
/external/eigen/Eigen/src/SparseCore/
H A DConservativeSparseSparseProduct.h25 Index cols = rhs.outerSize(); local
43 for (Index j=0; j<cols; ++j)
139 ColMajorMatrix resCol(lhs.rows(),rhs.cols());
154 RowMajorMatrix resRow(lhs.rows(), rhs.cols());
167 RowMajorMatrix resRow(lhs.rows(), rhs.cols());
179 RowMajorMatrix resRow(lhs.rows(), rhs.cols());
194 ColMajorMatrix resCol(lhs.rows(), rhs.cols());
207 ColMajorMatrix resCol(lhs.rows(), rhs.cols());
220 ColMajorMatrix resCol(lhs.rows(), rhs.cols());
233 RowMajorMatrix resRow(lhs.rows(),rhs.cols());
[all...]
H A DSparsePermutation.h53 inline int cols() const { return m_matrix.cols(); } function in struct:Eigen::internal::permut_sparsematrix_product_retval
59 SparseMatrix<Scalar,SrcStorageOrder,Index> tmp(m_matrix.rows(), m_matrix.cols());
79 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> tmp(m_matrix.rows(), m_matrix.cols());
H A DSparseSparseProductWithPruning.h29 Index cols = rhs.outerSize(); local
46 res.resize(cols, rows);
48 res.resize(rows, cols);
51 double ratioColRes = double(estimated_nnz_prod)/double(lhs.rows()*rhs.cols());
52 for (Index j=0; j<cols; ++j)
55 //double ratioColRes = (double(rhs.innerVector(j).nonZeros()) + double(lhs.nonZeros())/double(lhs.cols()))/double(lhs.rows());
90 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
104 SparseTemporaryType _res(res.rows(), res.cols());
117 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
137 // SparseTemporaryType _res(res.cols(), re
[all...]
/external/eigen/Eigen/src/misc/
H A DImage.h50 inline Index cols() const { return m_cols; } function in struct:Eigen::internal::image_retval_base
78 using Base::cols; \
H A DSparseSolve.h39 inline Index rows() const { return m_dec.cols(); }
40 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::sparse_solve_retval_base
55 int rhsCols = m_rhs.cols();
80 using Base::cols; \
109 inline Index rows() const { return m_dec.cols(); }
110 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::solve_retval_with_guess
/external/eigen/bench/
H A DbenchCholesky.cpp32 int cols = m.cols(); local
46 MatrixType a = MatrixType::Random(rows,cols);
53 int c = internal::random<int>(0,covMat.cols()-1);
92 gsl_matrix* gslCovMat = gsl_matrix_alloc(covMat.rows(),covMat.cols());
93 gsl_matrix* gslCopy = gsl_matrix_alloc(covMat.rows(),covMat.cols());
H A Dbench_reverse.cpp21 int cols = m.cols(); local
25 MatrixType a = MatrixType::Random(rows,cols);
26 MatrixType b = MatrixType::Random(rows,cols);
32 int c = internal::random<int>(0,cols-1);
50 std::cout << rows << " x " << cols << " \t"
H A Dsparse_dense_product.cpp55 int cols = SIZE; local
58 EigenSparseMatrix sm1(rows,cols);
59 DenseVector v1(cols), v2(cols);
65 //fillMatrix(density, rows, cols, sm1);
66 fillMatrix2(7, rows, cols, sm1);
72 DenseMatrix m1(rows,cols);
93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
106 // std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/float(m1.rows()*m1.cols())*100 << "%\n";
119 //GmmDynSparse gmmT3(rows,cols);
[all...]
H A Dsparse_lu.cpp75 int cols = SIZE; local
79 VectorX b = VectorX::Random(cols);
80 VectorX x = VectorX::Random(cols);
87 EigenSparseMatrix sm1(rows, cols);
88 fillMatrix(density, rows, cols, sm1);
96 DenseMatrix m1(rows,cols);
H A Dsparse_product.cpp53 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
56 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
101 int cols = SIZE; local
104 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols), sm3(rows,cols), sm4(rows,cols);
111 fillMatrix2(nnzPerCol, rows, cols, sm1);
112 fillMatrix2(nnzPerCol, rows, cols, sm
[all...]
H A Dsparse_randomsetter.cpp48 int cols = sm1.cols(); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
68 int cols = SIZE; local
71 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols);
74 nentries = rows*cols*density;
81 dummy = internal::random<int>(0,rows-1) + internal::random<int>(0,cols-1);
97 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
106 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols
[all...]
H A Dsparse_trisolver.cpp40 void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst) argument
42 dst.startFill(rows*cols*density);
43 for(int j = 0; j < cols; j++)
59 int cols = SIZE; local
63 EigenSparseTriMatrix sm1(rows,cols);
65 DenseVector b = DenseVector::Random(cols);
66 DenseVector x = DenseVector::Random(cols);
72 EigenSparseTriMatrix sm1(rows, cols);
73 fillMatrix(density, rows, cols, sm1);
81 DenseMatrix m1(rows,cols);
[all...]
/external/eigen/test/
H A Dadjoint.cpp69 Index cols = m.cols(); local
71 MatrixType m1 = MatrixType::Random(rows, cols),
72 m2 = MatrixType::Random(rows, cols),
73 m3(rows, cols),
101 c = internal::random<Index>(0, cols-1);
H A Ddiagonalmatrices.cpp24 Index cols = m.cols(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols);
30 RowVectorType rv1 = RowVectorType::Random(cols),
31 rv2 = RowVectorType::Random(cols);
56 Index j = internal::random<Index>(0, cols-1);
69 big.setZero(2*rows, 2*cols);
71 big.block(i,j,rows,cols) = m1;
72 big.block(i,j,rows,cols)
[all...]
/external/eigen/test/eigen2/
H A Deigen2_adjoint.cpp23 int cols = m.cols(); local
29 MatrixType m1 = MatrixType::Random(rows, cols),
30 m2 = MatrixType::Random(rows, cols),
31 m3(rows, cols),
32 mzero = MatrixType::Zero(rows, cols),
68 c = ei_random<int>(0, cols-1);
H A Deigen2_cholesky.cpp25 int cols = m.cols(); local
32 MatrixType a0 = MatrixType::Random(rows,cols);
34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
37 MatrixType a1 = MatrixType::Random(rows,cols);
93 SquareMatrixType symm = a0.block(0,0,rows,cols-4) * a0.block(0,0,rows,cols-4).adjoint();
H A Deigen2_cwiseop.cpp29 int cols = m.cols(); local
31 MatrixType m1 = MatrixType::Random(rows, cols),
32 m2 = MatrixType::Random(rows, cols),
33 m3(rows, cols),
34 m4(rows, cols),
35 mzero = MatrixType::Zero(rows, cols),
36 mones = MatrixType::Ones(rows, cols),
47 c = ei_random<int>(0, cols-1);
52 m3 = MatrixType::Constant(rows, cols, s
[all...]
H A Deigen2_eigensolver.cpp23 int cols = m.cols(); local
33 MatrixType a = MatrixType::Random(rows,cols);
34 MatrixType a1 = MatrixType::Random(rows,cols);
37 MatrixType b = MatrixType::Random(rows,cols);
38 MatrixType b1 = MatrixType::Random(rows,cols);
106 int cols = m.cols(); local
116 MatrixType a = MatrixType::Random(rows,cols);
117 MatrixType a1 = MatrixType::Random(rows,cols);
[all...]
H A Deigen2_nomalloc.cpp31 int cols = m.cols(); local
33 MatrixType m1 = MatrixType::Random(rows, cols),
34 m2 = MatrixType::Random(rows, cols),
35 m3(rows, cols),
36 mzero = MatrixType::Zero(rows, cols),
48 c = ei_random<int>(0, cols-1);
52 VERIFY_IS_APPROX(m1.cwise() * m1.block(0,0,rows,cols), m1.cwise() * m1);
H A Deigen2_sparse_product.cpp15 const int cols = ref.cols(); local
19 double density = std::max(8./(rows*cols), 0.01);
H A Deigen2_triangular.cpp21 int cols = m.cols(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols),
25 m3(rows, cols),
26 m4(rows, cols),
27 r1(rows, cols),
28 r2(rows, cols),
29 mzero = MatrixType::Zero(rows, cols),
30 mones = MatrixType::Ones(rows, cols),
[all...]
H A Deigen2_visitor.cpp17 int cols = p.cols(); local
21 m = MatrixType::Random(rows, cols);
29 for(int j = 0; j < cols; j++)

Completed in 290 milliseconds

1234567891011>>