| /third_party/boost/libs/math/test/ |
| D | chebyshev_test.cpp | 22 using boost::math::chebyshev_t;
37 BOOST_CHECK_CLOSE_FRACTION(chebyshev_t(0, x), Real(1), tol); in test_polynomials()
38 BOOST_CHECK_CLOSE_FRACTION(chebyshev_t(1, x), x, tol); in test_polynomials()
39 BOOST_CHECK_CLOSE_FRACTION(chebyshev_t(2, x), 2*x*x - 1, tol); in test_polynomials()
40 BOOST_CHECK_CLOSE_FRACTION(chebyshev_t(3, x), x*(4*x*x-3), tol); in test_polynomials()
41 BOOST_CHECK_CLOSE_FRACTION(chebyshev_t(4, x), 8*x*x*(x*x - 1) + 1, tol); in test_polynomials()
42 BOOST_CHECK_CLOSE_FRACTION(chebyshev_t(5, x), x*(16*x*x*x*x - 20*x*x + 5), tol); in test_polynomials()
102 BOOST_CHECK_CLOSE_FRACTION(y, chebyshev_t(0, x), tol); in test_clenshaw_recurrence()
105 BOOST_CHECK_CLOSE_FRACTION(y, chebyshev_t(0, x), tol); in test_clenshaw_recurrence()
108 BOOST_CHECK_CLOSE_FRACTION(y, chebyshev_t(0, x), tol); in test_clenshaw_recurrence()
[all …]
|
| D | test_autodiff_5.cpp | 60 boost::math::chebyshev_t(n, make_fvar<T, m>(x)).derivative(0u), in BOOST_AUTO_TEST_CASE_TEMPLATE()
61 boost::math::chebyshev_t(n, x), 40 * test_constants::pct_epsilon()); in BOOST_AUTO_TEST_CASE_TEMPLATE()
|
| D | chebyshev_transform_test.cpp | 29 using boost::math::chebyshev_t;
|
| /third_party/boost/boost/math/special_functions/ |
| D | chebyshev.hpp | 89 chebyshev_t(unsigned n, Real const & x, const Policy&) in chebyshev_t() function
97 inline typename tools::promote_args<Real>::type chebyshev_t(unsigned n, Real const & x) in chebyshev_t() function
99 return chebyshev_t(n, x, policies::policy<>()); in chebyshev_t()
|
| D | math_fwd.hpp | 271 chebyshev_t(unsigned n, Real const & x, const Policy&);
273 typename tools::promote_args<Real>::type chebyshev_t(unsigned n, Real const & x);
1263 …Real chebyshev_t(unsigned n, Real const & x){ return ::boost::math::chebyshev_t(n, x, Policy()); }\
|
| /third_party/boost/libs/multiprecision/example/ |
| D | hypergeometric_luke_algorithms.cpp | 88 template<class T> T chebyshev_t(const std::int32_t n, const T& x);
90 template<class T> T chebyshev_t(const std::uint32_t n, const T& x, std::vector<T>* vp);
152 template<class T> T my_math::chebyshev_t(const std::int32_t n, const T& x) in chebyshev_t() function in my_math
158 const T y = chebyshev_t(n, -x); in chebyshev_t()
167 return chebyshev_t(nn, x); in chebyshev_t()
175 template<class T> T my_math::chebyshev_t(const std::uint32_t n, const T& x, std::vector<T>* const v… in chebyshev_t() function in my_math
199 using my_math::chebyshev_t; in series()
206 chebyshev_t(static_cast<std::uint32_t>(C.size()), in series()
|
| /third_party/boost/libs/math/doc/sf/ |
| D | chebyshev.qbk | 22 ``__sf_result`` chebyshev_t(unsigned n, Real const & x);
25 ``__sf_result`` chebyshev_t(unsigned n, Real const & x, const ``__Policy``&);
49 double T12 = boost::math::chebyshev_t(12, x);
106 For this reason, `chebyshev_t` and `chebyshev_u` have code paths for /x > 1/ and /x < -1/ which do …
|
| /third_party/boost/libs/math/test/compile_test/ |
| D | instantiate.hpp | 238 boost::math::chebyshev_t(1, v1); in instantiate()
452 boost::math::chebyshev_t(1, 2 * v1); in instantiate()
635 boost::math::chebyshev_t(1, v1, pol); in instantiate()
853 test::chebyshev_t(1, v1); in instantiate()
1081 boost::math::chebyshev_t(1, i); in instantiate_mixed()
1232 boost::math::chebyshev_t(1, i, pol); in instantiate_mixed()
1389 test::chebyshev_t(1, i); in instantiate_mixed()
|