Chris@16
|
1 // Copyright John Maddock 2012.
|
Chris@16
|
2 // Use, modification and distribution are subject to the
|
Chris@16
|
3 // Boost Software License, Version 1.0.
|
Chris@16
|
4 // (See accompanying file LICENSE_1_0.txt
|
Chris@16
|
5 // or copy at http://www.boost.org/LICENSE_1_0.txt)
|
Chris@16
|
6
|
Chris@16
|
7 #ifndef BOOST_MATH_HANKEL_HPP
|
Chris@16
|
8 #define BOOST_MATH_HANKEL_HPP
|
Chris@16
|
9
|
Chris@16
|
10 #include <boost/math/special_functions/bessel.hpp>
|
Chris@16
|
11
|
Chris@16
|
12 namespace boost{ namespace math{
|
Chris@16
|
13
|
Chris@16
|
14 namespace detail{
|
Chris@16
|
15
|
Chris@16
|
16 template <class T, class Policy>
|
Chris@16
|
17 std::complex<T> hankel_imp(T v, T x, const bessel_no_int_tag&, const Policy& pol, int sign)
|
Chris@16
|
18 {
|
Chris@16
|
19 BOOST_MATH_STD_USING
|
Chris@16
|
20 static const char* function = "boost::math::cyl_hankel_1<%1%>(%1%,%1%)";
|
Chris@16
|
21
|
Chris@16
|
22 if(x < 0)
|
Chris@16
|
23 {
|
Chris@16
|
24 bool isint_v = floor(v) == v;
|
Chris@16
|
25 T j, y;
|
Chris@16
|
26 bessel_jy(v, -x, &j, &y, need_j | need_y, pol);
|
Chris@16
|
27 std::complex<T> cx(x), cv(v);
|
Chris@16
|
28 std::complex<T> j_result, y_result;
|
Chris@16
|
29 if(isint_v)
|
Chris@16
|
30 {
|
Chris@16
|
31 int s = (iround(v) & 1) ? -1 : 1;
|
Chris@16
|
32 j_result = j * s;
|
Chris@16
|
33 y_result = T(s) * (y - (2 / constants::pi<T>()) * (log(-x) - log(cx)) * j);
|
Chris@16
|
34 }
|
Chris@16
|
35 else
|
Chris@16
|
36 {
|
Chris@16
|
37 j_result = pow(cx, v) * pow(-cx, -v) * j;
|
Chris@16
|
38 T p1 = pow(-x, v);
|
Chris@16
|
39 std::complex<T> p2 = pow(cx, v);
|
Chris@16
|
40 y_result = p1 * y / p2
|
Chris@16
|
41 + (p2 / p1 - p1 / p2) * j / tan(constants::pi<T>() * v);
|
Chris@16
|
42 }
|
Chris@16
|
43 // multiply y_result by i:
|
Chris@16
|
44 y_result = std::complex<T>(-sign * y_result.imag(), sign * y_result.real());
|
Chris@16
|
45 return j_result + y_result;
|
Chris@16
|
46 }
|
Chris@16
|
47
|
Chris@16
|
48 if(x == 0)
|
Chris@16
|
49 {
|
Chris@16
|
50 if(v == 0)
|
Chris@16
|
51 {
|
Chris@16
|
52 // J is 1, Y is -INF
|
Chris@16
|
53 return std::complex<T>(1, sign * -policies::raise_overflow_error<T>(function, 0, pol));
|
Chris@16
|
54 }
|
Chris@16
|
55 else
|
Chris@16
|
56 {
|
Chris@16
|
57 // At least one of J and Y is complex infinity:
|
Chris@16
|
58 return std::complex<T>(policies::raise_overflow_error<T>(function, 0, pol), sign * policies::raise_overflow_error<T>(function, 0, pol));
|
Chris@16
|
59 }
|
Chris@16
|
60 }
|
Chris@16
|
61
|
Chris@16
|
62 T j, y;
|
Chris@16
|
63 bessel_jy(v, x, &j, &y, need_j | need_y, pol);
|
Chris@16
|
64 return std::complex<T>(j, sign * y);
|
Chris@16
|
65 }
|
Chris@16
|
66
|
Chris@16
|
67 template <class T, class Policy>
|
Chris@16
|
68 std::complex<T> hankel_imp(int v, T x, const bessel_int_tag&, const Policy& pol, int sign);
|
Chris@16
|
69
|
Chris@16
|
70 template <class T, class Policy>
|
Chris@16
|
71 inline std::complex<T> hankel_imp(T v, T x, const bessel_maybe_int_tag&, const Policy& pol, int sign)
|
Chris@16
|
72 {
|
Chris@16
|
73 BOOST_MATH_STD_USING // ADL of std names.
|
Chris@16
|
74 int ival = detail::iconv(v, pol);
|
Chris@16
|
75 if(0 == v - ival)
|
Chris@16
|
76 {
|
Chris@16
|
77 return hankel_imp(ival, x, bessel_int_tag(), pol, sign);
|
Chris@16
|
78 }
|
Chris@16
|
79 return hankel_imp(v, x, bessel_no_int_tag(), pol, sign);
|
Chris@16
|
80 }
|
Chris@16
|
81
|
Chris@16
|
82 template <class T, class Policy>
|
Chris@16
|
83 inline std::complex<T> hankel_imp(int v, T x, const bessel_int_tag&, const Policy& pol, int sign)
|
Chris@16
|
84 {
|
Chris@16
|
85 BOOST_MATH_STD_USING
|
Chris@16
|
86 if((std::abs(v) < 200) && (x > 0))
|
Chris@16
|
87 return std::complex<T>(bessel_jn(v, x, pol), sign * bessel_yn(v, x, pol));
|
Chris@16
|
88 return hankel_imp(static_cast<T>(v), x, bessel_no_int_tag(), pol, sign);
|
Chris@16
|
89 }
|
Chris@16
|
90
|
Chris@16
|
91 template <class T, class Policy>
|
Chris@16
|
92 inline std::complex<T> sph_hankel_imp(T v, T x, const Policy& pol, int sign)
|
Chris@16
|
93 {
|
Chris@16
|
94 BOOST_MATH_STD_USING
|
Chris@16
|
95 return constants::root_half_pi<T>() * hankel_imp(v + 0.5f, x, bessel_no_int_tag(), pol, sign) / sqrt(std::complex<T>(x));
|
Chris@16
|
96 }
|
Chris@16
|
97
|
Chris@16
|
98 } // namespace detail
|
Chris@16
|
99
|
Chris@16
|
100 template <class T1, class T2, class Policy>
|
Chris@16
|
101 inline std::complex<typename detail::bessel_traits<T1, T2, Policy>::result_type> cyl_hankel_1(T1 v, T2 x, const Policy& pol)
|
Chris@16
|
102 {
|
Chris@16
|
103 BOOST_FPU_EXCEPTION_GUARD
|
Chris@16
|
104 typedef typename detail::bessel_traits<T1, T2, Policy>::result_type result_type;
|
Chris@16
|
105 typedef typename detail::bessel_traits<T1, T2, Policy>::optimisation_tag tag_type;
|
Chris@16
|
106 typedef typename policies::evaluation<result_type, Policy>::type value_type;
|
Chris@16
|
107 return policies::checked_narrowing_cast<std::complex<result_type>, Policy>(detail::hankel_imp<value_type>(v, static_cast<value_type>(x), tag_type(), pol, 1), "boost::math::cyl_hankel_1<%1%>(%1%,%1%)");
|
Chris@16
|
108 }
|
Chris@16
|
109
|
Chris@16
|
110 template <class T1, class T2>
|
Chris@16
|
111 inline std::complex<typename detail::bessel_traits<T1, T2, policies::policy<> >::result_type> cyl_hankel_1(T1 v, T2 x)
|
Chris@16
|
112 {
|
Chris@16
|
113 return cyl_hankel_1(v, x, policies::policy<>());
|
Chris@16
|
114 }
|
Chris@16
|
115
|
Chris@16
|
116 template <class T1, class T2, class Policy>
|
Chris@16
|
117 inline std::complex<typename detail::bessel_traits<T1, T2, Policy>::result_type> cyl_hankel_2(T1 v, T2 x, const Policy& pol)
|
Chris@16
|
118 {
|
Chris@16
|
119 BOOST_FPU_EXCEPTION_GUARD
|
Chris@16
|
120 typedef typename detail::bessel_traits<T1, T2, Policy>::result_type result_type;
|
Chris@16
|
121 typedef typename detail::bessel_traits<T1, T2, Policy>::optimisation_tag tag_type;
|
Chris@16
|
122 typedef typename policies::evaluation<result_type, Policy>::type value_type;
|
Chris@16
|
123 return policies::checked_narrowing_cast<std::complex<result_type>, Policy>(detail::hankel_imp<value_type>(v, static_cast<value_type>(x), tag_type(), pol, -1), "boost::math::cyl_hankel_1<%1%>(%1%,%1%)");
|
Chris@16
|
124 }
|
Chris@16
|
125
|
Chris@16
|
126 template <class T1, class T2>
|
Chris@16
|
127 inline std::complex<typename detail::bessel_traits<T1, T2, policies::policy<> >::result_type> cyl_hankel_2(T1 v, T2 x)
|
Chris@16
|
128 {
|
Chris@16
|
129 return cyl_hankel_2(v, x, policies::policy<>());
|
Chris@16
|
130 }
|
Chris@16
|
131
|
Chris@16
|
132 template <class T1, class T2, class Policy>
|
Chris@16
|
133 inline std::complex<typename detail::bessel_traits<T1, T2, Policy>::result_type> sph_hankel_1(T1 v, T2 x, const Policy&)
|
Chris@16
|
134 {
|
Chris@16
|
135 BOOST_FPU_EXCEPTION_GUARD
|
Chris@16
|
136 typedef typename detail::bessel_traits<T1, T2, Policy>::result_type result_type;
|
Chris@16
|
137 typedef typename policies::evaluation<result_type, Policy>::type value_type;
|
Chris@16
|
138 typedef typename policies::normalise<
|
Chris@16
|
139 Policy,
|
Chris@16
|
140 policies::promote_float<false>,
|
Chris@16
|
141 policies::promote_double<false>,
|
Chris@16
|
142 policies::discrete_quantile<>,
|
Chris@16
|
143 policies::assert_undefined<> >::type forwarding_policy;
|
Chris@16
|
144
|
Chris@16
|
145 return policies::checked_narrowing_cast<std::complex<result_type>, Policy>(detail::sph_hankel_imp<value_type>(static_cast<value_type>(v), static_cast<value_type>(x), forwarding_policy(), 1), "boost::math::sph_hankel_1<%1%>(%1%,%1%)");
|
Chris@16
|
146 }
|
Chris@16
|
147
|
Chris@16
|
148 template <class T1, class T2>
|
Chris@16
|
149 inline std::complex<typename detail::bessel_traits<T1, T2, policies::policy<> >::result_type> sph_hankel_1(T1 v, T2 x)
|
Chris@16
|
150 {
|
Chris@16
|
151 return sph_hankel_1(v, x, policies::policy<>());
|
Chris@16
|
152 }
|
Chris@16
|
153
|
Chris@16
|
154 template <class T1, class T2, class Policy>
|
Chris@16
|
155 inline std::complex<typename detail::bessel_traits<T1, T2, Policy>::result_type> sph_hankel_2(T1 v, T2 x, const Policy&)
|
Chris@16
|
156 {
|
Chris@16
|
157 BOOST_FPU_EXCEPTION_GUARD
|
Chris@16
|
158 typedef typename detail::bessel_traits<T1, T2, Policy>::result_type result_type;
|
Chris@16
|
159 typedef typename policies::evaluation<result_type, Policy>::type value_type;
|
Chris@16
|
160 typedef typename policies::normalise<
|
Chris@16
|
161 Policy,
|
Chris@16
|
162 policies::promote_float<false>,
|
Chris@16
|
163 policies::promote_double<false>,
|
Chris@16
|
164 policies::discrete_quantile<>,
|
Chris@16
|
165 policies::assert_undefined<> >::type forwarding_policy;
|
Chris@16
|
166
|
Chris@16
|
167 return policies::checked_narrowing_cast<std::complex<result_type>, Policy>(detail::sph_hankel_imp<value_type>(static_cast<value_type>(v), static_cast<value_type>(x), forwarding_policy(), -1), "boost::math::sph_hankel_1<%1%>(%1%,%1%)");
|
Chris@16
|
168 }
|
Chris@16
|
169
|
Chris@16
|
170 template <class T1, class T2>
|
Chris@16
|
171 inline std::complex<typename detail::bessel_traits<T1, T2, policies::policy<> >::result_type> sph_hankel_2(T1 v, T2 x)
|
Chris@16
|
172 {
|
Chris@16
|
173 return sph_hankel_2(v, x, policies::policy<>());
|
Chris@16
|
174 }
|
Chris@16
|
175
|
Chris@16
|
176 }} // namespaces
|
Chris@16
|
177
|
Chris@16
|
178 #endif // BOOST_MATH_HANKEL_HPP
|
Chris@16
|
179
|