Home
last modified time | relevance | path

Searched refs:m3 (Results 1 – 25 of 112) sorted by relevance

12345

/external/eigen/test/
Dproduct_trmv.cpp25 m3(rows, cols); in trmv() local
33 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps)); in trmv()
35 m3 = m1.template triangularView<Eigen::Upper>(); in trmv()
36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps)); in trmv()
37 m3 = m1.template triangularView<Eigen::UnitLower>(); in trmv()
38 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps)); in trmv()
39 m3 = m1.template triangularView<Eigen::UnitUpper>(); in trmv()
40 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitUpper>() * v1, largerEps)); in trmv()
43 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
[all …]
Dtriangular.cpp27 m3(rows, cols), in triangular_square() local
55 m3 = m2.transpose() + m2; in triangular_square()
56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1); in triangular_square()
61 VERIFY_IS_APPROX(m3.template triangularView<Lower>().toDenseMatrix(), m1); in triangular_square()
63 VERIFY_IS_APPROX(m3.template triangularView<Lower>().conjugate().toDenseMatrix(), in triangular_square()
64 m3.conjugate().template triangularView<Lower>().toDenseMatrix()); in triangular_square()
72 m3 = m1.template triangularView<Upper>(); in triangular_square()
73 …VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), large… in triangular_square()
74 m3 = m1.template triangularView<Lower>(); in triangular_square()
75 …VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), l… in triangular_square()
[all …]
Dcommainitializer.cpp14 Matrix3d m3; in test_commainitializer() local
17 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8) ); in test_commainitializer()
20 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9, 10) ); in test_commainitializer()
26 m3 = Matrix3d::Random(); in test_commainitializer()
27 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; in test_commainitializer()
28 VERIFY_IS_APPROX(m3, ref ); in test_commainitializer()
34 m3 = Matrix3d::Random(); in test_commainitializer()
35 m3 << vec[0], vec[1], vec[2]; in test_commainitializer()
36 VERIFY_IS_APPROX(m3, ref); in test_commainitializer()
41 m3 = Matrix3d::Random(); in test_commainitializer()
[all …]
Dproduct_notemporary.cpp46 m3(rows, cols); in product_notemporary() local
60 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1); in product_notemporary()
61 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0); in product_notemporary()
63 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0); in product_notemporary()
65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0); in product_notemporary()
66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1); in product_notemporary()
67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0); in product_notemporary()
68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0); in product_notemporary()
69 VERIFY_EVALUATION_COUNT( m3.noalias() -= s1 * (m1.transpose() * m2), 0); in product_notemporary()
71 …VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block… in product_notemporary()
[all …]
Dcwiseop.cpp43 m3(rows, cols), in cwiseops() local
59 m3 = MatrixType::Constant(rows, cols, s1); in cwiseops()
65 VERIFY_IS_APPROX(m3(i,j), s1); in cwiseops()
69 VERIFY(m3.isConstant(s1)); in cwiseops()
71 VERIFY_IS_APPROX(m4.setConstant(s1), m3); in cwiseops()
72 VERIFY_IS_APPROX(m4.setConstant(rows,cols,s1), m3); in cwiseops()
78 VERIFY_IS_APPROX(m4, m3); in cwiseops()
92 m3 = m1; m3.cwise() += 1; in cwiseops()
93 VERIFY_IS_APPROX(m1 + mones, m3); in cwiseops()
94 m3 = m1; m3.cwise() -= 1; in cwiseops()
[all …]
Darray.cpp25 m3(rows, cols); in array() local
40 m3 = m1; in array()
41 m3 += s2; in array()
42 VERIFY_IS_APPROX(m3, m1 + s2); in array()
43 m3 = m1; in array()
44 m3 -= s1; in array()
45 VERIFY_IS_APPROX(m3, m1 - s1); in array()
48 m3 = m1; in array()
50 VERIFY_IS_APPROX(m1, m3 - m2); in array()
52 m3 = m1; in array()
[all …]
Dselfadjoint.cpp25 m3(rows, cols); in selfadjoint() local
30 m3 = m1.template selfadjointView<Upper>(); in selfadjoint()
31 …VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangula… in selfadjoint()
32 VERIFY_IS_APPROX(m3, m3.adjoint()); in selfadjoint()
35 m3 = m1.template selfadjointView<Lower>(); in selfadjoint()
36 …VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangula… in selfadjoint()
37 VERIFY_IS_APPROX(m3, m3.adjoint()); in selfadjoint()
Dlinearstructure.cpp27 m3(rows, cols); in linearStructure() local
42 m3 = m2; m3 += m1; in linearStructure()
43 VERIFY_IS_APPROX(m3, m1+m2); in linearStructure()
44 m3 = m2; m3 -= m1; in linearStructure()
45 VERIFY_IS_APPROX(m3, m2-m1); in linearStructure()
46 m3 = m2; m3 *= s1; in linearStructure()
47 VERIFY_IS_APPROX(m3, s1*m2); in linearStructure()
50 m3 = m2; m3 /= s1; in linearStructure()
51 VERIFY_IS_APPROX(m3, m2/s1); in linearStructure()
Darray_for_matrix.cpp25 m3(rows, cols); in array_for_matrix() local
37 m3 = m1; in array_for_matrix()
38 m3.array() += s2; in array_for_matrix()
39 VERIFY_IS_APPROX(m3, (m1.array() + s2).matrix()); in array_for_matrix()
40 m3 = m1; in array_for_matrix()
41 m3.array() -= s1; in array_for_matrix()
42 VERIFY_IS_APPROX(m3, (m1.array() - s1).matrix()); in array_for_matrix()
52 m3 = m1; in array_for_matrix()
53 VERIFY_IS_APPROX(m3.colwise() += cv1, m1.colwise() + cv1); in array_for_matrix()
54 m3 = m1; in array_for_matrix()
[all …]
Dhouseholder.cpp70 SquareMatrixType m3(rows,rows), m4(rows,rows); in householder() local
71 m3.rowwise() = v1.transpose(); in householder()
72 m4 = m3; in householder()
73 m3.row(0).makeHouseholder(essential, beta, alpha); in householder()
74 m3.applyHouseholderOnTheRight(essential,beta,tmp); in householder()
75 VERIFY_IS_APPROX(m3.norm(), m4.norm()); in householder()
76 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(m3.block(0,1,rows,rows-1).norm(), m3.norm()); in householder()
77 VERIFY_IS_MUCH_SMALLER_THAN(internal::imag(m3(0,0)), internal::real(m3(0,0))); in householder()
78 VERIFY_IS_APPROX(internal::real(m3(0,0)), alpha); in householder()
98 m3 = hseq; in householder()
[all …]
Dinteger_types.cpp68 m3(rows, cols), in integer_type_tests() local
93 VERIFY_IS_APPROX(m3 = m1,m1); in integer_type_tests()
97 m3.real() = m1.real(); in integer_type_tests()
98 …VERIFY_IS_APPROX(static_cast<const MatrixType&>(m3).real(), static_cast<const MatrixType&>(m1).rea… in integer_type_tests()
99 VERIFY_IS_APPROX(static_cast<const MatrixType&>(m3).real(), m1.real()); in integer_type_tests()
121 m3 = m2; m3 += m1; in integer_type_tests()
122 VERIFY_IS_EQUAL(m3, m1+m2); in integer_type_tests()
123 m3 = m2; m3 -= m1; in integer_type_tests()
124 VERIFY_IS_EQUAL(m3, m2-m1); in integer_type_tests()
125 m3 = m2; m3 *= s1; in integer_type_tests()
[all …]
Dswap.cpp37 …OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(… in swap() local
41 OtherMatrixType m3_copy = m3; in swap()
51 m1.swap(m3); in swap()
53 VERIFY_IS_APPROX(m3,m1_copy); in swap()
55 m3 = m3_copy; in swap()
65 m1.transpose().swap(m3.transpose()); in swap()
67 VERIFY_IS_APPROX(m3,m1_copy); in swap()
69 m3 = m3_copy; in swap()
Dsparse_basic.cpp166 SparseMatrixType m3(rows, rows); in sparse_basic() local
170 initSparse<Scalar>(density, refM3, m3); in sparse_basic()
174 VERIFY_IS_APPROX(m1+m2+m3, refM1+refM2+refM3); in sparse_basic()
175 VERIFY_IS_APPROX(m3.cwiseProduct(m1+m2), refM3.cwiseProduct(refM1+refM2)); in sparse_basic()
194 VERIFY_IS_APPROX(m3.cwiseProduct(refM4), refM3.cwiseProduct(refM4)); in sparse_basic()
226 SparseMatrixType m3(rows,rows); in sparse_basic() local
227 m3.reserve(VectorXi::Constant(rows,rows/2)); in sparse_basic()
230 m3.insertByOuterInner(j,k) = k+1; in sparse_basic()
233 VERIFY(j==internal::real(m3.innerVector(j).nonZeros())); in sparse_basic()
235 VERIFY(j==internal::real(m3.innerVector(j).lastCoeff())); in sparse_basic()
[all …]
/external/eigen/test/eigen2/
Deigen2_triangular.cpp25 m3(rows, cols), in triangular() local
61 m3 = m2.transpose() * m2; in triangular()
62 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>().transpose(), m1); in triangular()
67 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>(), m1); in triangular()
69 VERIFY_IS_APPROX(m3.template part<Diagonal>(), m3.diagonal().asDiagonal()); in triangular()
77 m3 = m1.template part<Eigen::LowerTriangular>(); in triangular()
78 …VERIFY(m3.template marked<Eigen::LowerTriangular>().solveTriangular(m3).cwise().abs().isIdentity(t… in triangular()
79 VERIFY(m3.transpose().template marked<Eigen::UpperTriangular>() in triangular()
80 .solveTriangular(m3.transpose()).cwise().abs().isIdentity(test_precision<RealScalar>())); in triangular()
82 m4 = m3; in triangular()
[all …]
Deigen2_commainitializer.cpp14 Matrix3d m3; in test_eigen2_commainitializer() local
17 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8) ); in test_eigen2_commainitializer()
20 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9, 10) ); in test_eigen2_commainitializer()
26 m3 = Matrix3d::Random(); in test_eigen2_commainitializer()
27 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; in test_eigen2_commainitializer()
28 VERIFY_IS_APPROX(m3, ref ); in test_eigen2_commainitializer()
34 m3 = Matrix3d::Random(); in test_eigen2_commainitializer()
35 m3 << vec[0], vec[1], vec[2]; in test_eigen2_commainitializer()
36 VERIFY_IS_APPROX(m3, ref); in test_eigen2_commainitializer()
41 m3 = Matrix3d::Random(); in test_eigen2_commainitializer()
[all …]
Deigen2_cwiseop.cpp33 m3(rows, cols), in cwiseops() local
52 m3 = MatrixType::Constant(rows, cols, s1); in cwiseops()
58 VERIFY_IS_APPROX(m3(i,j), s1); in cwiseops()
62 VERIFY(m3.isConstant(s1)); in cwiseops()
64 VERIFY_IS_APPROX(m4.setConstant(s1), m3); in cwiseops()
65 VERIFY_IS_APPROX(m4.setConstant(rows,cols,s1), m3); in cwiseops()
71 VERIFY_IS_APPROX(m4, m3); in cwiseops()
85 m3 = m1; m3.cwise() += 1; in cwiseops()
86 VERIFY_IS_APPROX(m1 + mones, m3); in cwiseops()
87 m3 = m1; m3.cwise() -= 1; in cwiseops()
[all …]
Deigen2_sparse_product.cpp30 SparseMatrixType m3(rows, rows); in sparse_product() local
33 initSparse<Scalar>(density, refMat3, m3); in sparse_product()
35 VERIFY_IS_APPROX(m4=m2*m3, refMat4=refMat2*refMat3); in sparse_product()
36 VERIFY_IS_APPROX(m4=m2.transpose()*m3, refMat4=refMat2.transpose()*refMat3); in sparse_product()
37 …VERIFY_IS_APPROX(m4=m2.transpose()*m3.transpose(), refMat4=refMat2.transpose()*refMat3.transpose()… in sparse_product()
38 VERIFY_IS_APPROX(m4=m2*m3.transpose(), refMat4=refMat2*refMat3.transpose()); in sparse_product()
47 VERIFY_IS_APPROX(dm4=refMat2*m3, refMat4=refMat2*refMat3); in sparse_product()
48 VERIFY_IS_APPROX(dm4=refMat2*m3.transpose(), refMat4=refMat2*refMat3.transpose()); in sparse_product()
49 VERIFY_IS_APPROX(dm4=refMat2.transpose()*m3, refMat4=refMat2.transpose()*refMat3); in sparse_product()
50 …VERIFY_IS_APPROX(dm4=refMat2.transpose()*m3.transpose(), refMat4=refMat2.transpose()*refMat3.trans… in sparse_product()
[all …]
Deigen2_linearstructure.cpp28 m3(rows, cols), in linearStructure() local
44 m3 = m2; m3 += m1; in linearStructure()
45 VERIFY_IS_APPROX(m3, m1+m2); in linearStructure()
46 m3 = m2; m3 -= m1; in linearStructure()
47 VERIFY_IS_APPROX(m3, m2-m1); in linearStructure()
48 m3 = m2; m3 *= s1; in linearStructure()
49 VERIFY_IS_APPROX(m3, s1*m2); in linearStructure()
52 m3 = m2; m3 /= s1; in linearStructure()
53 VERIFY_IS_APPROX(m3, m2/s1); in linearStructure()
Deigen2_array.cpp28 m3(rows, cols); in array() local
37 m3 = m1; in array()
38 m3.cwise() += s2; in array()
39 VERIFY_IS_APPROX(m3, m1.cwise() + s2); in array()
40 m3 = m1; in array()
41 m3.cwise() -= s1; in array()
42 VERIFY_IS_APPROX(m3, m1.cwise() - s1); in array()
66 m3(rows, cols); in comparisons() local
72 m3 = m1; in comparisons()
73 m3(r,c) += 1; in comparisons()
[all …]
Deigen2_swap.cpp37 …OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(… in swap() local
41 OtherMatrixType m3_copy = m3; in swap()
51 m1.swap(m3); in swap()
53 VERIFY_IS_APPROX(m3,m1_copy); in swap()
55 m3 = m3_copy; in swap()
65 m1.transpose().swap(m3.transpose()); in swap()
67 VERIFY_IS_APPROX(m3,m1_copy); in swap()
69 m3 = m3_copy; in swap()
Deigen2_lu.cpp44 MatrixType m1(rows, cols), m2(cols, cols2), m3(rows, cols2), k(1,1); in lu_non_invertible() local
67 m3 = m1*m2; in lu_non_invertible()
69 lu.solve(m3, &m2); in lu_non_invertible()
70 VERIFY_IS_APPROX(m3, m1*m2); in lu_non_invertible()
85 MatrixType m1(size, size), m2(size, size), m3(size, size); in lu_invertible() local
102 m3 = MatrixType::Random(size,size); in lu_invertible()
103 lu.solve(m3, &m2); in lu_invertible()
104 VERIFY_IS_APPROX(m3, m1*m2); in lu_invertible()
105 VERIFY_IS_APPROX(m2, lu.inverse()*m3); in lu_invertible()
106 m3 = MatrixType::Random(size,size); in lu_invertible()
[all …]
/external/eigen/doc/
Dtutorial.cpp8 Eigen::Matrix3f m3 = Eigen::Matrix3f::Random(); in main() local
11 std::cout << "*** Step 1 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
15 m3.diagonal().setOnes(); in main()
17 std::cout << "*** Step 2 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
20 m4.block<3,3>(0,1) = m3; in main()
21 m3.row(2) = m4.block<1,3>(2,0); in main()
23 std::cout << "*** Step 3 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
39 m3 = m3.cwise().cos(); in main()
40 std::cout << "*** Step 6 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; in main()
55 m3 = m3 * m4.block<3,3>(1,1); // here Eigen chooses NOT to evaluate block() into a temporary in main()
[all …]
/external/eigen/bench/
Dsparse_product.cpp119 DenseMatrix m1(rows,cols), m2(rows,cols), m3(rows,cols); in main() local
126 m3 = m1 * m2; in main()
133 m3 = m1.transpose() * m2; in main()
140 m3 = m1.transpose() * m2.transpose(); in main()
147 m3 = m1 * m2.transpose(); in main()
228 cs *m1, *m2, *m3; in main() local
234 m3 = cs_sorted_multiply(m1, m2); in main()
235 if (!m3) in main()
240 cs_spfree(m3); in main()
254 UBlasSparse m1(rows,cols), m2(rows,cols), m3(rows,cols); in main() local
[all …]
Dsparse_transpose.cpp52 DenseMatrix m1(rows,cols), m3(rows,cols); in main() local
54 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1.transpose();) in main()
70 cs *m1, *m3; in main() local
73 BENCH(for (int k=0; k<REPEAT; ++k) { m3 = cs_transpose(m1,1); cs_spfree(m3);}) in main()
82 GmmSparse m1(rows,cols), m3(rows,cols); in main() local
84 BENCH(for (int k=0; k<REPEAT; ++k) gmm::copy(gmm::transposed(m1),m3);) in main()
92 MtlSparse m1(rows,cols), m3(rows,cols); in main() local
94 BENCH(for (int k=0; k<REPEAT; ++k) m3 = trans(m1);) in main()
/external/icu4c/test/perf/ubrkperf/
DUBrkPerf.pl32 my $m3 = "-- -m line";
82 "TestForwardLine", ["$p1 $m3 TestICUForward", "$p2 $m3 TestICUForward", "$p3 $m3 TestICUForwar…
87 "TestIsBoundLine", ["$p1 $m3 TestICUIsBound", "$p2 $m3 TestICUIsBound", "$p3 $m3 TestICUIsBoun…

12345