HomeSort by relevance Sort by last modified time
    Searched refs:lpNorm (Results 1 - 12 of 12) sorted by null

  /external/eigen/doc/examples/
Tutorial_ReductionsVisitorsBroadcasting_reductions_norm.cpp 20 cout << "v.lpNorm<1>() = " << v.lpNorm<1>() << endl;
21 cout << "v.lpNorm<Infinity>() = " << v.lpNorm<Infinity>() << endl;
26 cout << "m.lpNorm<1>() = " << m.lpNorm<1>() << endl;
27 cout << "m.lpNorm<Infinity>() = " << m.lpNorm<Infinity>() << endl;
  /external/eigen/test/eigen2/
eigen2_array.cpp 107 template<typename VectorType> void lpNorm(const VectorType& v)
111 VERIFY_IS_APPROX(u.template lpNorm<Infinity>(), u.cwise().abs().maxCoeff());
112 VERIFY_IS_APPROX(u.template lpNorm<1>(), u.cwise().abs().sum());
113 VERIFY_IS_APPROX(u.template lpNorm<2>(), ei_sqrt(u.cwise().abs().cwise().square().sum()));
114 VERIFY_IS_APPROX(ei_pow(u.template lpNorm<5>(), typename VectorType::RealScalar(5)), u.cwise().abs().cwise().pow(5).sum());
135 CALL_SUBTEST_1( lpNorm(Matrix<float, 1, 1>()) );
136 CALL_SUBTEST_2( lpNorm(Vector2f()) );
137 CALL_SUBTEST_3( lpNorm(Vector3d()) );
138 CALL_SUBTEST_4( lpNorm(Vector4f()) );
139 CALL_SUBTEST_5( lpNorm(VectorXf(16)) )
    [all...]
  /external/eigen/test/
array_for_matrix.cpp 133 template<typename VectorType> void lpNorm(const VectorType& v)
138 VERIFY_IS_APPROX(u.template lpNorm<Infinity>(), u.cwiseAbs().maxCoeff());
139 VERIFY_IS_APPROX(u.template lpNorm<1>(), u.cwiseAbs().sum());
140 VERIFY_IS_APPROX(u.template lpNorm<2>(), sqrt(u.array().abs().square().sum()));
141 VERIFY_IS_APPROX(numext::pow(u.template lpNorm<5>(), typename VectorType::RealScalar(5)), u.array().abs().pow(5).sum());
240 CALL_SUBTEST_1( lpNorm(Matrix<float, 1, 1>()) );
241 CALL_SUBTEST_2( lpNorm(Vector2f()) );
242 CALL_SUBTEST_7( lpNorm(Vector3d()) );
243 CALL_SUBTEST_8( lpNorm(Vector4f()) );
244 CALL_SUBTEST_5( lpNorm(VectorXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) )
    [all...]
  /external/ceres-solver/include/ceres/
gradient_checker.h 189 jacobian_difference.lpNorm<Eigen::Infinity>());
  /external/ceres-solver/internal/ceres/
polynomial.cc 72 const double row_norm = companion_matrix_offdiagonal.row(i).lpNorm<1>();
73 const double col_norm = companion_matrix_offdiagonal.col(i).lpNorm<1>();
trust_region_minimizer.cc 222 (x - projected_gradient_step).lpNorm<Eigen::Infinity>();
598 (x - projected_gradient_step).lpNorm<Eigen::Infinity>();
line_search_minimizer.cc 93 (x - projected_gradient_step).lpNorm<Eigen::Infinity>();
line_search.cc 144 return direction_.lpNorm<Eigen::Infinity>();
    [all...]
  /external/ceres-solver/examples/
bal_problem.cc 229 tmp[i] = (point - median).lpNorm<1>();
  /external/eigen/Eigen/src/Core/
Dot.h 212 MatrixBase<Derived>::lpNorm() const
DenseBase.h 462 template<int p> RealScalar lpNorm() const;
MatrixBase.h 311 template<int p> RealScalar lpNorm() const;

Completed in 2022 milliseconds