Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:isApprox (Results 1 - 25 of 60) sorted by null

1 2 3

/external/eigen/test/
sparse_permutations.cpp	49 VERIFY(res.isApprox(res_d) && "mat*p"); 53 VERIFY(res.isApprox(res_d) && "p*mat"); 57 VERIFY(res.isApprox(res_d) && "mat*inv(p)"); 61 VERIFY(res.isApprox(res_d) && "inv(p)*mat"); 65 VERIFY(res.isApprox(res_d) && "p*mat*inv(p)"); 70 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); 74 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full"); 79 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full"); 83 VERIFY(res.isApprox(res_d) && "lower selfadjoint full"); 88 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full")     [all...]
product_trmv.cpp	34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps)); 36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps)); 38 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps)); 40 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitUpper>() * v1, largerEps)); 44 VERIFY(((s1*m3).conjugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lower>() * v1, largerEps)); 46 VERIFY((m3.conjugate() * v1.conjugate()).isApprox(m1.conjugate().template triangularView<Eigen::Upper>() * v1.conjugate(), largerEps)); 50 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1, largerEps)); 52 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1, largerEps)); 54 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitLower>() * v1, largerEps)); 56 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitUpper>() * v1, largerEps))     [all...]
triangular.cpp	73 VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), largerEps)); 75 VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), largerEps)); 77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps)); 79 VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), largerEps)); 83 VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), largerEps)); 85 VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), largerEps)); 87 VERIFY(m2.isApprox(m3 * (m1.template triangularView<Upper>().solve(m2)), largerEps)); 89 VERIFY(m2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(m2)), largerEps)); 104 VERIFY(m2.isApprox(m3 * (m1.template triangularView<UnitUpper>().solve(m2)), largerEps));
eigensolver_selfadjoint.cpp	49 VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox( 54 VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox( 65 VERIFY((symmA.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox( 71 VERIFY((symmB.template selfadjointView<Lower>() * (symmA.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox( 77 VERIFY((symmA.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(
sparse_solver.h	37 VERIFY(oldb.isApprox(b) && "sparse solver testing: the rhs should not be modified!"); 39 VERIFY(x.isApprox(refX,test_precision<Scalar>())); 57 VERIFY(oldb.isApprox(b) && "sparse solver testing: the rhs should not be modified!"); 59 VERIFY(x.isApprox(refX,test_precision<Scalar>())); 67 VERIFY(oldb.isApprox(b) && "sparse solver testing: the rhs should not be modified!"); 68 VERIFY(x.isApprox(refX,test_precision<Scalar>()));
/external/eigen/doc/snippets/
ColPivHouseholderQR_solve.cpp	7 assert(y.isApprox(m*x));
FullPivHouseholderQR_solve.cpp	7 assert(y.isApprox(m*x));
FullPivLU_solve.cpp	6 if((m*x).isApprox(y))
HouseholderQR_solve.cpp	8 assert(y.isApprox(m*x));
/external/eigen/test/eigen2/
eigen2_sparse_solvers.cpp	89 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: default"); 94 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: cholmod"); 101 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (IncompleteFactorization)"); 104 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (SupernodalMultifrontal)"); 107 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (SupernodalLeftLooking)"); 133 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LDLT: default"); 154 // // VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LU: default"); 162 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LU: SuperLU"); 179 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LU: umfpack"); // FIXME solve is not very stable for complex
eigen2_eigensolver.cpp	63 VERIFY((symmA * _evec).isApprox(_evec * _eval.asDiagonal(), largerEps)); 74 VERIFY((symmA * _evec).isApprox(symmB * (_evec * _eval.asDiagonal()), largerEps)); 88 VERIFY((symmA * eiSymm.eigenvectors()).isApprox( 92 VERIFY((symmA * eiSymmGen.eigenvectors()).isApprox(
/external/eigen/unsupported/test/
matrix_exponential.cpp	47 VERIFY(C.isApprox(B, static_cast<T>(tol))); 51 VERIFY(C.isApprox(B, static_cast<T>(tol))); 72 VERIFY(C.isApprox(B, static_cast<T>(tol))); 76 VERIFY(C.isApprox(B, static_cast<T>(tol))); 96 VERIFY(C.isApprox(B, static_cast<T>(tol))); 100 VERIFY(C.isApprox(B, static_cast<T>(tol))); 122 VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol))); 126 VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol)));
polynomialsolver.cpp	64 if( internal::isApprox( rootModuli[i], rootModuli[i-1] ) ){ 125 if( internal::isApprox( calc_realRoots[i], real_roots[j] ), psPrec ){ 132 VERIFY( internal::isApprox( roots.array().abs().maxCoeff(), 136 VERIFY( internal::isApprox( roots.array().abs().minCoeff(), 144 VERIFY( internal::isApprox( real_roots.array().abs().maxCoeff(), internal::abs(r), psPrec ) ); } 150 VERIFY( internal::isApprox( real_roots.array().abs().minCoeff(), internal::abs( r ), psPrec ) ); } 156 VERIFY( internal::isApprox( real_roots.array().maxCoeff(), r, psPrec ) ); } 162 VERIFY( internal::isApprox( real_roots.array().minCoeff(), r, psPrec ) ); }
sparse_extra.cpp	33 return sm.isApprox(ref); 48 return sm.isApprox(ref);
mpreal_support.cpp	31 VERIFY(Eigen::internal::isApprox(A.array().abs2().sum(), A.squaredNorm()));
/external/eigen/Eigen/src/Eigen2Support/Geometry/
ParametrizedLine.h	111 * \sa MatrixBase::isApprox() */ 112 bool isApprox(const ParametrizedLine& other, typename NumTraits<Scalar>::Real prec = precision<Scalar>()) const 113 { return m_origin.isApprox(other.m_origin, prec) && m_direction.isApprox(other.m_direction, prec); }
AlignedBox.h	135 * \sa MatrixBase::isApprox() */ 136 bool isApprox(const AlignedBox& other, typename NumTraits<Scalar>::Real prec = precision<Scalar>()) const 137 { return m_min.isApprox(other.m_min, prec) && m_max.isApprox(other.m_max, prec); }
AngleAxis.h	142 * \sa MatrixBase::isApprox() */ 143 bool isApprox(const AngleAxis& other, typename NumTraits<Scalar>::Real prec = precision<Scalar>()) const 144 { return m_axis.isApprox(other.m_axis, prec) && ei_isApprox(m_angle,other.m_angle, prec); }
Scaling.h	132 * \sa MatrixBase::isApprox() */ 133 bool isApprox(const Scaling& other, typename NumTraits<Scalar>::Real prec = precision<Scalar>()) const 134 { return m_coeffs.isApprox(other.m_coeffs, prec); }
Translation.h	135 * \sa MatrixBase::isApprox() */ 136 bool isApprox(const Translation& other, typename NumTraits<Scalar>::Real prec = precision<Scalar>()) const 137 { return m_coeffs.isApprox(other.m_coeffs, prec); }
/external/eigen/Eigen/src/Geometry/
Rotation2D.h	116 * \sa MatrixBase::isApprox() */ 117 bool isApprox(const Rotation2D& other, typename NumTraits<Scalar>::Real prec = NumTraits<Scalar>::dummy_precision()) const 118 { return internal::isApprox(m_angle,other.m_angle, prec); }
Scaling.h	101 * \sa MatrixBase::isApprox() */ 102 bool isApprox(const UniformScaling& other, typename NumTraits<Scalar>::Real prec = NumTraits<Scalar>::dummy_precision()) const 103 { return internal::isApprox(m_factor, other.factor(), prec); }
AngleAxis.h	139 * \sa MatrixBase::isApprox() */ 140 bool isApprox(const AngleAxis& other, typename NumTraits<Scalar>::Real prec = NumTraits<Scalar>::dummy_precision()) const 141 { return m_axis.isApprox(other.m_axis, prec) && internal::isApprox(m_angle,other.m_angle, prec); }
/external/eigen/Eigen/src/Core/
DiagonalMatrix.h	70 bool isApprox(const DiagonalBase<OtherDerived>& other, typename NumTraits<Scalar>::Real precision = NumTraits<Scalar>::dummy_precision()) const 72 return diagonal().isApprox(other.diagonal(), precision); 75 bool isApprox(const MatrixBase<OtherDerived>& other, typename NumTraits<Scalar>::Real precision = NumTraits<Scalar>::dummy_precision()) const 77 return toDenseMatrix().isApprox(other, precision);
/external/eigen/bench/
benchBlasGemm.cpp	188 MYVERIFY(meigen.isApprox(mref, eps),". * ."); 193 MYVERIFY(meigen.isApprox(mref, eps),"T * ."); 198 MYVERIFY(meigen.isApprox(mref, eps),"T * T"); 203 MYVERIFY(meigen.isApprox(mref, eps),". * T");

Completed in 108 milliseconds

1 2 3