Searched defs:rows (Results 126 - 150 of 469) sorted by relevance

1234567891011>>

/external/eigen/bench/
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,
57 // // lhs._valuePtr(), lhs.rows(), DST, dst_stride);
100 int rows = 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, col
[all...]
H A Dsparse_randomsetter.cpp47 int rows = sm1.rows(); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
67 int rows = 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
[all...]
H A Dsparse_trisolver.cpp40 void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst) argument
42 dst.startFill(rows*cols*density);
58 int rows = SIZE; local
63 EigenSparseTriMatrix sm1(rows,cols);
72 EigenSparseTriMatrix sm1(rows, cols);
73 fillMatrix(density, rows, cols, sm1);
81 DenseMatrix m1(rows,cols);
82 Matrix<Scalar,Dynamic,Dynamic,Dynamic,Dynamic,RowMajorBit> m2(rows,cols);
138 GmmSparse m1(rows,cols);
163 MtlSparse m1(rows,col
[all...]
/external/eigen/test/
H A Dadjoint.cpp68 Index rows = m.rows(); local
71 MatrixType m1 = MatrixType::Random(rows, cols),
72 m2 = MatrixType::Random(rows, cols),
73 m3(rows, cols),
74 square = SquareMatrixType::Random(rows, rows);
75 VectorType v1 = VectorType::Random(rows),
76 v2 = VectorType::Random(rows),
77 v3 = VectorType::Random(rows),
[all...]
H A Ddiagonalmatrices.cpp23 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols);
28 VectorType v1 = VectorType::Random(rows),
29 v2 = VectorType::Random(rows);
50 sq_m1.block(0,0,rows,rows) = ldm1;
55 Index i = internal::random<Index>(0, rows-1);
69 big.setZero(2*rows,
[all...]
H A Dinteger_types.cpp27 Index rows = m.rows(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
61 Index rows = m.rows(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, col
[all...]
H A Dlu.cpp21 Index rows, cols, cols2; local
24 rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE);
28 rows = MatrixType::RowsAtCompileTime;
51 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
54 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1));
56 MatrixType m1(rows, cols), m3(rows, cols2);
58 createRandomPIMatrixOfRank(rank, rows, cols, m1);
68 MatrixType u(rows,col
133 Index rows = internal::random<Index>(1,4); local
[all...]
H A Dmapped_matrix.cpp52 Index rows = m.rows(), cols = m.cols(), size = rows*cols; local
62 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
63 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>(array1, rows, cols);
64 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols);
65 MatrixType ma1 = Map<MatrixType>(array1, rows, col
[all...]
H A Dpermutationmatrices.cpp26 Index rows = m.rows(); local
29 MatrixType m_original = MatrixType::Random(rows,cols);
31 randomPermutationVector(lv, rows);
38 for (int i=0; i<rows; i++)
56 randomPermutationVector(lv2, rows);
64 identityp.setIdentity(rows);
84 if(rows>1 && cols>1)
87 Index i = internal::random<Index>(0, rows-1);
89 do j = internal::random<Index>(0, rows
[all...]
H A Dproduct.h34 Index rows = m.rows(); local
39 MatrixType m1 = MatrixType::Random(rows, cols),
40 m2 = MatrixType::Random(rows, cols),
41 m3(rows, cols);
43 identity = RowSquareMatrixType::Identity(rows, rows),
44 square = RowSquareMatrixType::Random(rows, rows),
45 res = RowSquareMatrixType::Random(rows, row
[all...]
H A Dproduct_selfadjoint.cpp21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
27 VectorType v1 = VectorType::Random(rows),
28 v2 = VectorType::Random(rows),
29 v3(rows);
30 RowVectorType r1 = RowVectorType::Random(rows),
31 r2 = RowVectorType::Random(rows);
32 RhsMatrixType m4 = RhsMatrixType::Random(rows,1
[all...]
H A Dproduct_syrk.cpp21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
26 m3 = MatrixType::Random(rows, cols);
27 RMatrixType rm2 = MatrixType::Random(rows, cols);
29 Rhs1 rhs1 = Rhs1::Random(internal::random<int>(1,320), cols); Rhs1 rhs11 = Rhs1::Random(rhs1.rows(), cols);
30 Rhs2 rhs2 = Rhs2::Random(rows, internal::random<int>(1,320)); Rhs2 rhs22 = Rhs2::Random(rows, rhs2.cols());
31 Rhs3 rhs3 = Rhs3::Random(internal::random<int>(1,320), rows);
[all...]
H A Dqr.cpp17 Index rows = m.rows(); local
23 MatrixType a = MatrixType::Random(rows,cols);
H A Dqr_colpivoting.cpp18 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols2 = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
H A Dqr_fullpivoting.cpp18 Index rows = internal::random<Index>(20,200), cols = internal::random<int>(20,200), cols2 = internal::random<int>(20,200); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
38 for(int i = 0; i < rows; i++) for(int j = 0; j < cols; j++) if(i>j) r(i,j) = Scalar(0);
H A Dredux.cpp18 Index rows = m.rows(); local
21 MatrixType m1 = MatrixType::Random(rows, cols);
25 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + RealScalar(0.2) * m1;
27 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows, cols).sum(), Scalar(1));
28 VERIFY_IS_APPROX(MatrixType::Ones(rows, cols).sum(), Scalar(float(rows*cols))); // the float() here to shut up excessive MSVC warning about int->complex conversion being lossy
31 for(int i = 0; i < rows; i++)
38 const Scalar mean = s/Scalar(RealScalar(rows*cols));
47 Index r0 = internal::random<Index>(0,rows
[all...]
/external/eigen/test/eigen2/
H A Deigen2_adjoint.cpp22 int rows = m.rows(); local
29 MatrixType m1 = MatrixType::Random(rows, cols),
30 m2 = MatrixType::Random(rows, cols),
31 m3(rows, cols),
32 mzero = MatrixType::Zero(rows, cols),
33 identity = SquareMatrixType::Identity(rows, rows),
34 square = SquareMatrixType::Random(rows, rows);
[all...]
H A Deigen2_cholesky.cpp24 int rows = m.rows(); local
32 MatrixType a0 = MatrixType::Random(rows,cols);
33 VectorType vecB = VectorType::Random(rows), vecX(rows);
34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
37 MatrixType a1 = MatrixType::Random(rows,cols);
52 VectorType vecX(rows), _vecX, _vecB;
91 if (rows>
[all...]
H A Deigen2_cwiseop.cpp28 int rows = m.rows(); 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),
38 ::Identity(rows, rows),
[all...]
H A Deigen2_eigensolver.cpp22 int rows = m.rows(); 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);
56 gEval = GslTraits<RealScalar>::createVector(rows);
105 int rows = m.rows(); local
116 MatrixType a = MatrixType::Random(rows,col
[all...]
H A Deigen2_nomalloc.cpp30 int rows = m.rows(); local
33 MatrixType m1 = MatrixType::Random(rows, cols),
34 m2 = MatrixType::Random(rows, cols),
35 m3(rows, cols),
36 mzero = MatrixType::Zero(rows, cols),
38 ::Identity(rows, rows),
40 ::Random(rows, rows);
[all...]
H A Deigen2_sparse_product.cpp14 const int rows = ref.rows(); local
19 double density = std::max(8./(rows*cols), 0.01);
25 DenseMatrix refMat2 = DenseMatrix::Zero(rows, rows);
26 DenseMatrix refMat3 = DenseMatrix::Zero(rows, rows);
27 DenseMatrix refMat4 = DenseMatrix::Zero(rows, rows);
28 DenseMatrix dm4 = DenseMatrix::Zero(rows, row
[all...]
H A Deigen2_triangular.cpp20 int rows = m.rows(); 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, col
[all...]
H A Deigen2_visitor.cpp16 int rows = p.rows(); local
21 m = MatrixType::Random(rows, cols);
30 for(int i = 0; i < rows; i++)
H A Dgsl_helper.h28 static Matrix createMatrix(int rows, int cols) { return gsl_matrix_alloc(rows,cols); } argument
63 static Matrix createMatrix(int rows, int cols) { return gsl_matrix_complex_alloc(rows,cols); } argument
100 res = gsl_matrix_alloc(m.rows(), m.cols());
101 for (int i=0 ; i<m.rows() ; ++i)
110 for (int i=0 ; i<res.rows() ; ++i)
128 for (int i=0 ; i<res.rows() ; ++i)
135 res = gsl_matrix_complex_alloc(m.rows(), m.cols());
136 for (int i=0 ; i<m.rows() ;
[all...]

Completed in 1190 milliseconds

1234567891011>>