bessel_y1.hpp 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184
  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_Y1_HPP
  6. #define BOOST_MATH_BESSEL_Y1_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/tools/config.hpp>
  13. #include <boost/math/special_functions/detail/bessel_j1.hpp>
  14. #include <boost/math/constants/constants.hpp>
  15. #include <boost/math/tools/rational.hpp>
  16. #include <boost/math/tools/big_constant.hpp>
  17. #include <boost/math/policies/error_handling.hpp>
  18. #include <boost/math/tools/assert.hpp>
  19. #if defined(__GNUC__) && defined(BOOST_MATH_USE_FLOAT128)
  20. //
  21. // This is the only way we can avoid
  22. // warning: non-standard suffix on floating constant [-Wpedantic]
  23. // when building with -Wall -pedantic. Neither __extension__
  24. // nor #pragma diagnostic ignored work :(
  25. //
  26. #pragma GCC system_header
  27. #endif
  28. // Bessel function of the second kind of order one
  29. // x <= 8, minimax rational approximations on root-bracketing intervals
  30. // x > 8, Hankel asymptotic expansion in Hart, Computer Approximations, 1968
  31. namespace boost { namespace math { namespace detail{
  32. template <typename T, typename Policy>
  33. BOOST_MATH_GPU_ENABLED T bessel_y1(T x, const Policy&);
  34. template <typename T, typename Policy>
  35. BOOST_MATH_GPU_ENABLED T bessel_y1(T x, const Policy&)
  36. {
  37. BOOST_MATH_STATIC const T P1[] = {
  38. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.0535726612579544093e+13)),
  39. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.4708611716525426053e+12)),
  40. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -3.7595974497819597599e+11)),
  41. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 7.2144548214502560419e+09)),
  42. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -5.9157479997408395984e+07)),
  43. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.2157953222280260820e+05)),
  44. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -3.1714424660046133456e+02)),
  45. };
  46. BOOST_MATH_STATIC const T Q1[] = {
  47. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.0737873921079286084e+14)),
  48. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.1272286200406461981e+12)),
  49. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.7800352738690585613e+10)),
  50. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.2250435122182963220e+08)),
  51. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.8136470753052572164e+05)),
  52. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.2079908168393867438e+02)),
  53. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  54. };
  55. BOOST_MATH_STATIC const T P2[] = {
  56. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.1514276357909013326e+19)),
  57. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -5.6808094574724204577e+18)),
  58. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -2.3638408497043134724e+16)),
  59. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.0686275289804744814e+15)),
  60. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -5.9530713129741981618e+13)),
  61. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.7453673962438488783e+11)),
  62. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.1957961912070617006e+09)),
  63. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.9153806858264202986e+06)),
  64. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.2337180442012953128e+03)),
  65. };
  66. BOOST_MATH_STATIC const T Q2[] = {
  67. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.3321844313316185697e+20)),
  68. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.6968198822857178911e+18)),
  69. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.0837179548112881950e+16)),
  70. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.1187010065856971027e+14)),
  71. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.0221766852960403645e+11)),
  72. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 6.3550318087088919566e+08)),
  73. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0453748201934079734e+06)),
  74. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.2855164849321609336e+03)),
  75. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  76. };
  77. BOOST_MATH_STATIC const T PC[] = {
  78. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -4.4357578167941278571e+06)),
  79. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -9.9422465050776411957e+06)),
  80. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -6.6033732483649391093e+06)),
  81. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.5235293511811373833e+06)),
  82. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.0982405543459346727e+05)),
  83. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.6116166443246101165e+03)),
  84. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 0.0)),
  85. };
  86. BOOST_MATH_STATIC const T QC[] = {
  87. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -4.4357578167941278568e+06)),
  88. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -9.9341243899345856590e+06)),
  89. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -6.5853394797230870728e+06)),
  90. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.5118095066341608816e+06)),
  91. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.0726385991103820119e+05)),
  92. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -1.4550094401904961825e+03)),
  93. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  94. };
  95. BOOST_MATH_STATIC const T PS[] = {
  96. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.3220913409857223519e+04)),
  97. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.5145160675335701966e+04)),
  98. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 6.6178836581270835179e+04)),
  99. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.8494262873223866797e+04)),
  100. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.7063754290207680021e+03)),
  101. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.5265133846636032186e+01)),
  102. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 0.0)),
  103. };
  104. BOOST_MATH_STATIC const T QS[] = {
  105. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 7.0871281941028743574e+05)),
  106. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.8194580422439972989e+06)),
  107. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.4194606696037208929e+06)),
  108. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 4.0029443582266975117e+05)),
  109. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 3.7890229745772202641e+04)),
  110. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 8.6383677696049909675e+02)),
  111. static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.0)),
  112. };
  113. BOOST_MATH_STATIC const T x1 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 2.1971413260310170351e+00)),
  114. x2 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.4296810407941351328e+00)),
  115. x11 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 5.620e+02)),
  116. x12 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.8288260310170351490e-03)),
  117. x21 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, 1.3900e+03)),
  118. x22 = static_cast<T>(BOOST_MATH_BIG_CONSTANT(T, 64, -6.4592058648672279948e-06))
  119. ;
  120. T value, factor, r, rc, rs;
  121. BOOST_MATH_STD_USING
  122. using namespace boost::math::tools;
  123. using namespace boost::math::constants;
  124. BOOST_MATH_ASSERT(x > 0);
  125. if (x <= 4) // x in (0, 4]
  126. {
  127. T y = x * x;
  128. T z = 2 * log(x/x1) * bessel_j1(x) / pi<T>();
  129. r = evaluate_rational(P1, Q1, y);
  130. factor = (x + x1) * ((x - x11/256) - x12) / x;
  131. value = z + factor * r;
  132. }
  133. else if (x <= 8) // x in (4, 8]
  134. {
  135. T y = x * x;
  136. T z = 2 * log(x/x2) * bessel_j1(x) / pi<T>();
  137. r = evaluate_rational(P2, Q2, y);
  138. factor = (x + x2) * ((x - x21/256) - x22) / x;
  139. value = z + factor * r;
  140. }
  141. else // x in (8, \infty)
  142. {
  143. T y = 8 / x;
  144. T y2 = y * y;
  145. rc = evaluate_rational(PC, QC, y2);
  146. rs = evaluate_rational(PS, QS, y2);
  147. factor = 1 / (sqrt(x) * root_pi<T>());
  148. //
  149. // This code is really just:
  150. //
  151. // T z = x - 0.75f * pi<T>();
  152. // value = factor * (rc * sin(z) + y * rs * cos(z));
  153. //
  154. // But using the sin/cos addition rules, plus constants for sin/cos of 3PI/4
  155. // which then cancel out with corresponding terms in "factor".
  156. //
  157. T sx = sin(x);
  158. T cx = cos(x);
  159. value = factor * (y * rs * (sx - cx) - rc * (sx + cx));
  160. }
  161. return value;
  162. }
  163. }}} // namespaces
  164. #ifdef _MSC_VER
  165. #pragma warning(pop)
  166. #endif
  167. #endif // BOOST_MATH_BESSEL_Y1_HPP