Home
last modified time | relevance | path

Searched refs:isApprox (Results 1 – 25 of 58) sorted by relevance

123

/external/eigen/test/
Dsparse_permutations.cpp84 VERIFY(res.isApprox(res_d) && "mat*p"); in sparse_permutations()
90 VERIFY(res.isApprox(res_d) && "p*mat"); in sparse_permutations()
96 VERIFY(res.isApprox(res_d) && "mat*inv(p)"); in sparse_permutations()
102 VERIFY(res.isApprox(res_d) && "inv(p)*mat"); in sparse_permutations()
108 VERIFY(res.isApprox(res_d) && "p*mat*inv(p)"); in sparse_permutations()
113 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); in sparse_permutations()
117 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full"); in sparse_permutations()
122 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full"); in sparse_permutations()
126 VERIFY(res.isApprox(res_d) && "lower selfadjoint full"); in sparse_permutations()
131 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); in sparse_permutations()
[all …]
Dproduct_trmv.cpp34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps)); in trmv()
36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps)); in trmv()
38 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps)); in trmv()
40 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitUpper>() * v1, largerEps)); in trmv()
44 …VERIFY(((s1*m3).conjugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lowe… in trmv()
46 …VERIFY((m3.conjugate() * v1.conjugate()).isApprox(m1.conjugate().template triangularView<Eigen::Up… in trmv()
50 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1,… in trmv()
52 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1,… in trmv()
54 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitLower>() *… in trmv()
56 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitUpper>() *… in trmv()
[all …]
Dtriangular.cpp73 …VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), large… in triangular_square()
75 …VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), l… in triangular_square()
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps)); in triangular_square()
79 …VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), l… in triangular_square()
83 …VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), large… in triangular_square()
85 …VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), l… in triangular_square()
87 VERIFY(m2.isApprox(m3 * (m1.template triangularView<Upper>().solve(m2)), largerEps)); in triangular_square()
89 …VERIFY(m2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(m2)), l… in triangular_square()
104 VERIFY(m2.isApprox(m3 * (m1.template triangularView<UnitUpper>().solve(m2)), largerEps)); in triangular_square()
Dsparse_solver.h65 VERIFY(oldb.isApprox(b) && "sparse solver testing: the rhs should not be modified!"); in check_sparse_solving()
66 VERIFY(x.isApprox(refX,test_precision<Scalar>())); in check_sparse_solving()
71 VERIFY(oldb.isApprox(b) && "sparse solver testing: the rhs should not be modified!"); in check_sparse_solving()
72 VERIFY(x.isApprox(refX,test_precision<Scalar>())); in check_sparse_solving()
81 VERIFY(oldb.isApprox(b) && "sparse solver testing: the rhs should not be modified!"); in check_sparse_solving()
82 VERIFY(x.isApprox(refX,test_precision<Scalar>())); in check_sparse_solving()
95 VERIFY(oldb.isApprox(bm) && "sparse solver testing: the rhs should not be modified!"); in check_sparse_solving()
96 VERIFY(xm.isApprox(refX,test_precision<Scalar>())); in check_sparse_solving()
108 VERIFY(x.isApprox(refX,test_precision<Scalar>())); in check_sparse_solving()
117 VERIFY(oldb.isApprox(db) && "sparse solver testing: the rhs should not be modified!"); in check_sparse_solving()
[all …]
Dmain.h314 { return internal::isApprox(a, b, test_precision<short>()); } in test_isApprox()
316 { return internal::isApprox(a, b, test_precision<unsigned long>()); } in test_isApprox()
318 { return internal::isApprox(a, b, test_precision<unsigned int>()); } in test_isApprox()
320 { return internal::isApprox(a, b, test_precision<long>()); } in test_isApprox()
322 { return internal::isApprox(a, b, test_precision<unsigned long>()); } in test_isApprox()
325 { return internal::isApprox(a, b, test_precision<int>()); } in test_isApprox()
332 { return internal::isApprox(a, b, test_precision<float>()); } in test_isApprox()
339 { return internal::isApprox(a, b, test_precision<double>()); } in test_isApprox()
347 { return internal::isApprox(a, b, test_precision<std::complex<float> >()); } in test_isApprox()
352 { return internal::isApprox(a, b, test_precision<std::complex<double> >()); } in test_isApprox()
[all …]
Dnullary.cpp55 if(!internal::isApprox(v(i), ref, prec)) in check_extremity_accuracy()
57 …VERIFY(internal::isApprox(v(i), (low*RealScalar(size-i-1))/RealScalar(size-1) + (high*RealScalar(i… in check_extremity_accuracy()
112 VERIFY( internal::isApprox(m(m.size()-1),high) ); in testVectorType()
113 VERIFY( size==1 || internal::isApprox(m(0),low) ); in testVectorType()
127 VERIFY( internal::isApprox(m(0),low) ); in testVectorType()
138 VERIFY( row_vector.isApprox(col_vector.transpose(), Scalar(2)*NumTraits<Scalar>::epsilon())); in testVectorType()
Deigensolver_selfadjoint.cpp46 if(! eiSymm.eigenvalues().isApprox(eiDirect.eigenvalues(), eival_eps) ) in selfadjointeigensolver_essential_check()
111 VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox( in selfadjointeigensolver()
117 …ointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox( in selfadjointeigensolver()
123 …ointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox( in selfadjointeigensolver()
Dpacketmath.cpp55 if (a[i]!=b[i] && !internal::isApprox(a[i],b[i])) in areApprox()
221 …VERIFY(internal::isApprox(data1[0], internal::pfirst(internal::pload<Packet>(data1))) && "internal… in packetmath()
262 …VERIFY(internal::isApprox(ref[0], internal::predux_mul(internal::pload<Packet>(data1))) && "intern… in packetmath()
499 …VERIFY(internal::isApprox(ref[0], internal::predux_min(internal::pload<Packet>(data1))) && "intern… in packetmath_notcomplex()
511 …VERIFY(internal::isApprox(ref[0], internal::predux_max(internal::pload<Packet>(data1))) && "intern… in packetmath_notcomplex()
533 VERIFY(internal::isApprox(ref[i], cj.pmul(data1[i],data2[i])) && "conj_helper pmul"); in test_conj_helper()
542 VERIFY(internal::isApprox(ref[i], cj.pmadd(data1[i],data2[i],tmp)) && "conj_helper pmadd"); in test_conj_helper()
/external/eigen/unsupported/test/
Dmatrix_exponential.cpp40 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dRotation()
44 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dRotation()
65 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dHyperbolicRotation()
69 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dHyperbolicRotation()
89 VERIFY(C.isApprox(B, static_cast<T>(tol))); in testPascal()
93 VERIFY(C.isApprox(B, static_cast<T>(tol))); in testPascal()
114 VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol))); in randomTest()
118 VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol))); in randomTest()
Dmatrix_power.cpp29 VERIFY(C.isApprox(B, tol)); in test2dRotation()
51 VERIFY(C.isApprox(B, tol)); in test2dHyperbolicRotation()
65 VERIFY(AngleAxis<T>(angle, v).matrix().isApprox(AngleAxis<T>(1,v).matrix().pow(angle), tol)); in test3dRotation()
87 VERIFY(m4.isApprox(m5, tol)); in testGeneral()
91 VERIFY(m4.isApprox(m5, tol)); in testGeneral()
95 VERIFY(m4.isApprox(m5, tol)); in testGeneral()
122 VERIFY(mpow(0.5L).isApprox(U * (TriangularType(T) * U.adjoint()), tol)); in testSingular()
125 VERIFY(mpow(0.25L).isApprox(U * (TriangularType(T) * U.adjoint()), tol)); in testSingular()
128 VERIFY(mpow(0.125L).isApprox(U * (TriangularType(T) * U.adjoint()), tol)); in testSingular()
145 VERIFY(m.pow(x).isApprox((x * m.log()).exp(), tol)); in testLogThenExp()
Dpolynomialsolver.cpp67 if( internal::isApprox( rootModuli[i], rootModuli[i-1] ) ){ in aux_evalSolver()
125 if( internal::isApprox( calc_realRoots[i], real_roots[j], psPrec ) ){ in evalSolverSugarFunction()
132 VERIFY( internal::isApprox( roots.array().abs().maxCoeff(), in evalSolverSugarFunction()
136 VERIFY( internal::isApprox( roots.array().abs().minCoeff(), in evalSolverSugarFunction()
144 VERIFY( internal::isApprox( real_roots.array().abs().maxCoeff(), abs(r), psPrec ) ); } in evalSolverSugarFunction()
150 VERIFY( internal::isApprox( real_roots.array().abs().minCoeff(), abs( r ), psPrec ) ); } in evalSolverSugarFunction()
156 VERIFY( internal::isApprox( real_roots.array().maxCoeff(), r, psPrec ) ); } in evalSolverSugarFunction()
162 VERIFY( internal::isApprox( real_roots.array().minCoeff(), r, psPrec ) ); } in evalSolverSugarFunction()
Dmpreal_support.cpp36 VERIFY(Eigen::internal::isApprox(A.array().abs2().sum(), A.squaredNorm())); in test_mpreal_support()
56 …VERIFY( (S.selfadjointView<Lower>() * eig.eigenvectors()).isApprox(eig.eigenvectors() * eig.eigenv… in test_mpreal_support()
Dsparse_extra.cpp32 return sm.isApprox(ref); in test_random_setter()
47 return sm.isApprox(ref); in test_random_setter()
Dopenglsupport.cpp25 if(!(REF).cast<float>().isApprox(m)) { \
38 if(!value.isApprox(data)) { \
51 if(!value.isApprox(data)) { \
/external/eigen/bench/
DbenchBlasGemm.cpp188 MYVERIFY(meigen.isApprox(mref, eps),". * ."); in check_product()
193 MYVERIFY(meigen.isApprox(mref, eps),"T * ."); in check_product()
198 MYVERIFY(meigen.isApprox(mref, eps),"T * T"); in check_product()
203 MYVERIFY(meigen.isApprox(mref, eps),". * T"); in check_product()
/external/eigen/Eigen/src/Geometry/
DParametrizedLine.h132 …EIGEN_DEVICE_FUNC bool isApprox(const ParametrizedLine& other, const typename NumTraits<Scalar>::R…
133 …{ return m_origin.isApprox(other.m_origin, prec) && m_direction.isApprox(other.m_direction, prec);…
DAngleAxis.h151 …EIGEN_DEVICE_FUNC bool isApprox(const AngleAxis& other, const typename NumTraits<Scalar>::Real& pr…
152 { return m_axis.isApprox(other.m_axis, prec) && internal::isApprox(m_angle,other.m_angle, prec); }
DScaling.h102 …bool isApprox(const UniformScaling& other, const typename NumTraits<Scalar>::Real& prec = NumTrait…
103 { return internal::isApprox(m_factor, other.factor(), prec); }
DRotation2D.h158 …EIGEN_DEVICE_FUNC bool isApprox(const Rotation2D& other, const typename NumTraits<Scalar>::Real& p…
159 { return internal::isApprox(m_angle,other.m_angle, prec); }
DAlignedBox.h302 …EIGEN_DEVICE_FUNC bool isApprox(const AlignedBox& other, const RealScalar& prec = ScalarTraits::du…
303 { return m_min.isApprox(other.m_min, prec) && m_max.isApprox(other.m_max, prec); }
DTranslation.h167 …EIGEN_DEVICE_FUNC bool isApprox(const Translation& other, const typename NumTraits<Scalar>::Real& …
168 { return m_coeffs.isApprox(other.m_coeffs, prec); }
/external/eigen/doc/snippets/
DFullPivLU_solve.cpp6 if((m*x).isApprox(y))
DColPivHouseholderQR_solve.cpp7 assert(y.isApprox(m*x));
DFullPivHouseholderQR_solve.cpp7 assert(y.isApprox(m*x));
DHouseholderQR_solve.cpp8 assert(y.isApprox(m*x));

123