bessel_j1.hpp 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209
  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_J1_HPP
  6. #define BOOST_MATH_BESSEL_J1_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/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 dianostic ignored work :(
  20. //
  21. #pragma GCC system_header
  22. #endif
  23. // Bessel function of the first kind of order one
  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_j1(T x);
  29. template <class T>
  30. struct bessel_j1_initializer
  31. {
  32. struct init
  33. {
  34. init()
  35. {
  36. do_init();
  37. }
  38. static void do_init()
  39. {
  40. bessel_j1(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_j1_initializer<T>::init bessel_j1_initializer<T>::initializer;
  52. template <typename T>
  53. T bessel_j1(T x)
  54. {
  55. bessel_j1_initializer<T>::force_instantiate();
  56. static const T P1[] = {
  57. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.4258509801366645672e+11)),
  58. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 6.6781041261492395835e+09)),
  59. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.1548696764841276794e+08)),
  60. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 9.8062904098958257677e+05)),
  61. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -4.4615792982775076130e+03)),
  62. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0650724020080236441e+01)),
  63. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.0767857011487300348e-02))
  64. };
  65. static const T Q1[] = {
  66. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.1868604460820175290e+12)),
  67. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.2091902282580133541e+10)),
  68. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.0228375140097033958e+08)),
  69. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.9117614494174794095e+05)),
  70. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0742272239517380498e+03)),
  71. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  72. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 0.0))
  73. };
  74. static const T P2[] = {
  75. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.7527881995806511112e+16)),
  76. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.6608531731299018674e+15)),
  77. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -3.6658018905416665164e+13)),
  78. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.5580665670910619166e+11)),
  79. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.8113931269860667829e+09)),
  80. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.0793266148011179143e+06)),
  81. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -7.5023342220781607561e+03)),
  82. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.6179191852758252278e+00))
  83. };
  84. static const T Q2[] = {
  85. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.7253905888447681194e+18)),
  86. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.7128800897135812012e+16)),
  87. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.4899346165481429307e+13)),
  88. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.7622777286244082666e+11)),
  89. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 6.4872502899596389593e+08)),
  90. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.1267125065029138050e+06)),
  91. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.3886978985861357615e+03)),
  92. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0))
  93. };
  94. static const T PC[] = {
  95. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -4.4357578167941278571e+06)),
  96. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -9.9422465050776411957e+06)),
  97. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -6.6033732483649391093e+06)),
  98. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.5235293511811373833e+06)),
  99. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.0982405543459346727e+05)),
  100. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.6116166443246101165e+03)),
  101. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 0.0))
  102. };
  103. static const T QC[] = {
  104. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -4.4357578167941278568e+06)),
  105. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -9.9341243899345856590e+06)),
  106. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -6.5853394797230870728e+06)),
  107. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.5118095066341608816e+06)),
  108. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.0726385991103820119e+05)),
  109. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.4550094401904961825e+03)),
  110. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0))
  111. };
  112. static const T PS[] = {
  113. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.3220913409857223519e+04)),
  114. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.5145160675335701966e+04)),
  115. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 6.6178836581270835179e+04)),
  116. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.8494262873223866797e+04)),
  117. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.7063754290207680021e+03)),
  118. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.5265133846636032186e+01)),
  119. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 0.0))
  120. };
  121. static const T QS[] = {
  122. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 7.0871281941028743574e+05)),
  123. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.8194580422439972989e+06)),
  124. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.4194606696037208929e+06)),
  125. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.0029443582266975117e+05)),
  126. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.7890229745772202641e+04)),
  127. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.6383677696049909675e+02)),
  128. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0))
  129. };
  130. static const T x1 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.8317059702075123156e+00)),
  131. x2 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 7.0155866698156187535e+00)),
  132. x11 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 9.810e+02)),
  133. x12 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -3.2527979248768438556e-04)),
  134. x21 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.7960e+03)),
  135. x22 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -3.8330184381246462950e-05));
  136. T value, factor, r, rc, rs, w;
  137. BOOST_MATH_STD_USING
  138. using namespace boost::math::tools;
  139. using namespace boost::math::constants;
  140. w = abs(x);
  141. if (x == 0)
  142. {
  143. return static_cast<T>(0);
  144. }
  145. if (w <= 4) // w in (0, 4]
  146. {
  147. T y = x * x;
  148. BOOST_ASSERT(sizeof(P1) == sizeof(Q1));
  149. r = evaluate_rational(P1, Q1, y);
  150. factor = w * (w + x1) * ((w - x11/256) - x12);
  151. value = factor * r;
  152. }
  153. else if (w <= 8) // w in (4, 8]
  154. {
  155. T y = x * x;
  156. BOOST_ASSERT(sizeof(P2) == sizeof(Q2));
  157. r = evaluate_rational(P2, Q2, y);
  158. factor = w * (w + x2) * ((w - x21/256) - x22);
  159. value = factor * r;
  160. }
  161. else // w in (8, \infty)
  162. {
  163. T y = 8 / w;
  164. T y2 = y * y;
  165. BOOST_ASSERT(sizeof(PC) == sizeof(QC));
  166. BOOST_ASSERT(sizeof(PS) == sizeof(QS));
  167. rc = evaluate_rational(PC, QC, y2);
  168. rs = evaluate_rational(PS, QS, y2);
  169. factor = 1 / (sqrt(w) * constants::root_pi<T>());
  170. //
  171. // What follows is really just:
  172. //
  173. // T z = w - 0.75f * pi<T>();
  174. // value = factor * (rc * cos(z) - y * rs * sin(z));
  175. //
  176. // but using the sin/cos addition rules plus constants
  177. // for the values of sin/cos of 3PI/4 which then cancel
  178. // out with corresponding terms in "factor".
  179. //
  180. T sx = sin(x);
  181. T cx = cos(x);
  182. value = factor * (rc * (sx - cx) + y * rs * (sx + cx));
  183. }
  184. if (x < 0)
  185. {
  186. value *= -1; // odd function
  187. }
  188. return value;
  189. }
  190. }}} // namespaces
  191. #endif // BOOST_MATH_BESSEL_J1_HPP