Chris@16: // Copyright John Maddock 2012. Chris@16: // Use, modification and distribution are subject to the Chris@16: // Boost Software License, Version 1.0. Chris@16: // (See accompanying file LICENSE_1_0.txt Chris@16: // or copy at http://www.boost.org/LICENSE_1_0.txt) Chris@16: Chris@16: #ifndef BOOST_MATH_HANKEL_HPP Chris@16: #define BOOST_MATH_HANKEL_HPP Chris@16: Chris@101: #include Chris@16: #include Chris@16: Chris@16: namespace boost{ namespace math{ Chris@16: Chris@16: namespace detail{ Chris@16: Chris@16: template Chris@16: std::complex hankel_imp(T v, T x, const bessel_no_int_tag&, const Policy& pol, int sign) Chris@16: { Chris@16: BOOST_MATH_STD_USING Chris@16: static const char* function = "boost::math::cyl_hankel_1<%1%>(%1%,%1%)"; Chris@16: Chris@16: if(x < 0) Chris@16: { Chris@16: bool isint_v = floor(v) == v; Chris@16: T j, y; Chris@16: bessel_jy(v, -x, &j, &y, need_j | need_y, pol); Chris@16: std::complex cx(x), cv(v); Chris@16: std::complex j_result, y_result; Chris@16: if(isint_v) Chris@16: { Chris@16: int s = (iround(v) & 1) ? -1 : 1; Chris@16: j_result = j * s; Chris@16: y_result = T(s) * (y - (2 / constants::pi()) * (log(-x) - log(cx)) * j); Chris@16: } Chris@16: else Chris@16: { Chris@16: j_result = pow(cx, v) * pow(-cx, -v) * j; Chris@16: T p1 = pow(-x, v); Chris@16: std::complex p2 = pow(cx, v); Chris@16: y_result = p1 * y / p2 Chris@16: + (p2 / p1 - p1 / p2) * j / tan(constants::pi() * v); Chris@16: } Chris@16: // multiply y_result by i: Chris@16: y_result = std::complex(-sign * y_result.imag(), sign * y_result.real()); Chris@16: return j_result + y_result; Chris@16: } Chris@16: Chris@16: if(x == 0) Chris@16: { Chris@16: if(v == 0) Chris@16: { Chris@16: // J is 1, Y is -INF Chris@16: return std::complex(1, sign * -policies::raise_overflow_error(function, 0, pol)); Chris@16: } Chris@16: else Chris@16: { Chris@16: // At least one of J and Y is complex infinity: Chris@16: return std::complex(policies::raise_overflow_error(function, 0, pol), sign * policies::raise_overflow_error(function, 0, pol)); Chris@16: } Chris@16: } Chris@16: Chris@16: T j, y; Chris@16: bessel_jy(v, x, &j, &y, need_j | need_y, pol); Chris@16: return std::complex(j, sign * y); Chris@16: } Chris@16: Chris@16: template Chris@16: std::complex hankel_imp(int v, T x, const bessel_int_tag&, const Policy& pol, int sign); Chris@16: Chris@16: template Chris@16: inline std::complex hankel_imp(T v, T x, const bessel_maybe_int_tag&, const Policy& pol, int sign) Chris@16: { Chris@16: BOOST_MATH_STD_USING // ADL of std names. Chris@16: int ival = detail::iconv(v, pol); Chris@16: if(0 == v - ival) Chris@16: { Chris@16: return hankel_imp(ival, x, bessel_int_tag(), pol, sign); Chris@16: } Chris@16: return hankel_imp(v, x, bessel_no_int_tag(), pol, sign); Chris@16: } Chris@16: Chris@16: template Chris@16: inline std::complex hankel_imp(int v, T x, const bessel_int_tag&, const Policy& pol, int sign) Chris@16: { Chris@16: BOOST_MATH_STD_USING Chris@16: if((std::abs(v) < 200) && (x > 0)) Chris@16: return std::complex(bessel_jn(v, x, pol), sign * bessel_yn(v, x, pol)); Chris@16: return hankel_imp(static_cast(v), x, bessel_no_int_tag(), pol, sign); Chris@16: } Chris@16: Chris@16: template Chris@16: inline std::complex sph_hankel_imp(T v, T x, const Policy& pol, int sign) Chris@16: { Chris@16: BOOST_MATH_STD_USING Chris@16: return constants::root_half_pi() * hankel_imp(v + 0.5f, x, bessel_no_int_tag(), pol, sign) / sqrt(std::complex(x)); Chris@16: } Chris@16: Chris@16: } // namespace detail Chris@16: Chris@16: template Chris@16: inline std::complex::result_type> cyl_hankel_1(T1 v, T2 x, const Policy& pol) Chris@16: { Chris@16: BOOST_FPU_EXCEPTION_GUARD Chris@16: typedef typename detail::bessel_traits::result_type result_type; Chris@16: typedef typename detail::bessel_traits::optimisation_tag tag_type; Chris@16: typedef typename policies::evaluation::type value_type; Chris@16: return policies::checked_narrowing_cast, Policy>(detail::hankel_imp(v, static_cast(x), tag_type(), pol, 1), "boost::math::cyl_hankel_1<%1%>(%1%,%1%)"); Chris@16: } Chris@16: Chris@16: template Chris@16: inline std::complex >::result_type> cyl_hankel_1(T1 v, T2 x) Chris@16: { Chris@16: return cyl_hankel_1(v, x, policies::policy<>()); Chris@16: } Chris@16: Chris@16: template Chris@16: inline std::complex::result_type> cyl_hankel_2(T1 v, T2 x, const Policy& pol) Chris@16: { Chris@16: BOOST_FPU_EXCEPTION_GUARD Chris@16: typedef typename detail::bessel_traits::result_type result_type; Chris@16: typedef typename detail::bessel_traits::optimisation_tag tag_type; Chris@16: typedef typename policies::evaluation::type value_type; Chris@16: return policies::checked_narrowing_cast, Policy>(detail::hankel_imp(v, static_cast(x), tag_type(), pol, -1), "boost::math::cyl_hankel_1<%1%>(%1%,%1%)"); Chris@16: } Chris@16: Chris@16: template Chris@16: inline std::complex >::result_type> cyl_hankel_2(T1 v, T2 x) Chris@16: { Chris@16: return cyl_hankel_2(v, x, policies::policy<>()); Chris@16: } Chris@16: Chris@16: template Chris@16: inline std::complex::result_type> sph_hankel_1(T1 v, T2 x, const Policy&) Chris@16: { Chris@16: BOOST_FPU_EXCEPTION_GUARD Chris@16: typedef typename detail::bessel_traits::result_type result_type; Chris@16: typedef typename policies::evaluation::type value_type; Chris@16: typedef typename policies::normalise< Chris@16: Policy, Chris@16: policies::promote_float, Chris@16: policies::promote_double, Chris@16: policies::discrete_quantile<>, Chris@16: policies::assert_undefined<> >::type forwarding_policy; Chris@16: Chris@16: return policies::checked_narrowing_cast, Policy>(detail::sph_hankel_imp(static_cast(v), static_cast(x), forwarding_policy(), 1), "boost::math::sph_hankel_1<%1%>(%1%,%1%)"); Chris@16: } Chris@16: Chris@16: template Chris@16: inline std::complex >::result_type> sph_hankel_1(T1 v, T2 x) Chris@16: { Chris@16: return sph_hankel_1(v, x, policies::policy<>()); Chris@16: } Chris@16: Chris@16: template Chris@16: inline std::complex::result_type> sph_hankel_2(T1 v, T2 x, const Policy&) Chris@16: { Chris@16: BOOST_FPU_EXCEPTION_GUARD Chris@16: typedef typename detail::bessel_traits::result_type result_type; Chris@16: typedef typename policies::evaluation::type value_type; Chris@16: typedef typename policies::normalise< Chris@16: Policy, Chris@16: policies::promote_float, Chris@16: policies::promote_double, Chris@16: policies::discrete_quantile<>, Chris@16: policies::assert_undefined<> >::type forwarding_policy; Chris@16: Chris@16: return policies::checked_narrowing_cast, Policy>(detail::sph_hankel_imp(static_cast(v), static_cast(x), forwarding_policy(), -1), "boost::math::sph_hankel_1<%1%>(%1%,%1%)"); Chris@16: } Chris@16: Chris@16: template Chris@16: inline std::complex >::result_type> sph_hankel_2(T1 v, T2 x) Chris@16: { Chris@16: return sph_hankel_2(v, x, policies::policy<>()); Chris@16: } Chris@16: Chris@16: }} // namespaces Chris@16: Chris@16: #endif // BOOST_MATH_HANKEL_HPP Chris@16: