bessel_j0.hpp 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219
  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_J0_HPP
  6. #define BOOST_MATH_BESSEL_J0_HPP
  7. #ifdef _MSC_VER
  8. #pragma once
  9. #endif
  10. #include <boost/math/constants/constants.hpp>
  11. #include <boost/math/tools/rational.hpp>
  12. #include <boost/math/tools/big_constant.hpp>
  13. #include <boost/math/tools/assert.hpp>
  14. #if defined(__GNUC__) && defined(BOOST_MATH_USE_FLOAT128)
  15. //
  16. // This is the only way we can avoid
  17. // warning: non-standard suffix on floating constant [-Wpedantic]
  18. // when building with -Wall -pedantic. Neither __extension__
  19. // nor #pragma diagnostic ignored work :(
  20. //
  21. #pragma GCC system_header
  22. #endif
  23. // Bessel function of the first kind of order zero
  24. // x <= 8, minimax rational approximations on root-bracketing intervals
  25. // x > 8, Hankel asymptotic expansion in Hart, Computer Approximations, 1968
  26. namespace boost { namespace math { namespace detail{
  27. template <typename T>
  28. T bessel_j0(T x);
  29. template <class T>
  30. struct bessel_j0_initializer
  31. {
  32. struct init
  33. {
  34. init()
  35. {
  36. do_init();
  37. }
  38. static void do_init()
  39. {
  40. bessel_j0(T(1));
  41. }
  42. void force_instantiate()const{}
  43. };
  44. static const init initializer;
  45. static void force_instantiate()
  46. {
  47. initializer.force_instantiate();
  48. }
  49. };
  50. template <class T>
  51. const typename bessel_j0_initializer<T>::init bessel_j0_initializer<T>::initializer;
  52. template <typename T>
  53. T bessel_j0(T x)
  54. {
  55. bessel_j0_initializer<T>::force_instantiate();
  56. #ifdef BOOST_MATH_INSTRUMENT
  57. static bool b = false;
  58. if (!b)
  59. {
  60. std::cout << "bessel_j0 called with " << typeid(x).name() << std::endl;
  61. std::cout << "double = " << typeid(double).name() << std::endl;
  62. std::cout << "long double = " << typeid(long double).name() << std::endl;
  63. b = true;
  64. }
  65. #endif
  66. static const T P1[] = {
  67. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -4.1298668500990866786e+11)),
  68. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.7282507878605942706e+10)),
  69. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -6.2140700423540120665e+08)),
  70. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 6.6302997904833794242e+06)),
  71. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -3.6629814655107086448e+04)),
  72. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0344222815443188943e+02)),
  73. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.2117036164593528341e-01))
  74. };
  75. static const T Q1[] = {
  76. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.3883787996332290397e+12)),
  77. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.6328198300859648632e+10)),
  78. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.3985097372263433271e+08)),
  79. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.5612696224219938200e+05)),
  80. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 9.3614022392337710626e+02)),
  81. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  82. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 0.0))
  83. };
  84. static const T P2[] = {
  85. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.8319397969392084011e+03)),
  86. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.2254078161378989535e+04)),
  87. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -7.2879702464464618998e+03)),
  88. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0341910641583726701e+04)),
  89. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.1725046279757103576e+04)),
  90. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.4176707025325087628e+03)),
  91. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 7.4321196680624245801e+02)),
  92. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.8591703355916499363e+01))
  93. };
  94. static const T Q2[] = {
  95. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -3.5783478026152301072e+05)),
  96. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.4599102262586308984e+05)),
  97. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -8.4055062591169562211e+04)),
  98. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.8680990008359188352e+04)),
  99. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -2.9458766545509337327e+03)),
  100. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.3307310774649071172e+02)),
  101. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -2.5258076240801555057e+01)),
  102. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0))
  103. };
  104. static const T PC[] = {
  105. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.2779090197304684302e+04)),
  106. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.1345386639580765797e+04)),
  107. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.1170523380864944322e+04)),
  108. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.4806486443249270347e+03)),
  109. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.5376201909008354296e+02)),
  110. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.8961548424210455236e-01))
  111. };
  112. static const T QC[] = {
  113. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.2779090197304684318e+04)),
  114. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.1370412495510416640e+04)),
  115. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.1215350561880115730e+04)),
  116. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.5028735138235608207e+03)),
  117. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.5711159858080893649e+02)),
  118. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0))
  119. };
  120. static const T PS[] = {
  121. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -8.9226600200800094098e+01)),
  122. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.8591953644342993800e+02)),
  123. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.1183429920482737611e+02)),
  124. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -2.2300261666214198472e+01)),
  125. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.2441026745835638459e+00)),
  126. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -8.8033303048680751817e-03))
  127. };
  128. static const T QS[] = {
  129. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.7105024128512061905e+03)),
  130. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.1951131543434613647e+04)),
  131. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 7.2642780169211018836e+03)),
  132. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.4887231232283756582e+03)),
  133. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 9.0593769594993125859e+01)),
  134. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0))
  135. };
  136. static const T x1 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.4048255576957727686e+00)),
  137. x2 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.5200781102863106496e+00)),
  138. x11 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 6.160e+02)),
  139. x12 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.42444230422723137837e-03)),
  140. x21 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.4130e+03)),
  141. x22 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.46860286310649596604e-04));
  142. T value, factor, r, rc, rs;
  143. BOOST_MATH_STD_USING
  144. using namespace boost::math::tools;
  145. using namespace boost::math::constants;
  146. if (x < 0)
  147. {
  148. x = -x; // even function
  149. }
  150. if (x == 0)
  151. {
  152. return static_cast<T>(1);
  153. }
  154. if (x <= 4) // x in (0, 4]
  155. {
  156. T y = x * x;
  157. BOOST_MATH_ASSERT(sizeof(P1) == sizeof(Q1));
  158. r = evaluate_rational(P1, Q1, y);
  159. factor = (x + x1) * ((x - x11/256) - x12);
  160. value = factor * r;
  161. }
  162. else if (x <= 8.0) // x in (4, 8]
  163. {
  164. T y = 1 - (x * x)/64;
  165. BOOST_MATH_ASSERT(sizeof(P2) == sizeof(Q2));
  166. r = evaluate_rational(P2, Q2, y);
  167. factor = (x + x2) * ((x - x21/256) - x22);
  168. value = factor * r;
  169. }
  170. else // x in (8, \infty)
  171. {
  172. T y = 8 / x;
  173. T y2 = y * y;
  174. BOOST_MATH_ASSERT(sizeof(PC) == sizeof(QC));
  175. BOOST_MATH_ASSERT(sizeof(PS) == sizeof(QS));
  176. rc = evaluate_rational(PC, QC, y2);
  177. rs = evaluate_rational(PS, QS, y2);
  178. factor = constants::one_div_root_pi<T>() / sqrt(x);
  179. //
  180. // What follows is really just:
  181. //
  182. // T z = x - pi/4;
  183. // value = factor * (rc * cos(z) - y * rs * sin(z));
  184. //
  185. // But using the addition formulae for sin and cos, plus
  186. // the special values for sin/cos of pi/4.
  187. //
  188. T sx = sin(x);
  189. T cx = cos(x);
  190. BOOST_MATH_INSTRUMENT_VARIABLE(rc);
  191. BOOST_MATH_INSTRUMENT_VARIABLE(rs);
  192. BOOST_MATH_INSTRUMENT_VARIABLE(factor);
  193. BOOST_MATH_INSTRUMENT_VARIABLE(sx);
  194. BOOST_MATH_INSTRUMENT_VARIABLE(cx);
  195. value = factor * (rc * (cx + sx) - y * rs * (sx - cx));
  196. }
  197. return value;
  198. }
  199. }}} // namespaces
  200. #endif // BOOST_MATH_BESSEL_J0_HPP