14 : mySM(SM_i), meMStoRI(5, 0.), coeffsMStoRI(3, 0.)
33 throw std::runtime_error(
"AmpDB2::AmpDB2(): invalid B meson index");
38 double meMStoRI0[5] = {-3. - 5. / 3. + 8. *
log2, 0., 0., 0., 0.},
39 meMStoRI1[5] = {0., 61. / 9. + 44. / 9. *
log2, -7. / 9. + 28. / 9. *
log2, 0., 0.},
40 meMStoRI2[5] = {0., -25. / 9. + 28. / 9. *
log2, -29. / 9. + 44. / 9. *
log2, 0., 0.},
41 meMStoRI3[5] = {0., 0., 0., -5. / 3. + 13. - 2. / 3. *
log2, -3. + 1. + 2. *
log2},
42 meMStoRI4[5] = {0., 0., 0., -7. / 2. + 11. / 2. + 2. *
log2, -1. / 6. - 1. / 2. - 2. / 3. *
log2};
48 for (
int i = 0; i <= 2; i++)
50 for (
int j = 0; j <= 2; j++)
61 throw std::runtime_error(
"DmBd::computeThValue(): requires cofficient of order not computed");
67 C_1_SM = ((*(allcoeff_SM[
LO]))(0) + (*(allcoeff_SM[
NLO]))(0));
81 double KBs = MBs / (
Mb +
Ms) * MBs / (
Mb +
Ms);
83 me(0) *= 1. / 3. * MBs * Fbs * Fbs;
84 me(1) *= -5. / 24. * KBs * MBs * Fbs * Fbs;
85 me(2) *= 1. / 24. * KBs * MBs * Fbs * Fbs;
86 me(3) *= 1. / 4. * KBs * MBs * Fbs * Fbs;
87 me(4) *= 1. / 12. * KBs * MBs * Fbs * Fbs;
101 return (*(allcoeff[
LO]) + *(allcoeff[
NLO])) *
me /
104 return ((*(allcoeff[
LO])) *
me /(*(allcoeff_SM[
LO]))(0) *
me(0));
106 throw std::runtime_error(
"RBs::RBs(): order not implemented");
114 throw std::runtime_error(
"DmBd::computeThValue(): requires cofficient of order not computed");
120 C_1_SM = ((*(allcoeff_SM[
LO]))(0) + (*(allcoeff_SM[
NLO]))(0));
134 double KBd = MBd / (
Mb +
Md) * MBd / (
Mb +
Md);
136 me(0) *= 1. / 3. * MBd * Fbd * Fbd;
137 me(1) *= -5. / 24. * KBd * MBd * Fbd * Fbd;
138 me(2) *= 1. / 24. * KBd * MBd * Fbd * Fbd;
139 me(3) *= 1. / 4. * KBd * MBd * Fbd * Fbd;
140 me(4) *= 1. / 12. * KBd * MBd * Fbd * Fbd;
154 return (*(allcoeff[
LO]) + *(allcoeff[
NLO])) *
me /
157 return ((*(allcoeff[
LO])) *
me / ((*(allcoeff_SM[
LO]))(0) *
me(0)));
159 throw std::runtime_error(
"RBd::RBd(): order not implemented");
166 throw std::runtime_error(
"DmBd::computeThValue(): requires cofficient of order not computed");
180 double KBd = MBd / (
Mb +
Md) * MBd / (
Mb +
Md);
182 me(0) *= 1. / 3. * MBd * Fb * Fb;
183 me(1) *= -5. / 24. * KBd * MBd * Fb * Fb;
184 me(2) *= 1. / 24. * KBd * MBd * Fb * Fb;
185 me(3) *= 1. / 4. * KBd * MBd * Fb * Fb;
186 me(4) *= 1. / 12. * KBd * MBd * Fb * Fb;
189 std::cout <<
"Bd: me(0) = " <<
me(0) << std::endl;
192 std::cout <<
"coefficient Bd: " << (*(allcoeff[
LO]) + *(allcoeff[
NLO]))(0) << std::endl;
193 std::cout <<
"M: " <<
me << std::endl;
201 return ((*(allcoeff[
LO]) + *(allcoeff[
NLO])) *
me / HCUT);
203 return ((*(allcoeff[
LO])) *
me / HCUT);
205 throw std::runtime_error(
"AmpDB2::AmpBd(): order not implemented");
212 throw std::runtime_error(
"DmBd::computeThValue(): requires cofficient of order not computed");
227 double KBs = MBs / (
Mb +
Ms) * MBs / (
Mb +
Ms);
232 me(0) *= 1. / 3. * MBs * Fbs * Fbs;
233 me(1) *= -5. / 24. * KBs * MBs * Fbs * Fbs;
234 me(2) *= 1. / 24. * KBs * MBs * Fbs * Fbs;
235 me(3) *= 1. / 4. * KBs * MBs * Fbs * Fbs;
236 me(4) *= 1. / 12. * KBs * MBs * Fbs * Fbs;
238 std::cout <<
"Bs: me(0) = " <<
me(0) << std::endl;
244 return ((*(allcoeff[
LO]) + *(allcoeff[
NLO])) *
me / HCUT);
246 return ((*(allcoeff[
LO])) *
me / HCUT);
248 throw std::runtime_error(
"AmpDB2::AmpBs(): order not implemented");
263 gslpp::complex M21overme0;
276 throw std::runtime_error(
"AmpDB2::Gamma21overM21_tradBasis(orders order, quark q): invalid quark index: ");
312 throw std::runtime_error(
"AmpDB2::Gamma21overM21_tradBasis(orders order, quark q): order not implemented");
319 if (order !=
NLO and order !=
NNLO)
320 throw(std::runtime_error(
"computeCKMandMasses() order not present"));
372 z = Mc_mub * Mc_mub / (Mb_mub * Mb_mub);
405 throw(std::runtime_error(
"mass_scheme not implemented"));
424 z =
Mc *
Mc / (Mb_mub * Mb_mub);
445 z_1overm = Mc_mub * Mc_mub / (Mb_mub * Mb_mub);
461 Dilogz = gslpp_special_functions::dilog(
z);
471 for (
int i = 0; i < 8; i++)
510 for (
int k = 1; k < 3; k++)
529 8. *
z * (2. - 23. *
z + 21. *
z2 - 3. *
z3) *
logz -
536 2. / 3. *
z * (8. - 93. *
z + 87. *
z2 - 12. *
z3) *
logz -
577 for (
int k = 1; k < 3; k++)
647 for (
int k = 1; k <= 2; k++)
649 gslpp::complex result = 0.;
650 for (
int i = 1; i <= 2; i++)
652 for (
int j = 1; j <= 2; j++)
658 for (
int i = 1; i <= 2; i++)
660 for (
int r = 3; r <= 6; r++)
669 for (
int k = 1; k <= 2; k++)
671 gslpp::complex result = 0.;
672 for (
int i = 1; i <= 2; i++)
674 for (
int j = 1; j <= 2; j++)
680 for (
int i = 1; i <= 2; i++)
682 for (
int r = 3; r <= 6; r++)
690 else if (order ==
LO)
695 for (
int k = 1; k <= 2; k++)
697 gslpp::complex result = 0.;
698 for (
int i = 1; i <= 2; i++)
700 for (
int j = 1; j <= 2; j++)
705 for (
int i = 1; i <= 2; i++)
707 for (
int r = 3; r <= 6; r++)
716 for (
int k = 1; k <= 2; k++)
718 gslpp::complex result = 0.;
719 for (
int i = 1; i <= 2; i++)
721 for (
int j = 1; j <= 2; j++)
726 for (
int i = 1; i <= 2; i++)
728 for (
int r = 3; r <= 6; r++)
738 throw std::runtime_error(
"AmpDB2::computeD(orders order): order not implemented");
766 return qq * 8 + (k - 1) * 4 + (i - 1) * 2 + (j - 1);
771 return qq * 28 + (k - 1) * 14 + (i - 1) * 7 + (j - 2);
802 throw std::runtime_error(
"AmpDB2::compute_matrixelements(quark q): invalid quark index: ");
810 KBq = MBq2 / ((Mb_mu2 + Mq) * (Mb_mu2 + Mq));
811 me(0) *= 8. / 3. * MBq2 * FBq2;
812 me(1) *= -5. / 3. * KBq * MBq2 * FBq2;
813 me(2) *= 1. / 3. * KBq * MBq2 * FBq2;
814 me(3) *= 2. * (KBq + 1. / 6.) * MBq2 * FBq2;
815 me(4) *= 2. / 3. * (KBq + 3. / 2.) * MBq2 * FBq2;
838 me_R(2) *= MBq2 * FBq2;
839 me_R(3) *= MBq2 * FBq2;
840 me_R(4) = 0.5 * (
me(2) + 0.5 *
me(0) +
me(1) - 2. * Mq / Mb_mu2 *
me(4) +
me_R(2));
847 double L_2 = 2. * log(
mu_2 / Mb_mu2);
848 double as1_me0 = 0., as1_me2 = 0.;
851 as1_me0 = 4. * L_2 + 26. / 3.;
852 as1_me2 = 8. * L_2 + 8.;
856 me_R(1) = Mq / Mb_mu2 *
me(3);
877 gslpp::vector<gslpp::complex> result = gslpp::vector<gslpp::complex>(3, 0.);
881 for (
int i = 1; i <= 2; i++)
888 for (
int i = 1; i <= 2; i++)
895 throw std::runtime_error(
"AmpDB2::c(quark q, double mu_2): invalid quark index: ");
901 result.assign(0, result(0) - 0.5 * result(1));
902 result.assign(2, -result(1));
903 result.assign(1, 0.);
905 else if (order ==
NLO)
908 gslpp::vector<gslpp::complex> RI_NLO = gslpp::vector<gslpp::complex>(3, 0.);
913 result.assign(0, -alpha2 / 2. * result(1));
914 result.assign(2, -alpha1 * result(1));
917 result.assign(1, 0.);
921 throw std::runtime_error(
"AmpDB2::c(quark q, orders order): order not implemented");
934 if (k != 1 and k != 2)
936 throw std::runtime_error(
"AmpDB2::indexD(quarks qq, int k): invalid k");
938 return qq * 2 + (k - 1);
956 throw std::runtime_error(
"AmpDB2::delta_1overm_tradBasis(quark q): invalid quark index: ");
988 gslpp::complex lambda_c, lambda_u;
1000 throw std::runtime_error(
"AmpDB2::delta_1overm(quark q): invalid quark index: ");
1013 for (
int i = 0; i <= 3; i++)
1017 for (
int i = 0; i <= 2; i++)
1087 gslpp::complex M21overme0;
1107 throw std::runtime_error(
"AmpDB2::Gamma21overM21(orders order, int BMeson): invalid B meson index: ");
1117 if (mass_scheme ==
MSbar)
1121 else if (mass_scheme ==
PS)
1148 std::cerr <<
"WARNING: mass_scheme might no be implemented.\n";
1177 for (
int i = 0; i < 8; i++)
1190 gslpp::vector<gslpp::complex> result = gslpp::vector<gslpp::complex>(3, 0.);
1191 gslpp::complex lambda_c, lambda_u;
1203 throw std::runtime_error(
"AmpDB2::c_H(quark q): invalid quark index: ");
1208 result.assign(0, -lambda_c * lambda_c *
H(
cc,
LO) - 2. * lambda_c * lambda_u *
H(
cu,
LO) - lambda_u * lambda_u *
H(
uu,
LO));
1209 result.assign(2, -lambda_c * lambda_c *
H_s(
cc,
LO) - 2. * lambda_c * lambda_u *
H_s(
cu,
LO) - lambda_u * lambda_u *
H_s(
uu,
LO));
1210 result.assign(0, result(0) - 0.5 * result(2));
1211 result.assign(1, -result(2));
1212 result.assign(2, 0.);
1216 result.assign(0, result(0) - 0.5 * result(1) +
1217 -lambda_c * lambda_c *
H(
cc,
NLO) - 2. * lambda_c * lambda_u *
H(
cu,
NLO) - lambda_u * lambda_u *
H(
uu,
NLO));
1218 result.assign(2, -result(1) +
1219 -lambda_c * lambda_c *
H_s(
cc,
NLO) - 2. * lambda_c * lambda_u *
H_s(
cu,
NLO) - lambda_u * lambda_u *
H_s(
uu,
NLO));
1220 result.assign(1, 0.);
1224 throw std::runtime_error(
"AmpDB2::c_H(quark q, orders order) order for RI not implemented");
1226 result.assign(0, -lambda_c * lambda_c *
H(
cc, order) - 2. * lambda_c * lambda_u *
H(
cu, order) - lambda_u * lambda_u *
H(
uu, order));
1227 result.assign(2, -lambda_c * lambda_c *
H_s(
cc, order) - 2. * lambda_c * lambda_u *
H_s(
cu, order) - lambda_u * lambda_u *
H_s(
uu, order));
1241 return H_partial(qq, 1, 8, 1, 8, 0) +
H_partial(qq, 1, 8, 1, 8, 1);
1243 return H_partial(qq, 1, 8, 1, 8, 0) +
H_partial(qq, 1, 8, 1, 8, 1) +
H_partial(qq, 1, 8, 1, 8, 2);
1245 return H_partial(qq, 1, 8, 1, 8, 0) +
H_partial(qq, 1, 8, 1, 8, 1) +
H_partial(qq, 1, 8, 1, 8, 2) +
H_partial(qq, 1, 8, 1, 8, 3);
1246 throw std::runtime_error(
"AmpDB2::H(quarks qq, orders order) order not implemented");
1257 return H_s_partial(qq, 1, 8, 1, 8, 0) +
H_s_partial(qq, 1, 8, 1, 8, 1);
1259 return H_s_partial(qq, 1, 8, 1, 8, 0) +
H_s_partial(qq, 1, 8, 1, 8, 1) +
H_s_partial(qq, 1, 8, 1, 8, 2);
1261 return H_s_partial(qq, 1, 8, 1, 8, 0) +
H_s_partial(qq, 1, 8, 1, 8, 1) +
H_s_partial(qq, 1, 8, 1, 8, 2) +
H_s_partial(qq, 1, 8, 1, 8, 3);
1262 throw std::runtime_error(
"AmpDB2::H_s(quarks qq, orders order) order not implemented");
1267 gslpp::complex lambda_c, lambda_u;
1279 throw std::runtime_error(
"AmpDB2::c_H_partial(quark q, int i): invalid quark index: ");
1281 gslpp::vector<gslpp::complex> zeros(12, 0.);
1291 throw std::runtime_error(
"AmpDB2::c_H_partial(quark q, int i): invalid index i");
1297 gslpp::vector<gslpp::complex> result(12, 0.);
1298 result.assign(0,
H_partial(qq, 1, 2, 1, 2, 0));
1299 result.assign(1,
H_partial(qq, 1, 2, 1, 2, 1));
1300 result.assign(2,
H_partial(qq, 1, 2, 1, 2, 2));
1301 result.assign(3,
H_partial(qq, 1, 2, 3, 6, 0));
1302 result.assign(4,
H_partial(qq, 1, 2, 3, 6, 1));
1303 result.assign(5,
H_partial(qq, 3, 6, 3, 6, 0));
1304 result.assign(6,
H_partial(qq, 3, 6, 3, 6, 1));
1305 result.assign(7,
H_partial(qq, 1, 2, 8, 8, 1));
1306 result.assign(8,
H_partial(qq, 1, 2, 8, 8, 2));
1307 result.assign(9,
H_partial(qq, 3, 6, 8, 8, 1));
1308 result.assign(10,
H_partial(qq, 3, 6, 8, 8, 2));
1309 result.assign(11,
H_partial(qq, 8, 8, 8, 8, 2));
1315 gslpp::vector<gslpp::complex> result(12, 0.);
1326 result.assign(10,
H_s_partial(qq, 3, 6, 8, 8, 2));
1327 result.assign(11,
H_s_partial(qq, 8, 8, 8, 8, 2));
1333 gslpp::complex result = 0.;
1334 for (
int i = i_start; i <= i_end; i++)
1338 for (
int j = j_start; j <= j_end; j++)
1350 if (j == 1 or j == 2 or j == 8)
1354 else if (3 <= j and j <= 6)
1361 if (j == 1 or j == 2 or j == 8)
1363 result +=
as_4pi_mu1 *
as_4pi_mu1 *
C_Misiak_LO[i - 1] *
C_Misiak_LO[j - 1] *
p(qq, i, j, 2) +
as_4pi_mu1 * (
C_Misiak_NLO[i - 1] *
C_Misiak_LO[j - 1] +
C_Misiak_LO[i - 1] *
C_Misiak_NLO[j - 1]) *
p(qq, i, j, 1,
flag_LOz) + (
C_Misiak_NNLO[i - 1] *
C_Misiak_LO[j - 1] +
C_Misiak_NLO[i - 1] *
C_Misiak_NLO[j - 1] +
C_Misiak_LO[i - 1] *
C_Misiak_NNLO[j - 1]) *
p(qq, i, j, 0,
flag_LOz);
1368 result +=
as_4pi_mu1 *
as_4pi_mu1 *
as_4pi_mu1 *
C_Misiak_LO[i - 1] *
C_Misiak_LO[j - 1] *
p(qq, i, j, 3) +
as_4pi_mu1 *
as_4pi_mu1 * (
C_Misiak_NLO[i - 1] *
C_Misiak_LO[j - 1] +
C_Misiak_LO[i - 1] *
C_Misiak_NLO[j - 1]) *
p(qq, i, j, 2) +
as_4pi_mu1 * (
C_Misiak_NNLO[i - 1] *
C_Misiak_LO[j - 1] +
C_Misiak_NLO[i - 1] *
C_Misiak_NLO[j - 1] +
C_Misiak_LO[i - 1] *
C_Misiak_NNLO[j - 1]) *
p(qq, i, j, 1) + (
C_Misiak_NNLO[i - 1] *
C_Misiak_NLO[j - 1] +
C_Misiak_NLO[i - 1] *
C_Misiak_NNLO[j - 1]) *
p(qq, i, j, 0);
1372 throw(std::runtime_error(
"AmpDB2::H_partial order not implemented"));
1381 gslpp::complex result = 0.;
1382 for (
int i = i_start; i <= i_end; i++)
1386 for (
int j = j_start; j <= j_end; j++)
1398 if (j == 1 or j == 2 or j == 8)
1402 else if (3 <= j and j <= 6)
1409 if (j == 1 or j == 2 or j == 8)
1411 result +=
as_4pi_mu1 *
as_4pi_mu1 *
C_Misiak_LO[i - 1] *
C_Misiak_LO[j - 1] *
p_s(qq, i, j, 2) +
as_4pi_mu1 * (
C_Misiak_NLO[i - 1] *
C_Misiak_LO[j - 1] +
C_Misiak_LO[i - 1] *
C_Misiak_NLO[j - 1]) *
p_s(qq, i, j, 1,
flag_LOz) + (
C_Misiak_NNLO[i - 1] *
C_Misiak_LO[j - 1] +
C_Misiak_NLO[i - 1] *
C_Misiak_NLO[j - 1] +
C_Misiak_LO[i - 1] *
C_Misiak_NNLO[j - 1]) *
p_s(qq, i, j, 0,
flag_LOz);
1416 result +=
as_4pi_mu1 *
as_4pi_mu1 *
as_4pi_mu1 *
C_Misiak_LO[i - 1] *
C_Misiak_LO[j - 1] *
p_s(qq, i, j, 3) +
as_4pi_mu1 *
as_4pi_mu1 * (
C_Misiak_NLO[i - 1] *
C_Misiak_LO[j - 1] +
C_Misiak_LO[i - 1] *
C_Misiak_NLO[j - 1]) *
p_s(qq, i, j, 2) +
as_4pi_mu1 * (
C_Misiak_NNLO[i - 1] *
C_Misiak_LO[j - 1] +
C_Misiak_NLO[i - 1] *
C_Misiak_NLO[j - 1] +
C_Misiak_LO[i - 1] *
C_Misiak_NNLO[j - 1]) *
p_s(qq, i, j, 1) + (
C_Misiak_NNLO[i - 1] *
C_Misiak_NLO[j - 1] +
C_Misiak_NLO[i - 1] *
C_Misiak_NNLO[j - 1]) *
p_s(qq, i, j, 0);
1420 throw(std::runtime_error(
"AmpDB2::H_s_partial order not implemented"));
1429 if (n < 0 or n >= 768)
1430 throw(std::runtime_error(
"AmpDB2::p(quarks qq, int i, int j, int n, bool flag_LOz) out of index"));
1434 throw(std::runtime_error(
"AmpDB2::p(quarks qq, int i, int j, int n, bool flag_LOz) out of index"));
1441 if (n < 0 or n >= 768)
1442 throw(std::runtime_error(
"AmpDB2::p_s(quarks qq, int i, int j, int n, bool flag_LOz) out of index"));
1446 throw(std::runtime_error(
"AmpDB2::p_s(quarks qq, int i, int j, int n, bool flag_LOz) out of index"));
1454 return n * 192 + qq * 64 + (i - 1) * 8 + (j - 1);
1463 double cache_logz =
logz;
1466 throw std::runtime_error(
"AmpDB2::compute_pp_s(): only implemented for resummed z");
1470 const double cache_z =
z;
1533 for (
int i = 3; i <= 6; i++)
1535 for (
int j = i; j <= 6; j++)
1543 for (
int i = 1; i <= 6; i++)
1545 for (
int j = i; j <= 6; j++)
1553 double L_1 = 2. * log(
mu_1 /
Mb);
1554 double L_2 = 2. * log(
mu_2 /
Mb);
1627 cache_p[
index_p(
uu, 1, 1, 1)] = 299. / 81. + (19. * L_1) / 18. + (149. * L_2) / 108. - (5. * (
M_PI2)) / 108.;
1628 cache_p[
index_p(
uu, 1, 2, 1)] = -452. / 27. - (37. * L_1) / 6. + (19. * L_2) / 9. + (5. * (
M_PI2)) / 9.;
1672 double z_replace = -6. * 4. / 3. *
logz *
z;
1683 cache_p[
index_p(qq, 1, 3, 1)] = (320. / 9. - 4. * L_1) *
z + 47. / 18. * L_1 + 56. / 9. * L_2 - 5. / (18. *
sqrt3) * M_PI + 1523. / 108.;
1684 cache_p[
index_p(qq, 1, 4, 1)] = (59. / 3. * L_1 + 5. / 9. *
M_PI2 + 4565. / 108.) *
z - 281. / 108. * L_1 + L_2 / 54. + 5. / 18. *
M_PI2 - 25. / (108. *
sqrt3) * M_PI - 712. / 81.;
1685 cache_p[
index_p(qq, 1, 5, 1)] =
z * (-136. * L_1 - 192. * L_2 - 768. *
logz - 16408. / 9.) + 376. / 9. * L_1 + 896. / 9. * L_2 - 40. / (9. *
sqrt3) * M_PI + 318.;
1686 cache_p[
index_p(qq, 1, 6, 1)] =
z * (764. / 3. * L_1 + 8. * L_2 + 32. *
logz + 8. / 9. *
M_PI2 + 22850. / 27.) - 1259. / 27. * L_1 + 8. / 27. * L_2 + 40. / 9. *
M_PI2 - 55. / (27. *
sqrt3) * M_PI - 4243. / 27.;
1687 cache_p[
index_p(qq, 2, 3, 1)] = (24. * L_1 + 170. / 3.) *
z - 47. / 3. * L_1 + 14. / 3. * L_2 + 5. / (3. *
sqrt3) * M_PI - 677. / 18.;
1688 cache_p[
index_p(qq, 2, 4, 1)] = (26. * L_1 - 10. / 3. *
M_PI2 + 1429. / 18.) *
z - 35. / 9. * L_1 - L_2 / 9. - 5. / 3. *
M_PI2 + 25. / (18. *
sqrt3) * M_PI - 88. / 27.;
1689 cache_p[
index_p(qq, 2, 5, 1)] =
z * (816. * L_1 - 144. * L_2 - 576. *
logz + 3656. / 3.) - 752. / 3. * L_1 + 224. / 3. * L_2 + 80. / (3. *
sqrt3) * M_PI - 580.;
1690 cache_p[
index_p(qq, 2, 6, 1)] =
z * (128. * L_1 - 48. * L_2 - 192. *
logz - 16. / 3. *
M_PI2 + 6140. / 9.) - 290. / 9. * L_1 - 16. / 9. * L_2 - 80. / 3. *
M_PI2 + 110. / (9. *
sqrt3) * M_PI - 442. / 9.;
1692 cache_ps[
index_p(qq, 1, 3, 1)] = -4. / 3. * L_1 - 64. / 9. * L_2 - 1720. / 9. *
z - 4. / (9. *
sqrt3) * M_PI - 130. / 27.;
1693 cache_ps[
index_p(qq, 1, 4, 1)] = 2. * L_1 - 16. / 27. * L_2 + (80. / 27. + 8. / 9. *
M_PI2) *
z + 4. / 9. *
M_PI2 - 10. / (27. *
sqrt3) * M_PI + 404. / 81.;
1694 cache_ps[
index_p(qq, 1, 5, 1)] = -64. / 3. * L_1 - 1024. / 9. * L_2 - 27952. / 9. *
z - 64. / (9. *
sqrt3) * M_PI - 2128. / 9.;
1695 cache_ps[
index_p(qq, 1, 6, 1)] = 24. * L_1 - 256. / 27. * L_2 + (128. / 9. *
M_PI2 - 520. / 27.) *
z - 64. / 9. *
M_PI2 - 88. / (27. *
sqrt3) * M_PI + 2824. / 27.;
1696 cache_ps[
index_p(qq, 2, 3, 1)] = 8. * L_1 - 16. / 3. * L_2 - 448. / 3. *
z + 8. / (3. *
sqrt3) * M_PI + 116. / 9.;
1698 cache_ps[
index_p(qq, 2, 5, 1)] = 128. * L_1 - 256. / 3. * L_2 - 6304. / 3. *
z + 128. / (3. *
sqrt3) * M_PI + 32. / 3.;
1699 cache_ps[
index_p(qq, 2, 6, 1)] = 48. * L_1 + 512. / 9. * L_2 + (7520. / 9. - 256. / 3. *
M_PI2) *
z - 128. / 3. *
M_PI2 + 176. / (9. *
sqrt3) * M_PI + 1840. / 9.;
1723 for (
int i = 1; i <= 2; i++)
1725 for (
int j = i; j <= 6; j++)
1755 7. * (-1. +
z) * (-5. - 8. *
z + 19. *
z2) + 3. *
logz *
z * (-2. + 3. *
z - 18. *
z2 + 3. *
z3) +
1756 6. * (-1. +
z) * (1. + 2. *
z) * (
M_PI2))) /
1788 cache_p[
index_p(
cc, 3, 3, 1)] = -154. / 9. * L_1 + 184. / 3. * L_2 + 90. *
z - 5. / 3. *
M_PI2 + 5. / (3. *
sqrt3) * M_PI + 1390. / 27.;
1789 cache_p[
index_p(
cc, 3, 4, 1)] = -811. / 54. * L_1 + 74. / 9. * L_2 - 10. / 3. *
z - 10. / 9. *
M_PI2 + 70. / (9. *
sqrt3) * M_PI - 27991. / 324.;
1790 cache_p[
index_p(
cc, 3, 5, 1)] = -4928. / 9. * L_1 + 3872. / 3. * L_2 + 1800. *
z - 160. / 3. *
M_PI2 + 160. / (3. *
sqrt3) * M_PI + 16880. / 27.;
1791 cache_p[
index_p(
cc, 3, 6, 1)] = (144. * L_1 + 440. / 3.) *
z - 12932. / 27. * L_1 + 1184. / 9. * L_2 - 160. / 9. *
M_PI2 + 670. / (9. *
sqrt3) * M_PI - 131410. / 81.;
1792 cache_p[
index_p(
cc, 4, 4, 1)] = 181. / 162. * L_1 + 127. / 108. * L_2 + (323. / 36. - 5. / 3. *
M_PI2) *
z - 335. / 108. *
M_PI2 + 575. / (108. *
sqrt3) * M_PI + 779. / 486.;
1793 cache_p[
index_p(
cc, 4, 5, 1)] = (576. * L_1 + 3836. / 3.) *
z - 14912. / 27. * L_1 + 1184. / 9. * L_2 - 160. / 9. *
M_PI2 + 1120. / (9. *
sqrt3) * M_PI - 127990. / 81.;
1794 cache_p[
index_p(
cc, 4, 6, 1)] = (60. * L_1 - 100. / 3. *
M_PI2 + 2455. / 9.) *
z - 8759. / 81. * L_1 + 1088. / 27. * L_2 - 1600. / 27. *
M_PI2 + 2665. / (27. *
sqrt3) * M_PI - 50083. / 243.;
1795 cache_p[
index_p(
cc, 5, 5, 1)] =
z * (-2592. * L_2 - 10368. *
logz - 33120.) - 39424. / 9. * L_1 + 26944. / 3. * L_2 - 1280. / 3. *
M_PI2 + 1280. / (3. *
sqrt3) * M_PI + 347104. / 27.;
1796 cache_p[
index_p(
cc, 5, 6, 1)] = (7200. * L_1 + 74000. / 3.) *
z - 240608. / 27. * L_1 + 18944. / 9. * L_2 - 2560. / 9. *
M_PI2 + 10720. / (9. *
sqrt3) * M_PI - 2253568. / 81.;
1797 cache_p[
index_p(
cc, 6, 6, 1)] =
z * (-48. * L_1 - 144. * L_2 - 576. *
logz - 248. / 3. *
M_PI2 + 12290. / 9.) - 59632. / 81. * L_1 + 8848. / 27. * L_2 - 10640. / 27. *
M_PI2 + 12320. / (27. *
sqrt3) * M_PI - 662144. / 243.;
1799 cache_ps[
index_p(
cc, 3, 3, 1)] = 176. / 9. * L_1 - 200. / 3. * L_2 - 432. *
z - 8. / 3. *
M_PI2 + 8. / (3. *
sqrt3) * M_PI - 620. / 27.;
1800 cache_ps[
index_p(
cc, 3, 4, 1)] = 268. / 27. * L_1 - 64. / 9. * L_2 - 16. / 3. *
z - 16. / 9. *
M_PI2 + 112. / (9. *
sqrt3) * M_PI + 3506. / 81.;
1801 cache_ps[
index_p(
cc, 3, 5, 1)] = 5632. / 9. * L_1 - 4096. / 3. * L_2 - 8640. *
z - 256. / 3. *
M_PI2 + 256. / (3. *
sqrt3) * M_PI + 9728. / 27.;
1802 cache_ps[
index_p(
cc, 3, 6, 1)] = 9184. / 27. * L_1 - 1024. / 9. * L_2 - 160. / 3. *
z - 256. / 9. *
M_PI2 + 1072. / (9. *
sqrt3) * M_PI + 88688. / 81.;
1803 cache_ps[
index_p(
cc, 4, 4, 1)] = 1028. / 81. * L_1 + 136. / 27. * L_2 - 8. / 3. *
M_PI2 *
z + 230. / 9. *
z - 134. / 27. *
M_PI2 + 230. / (27. *
sqrt3) * M_PI + 6214. / 243.;
1804 cache_ps[
index_p(
cc, 4, 5, 1)] = 9472. / 27. * L_1 - 1024. / 9. * L_2 + 608. / 3. *
z - 256. / 9. *
M_PI2 + 1792. / (9. *
sqrt3) + 64784. / 81.;
1805 cache_ps[
index_p(
cc, 4, 6, 1)] = 10792. / 81. * L_1 + 2048. / 27. * L_2 - 160. / 3. *
M_PI2 *
z + 3568. / 9. *
z - 2560. / 27. *
M_PI2 + 4264. / (27. *
sqrt3) * M_PI + 123080. / 243.;
1806 cache_ps[
index_p(
cc, 5, 5, 1)] = 45056. / 9. * L_1 - 28160. / 3. * L_2 - 58752. *
z - 2048. / 3. *
M_PI2 - 2048. / (3. *
sqrt3) * M_PI - 349184. / 27.;
1807 cache_ps[
index_p(
cc, 5, 6, 1)] = 167680. / 27. * L_1 - 16384. / 9. * L_2 + 6080. / 3. *
z - 4096. / 9. *
M_PI2 + 17152. / (9. *
sqrt3) * M_PI + 1502720. / 81.;
1808 cache_ps[
index_p(
cc, 6, 6, 1)] = 75392. / 81. * L_1 + 11776. / 27. * L_2 - 1088. / 3. *
M_PI2 *
z + 23696. / 9. *
z - 17024. / 27. *
M_PI2 + 19712. / (27. *
sqrt3) * M_PI + 717184. / 243.;
1815 for (
int i = 3; i <= 6; i++)
1817 for (
int j = i; j <= 6; j++)
1837 for (
int i = 1; i <= 2; i++)
1854 for (
int i = 3; i <= 6; i++)
1862 double L_12 = L_1 * L_1;
1863 double L_22 = L_2 * L_2;
1865 gslpp::complex log1M1OverSqrtz = log(abs(1. - 1. /
sqrtz));
1867 log1M1OverSqrtz += M_PI * complex::i();
1868 gslpp::complex logM1OverSqrtz = log(abs(-1. /
sqrtz)) + M_PI * complex::i();
1869 gslpp::complex logM1OverSqrtz2 = logM1OverSqrtz * logM1OverSqrtz;
1872 cache_p[
index_p(
cc, 1, 1, 2)] = (814589597. / 4199040. + (1320817. * L_1) / 17496. + (3211. * L_12) / 324. + (259603. * L_2) / 11664. + (12911. * L_1 * L_2) / 972. - (311. * L_22) / 216. + (56. *
Cl2PI3 *
sqrt3) / 729. -
1874 ((5. * -1.) / 486.) *
sqrt3 *
t_2 - (22. *
log2z) / (9. *
z) - (88. * logM1OverSqrtz2) / (9. *
z) - (88. * logM1OverSqrtz *
logz) / (9. *
z) + (22. *
log2z) / (9. *
sqrtz) +
1875 (88. * logM1OverSqrtz2) / (9. *
sqrtz) + (88. * logM1OverSqrtz *
logz) / (9. *
sqrtz) - (3547371902315179. *
z) / 3455518320000. - (721919. * L_1 *
z) / 1944. - (2347. * L_12 *
z) / 54. +
1876 (1891. * L_2 *
z) / 81. - (337. * L_1 * L_2 *
z) / 9. + (187. * L_22 *
z) / 18. - (88. * logM1OverSqrtz2 *
z) / 9. - (4823. *
logz *
z) / 9. - (1348. * L_1 *
logz *
z) / 9. - (88. * L_2 *
logz *
z) / 3. -
1877 (88. * logM1OverSqrtz *
logz *
z) / 9. - (28333. *
zeta3) / 486. + (128581. *
z *
zeta3) / 216. - (5. *
sqrt3 * (20. + 30. * L_1 + 3. *
log3 + 180. *
z) * (M_PI)) / 17496. +
1878 ((-684288. + 684288. *
sqrtz - (216641. + 87480. * L_1 - 432. * L_2 + 146016. *
log12sqrt52 + 5112. *
log2 - (50. * complex::i()) *
sqrt3 + 158184. *
sqrt5 - 684288. *
sqrtz) *
z +
1882 (23. * (
M_PI4)) / 4860. - (13637. *
z * (
M_PI4)) / 116640.)
1884 cache_p[
index_p(
cc, 1, 2, 2)] = (-95740679. / 349920. - (1026907. * L_1) / 5832. - (1751. * L_12) / 54. - (619. * L_2) / 972. + (166. * L_1 * L_2) / 81. - L_22 / 18. - (224. *
Cl2PI3 *
sqrt3) / 243. + ((5. * complex::i()) / 324.) *
log3 *
log3 *
sqrt3 +
1886 (32. * logM1OverSqrtz2) / (3. *
z) - (32. * logM1OverSqrtz *
logz) / (3. *
z) + (8. *
log2z) / (3. *
sqrtz) + (32. * logM1OverSqrtz2) / (3. *
sqrtz) +
1887 (32. * logM1OverSqrtz *
logz) / (3. *
sqrtz) + (2370097879. *
z) / 1944000. + (117443. * L_1 *
z) / 162. + (1193. * L_12 *
z) / 9. + (6350. * L_2 *
z) / 27. + (64. * L_1 * L_2 *
z) / 3. + (34. * L_22 *
z) / 3. -
1888 (32. * logM1OverSqrtz2 *
z) / 3. + 124. *
logz *
z + (256. * L_1 *
logz *
z) / 3. - 32. * L_2 *
logz *
z - (32. * logM1OverSqrtz *
logz *
z) / 3. - (10573. *
zeta3) / 324. + (85027. *
z *
zeta3) / 90. +
1889 (5. *
sqrt3 * (20. + 30. * L_1 + 3. *
log3 + 180. *
z) * (M_PI)) / 1458. -
1890 ((622080. - 622080. *
sqrtz - 5. * (497221. + 116640. * L_1 - 864. * L_2 - 39744. *
log12sqrt52 + 85824. *
log2 - (100. * complex::i()) *
sqrt3 - 43056. *
sqrt5 + 124416. *
sqrtz) *
z +
1894 (799. * (
M_PI4)) / 810. + (20833. *
z * (
M_PI4)) / 4860.)
1896 cache_p[
index_p(
cc, 2, 2, 2)] = (74041. / 14580. + (106199. * L_1) / 972. + (239. * L_12) / 18. - (5117. * L_2) / 81. - (202. * L_1 * L_2) / 27. - (19. * L_22) / 3. + (224. *
Cl2PI3 *
sqrt3) / 81. - ((5. * complex::i()) / 108.) *
log3 *
log3 *
sqrt3 -
1898 (16. * logM1OverSqrtz2) /
z - (16. * logM1OverSqrtz *
logz) /
z + (4. *
log2z) /
sqrtz + (16. * logM1OverSqrtz2) /
sqrtz + (16. * logM1OverSqrtz *
logz) /
sqrtz -
1899 (69930883. *
z) / 101250. - (16463. * L_1 *
z) / 54. - (122. * L_12 *
z) / 3. - (109. * L_2 *
z) / 18. - 22. * L_1 * L_2 *
z + 17. * L_22 *
z - 16. * logM1OverSqrtz2 *
z - 496. *
logz *
z - 88. * L_1 *
logz *
z -
1900 48. * L_2 *
logz *
z - 16. * logM1OverSqrtz *
logz *
z - (3157. *
zeta3) / 54. + (2521. *
z *
zeta3) / 15. - (5. *
sqrt3 * (20. + 30. * L_1 + 3. *
log3 + 180. *
z) * (M_PI)) / 486. +
1902 (178. *
log2 *
z) / 9. + (16. *
logz *
z) / 3. + (28. *
sqrt5 *
z) / 45. + L_1 * (-15. + (26. *
z) / 3.) + (2. * L_2 * (1. + 38. *
z)) / 9.) *
1904 (971. * (
M_PI4)) / 540. + (5203. *
z * (
M_PI4)) / 3240.)
1907 cache_ps[
index_p(
cc, 1, 1, 2)] = (-67489177. / 262440. - (77617. * L_1) / 2187. - (902. * L_12) / 243. -
1908 (5504. * L_2) / 729. - (3064. * L_1 * L_2) / 243. + (260. * L_22) / 27. +
1910 (166687. *
sqrtz) / 6000. - ((4. * -1.) / 243.) *
sqrt3 *
t_2 -
1911 (27341897029. *
z) / 29160000. - (97999. * L_1 *
z) / 243. - (9272. * L_2 *
z) / 81. -
1912 (9272. *
logz *
z) / 27. + (28528. *
zeta3) / 243. + (29. *
z *
zeta3) / 3. -
1913 (
sqrt3 * (20. + 30. * L_1 + 3. *
log3 + 180. *
z) * (M_PI)) / 2187. -
1916 37152. *
sqrt5 *
z + 17496. * L_1 * (1. + 2. *
z) + 1728. * L_2 * (1. + 2. *
z)) *
1919 (449. * (
M_PI4)) / 1215. - (27529. *
z * (
M_PI4)) / 14580.)
1921 cache_ps[
index_p(
cc, 1, 2, 2)] = (-1336127. / 2187. - (28733. * L_1) / 729. + (44. * L_12) / 81. - (2176. * L_2) / 243. -
1922 (1856. * L_1 * L_2) / 81. + (208. * L_22) / 9. - (416. *
Cl2PI3 *
sqrt3) / 243. +
1924 (1672496939. *
z) / 4860000. - (23372. * L_1 *
z) / 81. - (5248. * L_2 *
z) / 27. -
1926 (4. *
sqrt3 * (20. + 30. * L_1 + 3. *
log3 + 180. *
z) * (M_PI)) / 729. +
1929 23328. * L_1 * (1. + 2. *
z) + 3456. * L_2 * (1. + 2. *
z)) *
1932 (226. * (
M_PI4)) / 405. + (5692. *
z * (
M_PI4)) / 1215.)
1934 cache_ps[
index_p(
cc, 2, 2, 2)] = (27476329. / 58320. + (40370. * L_1) / 243. + (604. * L_12) / 27. + (6928. * L_2) / 81. +
1935 (1064. * L_1 * L_2) / 27. - (52. * L_22) / 3. + (416. *
Cl2PI3 *
sqrt3) / 81. -
1937 (287805209. *
z) / 81000. + (18836. * L_1 *
z) / 27. + (928. * L_2 *
z) / 9. + (928. *
logz *
z) / 3. -
1939 (4. *
sqrt3 * (20. + 30. * L_1 + 3. *
log3 + 180. *
z) * (M_PI)) / 243. -
1942 11664. * L_1 * (1. + 2. *
z) + 3456. * L_2 * (1. + 2. *
z)) *
1945 (398. * (
M_PI4)) / 135. + (7991. *
z * (
M_PI4)) / 405.)
1948 cache_p[
index_p(
uu, 1, 1, 2)] = (814589597. / 4199040. + (1320817. * L_1) / 17496. + (3211. * L_12) / 324. +
1949 (259603. * L_2) / 11664. + (12911. * L_1 * L_2) / 972. - (311. * L_22) / 216. +
1951 (855371. *
sqrtz) / 180000. - ((5. * -1.) / 486.) *
sqrt3 *
t_2 +
1952 (5298817581707. *
z) / 1151839440000. + (5. * L_1 *
z) / 81. - (50. *
logz *
z) / 9. -
1953 (28333. *
zeta3) / 486. - (5. * (20. + 30. * L_1 + 3. *
log3) *
sqrt3 * (M_PI)) / 17496. -
1954 ((216641. + 87480. * L_1 - 432. * L_2 + 146016. *
log12sqrt52 + 5112. *
log2 -
1955 (50. * complex::i()) *
sqrt3 + 158184. *
sqrt5) *
1958 (23. * (
M_PI4)) / 4860.)
1960 cache_p[
index_p(
uu, 1, 2, 2)] = (-95740679. / 349920. - (1026907. * L_1) / 5832. - (1751. * L_12) / 54. - (619. * L_2) / 972. +
1961 (166. * L_1 * L_2) / 81. - L_22 / 18. - (224. *
Cl2PI3 *
sqrt3) / 243. +
1963 ((10. * -1.) / 81.) *
sqrt3 *
t_2 - (55644107. *
z) / 648000. - (20. * L_1 *
z) / 27. +
1964 (8. *
logz *
z) / 3. - (10573. *
zeta3) / 324. +
1965 (5. * (20. + 30. * L_1 + 3. *
log3) *
sqrt3 * (M_PI)) / 1458. +
1966 ((497221. + 116640. * L_1 - 864. * L_2 - 39744. *
log12sqrt52 + 85824. *
log2 -
1967 (100. * complex::i()) *
sqrt3 - 43056. *
sqrt5) *
1970 (799. * (
M_PI4)) / 810.)
1972 cache_p[
index_p(
uu, 2, 2, 2)] = (74041. / 14580. + (106199. * L_1) / 972. + (239. * L_12) / 18. - (5117. * L_2) / 81. -
1973 (202. * L_1 * L_2) / 27. - (19. * L_22) / 3. + (224. *
Cl2PI3 *
sqrt3) / 81. -
1975 ((10. * -1.) / 27.) *
sqrt3 *
t_2 + (9532631. *
z) / 135000. + (20. * L_1 *
z) / 9. - 32. *
logz *
z -
1976 (3157. *
zeta3) / 54. - (5. * (20. + 30. * L_1 + 3. *
log3) *
sqrt3 * (M_PI)) / 486. -
1977 ((177247. + 58320. * L_1 - 864. * L_2 + 1728. *
log12sqrt52 - 21312. *
log2 -
1978 (100. * complex::i()) *
sqrt3 + 1872. *
sqrt5) *
1981 (971. * (
M_PI4)) / 540.)
1983 cache_ps[
index_p(
uu, 1, 1, 2)] = (-67489177. / 262440. - (77617. * L_1) / 2187. - (902. * L_12) / 243. - (5504. * L_2) / 729. -
1984 (3064. * L_1 * L_2) / 243. + (260. * L_22) / 27. + (104. *
Cl2PI3 *
sqrt3) / 729. -
1986 (261095543. *
z) / 9720000. + (8. * L_1 *
z) / 81. + (28528. *
zeta3) / 243. -
1987 ((20. + 30. * L_1 + 3. *
log3) *
sqrt3 * (M_PI)) / 2187. -
1988 ((44209. + 17496. * L_1 + 1728. * L_2 - 37152. *
log12sqrt52 + 126216. *
log2 -
1989 (10. * complex::i()) *
sqrt3 - 40248. *
sqrt5) *
1992 (449. * (
M_PI4)) / 1215.)
1994 cache_ps[
index_p(
uu, 1, 2, 2)] = (-1336127. / 2187. - (28733. * L_1) / 729. + (44. * L_12) / 81. - (2176. * L_2) / 243. -
1995 (1856. * L_1 * L_2) / 81. + (208. * L_22) / 9. - (416. *
Cl2PI3 *
sqrt3) / 243. +
1997 (117168887. *
z) / 1620000. - (32. * L_1 *
z) / 27. + (13934. *
zeta3) / 81. +
1998 (4. * (20. + 30. * L_1 + 3. *
log3) *
sqrt3 * (M_PI)) / 729. +
1999 ((39995. + 23328. * L_1 + 3456. * L_2 + 8640. *
log12sqrt52 - 29232. *
log2 -
2000 (20. * complex::i()) *
sqrt3 + 9360. *
sqrt5) *
2003 (226. * (
M_PI4)) / 405.)
2005 cache_ps[
index_p(
uu, 2, 2, 2)] = (27476329. / 58320. + (40370. * L_1) / 243. + (604. * L_12) / 27. + (6928. * L_2) / 81. +
2006 (1064. * L_1 * L_2) / 27. - (52. * L_22) / 3. + (416. *
Cl2PI3 *
sqrt3) / 81. -
2008 (4778443. *
z) / 27000. + (32. * L_1 *
z) / 9. - (4388. *
zeta3) / 27. -
2009 (4. * (20. + 30. * L_1 + 3. *
log3) *
sqrt3 * (M_PI)) / 243. -
2010 ((41279. + 11664. * L_1 + 3456. * L_2 - 1728. *
log12sqrt52 + 11808. *
log2 -
2011 (20. * complex::i()) *
sqrt3 - 1872. *
sqrt5) *
2014 (398. * (
M_PI4)) / 135.)
2034 double L_b = 2. * log(
mu_b /
Mb);
2037 cache_p[
index_p(
cc, 1, 1, 2)] += (8. * (4. + 3. * L_b) * (-196. + 675. *
z)) / 243.;
2038 cache_p[
index_p(
cc, 1, 2, 2)] += (-44. * (4. + 3. * L_b) * (-19. + 108. *
z)) / 81.;
2039 cache_p[
index_p(
cc, 2, 2, 2)] += (-16. * (4. + 3. * L_b) * (-4. + 27. *
z)) / 27.;
2052 for (
int i = 1; i <= 2; i++)
2054 for (
int j = i; j <= 2; j++)
2062 cache_p[
index_p(
cu, 1, 1, 2)] = (814589597. / 4199040. + (56. *
Cl2PI3) / (243. *
sqrt3) + (1320817. * L_1) / 17496. + (3211. * L_12) / 324. +
2063 (259603. * L_2) / 11664. + (12911. * L_1 * L_2) / 972. - (311. * L_22) / 216. - (((5. * complex::i()) / 1296.) *
log3 *
log3) /
sqrt3 +
2064 (855371. *
sqrtz) / 180000. + (11. *
log2z *
sqrtz) / 9. + (44. * logM1OverSqrtz2 *
sqrtz) / 9. +
2066 (44. * logM1OverSqrtz2) / (9. *
z) - (44. * logM1OverSqrtz *
logz) / (9. *
z) + (11. *
log2z) / (9. *
sqrtz) +
2067 (44. * logM1OverSqrtz2) / (9. *
sqrtz) + (44. * logM1OverSqrtz *
logz) / (9. *
sqrtz) -
2068 (1765737724785029. *
z) / 3455518320000. - (721799. * L_1 *
z) / 3888. - (2347. * L_12 *
z) / 108. + (1891. * L_2 *
z) / 162. -
2069 (337. * L_1 * L_2 *
z) / 18. + (187. * L_22 *
z) / 36. - (44. * logM1OverSqrtz2 *
z) / 9. - (4873. *
logz *
z) / 18. -
2070 (674. * L_1 *
logz *
z) / 9. - (44. * L_2 *
logz *
z) / 3. - (44. * logM1OverSqrtz *
logz *
z) / 9. - (28333. *
zeta3) / 486. +
2071 (128581. *
z *
zeta3) / 432. - (5. * (3. *
sqrt3 *
log3 + 30. * L_1 *
sqrt3 + 10. *
sqrt3 * (2. + 9. *
z)) * (M_PI)) / 17496. +
2072 ((-342144. + 342144. *
sqrtz + (-216641. + (50. * complex::i()) *
sqrt3 - 87480. * L_1 + 432. * L_2 - 5112. *
log2 - 158184. *
sqrt5 + 342144. *
sqrtz) *
z + 9. * (197453. + 2232. * L_1 + 912. * L_2 - 26508. *
log2 + 576. *
logz + 9744. *
sqrt5) *
z2 - 864. *
z * (169. + 102. *
z) *
log12sqrt52) * (
M_PI2)) / (69984. *
z) +
2073 (23. * (
M_PI4)) / 4860. - (13637. *
z * (
M_PI4)) / 233280.)
2075 cache_p[
index_p(
cu, 1, 2, 2)] = (-95740679. / 349920. - (1026907. * L_1) / 5832. - (1751. * L_12) / 54. - (619. * L_2) / 972. + (166. * L_1 * L_2) / 81. - L_22 / 18. -
2077 (16. * logM1OverSqrtz2 *
sqrtz) / 3. + (16. * logM1OverSqrtz *
logz *
sqrtz) / 3. + ((10. * -1.) / 81.) *
sqrt3 *
t_2 -
2078 (4. *
log2z) / (3. *
z) - (16. * logM1OverSqrtz2) / (3. *
z) - (16. * logM1OverSqrtz *
logz) / (3. *
z) +
2079 (4. *
log2z) / (3. *
sqrtz) + (16. * logM1OverSqrtz2) / (3. *
sqrtz) +
2080 (16. * logM1OverSqrtz *
logz) / (3. *
sqrtz) + (1101582779. *
z) / 1944000. + (117323. * L_1 *
z) / 324. +
2081 (1193. * L_12 *
z) / 18. + (3175. * L_2 *
z) / 27. + (32. * L_1 * L_2 *
z) / 3. + (17. * L_22 *
z) / 3. - (16. * logM1OverSqrtz2 *
z) / 3. +
2082 (190. *
logz *
z) / 3. + (128. * L_1 *
logz *
z) / 3. - 16. * L_2 *
logz *
z - (16. * logM1OverSqrtz *
logz *
z) / 3. -
2083 (10573. *
zeta3) / 324. + (85027. *
z *
zeta3) / 180. + (5. *
sqrt3 * (20. + 30. * L_1 + 3. *
log3 + 90. *
z) * (M_PI)) / 1458. -
2084 ((311040. - 311040. *
sqrtz - 5. * (497221. + 116640. * L_1 - 864. * L_2 - 39744. *
log12sqrt52 + 85824. *
log2 - (100. * complex::i()) *
sqrt3 - 43056. *
sqrt5 + 62208. *
sqrtz) *
z +
2088 (799. * (
M_PI4)) / 810. + (20833. *
z * (
M_PI4)) / 9720.)
2090 cache_p[
index_p(
cu, 2, 2, 2)] = (74041. / 14580. + (106199. * L_1) / 972. + (239. * L_12) / 18. - (5117. * L_2) / 81. - (202. * L_1 * L_2) / 27. - (19. * L_22) / 3. +
2093 (8. * logM1OverSqrtz2) /
z - (8. * logM1OverSqrtz *
logz) /
z + (2. *
log2z) /
sqrtz +
2094 (8. * logM1OverSqrtz2) /
sqrtz + (8. * logM1OverSqrtz *
logz) /
sqrtz - (251125639. *
z) / 810000. -
2095 (16343. * L_1 *
z) / 108. - (61. * L_12 *
z) / 3. - (109. * L_2 *
z) / 36. - 11. * L_1 * L_2 *
z + (17. * L_22 *
z) / 2. -
2096 8. * logM1OverSqrtz2 *
z - 264. *
logz *
z - 44. * L_1 *
logz *
z - 24. * L_2 *
logz *
z - 8. * logM1OverSqrtz *
logz *
z -
2097 (3157. *
zeta3) / 54. + (2521. *
z *
zeta3) / 30. - (5. *
sqrt3 * (20. + 30. * L_1 + 3. *
log3 + 90. *
z) * (M_PI)) / 486. +
2098 (-177247. / 3888. - (4. *
log12sqrt52) / 9. + (148. *
log2) / 27. + ((25. * complex::i()) / 972.) *
sqrt3 - (13. *
sqrt5) / 27. +
2100 (8. *
logz *
z) / 3. + (14. *
sqrt5 *
z) / 45. + L_1 * (-15. + (13. *
z) / 3.) + (2. * L_2 * (1. + 19. *
z)) / 9.) *
2102 (971. * (
M_PI4)) / 540. + (5203. *
z * (
M_PI4)) / 6480.)
2105 (902. * L_12) / 243. - (5504. * L_2) / 729. - (3064. * L_1 * L_2) / 243. + (260. * L_22) / 27. -
2107 (14062591829. *
z) / 29160000. - (97975. * L_1 *
z) / 486. - (4636. * L_2 *
z) / 81. -
2108 (4636. *
logz *
z) / 27. + (28528. *
zeta3) / 243. + (29. *
z *
zeta3) / 6. -
2110 ((-44209. + (10. * complex::i()) *
sqrt3 - 1728. * L_2 - 163368. *
log2 + 40248. *
sqrt5 - 63927. *
z -
2111 1728. * L_2 *
z + 98604. *
log2 *
z - 5184. *
logz *
z - 18576. *
sqrt5 *
z - 17496. * L_1 * (1. +
z) +
2115 (449. * (
M_PI4)) / 1215. -
2116 (27529. *
z * (
M_PI4)) / 29160.)
2118 cache_ps[
index_p(
cu, 1, 2, 2)] = (-1336127. / 2187. - (28733. * L_1) / 729. + (44. * L_12) / 81. - (2176. * L_2) / 243. - (1856. * L_1 * L_2) / 81. +
2120 (8773. *
sqrtz) / 100. + ((16. * -1.) / 81.) *
sqrt3 *
t_2 + (660495139. *
z) / 4860000. -
2121 (11734. * L_1 *
z) / 81. - (2624. * L_2 *
z) / 27. - (2624. *
logz *
z) / 9. + (13934. *
zeta3) / 81. -
2122 122. *
z *
zeta3 + (4. *
sqrt3 * (20. + 30. * L_1 + 3. *
log3 + 90. *
z) * (M_PI)) / 729. +
2124 5616. *
log2 *
z + 10368. *
logz *
z - 4320. *
sqrt5 *
z + 23328. * L_1 * (1. +
z) +
2125 3456. * L_2 * (1. +
z)) *
2128 (226. * (
M_PI4)) / 405. + (2846. *
z * (
M_PI4)) / 1215.)
2130 cache_ps[
index_p(
cu, 2, 2, 2)] = (27476329. / 58320. + (40370. * L_1) / 243. + (604. * L_12) / 27. + (6928. * L_2) / 81. +
2131 (1064. * L_1 * L_2) / 27. - (52. * L_22) / 3. + (416. *
Cl2PI3 *
sqrt3) / 81. -
2133 (151070269. *
z) / 81000. + (9466. * L_1 *
z) / 27. + (464. * L_2 *
z) / 9. + (464. *
logz *
z) / 3. -
2134 (4388. *
zeta3) / 27. - 300. *
z *
zeta3 - (4. *
sqrt3 * (20. + 30. * L_1 + 3. *
log3 + 90. *
z) * (M_PI)) / 243. - ((41279. - 1728. *
log12sqrt52 + 11808. *
log2 - (20. * complex::i()) *
sqrt3 - 1872. *
sqrt5 + 72342. *
z - 7344. *
log2 *
z + 10368. *
logz *
z + 864. *
sqrt5 *
z + 11664. * L_1 * (1. +
z) + 3456. * L_2 * (1. +
z)) * (
M_PI2)) / 486. + (398. * (
M_PI4)) / 135. + (7991. *
z * (
M_PI4)) / 810.)
2155 cache_p[
index_p(
cu, 1, 1, 2)] += (4. * (4. + 3. * L_b) * (-392. + 675. *
z)) / 243.;
2156 cache_p[
index_p(
cu, 1, 2, 2)] += (-44. * (4. + 3. * L_b) * (-19. + 54. *
z)) / 81.;
2157 cache_p[
index_p(
cu, 2, 2, 2)] += (-8. * (4. + 3. * L_b) * (-8. + 27. *
z)) / 27.;
2165 cache_p[
index_p(qq, 1, 8, 2)] = 208. / 81. * L_1 - L_2 / 27. + (2615. / 54. - 10. / 9. *
M_PI2) *
z - 5. / 9. *
M_PI2 + 25. / (54. *
sqrt3) * M_PI - 115. / 486.;
2166 cache_p[
index_p(qq, 2, 8, 2)] = -11. / 27. * L_1 + 2. / 9. * L_2 + (20. / 3. *
M_PI2 - 833. / 9.) *
z + 10. / 3. *
M_PI2 - 25. / (9. *
sqrt3) * M_PI - 3125. / 81.;
2167 cache_ps[
index_p(qq, 1, 8, 2)] = 448. / 81. * L_1 + 32. / 27. * L_2 + (1192. / 27. - 16. / 9. *
M_PI2) *
z - 8. / 9. *
M_PI2 + 20. / (27. *
sqrt3) * M_PI + 3580. / 243.;
2168 cache_ps[
index_p(qq, 2, 8, 2)] = -248. / 27. * L_1 - 64. / 9. * L_2 + (32. / 3. *
M_PI2 - 1088. / 9.) *
z + 16. / 3. *
M_PI2 - 40. / (9. *
sqrt3) * M_PI - 4568. / 81.;
2171 cache_p[
index_p(qq, 3, 8, 2)] = -85. / 27. * L_1 - 448. / 9. * L_2 - 196. / 3. *
z + 25. / 6. *
M_PI2 - 107. / (18. *
sqrt3) * M_PI - 17201. / 81.;
2172 cache_p[
index_p(qq, 4, 8, 2)] = -3269. / 162. * L_1 - 427. / 27. * L_2 + (20. / 3. *
M_PI2 - 404. / 3.) *
z + 169. / 12. *
M_PI2 - 514. / (27. *
sqrt3) * M_PI - 43016. / 243.;
2173 cache_p[
index_p(qq, 5, 8, 2)] = 5120. / 27. * L_1 - 7168. / 9. * L_2 - 760. / 3. *
z + 770. / 9. *
M_PI2 - 28. / (9. *
sqrt3) * M_PI - 430238. / 81.;
2174 cache_p[
index_p(qq, 6, 8, 2)] = -8962. / 81. * L_1 - 6976. / 27. * L_2 + (200. / 3. *
M_PI2 - 4222. / 3.) *
z + 3761. / 27. *
M_PI2 - 3220. / (27. *
sqrt3) * M_PI - 474656. / 243.;
2175 cache_ps[
index_p(qq, 3, 8, 2)] = 440. / 27. * L_1 + 512. / 9. * L_2 + 608. / 3. *
z - 596. / 27. *
M_PI2 - 52. / (9. *
sqrt3) * M_PI + 22504. / 81.;
2176 cache_ps[
index_p(qq, 4, 8, 2)] = -4804. / 81. * L_1 - 160. / 27. * L_2 + (32. / 3. *
M_PI2 - 128. / 3.) *
z + 1090. / 81. *
M_PI2 - 1120. / (27. *
sqrt3) * M_PI - 46988. / 243.;
2177 cache_ps[
index_p(qq, 5, 8, 2)] = 17408. / 27. * L_1 + 8192. / 9. * L_2 + 11456. / 3. *
z - 8912. / 27. *
M_PI2 - 1984. / (9. *
sqrt3) * M_PI + 420304. / 81.;
2178 cache_ps[
index_p(qq, 6, 8, 2)] = -28624. / 81. * L_1 + 2048. / 27. * L_2 + (320. / 3. *
M_PI2 - 160. / 3.) *
z + 5608. / 81. *
M_PI2 - 8416. / (27. *
sqrt3) * M_PI - 423440. / 243.;
2202 for (
int i = 1; i <= 6; i++)
2219 for (
int i = 0; i < 576; i++)
2240 for (
int i = 3; i <= 6; i++)
2242 for (
int j = i; j <= 6; j++)
2250 for (
int i = 1; i <= 6; i++)
2252 for (
int j = i; j <= 6; j++)
2261 cache_p_LO[
index_p(
cc, 1, 1, 1)] = (1196. + 342. * L_1 + 447. * L_2 - 15. * (
M_PI2)) / 324. + (
z * (-4113. - 1008. * L_1 - 792. * L_2 - 3168. *
logz + 4. * (
M_PI2))) / 216.;
2262 cache_p_LO[
index_p(
cc, 1, 2, 1)] = (
z * (1179. + 468. * L_1 - 72. * L_2 - 288. *
logz - 4. * (
M_PI2))) / 18. + (-452. - (333. * L_1) / 2. + 57. * L_2 + 15. * (
M_PI2)) / 27.;
2280 for (
int i = 1; i <= 2; i++)
2282 for (
int j = i; j <= 2; j++)
2308 for (
int i = 1; i <= 6; i++)
2327 double log_mub_Mb = 2. * log(
mu_b /
Mb);
2332 double beta0 = 23. / 3.;
2333 double log_mu1_mub = 2. * log(
mu_1 /
mu_b);
2334 double as_running1 = beta0 * log_mu1_mub;
2338 for (
int i = 1; i <= 6; i++)
2341 for (
int j = i; j <= 8; j++)
2347 cache_p[
index_p(qq, i, j, 2)] += 8. *
PoletoMS_as1 *
p(qq, i, j, 1,
flag_LOz) + (32. *
PoletoMS_as2_z0 + 16. *
PoletoMS_as1 *
PoletoMS_as1 + 8. *
PoletoMS_as1 * as_running1) *
p(qq, i, j, 0,
flag_LOz) + 16. * 2. *
PoletoMS_as2_z1 *
p(
uu, i, j, 0,
flag_LOz);
2348 cache_ps[
index_p(qq, i, j, 2)] += 8. *
PoletoMS_as1 *
p_s(qq, i, j, 1,
flag_LOz) + (32. *
PoletoMS_as2_z0 + 16. *
PoletoMS_as1 *
PoletoMS_as1 + 8. *
PoletoMS_as1 * as_running1) *
p_s(qq, i, j, 0,
flag_LOz) + 16. * 2. *
PoletoMS_as2_z1 *
p_s(
uu, i, j, 0,
flag_LOz);
2352 for (
int j = i; j <= 8; j++)
2356 if (j == 1 or j == 2 or j == 8)
2361 else if (3 <= j and j <= 6)
2375 double log_mu1_Mb = 2. * log(
mu_1 /
Mb);
2376 double log_mub_Mb = 2. * log(
mu_b /
Mb);
2381 double beta0 = 23. / 3.;
2382 double as_running1 = beta0 * log_mu1_Mb;
2386 for (
int i = 1; i <= 6; i++)
2389 for (
int j = i; j <= 8; j++)
2406 for (
int j = i; j <= 8; j++)
2410 if (j == 1 or j == 2 or j == 8)
2415 else if (3 <= j and j <= 6)
2429 double log_mub_Mb = 2. * log(
mu_b /
Mb);
2430 double log_mub_Mb_2 = log_mub_Mb * log_mub_Mb;
2431 double log_mub_Mb_3 = log_mub_Mb_2 * log_mub_Mb;
2432 double nl2 =
nl *
nl;
2433 double Dilogsqrtz = gslpp_special_functions::dilog(
sqrtz);
2434 double Dilogminussqrtz = gslpp_special_functions::dilog(-
sqrtz);
2435 double oneminussqrtz2 = (1. -
sqrtz) * (1. -
sqrtz);
2436 double log1minussqrtz = log(1. -
sqrtz);
2437 double log1plussqrtz = log(1. +
sqrtz);
2439 double log_mub_Mc = 2. * log(
mu_b /
Mc);
2443 (log_mub_Mb_3 * (1591. - 160. *
nl + 4. * nl2)) / 432. + (log_mub_Mb_2 * (19315. - 2206. *
nl + 52. * nl2)) / 864. - (220. *
polylog4_12) / 27. + 22.968067156 *
sqrtz + (2. * Dilogminussqrtz *
sqrtz) / 9. - (2. * Dilogsqrtz *
sqrtz) / 9. - 0.982666666 *
nl *
sqrtz +
2444 1.022111111 * sqrtz3 + (2. * Dilogminussqrtz * sqrtz3) / 9. - (2. * Dilogsqrtz * sqrtz3) / 9. + (
M_PI2 * sqrtz3) / 9. + 4.014666667 *
z - 0.300333333 *
nl *
z - (log_mub_Mc *
sqrtz * (3. * log1minussqrtz *
logz - 3. * log1plussqrtz *
logz - 3. *
M_PI2 + 24. *
sqrtz + 6. *
logz *
sqrtz + 6. *
log2z * sqrtz3 - 12. * log1minussqrtz *
logz * sqrtz3 - 12. * log1plussqrtz *
logz * sqrtz3 + 4. *
M_PI2 * sqrtz3 + 9. * log1minussqrtz *
logz *
z - 9. * log1plussqrtz *
logz *
z - 9. *
M_PI2 *
z - 6. * Dilogminussqrtz * (1. + 4. * sqrtz3 + 3. *
z) + Dilogsqrtz * (6. - 24. * sqrtz3 + 18. *
z))) / 18. + 0.0493333333 *
zeta2 + (2. * Dilogminussqrtz *
zeta2) / 9. + (2. * Dilogsqrtz *
zeta2) / 9. - (
log2z *
zeta2) / 18. - (
M_PI2 *
zeta2) / 27. +
2445 (log_mub_Mb * (12. * Dilogminussqrtz + 12. * Dilogsqrtz + 118.990000008 *
sqrtz + 6. * Dilogminussqrtz *
sqrtz - 6. * Dilogsqrtz *
sqrtz + 3. *
M_PI2 *
sqrtz - 9.624000006 *
nl *
sqrtz + 13.037999994 * sqrtz3 - 6. * Dilogminussqrtz * sqrtz3 +
2446 6. * Dilogsqrtz * sqrtz3 - 3. *
M_PI2 * sqrtz3 - 1.206 *
nl * sqrtz3 - 38.372000004 *
z + 3.96 *
nl *
z - 3. *
logz * (-1. +
z) * (log1minussqrtz * (2. -
sqrtz + 2. *
z) + log1plussqrtz * (2. +
sqrtz + 2. *
z)) - 12. * Dilogminussqrtz *
zeta2 -
2449 (
logz * (log1minussqrtz * oneminussqrtz2 * (1. +
sqrtz +
z) + 1. * (
sqrtz * (-76.2645000015 + 4.9559999985 *
nl - 13.544000001 *
sqrtz + 0.1544999985 *
z) +
2450 log1plussqrtz * (1. +
sqrtz + sqrtz3 +
zeta2)))) /
2453 (nl2 * (2353. + 936. *
M_PI2 + 3024. *
zeta3)) / 23328. + (log_mub_Mb * (177305. + 10656. * (3. +
log2) *
zeta2 + 4. * nl2 * (89. + 72. *
zeta2) - 4824. *
zeta3 - 2. *
nl * (72. * (49. + 4. *
log2) *
zeta2 + 7. * (1447. + 144. *
zeta3)))) / 2592. + (1975. *
zeta5) / 216.) /
2456 double beta0 = 23. / 3.;
2457 double beta1 = 51. / 8. - 19. / 24. * 5.;
2458 double log_mu1_mub = 2. * log(
mu_1 /
mu_b);
2459 double as_running1 = beta0 * log_mu1_mub;
2460 double as_running2 = -beta0 * beta0 * log_mu1_mub * log_mu1_mub + beta1 * log_mu1_mub;
2464 for (
int i = 1; i <= 8; i++)
2468 for (
int j = i; j <= 8; j++)
2474 cache_p[
index_p(qq, i, j, 3)] = 8. *
PoletoMS_as1 *
p(qq, i, j, 2) + (32. *
PoletoMS_as2 + 16. *
PoletoMS_as1 *
PoletoMS_as1 + 8. *
PoletoMS_as1 * as_running1) *
p(qq, i, j, 1) + (128. * (
PoletoMS_as3 +
PoletoMS_as1 *
PoletoMS_as2) + 8. *
PoletoMS_as1 * as_running2 + 32. *
PoletoMS_as2 * as_running1) *
p(qq, i, j, 0);
2475 cache_ps[
index_p(qq, i, j, 3)] = 8. *
PoletoMS_as1 *
p_s(qq, i, j, 2) + (32. *
PoletoMS_as2 + 16. *
PoletoMS_as1 *
PoletoMS_as1 + 8. *
PoletoMS_as1 * as_running1) *
p_s(qq, i, j, 1) + (128. * (
PoletoMS_as3 +
PoletoMS_as1 *
PoletoMS_as2) + 8. *
PoletoMS_as1 * as_running2 + 32. *
PoletoMS_as2 * as_running1) *
p_s(qq, i, j, 0);
2476 if (j >= 3 and j <= 6)
2505 double log_mu1_Mb = 2. * log(
mu_1 /
Mb);
2506 double log_mub_Mb = 2. * log(
mu_b /
Mb);
2508 double log_muf_Mb = 2. * log(
mu_f /
Mb);
2512 PoletoPS_as3 = 4. / 3. *
mu_f / (
Mb * 16.) * (
a2 - (2. *
a1 *
b0 +
b1) * (log_muf_Mb - 2.) +
b0_2 * (log_muf_Mb * log_muf_Mb - 4. * log_muf_Mb + 8.));
2515 double beta0 = 23. / 3.;
2516 double beta1 = 51. / 8. - 19. / 24. * 5.;
2517 double as_running1 = beta0 * log_mu1_Mb;
2518 double as_running1_mub = beta0 * 2. * log(
mu_1 /
mu_b);
2519 double as_running2 = -beta0 * beta0 * log_mu1_Mb * log_mu1_Mb + beta1 * log_mu1_Mb;
2522 for (
int i = 1; i <= 8; i++)
2526 for (
int j = i; j <= 8; j++)
2532 cache_p[
index_p(qq, i, j, 3)] = 8. *
PoletoPS_as1 *
p(qq, i, j, 2) + (32. *
PoletoPS_as2 + 16. * PoletoPS_as1_2 + 8. *
PoletoPS_as1 * as_running1 - 8. *
PoletoPS_as1 * 4. * (-
PoletoPS_as1 +
PoletoMS_as1)) *
p(qq, i, j, 1) + (128. * (
PoletoPS_as3 +
PoletoPS_as1 *
PoletoPS_as2) - (-
PoletoPS_as1 +
PoletoMS_as1) * (128. * (PoletoPS_as1_2 +
PoletoPS_as2) + 32. *
PoletoPS_as1 * (as_running1 + as_running1_mub)) - (-
PoletoPS_as2 +
PoletoMS_as2) * 128. *
PoletoPS_as1 + (32. * PoletoPS_as1_2 + 64. *
PoletoPS_as2) * as_running1 + 8. *
PoletoPS_as1 * as_running2) *
p(qq, i, j, 0);
2533 cache_ps[
index_p(qq, i, j, 3)] = 8. *
PoletoPS_as1 *
p_s(qq, i, j, 2) + (32. *
PoletoPS_as2 + 16. * PoletoPS_as1_2 + 8. *
PoletoPS_as1 * as_running1 - 8. *
PoletoPS_as1 * 4. * (-
PoletoPS_as1 +
PoletoMS_as1)) *
p_s(qq, i, j, 1) + (128. * (
PoletoPS_as3 +
PoletoPS_as1 *
PoletoPS_as2) - (-
PoletoPS_as1 +
PoletoMS_as1) * (128. * (PoletoPS_as1_2 +
PoletoPS_as2) + 32. *
PoletoPS_as1 * (as_running1 + as_running1_mub)) - (-
PoletoPS_as2 +
PoletoMS_as2) * 128. *
PoletoPS_as1 + (32. * PoletoPS_as1_2 + 64. *
PoletoPS_as2) * as_running1 + 8. *
PoletoPS_as1 * as_running2) *
p_s(qq, i, j, 0);
2534 if (j >= 3 and j <= 6)
2566 for (
int i = 1; i <= 6; i++)
2569 for (
int j = i; j <= 8; j++)
2580 for (
int i = 0; i < 8; i++)
2593 double kappa = -2. * M_PI * mbpole * mbpole /
2596 double n[13] = {0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0.};
2619 double kappa = -2. * M_PI * mbpole * mbpole /
2622 double n[13] = {0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0., 0.};
gslpp::vector< double > me
int index_deltas(quarks qq, quark q)
gslpp::complex deltas_1overm(quarks qq, quark q)
gslpp::complex C1_LO_1overm
gslpp::vector< gslpp::complex > c_H(quark q, orders order)
double p(quarks qq, int i, int j, int n, bool flag_LOz=false)
gslpp::matrix< double > meMStoRI
void computeCKMandMasses(orders order=NNLO, mass_schemes mass_scheme=MSbar)
A method to compute CKM elements, quark masses and alpha_s.
void compute_deltas_1overm(quark q)
gslpp::complex lambda_u_d
gslpp::vector< gslpp::complex > H_allpartial(quarks qq)
double Mb2_prefactor_1overm
gslpp::complex Gamma21overM21_tradBasis(orders order, quark q)
A method to compute in the traditional basis @detail source: Ciuchini (hep-ph/0308029v2)
gslpp::complex M21_Bd(orders order)
A method to compute .
gslpp::vector< double > me_R
int indexF(quarks qq, int k, int i, int j)
gslpp::complex cache_deltas_1overm[6]
double F1(quarks qq, int k, int i, int j)
int indexP(quarks qq, int k, int i, int j)
double F(quarks qq, int k, int i, int j)
gslpp::complex C_Misiak_NLO[8]
void compute_partialNNLO()
gslpp::complex g(quarks qq, int i)
gslpp::complex delta_1overm(quark q)
Value of 1/mb corrections of (hep-ph/0612167)
gslpp::complex H_s_partial(quarks qq, int i_start, int i_end, int j_start, int j_end, int n)
gslpp::complex C_Misiak_LO[8]
gslpp::complex M21_Bs(orders order)
A method to compute .
double sqrt1minus4z_1overm
double F0(quarks qq, int k, int i, int j)
gslpp::complex H(quarks qq, orders order)
const StandardModel & mySM
gslpp::complex cachegtilde[12]
double P(quarks qq, int k, int i, int j)
gslpp::complex H_partial(quarks qq, int i_start, int i_end, int j_start, int j_end, int n)
gslpp::complex cacheg[12]
gslpp::complex C_Buras_LO[8]
gslpp::complex gtilde(quarks qq, int i)
gslpp::complex lambda_c_s
void computeD(orders order)
void poletoMSbar_pp_s_partialN3LO()
void poletoPS_pp_s_partialN3LO()
int index_p(quarks qq, int i, int j, int n)
gslpp::complex lambda_c_d
gslpp::complex C_Buras_NNLO[8]
gslpp::complex C2_LO_1overm
gslpp::complex delta_1overm_tradBasis(quark q)
Value of 1/mb corrections of (hep-ph/0308029v2)
AmpDB2(const StandardModel &SM_i, int BMeson_i, bool flag_fixmub=false, bool flag_RI=false)
Constructor.
gslpp::complex Gamma21overM21(orders order, mass_schemes mass_scheme, int BMeson)
A method to compute @detail source: Marvin Gerlach (2205.07907 and thesis) with 1/mb corrections fro...
gslpp::complex RBs(orders order)
A method to compute the ratio of the absolute value of the $B_s$ mixing amplitude over the Standard M...
gslpp::complex RBd(orders order)
A method to compute the ratio of the absolute value of the $B_d$ mixing amplitude over the Standard M...
gslpp::complex D(quarks qq, int k)
void computeWilsonCoeffsBuras()
int indexD(quarks qq, int k)
int indexg(quarks qq, int i)
gslpp::complex deltas_1overm_tradBasis(quarks qq, quark q)
gslpp::complex lambda_u_s
gslpp::complex C_Buras_NLO[8]
gslpp::vector< double > me_Rtilde
gslpp::matrix< double > coeffsMStoRI
gslpp::complex cache_deltas_1overm_tradBasis[6]
void compute_matrixelements(quark q, orders order)
A method to compute all DB=2 Wilson coefficients (me, me_R, me_Rtilde)
double p_s(quarks qq, int i, int j, int n, bool flag_LOz=false)
gslpp::vector< gslpp::complex > c(quark q, orders order)
Values of DB=2 Wilson coefficients from (hep-ph/0308029v2) transformed to the new basis.
gslpp::complex H_s(quarks qq, orders order)
gslpp::vector< double > meoverme0
gslpp::vector< gslpp::complex > c_H_partial(quark q, int i)
gslpp::vector< gslpp::complex > H_s_allpartial(quarks qq)
void computeWilsonCoeffsMisiak()
gslpp::complex C_Misiak_NNLO[8]
void compute_deltas_1overm_tradBasis(quark q)
const double & getMu() const
A get method for the scale of the bag parameters.
schemes getScheme() const
A get method for the scheme of the bag parameters.
const gslpp::vector< double > & getBpars() const
A get method for the vector of the bag parameters.
const double computeBeta() const
The CKM angle .
const gslpp::complex computelamt_s() const
The product of the CKM elements .
const gslpp::complex computelamu_s() const
The product of the CKM elements .
const gslpp::complex computelamc_s() const
The product of the CKM elements .
const gslpp::complex computelamu_d() const
The product of the CKM elements .
const gslpp::complex computelamc_d() const
The product of the CKM elements .
const double computeBetas() const
The CKM angle .
const gslpp::complex computelamt_d() const
The product of the CKM elements .
const double computeRt() const
.
const double computeRts() const
.
gslpp::matrix< double > & Df2Evol(double mu, double M, orders order, schemes scheme=NDR)
double etabS0(double mu) const
Buras et al, hep-ph/9512380.
gslpp::vector< gslpp::complex > ** ComputeCoeffsgamma(double mu, bool noSM=false, schemes scheme=NDR) const
Computes the Wilson coefficient for the process .
gslpp::vector< gslpp::complex > ** ComputeCoeffsgamma_Buras(double mu, bool noSM=false, schemes scheme=NDR) const
Computes the Wilson coefficient for the process .
gslpp::vector< gslpp::complex > ** ComputeCoeffBd(double mu, schemes scheme=NDR, bool SM=false) const
Computes the Wilson coefficient for the process .
HeffDF2 & getHDF2() const
The member that returns an object of the class HeffDF2.
gslpp::vector< gslpp::complex > ** ComputeCoeffBs(double mu, schemes scheme=NDR, bool SM=false) const
Computes the Wilson coefficient for the process .
EvolDF2 & getUDF2() const
WilsonCoefficient getCoeffBs() const
WilsonCoefficient getCoeffBd() const
const double & getDecayconst() const
A get method for the decay constant of the meson.
An observable class for the -boson mass.
double getMass_scale() const
A get method to access the scale at which the particle mass is defined.
const double & getMass() const
A get method to access the particle mass.
const Meson & getMesons(const QCD::meson m) const
A get method to access a meson as an object of the type Meson.
const BParameter & getBBd_subleading() const
For getting the subleading bag parameters in process in the meson system.
const double Mrun(const double mu, const double m, const quark q, const orders order=FULLNNLO) const
Computes a running quark mass from .
const BParameter & getBBs_subleading() const
For getting the subleading bag parameters in process in the meson system.
const double getMut() const
A get method to access the threshold between six- and five-flavour theory in GeV.
void initializeBParameter(std::string name_i) const
A method to initialize B Parameter and the corresponding meson.
const BParameter & getBBs() const
For getting the bag parameters corresponding to the operator basis in process in the meson system.
const BParameter & getBBd() const
For getting the bag parameters corresponding to the operator basis in process in the meson system.
const Particle & getQuarks(const QCD::quark q) const
A get method to access a quark as an object of the type Particle.
void initializeMeson(QCD::meson meson_i) const
A method to initialize a meson.
const double getMub() const
A get method to access the threshold between five- and four-flavour theory in GeV.
const double Mbar2Mp(const double mbar, const quark q, const orders order=FULLNNLO) const
Converts the mass to the pole mass.
A model class for the Standard Model.
virtual const double getPhiBs() const
Half the relative phase of the $B_s$ mixing amplitude w.r.t. the Standard Model one.
virtual const double getCBd() const
The ratio of the absolute value of the $B_d$ mixing amplitude over the Standard Model value.
const CKM & getCKM() const
A get method to retrieve the member object of type CKM.
virtual const double getPhiBd() const
Half the relative phase of the $B_d$ mixing amplitude w.r.t. the Standard Model one.
virtual const double Mw() const
The SM prediction for the -boson mass in the on-shell scheme, .
const Flavour & getFlavour() const
const double getGF() const
A get method to retrieve the Fermi constant .
const double Als(const double mu, const orders order, const bool Nf_thr, const bool qed_flag) const
The running QCD coupling in the scheme including QED corrections.
virtual const double getCBs() const
The ratio of the absolute value of the $B_s$ mixing amplitude over the Standard Model value.
orders getHighest(orders order)
returns the highest order in QCD without the prefix FULL
orders
An enum type for orders in QCD.