test_Riccati_Bessel_logarithmic_derivative.cc 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233
  1. #include "gtest/gtest.h"
  2. #include "../src/nmie-impl.hpp"
  3. #include "test_spec_functions_data.hpp"
  4. // From W. Yang APPLIED OPTICS Vol. 42, No. 9, 20 March 2003
  5. // Dtest refractive index is m={1.05,1}, the size parameter is x = 80
  6. std::vector<int> Dtest_n({0,1,30,50,60,70,75,80,85,90,99,116,130});
  7. std::vector< std::complex<double>>
  8. Dtest_D1({
  9. //Orig
  10. // {0.11449e-15 ,-0.10000e+01 },{0.74646e-04 ,-0.10000e+01 },
  11. // {0.34764e-01 ,-0.99870},{0.95292e-01 ,-0.99935},
  12. // {0.13645,-0.10019e+01 },{0.18439,-0.10070e+01 },
  13. // {0.21070,-0.10107e+01 },{0.23845,-0.10154e+01 },
  14. // {0.26752,-0.10210e+01 },{0.29777,-0.10278e+01 },
  15. // {0.35481,-0.10426e+01 },{0.46923,-0.10806e+01 },
  16. // {0.17656,-0.13895e+01 }
  17. // mod (from Python mpmath)
  18. {0.0,-1.0}, {7.464603828e-5,-0.9999958865},
  19. {0.03476380918,-0.9986960672},{0.09529213152,-0.999347654},
  20. {0.1364513887,-1.001895883},{0.184388335,-1.006979164},
  21. {0.2107044267,-1.01072099},{0.2384524295,-1.015382914},
  22. {0.2675164524,-1.021040337},{0.2977711192,-1.027753418},
  23. {0.3548096904,-1.042622957},{0.4692294405,-1.080629479},
  24. {0.5673827836,-1.121108944},
  25. });
  26. std::vector< std::complex<double>>
  27. Dtest_D2({{0.64966e-69 ,-0.10000e+01 },{0.74646e-04 ,-0.10000e+01 },
  28. {0.34764e-01 ,-0.99870},{0.95292e-01 ,-0.99935},
  29. {0.13645,-0.10019e+01 },{0.17769,-0.10099e+01 },
  30. {0.41264e-01 ,-0.21076e+01 },{-0.20190,0.10435e+01 },
  31. {-0.26343,0.10223e+01 },{-0.29339,0.10291e+01 },
  32. {-0.34969,0.10437e+01 },{-0.46296,0.10809e+01 },
  33. {-0.56047,0.11206e+01 }});
  34. std::vector< std::complex<double>>
  35. Dtest_D3({{0.00000,0.10000e+01 },{-0.73809e-04 ,0.10000e+01 },
  36. {-0.34344e-01 ,0.99912},{-0.94022e-01 ,0.10004e+01 },
  37. {-0.13455,0.10032e+01 },{-0.18172,0.10084e+01 },
  38. {-0.20762,0.10122e+01 },{-0.23494,0.10169e+01 },
  39. {-0.26357,0.10225e+01 },{-0.29339,0.10291e+01 },
  40. {-0.34969,0.10437e+01 },{-0.46296,0.10809e+01 },
  41. {-0.56047,0.11206e+01 }});
  42. int LeRu_cutoff(std::complex<double> z) {
  43. auto x = std::abs(z);
  44. return std::round(x + 11 * std::pow(x, (1.0 / 3.0)) + 1);
  45. }
  46. void parse_mpmath_data(const double min_abs_tol, const std::tuple< std::complex<double>, int, std::complex<double>, double, double > data,
  47. std::complex<double> &z, int &n, std::complex<double> &func_mp,
  48. double &re_abs_tol, double &im_abs_tol){
  49. z = std::get<0>(data);
  50. n = std::get<1>(data);
  51. func_mp = std::get<2>(data);
  52. re_abs_tol = ( std::get<3>(data) > min_abs_tol && std::real(func_mp) < min_abs_tol)
  53. ? std::get<3>(data) : min_abs_tol;
  54. im_abs_tol = ( std::get<4>(data) > min_abs_tol && std::imag(func_mp) < min_abs_tol)
  55. ? std::get<4>(data) : min_abs_tol;
  56. // if re(func_mp) < 0.5 then round will give 0. To avoid zero tolerance add one.
  57. re_abs_tol *= std::abs(std::round(std::real(func_mp))) + 1;
  58. im_abs_tol *= std::abs(std::round(std::imag(func_mp))) + 1;
  59. }
  60. //TEST(zeta_test, DISABLED_mpmath_generated_input) {
  61. TEST(zeta_test, mpmath_generated_input) {
  62. double min_abs_tol = 2e-11;
  63. std::complex<double> z, zeta_mp;
  64. int n;
  65. double re_abs_tol, im_abs_tol;
  66. for (const auto &data : zeta_test_16digits) {
  67. parse_mpmath_data(min_abs_tol, data, z, n, zeta_mp, re_abs_tol, im_abs_tol);
  68. auto Nstop = LeRu_cutoff(z)+1000;
  69. if (n > Nstop) continue;
  70. std::vector<std::complex<nmie::FloatType>> D1dr(Nstop+35), D3(Nstop+35), zeta(Nstop);
  71. nmie::evalDownwardD1(z, D1dr);
  72. nmie::evalUpwardD3(z, D1dr, D3);
  73. nmie::evalUpwardZeta(z, D3, zeta);
  74. EXPECT_NEAR(std::real(zeta[n]), std::real(zeta_mp), re_abs_tol)
  75. << "zeta at n=" << n << " Nstop="<< Nstop<<" z="<<z;
  76. EXPECT_NEAR(std::imag(zeta[n]), std::imag(zeta_mp), im_abs_tol)
  77. << "zeta at n=" << n << " Nstop="<< Nstop<<" z="<<z;
  78. }
  79. }
  80. //TEST(psi_test, DISABLED_mpmath_generated_input) {
  81. TEST(psi_test, mpmath_generated_input) {
  82. double min_abs_tol = 2e-11;
  83. std::complex<double> z, Psi_mp;
  84. int n;
  85. double re_abs_tol, im_abs_tol;
  86. for (const auto &data : psi_test_16digits) {
  87. parse_mpmath_data(min_abs_tol, data, z, n, Psi_mp, re_abs_tol, im_abs_tol);
  88. auto Nstop = LeRu_cutoff(z)+10000;
  89. if (n > Nstop) continue;
  90. std::vector<std::complex<nmie::FloatType>> D1dr(Nstop+35), Psi(Nstop);
  91. nmie::evalDownwardD1(z, D1dr);
  92. nmie::evalUpwardPsi(z, D1dr, Psi);
  93. EXPECT_NEAR(std::real(Psi[n]), std::real(Psi_mp), re_abs_tol)
  94. << "Psi at n=" << n << " Nstop="<< Nstop<<" z="<<z;
  95. EXPECT_NEAR(std::imag(Psi[n]), std::imag(Psi_mp), im_abs_tol)
  96. << "Psi at n=" << n << " Nstop="<< Nstop<<" z="<<z;
  97. }
  98. }
  99. TEST(D3test, DISABLED_mpmath_generated_input) {
  100. //TEST(D3test, mpmath_generated_input) {
  101. double min_abs_tol = 2e-11;
  102. std::complex<double> z, D3_mp;
  103. int n;
  104. double re_abs_tol, im_abs_tol;
  105. for (const auto &data : D3_test_16digits) {
  106. parse_mpmath_data(min_abs_tol, data, z, n, D3_mp, re_abs_tol, im_abs_tol);
  107. auto Nstop = LeRu_cutoff(z)+1;
  108. std::vector<std::complex<nmie::FloatType>> D1dr(Nstop+35), D3(Nstop+35);
  109. nmie::evalDownwardD1(z, D1dr);
  110. nmie::evalUpwardD3(z, D1dr, D3);
  111. EXPECT_NEAR(std::real(D3[n]), std::real(D3_mp), re_abs_tol)
  112. << "D3 at n=" << n << " Nstop="<< Nstop<<" z="<<z;
  113. EXPECT_NEAR(std::imag(D3[n]), std::imag(D3_mp), im_abs_tol)
  114. << "D3 at n=" << n << " Nstop="<< Nstop<<" z="<<z;
  115. }
  116. }
  117. TEST(D1test, DISABLED_mpmath_generated_input) {
  118. // TEST(D1test, mpmath_generated_input) {
  119. double min_abs_tol = 2e-11;
  120. std::complex<double> z, D1_mp;
  121. int n;
  122. double re_abs_tol, im_abs_tol;
  123. for (const auto &data : D1_test_16digits) {
  124. parse_mpmath_data(min_abs_tol, data, z, n, D1_mp, re_abs_tol, im_abs_tol);
  125. auto Nstop = LeRu_cutoff(z)+1;
  126. std::vector<std::complex<nmie::FloatType>> Db(Nstop),Dold(Nstop+35), r;
  127. int valid_digits = 6;
  128. int nstar = nmie::getNStar(Nstop, z, valid_digits);
  129. r.resize(nstar);
  130. nmie::evalBackwardR(z,r);
  131. nmie::convertRtoD1(z, r, Db);
  132. if (n > Db.size()) continue;
  133. EXPECT_NEAR(std::real(Db[n]), std::real(D1_mp), re_abs_tol)
  134. << "Db at n=" << n << " Nstop="<< Nstop<<" nstar="<<nstar<< " z="<<z;
  135. EXPECT_NEAR(std::imag(Db[n]), std::imag(D1_mp), im_abs_tol)
  136. << "Db at n=" << n << " Nstop="<< Nstop<<" nstar="<<nstar<< " z="<<z;
  137. nmie::evalDownwardD1(z, Dold);
  138. if (n > Dold.size()) continue;
  139. EXPECT_NEAR(std::real(Dold[n]), std::real(D1_mp), re_abs_tol)
  140. << "Dold at n=" << n << " Nstop="<< Nstop<< " z="<<z;
  141. EXPECT_NEAR(std::imag(Dold[n]), std::imag(D1_mp), im_abs_tol)
  142. << "Dold at n=" << n << " Nstop="<< Nstop<< " z="<<z;
  143. }
  144. }
  145. //TEST(D1test, DISABLED_WYang_data){
  146. TEST(D1test, WYang_data){
  147. double abs_tol = 1e-9;
  148. int test_loss_digits = std::round(15 - std::log10(1/abs_tol));
  149. int Nstop = 131;
  150. std::vector<std::complex<nmie::FloatType>> Df(Nstop), Db(Nstop),Dold(Nstop), r;
  151. std::complex<nmie::FloatType> z(1.05,1);
  152. z = z*80.0;
  153. // eval D1 directly from backward recurrence
  154. nmie::evalDownwardD1(z, Dold);
  155. // eval forward recurrence
  156. r.resize(Nstop+1);
  157. nmie::evalForwardR(z, r);
  158. nmie::convertRtoD1(z, r, Df);
  159. // eval backward recurrence
  160. int valid_digits = 6;
  161. int nstar = nmie::getNStar(Nstop, z, valid_digits);
  162. r.resize(nstar);
  163. nmie::evalBackwardR(z,r);
  164. nmie::convertRtoD1(z, r, Db);
  165. for (int i = 0; i < Dtest_n.size(); i++) {
  166. int n = Dtest_n[i];
  167. int forward_loss_digits = nmie::evalKapteynNumberOfLostSignificantDigits(n, z);
  168. forward_loss_digits += 3; // Kapteyn is too optimistic
  169. if (test_loss_digits > forward_loss_digits ) {
  170. EXPECT_NEAR(std::real(Df[n]), std::real(Dtest_D1[i]),
  171. abs_tol) << "f at n=" << n << " lost digits = " << forward_loss_digits;
  172. EXPECT_NEAR(std::imag(Df[n]), std::imag(Dtest_D1[i]),
  173. abs_tol) << "f at n=" << n << " lost digits = " << forward_loss_digits;
  174. }
  175. EXPECT_NEAR(std::real(Db[n]), std::real(Dtest_D1[i]),
  176. abs_tol) << "b at n=" << n;
  177. EXPECT_NEAR(std::imag(Db[n]), std::imag(Dtest_D1[i]),
  178. abs_tol) << "b at n=" << n;
  179. if (n < Dold.size()-15) {
  180. EXPECT_NEAR(std::real(Dold[n]), std::real(Dtest_D1[i]),
  181. abs_tol) << "old at n=" << n;
  182. EXPECT_NEAR(std::imag(Dold[n]), std::imag(Dtest_D1[i]),
  183. abs_tol) << "old at n=" << n;
  184. }
  185. }
  186. }
  187. TEST(KaptyenTest, HandlesInput) {
  188. // H.Du APPLIED OPTICS, Vol. 43, No. 9, 20 March 2004
  189. double l = nmie::evalKapteynNumberOfLostSignificantDigits(80, std::complex<double>(100,100));
  190. EXPECT_EQ(l, 7)<<"Should be equal";
  191. std::complex<double> z(10000,0);
  192. l = nmie::evalKapteynNumberOfLostSignificantDigits(5070, z);
  193. EXPECT_EQ(l, 0)<<"Should be equal";
  194. // find NStar such that l_nstar(z) - l_nmax(z) >= valid_digits
  195. int NStar = nmie::getNStar(5070, z,6);
  196. EXPECT_GE(NStar, 10130);
  197. // const double pi=3.14159265358979323846;
  198. // z = std::complex<double>(100,100);
  199. // l = nmie::evalKapteynNumberOfLostSignificantDigits(1, z);
  200. // EXPECT_EQ(l, 0)<<"Should be equal";
  201. }
  202. int main(int argc, char **argv) {
  203. testing::InitGoogleTest(&argc, argv);
  204. return RUN_ALL_TESTS();
  205. }