bessel_y0.hpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240
  1. // Copyright (c) 2006 Xiaogang Zhang
  2. // Use, modification and distribution are subject to the
  3. // Boost Software License, Version 1.0. (See accompanying file
  4. // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
  5. #ifndef BOOST_MATH_BESSEL_Y0_HPP
  6. #define BOOST_MATH_BESSEL_Y0_HPP
  7. #ifdef _MSC_VER
  8. #pragma once
  9. #pragma warning(push)
  10. #pragma warning(disable:4702) // Unreachable code (release mode only warning)
  11. #endif
  12. #include <boost/math/special_functions/detail/bessel_j0.hpp>
  13. #include <boost/math/constants/constants.hpp>
  14. #include <boost/math/tools/rational.hpp>
  15. #include <boost/math/tools/big_constant.hpp>
  16. #include <boost/math/policies/error_handling.hpp>
  17. #include <boost/assert.hpp>
  18. #if defined(__GNUC__) && defined(BOOST_MATH_USE_FLOAT128)
  19. //
  20. // This is the only way we can avoid
  21. // warning: non-standard suffix on floating constant [-Wpedantic]
  22. // when building with -Wall -pedantic. Neither __extension__
  23. // nor #pragma dianostic ignored work :(
  24. //
  25. #pragma GCC system_header
  26. #endif
  27. // Bessel function of the second kind of order zero
  28. // x <= 8, minimax rational approximations on root-bracketing intervals
  29. // x > 8, Hankel asymptotic expansion in Hart, Computer Approximations, 1968
  30. namespace boost { namespace math { namespace detail{
  31. template <typename T, typename Policy>
  32. T bessel_y0(T x, const Policy&);
  33. template <class T, class Policy>
  34. struct bessel_y0_initializer
  35. {
  36. struct init
  37. {
  38. init()
  39. {
  40. do_init();
  41. }
  42. static void do_init()
  43. {
  44. bessel_y0(T(1), Policy());
  45. }
  46. void force_instantiate()const{}
  47. };
  48. static const init initializer;
  49. static void force_instantiate()
  50. {
  51. initializer.force_instantiate();
  52. }
  53. };
  54. template <class T, class Policy>
  55. const typename bessel_y0_initializer<T, Policy>::init bessel_y0_initializer<T, Policy>::initializer;
  56. template <typename T, typename Policy>
  57. T bessel_y0(T x, const Policy& pol)
  58. {
  59. bessel_y0_initializer<T, Policy>::force_instantiate();
  60. static const T P1[] = {
  61. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0723538782003176831e+11)),
  62. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -8.3716255451260504098e+09)),
  63. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.0422274357376619816e+08)),
  64. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -2.1287548474401797963e+06)),
  65. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0102532948020907590e+04)),
  66. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.8402381979244993524e+01)),
  67. };
  68. static const T Q1[] = {
  69. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.8873865738997033405e+11)),
  70. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.1617187777290363573e+09)),
  71. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.5662956624278251596e+07)),
  72. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.3889393209447253406e+05)),
  73. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 6.6475986689240190091e+02)),
  74. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  75. };
  76. static const T P2[] = {
  77. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -2.2213976967566192242e+13)),
  78. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -5.5107435206722644429e+11)),
  79. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.3600098638603061642e+10)),
  80. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -6.9590439394619619534e+08)),
  81. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.6905288611678631510e+06)),
  82. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.4566865832663635920e+04)),
  83. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.7427031242901594547e+01)),
  84. };
  85. static const T Q2[] = {
  86. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.3386146580707264428e+14)),
  87. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.4266824419412347550e+12)),
  88. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.4015103849971240096e+10)),
  89. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.3960202770986831075e+08)),
  90. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.0669982352539552018e+05)),
  91. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.3030857612070288823e+02)),
  92. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  93. };
  94. static const T P3[] = {
  95. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -8.0728726905150210443e+15)),
  96. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 6.7016641869173237784e+14)),
  97. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.2829912364088687306e+11)),
  98. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.9363051266772083678e+11)),
  99. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.1958827170518100757e+09)),
  100. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.0085539923498211426e+07)),
  101. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.1363534169313901632e+04)),
  102. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.7439661319197499338e+01)),
  103. };
  104. static const T Q3[] = {
  105. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.4563724628846457519e+17)),
  106. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.9272425569640309819e+15)),
  107. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.2598377924042897629e+13)),
  108. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.6926121104209825246e+10)),
  109. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.4727219475672302327e+08)),
  110. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.3924739209768057030e+05)),
  111. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.7903362168128450017e+02)),
  112. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  113. };
  114. static const T PC[] = {
  115. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.2779090197304684302e+04)),
  116. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.1345386639580765797e+04)),
  117. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.1170523380864944322e+04)),
  118. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.4806486443249270347e+03)),
  119. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.5376201909008354296e+02)),
  120. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.8961548424210455236e-01)),
  121. };
  122. static const T QC[] = {
  123. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.2779090197304684318e+04)),
  124. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.1370412495510416640e+04)),
  125. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.1215350561880115730e+04)),
  126. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.5028735138235608207e+03)),
  127. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.5711159858080893649e+02)),
  128. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  129. };
  130. static const T PS[] = {
  131. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -8.9226600200800094098e+01)),
  132. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.8591953644342993800e+02)),
  133. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.1183429920482737611e+02)),
  134. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -2.2300261666214198472e+01)),
  135. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.2441026745835638459e+00)),
  136. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -8.8033303048680751817e-03)),
  137. };
  138. static const T QS[] = {
  139. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.7105024128512061905e+03)),
  140. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.1951131543434613647e+04)),
  141. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 7.2642780169211018836e+03)),
  142. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.4887231232283756582e+03)),
  143. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 9.0593769594993125859e+01)),
  144. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  145. };
  146. static const T x1 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.9357696627916752158e-01)),
  147. x2 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.9576784193148578684e+00)),
  148. x3 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 7.0860510603017726976e+00)),
  149. x11 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.280e+02)),
  150. x12 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.9519662791675215849e-03)),
  151. x21 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0130e+03)),
  152. x22 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 6.4716931485786837568e-04)),
  153. x31 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.8140e+03)),
  154. x32 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.1356030177269762362e-04))
  155. ;
  156. T value, factor, r, rc, rs;
  157. BOOST_MATH_STD_USING
  158. using namespace boost::math::tools;
  159. using namespace boost::math::constants;
  160. static const char* function = "boost::math::bessel_y0<%1%>(%1%,%1%)";
  161. if (x < 0)
  162. {
  163. return policies::raise_domain_error<T>(function,
  164. "Got x = %1% but x must be non-negative, complex result not supported.", x, pol);
  165. }
  166. if (x == 0)
  167. {
  168. return -policies::raise_overflow_error<T>(function, 0, pol);
  169. }
  170. if (x <= 3) // x in (0, 3]
  171. {
  172. T y = x * x;
  173. T z = 2 * log(x/x1) * bessel_j0(x) / pi<T>();
  174. r = evaluate_rational(P1, Q1, y);
  175. factor = (x + x1) * ((x - x11/256) - x12);
  176. value = z + factor * r;
  177. }
  178. else if (x <= 5.5f) // x in (3, 5.5]
  179. {
  180. T y = x * x;
  181. T z = 2 * log(x/x2) * bessel_j0(x) / pi<T>();
  182. r = evaluate_rational(P2, Q2, y);
  183. factor = (x + x2) * ((x - x21/256) - x22);
  184. value = z + factor * r;
  185. }
  186. else if (x <= 8) // x in (5.5, 8]
  187. {
  188. T y = x * x;
  189. T z = 2 * log(x/x3) * bessel_j0(x) / pi<T>();
  190. r = evaluate_rational(P3, Q3, y);
  191. factor = (x + x3) * ((x - x31/256) - x32);
  192. value = z + factor * r;
  193. }
  194. else // x in (8, \infty)
  195. {
  196. T y = 8 / x;
  197. T y2 = y * y;
  198. rc = evaluate_rational(PC, QC, y2);
  199. rs = evaluate_rational(PS, QS, y2);
  200. factor = constants::one_div_root_pi<T>() / sqrt(x);
  201. //
  202. // The following code is really just:
  203. //
  204. // T z = x - 0.25f * pi<T>();
  205. // value = factor * (rc * sin(z) + y * rs * cos(z));
  206. //
  207. // But using the sin/cos addition formulae and constant values for
  208. // sin/cos of PI/4 which then cancel part of the "factor" term as they're all
  209. // 1 / sqrt(2):
  210. //
  211. T sx = sin(x);
  212. T cx = cos(x);
  213. value = factor * (rc * (sx - cx) + y * rs * (cx + sx));
  214. }
  215. return value;
  216. }
  217. }}} // namespaces
  218. #ifdef _MSC_VER
  219. #pragma warning(pop)
  220. #endif
  221. #endif // BOOST_MATH_BESSEL_Y0_HPP