1 /** @file inifcns_nstdsums.cpp
3 * Implementation of some special functions that have a representation as nested sums.
6 * classical polylogarithm Li(n,x)
7 * multiple polylogarithm Li(lst(m_1,...,m_k),lst(x_1,...,x_k))
8 * G(lst(a_1,...,a_k),y) or G(lst(a_1,...,a_k),lst(s_1,...,s_k),y)
9 * Nielsen's generalized polylogarithm S(n,p,x)
10 * harmonic polylogarithm H(m,x) or H(lst(m_1,...,m_k),x)
11 * multiple zeta value zeta(m) or zeta(lst(m_1,...,m_k))
12 * alternating Euler sum zeta(m,s) or zeta(lst(m_1,...,m_k),lst(s_1,...,s_k))
16 * - All formulae used can be looked up in the following publications:
17 * [Kol] Nielsen's Generalized Polylogarithms, K.S.Kolbig, SIAM J.Math.Anal. 17 (1986), pp. 1232-1258.
18 * [Cra] Fast Evaluation of Multiple Zeta Sums, R.E.Crandall, Math.Comp. 67 (1998), pp. 1163-1172.
19 * [ReV] Harmonic Polylogarithms, E.Remiddi, J.A.M.Vermaseren, Int.J.Mod.Phys. A15 (2000), pp. 725-754
20 * [BBB] Special Values of Multiple Polylogarithms, J.Borwein, D.Bradley, D.Broadhurst, P.Lisonek, Trans.Amer.Math.Soc. 353/3 (2001), pp. 907-941
21 * [VSW] Numerical evaluation of multiple polylogarithms, J.Vollinga, S.Weinzierl, hep-ph/0410259
23 * - The order of parameters and arguments of Li and zeta is defined according to the nested sums
24 * representation. The parameters for H are understood as in [ReV]. They can be in expanded --- only
25 * 0, 1 and -1 --- or in compactified --- a string with zeros in front of 1 or -1 is written as a single
26 * number --- notation.
28 * - All functions can be numerically evaluated with arguments in the whole complex plane. The parameters
29 * for Li, zeta and S must be positive integers. If you want to have an alternating Euler sum, you have
30 * to give the signs of the parameters as a second argument s to zeta(m,s) containing 1 and -1.
32 * - The calculation of classical polylogarithms is speeded up by using Bernoulli numbers and
33 * look-up tables. S uses look-up tables as well. The zeta function applies the algorithms in
34 * [Cra] and [BBB] for speed up. Multiple polylogarithms use Hoelder convolution [BBB].
36 * - The functions have no means to do a series expansion into nested sums. To do this, you have to convert
37 * these functions into the appropriate objects from the nestedsums library, do the expansion and convert
40 * - Numerical testing of this implementation has been performed by doing a comparison of results
41 * between this software and the commercial M.......... 4.1. Multiple zeta values have been checked
42 * by means of evaluations into simple zeta values. Harmonic polylogarithms have been checked by
43 * comparison to S(n,p,x) for corresponding parameter combinations and by continuity checks
44 * around |x|=1 along with comparisons to corresponding zeta functions. Multiple polylogarithms were
45 * checked against H and zeta and by means of shuffle and quasi-shuffle relations.
50 * GiNaC Copyright (C) 1999-2015 Johannes Gutenberg University Mainz, Germany
52 * This program is free software; you can redistribute it and/or modify
53 * it under the terms of the GNU General Public License as published by
54 * the Free Software Foundation; either version 2 of the License, or
55 * (at your option) any later version.
57 * This program is distributed in the hope that it will be useful,
58 * but WITHOUT ANY WARRANTY; without even the implied warranty of
59 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
60 * GNU General Public License for more details.
62 * You should have received a copy of the GNU General Public License
63 * along with this program; if not, write to the Free Software
64 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
74 #include "operators.h"
77 #include "relational.h"
90 //////////////////////////////////////////////////////////////////////
92 // Classical polylogarithm Li(n,x)
96 //////////////////////////////////////////////////////////////////////
99 // anonymous namespace for helper functions
103 // lookup table for factors built from Bernoulli numbers
105 std::vector<std::vector<cln::cl_N> > Xn;
106 // initial size of Xn that should suffice for 32bit machines (must be even)
107 const int xninitsizestep = 26;
108 int xninitsize = xninitsizestep;
112 // This function calculates the X_n. The X_n are needed for speed up of classical polylogarithms.
113 // With these numbers the polylogs can be calculated as follows:
114 // Li_p (x) = \sum_{n=0}^\infty X_{p-2}(n) u^{n+1}/(n+1)! with u = -log(1-x)
115 // X_0(n) = B_n (Bernoulli numbers)
116 // X_p(n) = \sum_{k=0}^n binomial(n,k) B_{n-k} / (k+1) * X_{p-1}(k)
117 // The calculation of Xn depends on X0 and X{n-1}.
118 // X_0 is special, it holds only the non-zero Bernoulli numbers with index 2 or greater.
119 // This results in a slightly more complicated algorithm for the X_n.
120 // The first index in Xn corresponds to the index of the polylog minus 2.
121 // The second index in Xn corresponds to the index from the actual sum.
125 // calculate X_2 and higher (corresponding to Li_4 and higher)
126 std::vector<cln::cl_N> buf(xninitsize);
127 std::vector<cln::cl_N>::iterator it = buf.begin();
129 *it = -(cln::expt(cln::cl_I(2),n+1) - 1) / cln::expt(cln::cl_I(2),n+1); // i == 1
131 for (int i=2; i<=xninitsize; i++) {
133 result = 0; // k == 0
135 result = Xn[0][i/2-1]; // k == 0
137 for (int k=1; k<i-1; k++) {
138 if ( !(((i-k) & 1) && ((i-k) > 1)) ) {
139 result = result + cln::binomial(i,k) * Xn[0][(i-k)/2-1] * Xn[n-1][k-1] / (k+1);
142 result = result - cln::binomial(i,i-1) * Xn[n-1][i-2] / 2 / i; // k == i-1
143 result = result + Xn[n-1][i-1] / (i+1); // k == i
150 // special case to handle the X_0 correct
151 std::vector<cln::cl_N> buf(xninitsize);
152 std::vector<cln::cl_N>::iterator it = buf.begin();
154 *it = cln::cl_I(-3)/cln::cl_I(4); // i == 1
156 *it = cln::cl_I(17)/cln::cl_I(36); // i == 2
158 for (int i=3; i<=xninitsize; i++) {
160 result = -Xn[0][(i-3)/2]/2;
161 *it = (cln::binomial(i,1)/cln::cl_I(2) + cln::binomial(i,i-1)/cln::cl_I(i))*result;
164 result = Xn[0][i/2-1] + Xn[0][i/2-1]/(i+1);
165 for (int k=1; k<i/2; k++) {
166 result = result + cln::binomial(i,k*2) * Xn[0][k-1] * Xn[0][i/2-k-1] / (k*2+1);
175 std::vector<cln::cl_N> buf(xninitsize/2);
176 std::vector<cln::cl_N>::iterator it = buf.begin();
177 for (int i=1; i<=xninitsize/2; i++) {
178 *it = bernoulli(i*2).to_cl_N();
187 // doubles the number of entries in each Xn[]
190 const int pos0 = xninitsize / 2;
192 for (int i=1; i<=xninitsizestep/2; ++i) {
193 Xn[0].push_back(bernoulli((i+pos0)*2).to_cl_N());
196 int xend = xninitsize + xninitsizestep;
199 for (int i=xninitsize+1; i<=xend; ++i) {
201 result = -Xn[0][(i-3)/2]/2;
202 Xn[1].push_back((cln::binomial(i,1)/cln::cl_I(2) + cln::binomial(i,i-1)/cln::cl_I(i))*result);
204 result = Xn[0][i/2-1] + Xn[0][i/2-1]/(i+1);
205 for (int k=1; k<i/2; k++) {
206 result = result + cln::binomial(i,k*2) * Xn[0][k-1] * Xn[0][i/2-k-1] / (k*2+1);
208 Xn[1].push_back(result);
212 for (size_t n=2; n<Xn.size(); ++n) {
213 for (int i=xninitsize+1; i<=xend; ++i) {
215 result = 0; // k == 0
217 result = Xn[0][i/2-1]; // k == 0
219 for (int k=1; k<i-1; ++k) {
220 if ( !(((i-k) & 1) && ((i-k) > 1)) ) {
221 result = result + cln::binomial(i,k) * Xn[0][(i-k)/2-1] * Xn[n-1][k-1] / (k+1);
224 result = result - cln::binomial(i,i-1) * Xn[n-1][i-2] / 2 / i; // k == i-1
225 result = result + Xn[n-1][i-1] / (i+1); // k == i
226 Xn[n].push_back(result);
230 xninitsize += xninitsizestep;
234 // calculates Li(2,x) without Xn
235 cln::cl_N Li2_do_sum(const cln::cl_N& x)
239 cln::cl_N num = x * cln::cl_float(1, cln::float_format(Digits));
240 cln::cl_I den = 1; // n^2 = 1
245 den = den + i; // n^2 = 4, 9, 16, ...
247 res = res + num / den;
248 } while (res != resbuf);
253 // calculates Li(2,x) with Xn
254 cln::cl_N Li2_do_sum_Xn(const cln::cl_N& x)
256 std::vector<cln::cl_N>::const_iterator it = Xn[0].begin();
257 std::vector<cln::cl_N>::const_iterator xend = Xn[0].end();
258 cln::cl_N u = -cln::log(1-x);
259 cln::cl_N factor = u * cln::cl_float(1, cln::float_format(Digits));
260 cln::cl_N uu = cln::square(u);
261 cln::cl_N res = u - uu/4;
266 factor = factor * uu / (2*i * (2*i+1));
267 res = res + (*it) * factor;
271 it = Xn[0].begin() + (i-1);
274 } while (res != resbuf);
279 // calculates Li(n,x), n>2 without Xn
280 cln::cl_N Lin_do_sum(int n, const cln::cl_N& x)
282 cln::cl_N factor = x * cln::cl_float(1, cln::float_format(Digits));
289 res = res + factor / cln::expt(cln::cl_I(i),n);
291 } while (res != resbuf);
296 // calculates Li(n,x), n>2 with Xn
297 cln::cl_N Lin_do_sum_Xn(int n, const cln::cl_N& x)
299 std::vector<cln::cl_N>::const_iterator it = Xn[n-2].begin();
300 std::vector<cln::cl_N>::const_iterator xend = Xn[n-2].end();
301 cln::cl_N u = -cln::log(1-x);
302 cln::cl_N factor = u * cln::cl_float(1, cln::float_format(Digits));
308 factor = factor * u / i;
309 res = res + (*it) * factor;
313 it = Xn[n-2].begin() + (i-2);
314 xend = Xn[n-2].end();
316 } while (res != resbuf);
321 // forward declaration needed by function Li_projection and C below
322 const cln::cl_N S_num(int n, int p, const cln::cl_N& x);
325 // helper function for classical polylog Li
326 cln::cl_N Li_projection(int n, const cln::cl_N& x, const cln::float_format_t& prec)
328 // treat n=2 as special case
330 // check if precalculated X0 exists
335 if (cln::realpart(x) < 0.5) {
336 // choose the faster algorithm
337 // the switching point was empirically determined. the optimal point
338 // depends on hardware, Digits, ... so an approx value is okay.
339 // it solves also the problem with precision due to the u=-log(1-x) transformation
340 if (cln::abs(cln::realpart(x)) < 0.25) {
342 return Li2_do_sum(x);
344 return Li2_do_sum_Xn(x);
347 // choose the faster algorithm
348 if (cln::abs(cln::realpart(x)) > 0.75) {
352 return -Li2_do_sum(1-x) - cln::log(x) * cln::log(1-x) + cln::zeta(2);
355 return -Li2_do_sum_Xn(1-x) - cln::log(x) * cln::log(1-x) + cln::zeta(2);
359 // check if precalculated Xn exist
361 for (int i=xnsize; i<n-1; i++) {
366 if (cln::realpart(x) < 0.5) {
367 // choose the faster algorithm
368 // with n>=12 the "normal" summation always wins against the method with Xn
369 if ((cln::abs(cln::realpart(x)) < 0.3) || (n >= 12)) {
370 return Lin_do_sum(n, x);
372 return Lin_do_sum_Xn(n, x);
375 cln::cl_N result = 0;
376 if ( x != 1 ) result = -cln::expt(cln::log(x), n-1) * cln::log(1-x) / cln::factorial(n-1);
377 for (int j=0; j<n-1; j++) {
378 result = result + (S_num(n-j-1, 1, 1) - S_num(1, n-j-1, 1-x))
379 * cln::expt(cln::log(x), j) / cln::factorial(j);
386 // helper function for classical polylog Li
387 const cln::cl_N Lin_numeric(const int n, const cln::cl_N& x)
391 return -cln::log(1-x);
402 return -(1-cln::expt(cln::cl_I(2),1-n)) * cln::zeta(n);
404 if (cln::abs(realpart(x)) < 0.4 && cln::abs(cln::abs(x)-1) < 0.01) {
405 cln::cl_N result = -cln::expt(cln::log(x), n-1) * cln::log(1-x) / cln::factorial(n-1);
406 for (int j=0; j<n-1; j++) {
407 result = result + (S_num(n-j-1, 1, 1) - S_num(1, n-j-1, 1-x))
408 * cln::expt(cln::log(x), j) / cln::factorial(j);
413 // what is the desired float format?
414 // first guess: default format
415 cln::float_format_t prec = cln::default_float_format;
416 const cln::cl_N value = x;
417 // second guess: the argument's format
418 if (!instanceof(realpart(x), cln::cl_RA_ring))
419 prec = cln::float_format(cln::the<cln::cl_F>(cln::realpart(value)));
420 else if (!instanceof(imagpart(x), cln::cl_RA_ring))
421 prec = cln::float_format(cln::the<cln::cl_F>(cln::imagpart(value)));
424 if (cln::abs(value) > 1) {
425 cln::cl_N result = -cln::expt(cln::log(-value),n) / cln::factorial(n);
426 // check if argument is complex. if it is real, the new polylog has to be conjugated.
427 if (cln::zerop(cln::imagpart(value))) {
429 result = result + conjugate(Li_projection(n, cln::recip(value), prec));
432 result = result - conjugate(Li_projection(n, cln::recip(value), prec));
437 result = result + Li_projection(n, cln::recip(value), prec);
440 result = result - Li_projection(n, cln::recip(value), prec);
444 for (int j=0; j<n-1; j++) {
445 add = add + (1+cln::expt(cln::cl_I(-1),n-j)) * (1-cln::expt(cln::cl_I(2),1-n+j))
446 * Lin_numeric(n-j,1) * cln::expt(cln::log(-value),j) / cln::factorial(j);
448 result = result - add;
452 return Li_projection(n, value, prec);
457 } // end of anonymous namespace
460 //////////////////////////////////////////////////////////////////////
462 // Multiple polylogarithm Li(n,x)
466 //////////////////////////////////////////////////////////////////////
469 // anonymous namespace for helper function
473 // performs the actual series summation for multiple polylogarithms
474 cln::cl_N multipleLi_do_sum(const std::vector<int>& s, const std::vector<cln::cl_N>& x)
476 // ensure all x <> 0.
477 for (std::vector<cln::cl_N>::const_iterator it = x.begin(); it != x.end(); ++it) {
478 if ( *it == 0 ) return cln::cl_float(0, cln::float_format(Digits));
481 const int j = s.size();
482 bool flag_accidental_zero = false;
484 std::vector<cln::cl_N> t(j);
485 cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
492 t[j-1] = t[j-1] + cln::expt(x[j-1], q) / cln::expt(cln::cl_I(q),s[j-1]) * one;
493 for (int k=j-2; k>=0; k--) {
494 t[k] = t[k] + t[k+1] * cln::expt(x[k], q+j-1-k) / cln::expt(cln::cl_I(q+j-1-k), s[k]);
497 t[j-1] = t[j-1] + cln::expt(x[j-1], q) / cln::expt(cln::cl_I(q),s[j-1]) * one;
498 for (int k=j-2; k>=0; k--) {
499 flag_accidental_zero = cln::zerop(t[k+1]);
500 t[k] = t[k] + t[k+1] * cln::expt(x[k], q+j-1-k) / cln::expt(cln::cl_I(q+j-1-k), s[k]);
502 } while ( (t[0] != t0buf) || cln::zerop(t[0]) || flag_accidental_zero );
508 // forward declaration for Li_eval()
509 lst convert_parameter_Li_to_H(const lst& m, const lst& x, ex& pf);
512 // type used by the transformation functions for G
513 typedef std::vector<int> Gparameter;
516 // G_eval1-function for G transformations
517 ex G_eval1(int a, int scale, const exvector& gsyms)
520 const ex& scs = gsyms[std::abs(scale)];
521 const ex& as = gsyms[std::abs(a)];
523 return -log(1 - scs/as);
528 return log(gsyms[std::abs(scale)]);
533 // G_eval-function for G transformations
534 ex G_eval(const Gparameter& a, int scale, const exvector& gsyms)
536 // check for properties of G
537 ex sc = gsyms[std::abs(scale)];
539 bool all_zero = true;
540 bool all_ones = true;
542 for (Gparameter::const_iterator it = a.begin(); it != a.end(); ++it) {
544 const ex sym = gsyms[std::abs(*it)];
558 // care about divergent G: shuffle to separate divergencies that will be canceled
559 // later on in the transformation
560 if (newa.nops() > 1 && newa.op(0) == sc && !all_ones && a.front()!=0) {
563 Gparameter::const_iterator it = a.begin();
565 for (; it != a.end(); ++it) {
566 short_a.push_back(*it);
568 ex result = G_eval1(a.front(), scale, gsyms) * G_eval(short_a, scale, gsyms);
569 it = short_a.begin();
570 for (int i=1; i<count_ones; ++i) {
573 for (; it != short_a.end(); ++it) {
576 Gparameter::const_iterator it2 = short_a.begin();
577 for (; it2 != it; ++it2) {
578 newa.push_back(*it2);
581 newa.push_back(a[0]);
584 for (; it2 != short_a.end(); ++it2) {
585 newa.push_back(*it2);
587 result -= G_eval(newa, scale, gsyms);
589 return result / count_ones;
592 // G({1,...,1};y) -> G({1};y)^k / k!
593 if (all_ones && a.size() > 1) {
594 return pow(G_eval1(a.front(),scale, gsyms), count_ones) / factorial(count_ones);
597 // G({0,...,0};y) -> log(y)^k / k!
599 return pow(log(gsyms[std::abs(scale)]), a.size()) / factorial(a.size());
602 // no special cases anymore -> convert it into Li
605 ex argbuf = gsyms[std::abs(scale)];
607 for (Gparameter::const_iterator it=a.begin(); it!=a.end(); ++it) {
609 const ex& sym = gsyms[std::abs(*it)];
610 x.append(argbuf / sym);
618 return pow(-1, x.nops()) * Li(m, x);
622 // converts data for G: pending_integrals -> a
623 Gparameter convert_pending_integrals_G(const Gparameter& pending_integrals)
625 GINAC_ASSERT(pending_integrals.size() != 1);
627 if (pending_integrals.size() > 0) {
628 // get rid of the first element, which would stand for the new upper limit
629 Gparameter new_a(pending_integrals.begin()+1, pending_integrals.end());
632 // just return empty parameter list
639 // check the parameters a and scale for G and return information about convergence, depth, etc.
640 // convergent : true if G(a,scale) is convergent
641 // depth : depth of G(a,scale)
642 // trailing_zeros : number of trailing zeros of a
643 // min_it : iterator of a pointing on the smallest element in a
644 Gparameter::const_iterator check_parameter_G(const Gparameter& a, int scale,
645 bool& convergent, int& depth, int& trailing_zeros, Gparameter::const_iterator& min_it)
651 Gparameter::const_iterator lastnonzero = a.end();
652 for (Gparameter::const_iterator it = a.begin(); it != a.end(); ++it) {
653 if (std::abs(*it) > 0) {
657 if (std::abs(*it) < scale) {
659 if ((min_it == a.end()) || (std::abs(*it) < std::abs(*min_it))) {
667 if (lastnonzero == a.end())
669 return ++lastnonzero;
673 // add scale to pending_integrals if pending_integrals is empty
674 Gparameter prepare_pending_integrals(const Gparameter& pending_integrals, int scale)
676 GINAC_ASSERT(pending_integrals.size() != 1);
678 if (pending_integrals.size() > 0) {
679 return pending_integrals;
681 Gparameter new_pending_integrals;
682 new_pending_integrals.push_back(scale);
683 return new_pending_integrals;
688 // handles trailing zeroes for an otherwise convergent integral
689 ex trailing_zeros_G(const Gparameter& a, int scale, const exvector& gsyms)
692 int depth, trailing_zeros;
693 Gparameter::const_iterator last, dummyit;
694 last = check_parameter_G(a, scale, convergent, depth, trailing_zeros, dummyit);
696 GINAC_ASSERT(convergent);
698 if ((trailing_zeros > 0) && (depth > 0)) {
700 Gparameter new_a(a.begin(), a.end()-1);
701 result += G_eval1(0, scale, gsyms) * trailing_zeros_G(new_a, scale, gsyms);
702 for (Gparameter::const_iterator it = a.begin(); it != last; ++it) {
703 Gparameter new_a(a.begin(), it);
705 new_a.insert(new_a.end(), it, a.end()-1);
706 result -= trailing_zeros_G(new_a, scale, gsyms);
709 return result / trailing_zeros;
711 return G_eval(a, scale, gsyms);
716 // G transformation [VSW] (57),(58)
717 ex depth_one_trafo_G(const Gparameter& pending_integrals, const Gparameter& a, int scale, const exvector& gsyms)
719 // pendint = ( y1, b1, ..., br )
720 // a = ( 0, ..., 0, amin )
723 // int_0^y1 ds1/(s1-b1) ... int dsr/(sr-br) G(0, ..., 0, sr; y2)
724 // where sr replaces amin
726 GINAC_ASSERT(a.back() != 0);
727 GINAC_ASSERT(a.size() > 0);
730 Gparameter new_pending_integrals = prepare_pending_integrals(pending_integrals, std::abs(a.back()));
731 const int psize = pending_integrals.size();
734 // G(sr_{+-}; y2 ) = G(y2_{-+}; sr) - G(0; sr) + ln(-y2_{-+})
739 result += log(gsyms[ex_to<numeric>(scale).to_int()]);
741 new_pending_integrals.push_back(-scale);
744 new_pending_integrals.push_back(scale);
748 result *= trailing_zeros_G(convert_pending_integrals_G(pending_integrals),
749 pending_integrals.front(),
754 result += trailing_zeros_G(convert_pending_integrals_G(new_pending_integrals),
755 new_pending_integrals.front(),
759 new_pending_integrals.back() = 0;
760 result -= trailing_zeros_G(convert_pending_integrals_G(new_pending_integrals),
761 new_pending_integrals.front(),
768 // G_m(sr_{+-}; y2) = -zeta_m + int_0^y2 dt/t G_{m-1}( (1/y2)_{+-}; 1/t )
769 // - int_0^sr dt/t G_{m-1}( (1/y2)_{+-}; 1/t )
772 result -= zeta(a.size());
774 result *= trailing_zeros_G(convert_pending_integrals_G(pending_integrals),
775 pending_integrals.front(),
779 // term int_0^sr dt/t G_{m-1}( (1/y2)_{+-}; 1/t )
780 // = int_0^sr dt/t G_{m-1}( t_{+-}; y2 )
781 Gparameter new_a(a.begin()+1, a.end());
782 new_pending_integrals.push_back(0);
783 result -= depth_one_trafo_G(new_pending_integrals, new_a, scale, gsyms);
785 // term int_0^y2 dt/t G_{m-1}( (1/y2)_{+-}; 1/t )
786 // = int_0^y2 dt/t G_{m-1}( t_{+-}; y2 )
787 Gparameter new_pending_integrals_2;
788 new_pending_integrals_2.push_back(scale);
789 new_pending_integrals_2.push_back(0);
791 result += trailing_zeros_G(convert_pending_integrals_G(pending_integrals),
792 pending_integrals.front(),
794 * depth_one_trafo_G(new_pending_integrals_2, new_a, scale, gsyms);
796 result += depth_one_trafo_G(new_pending_integrals_2, new_a, scale, gsyms);
803 // forward declaration
804 ex shuffle_G(const Gparameter & a0, const Gparameter & a1, const Gparameter & a2,
805 const Gparameter& pendint, const Gparameter& a_old, int scale,
806 const exvector& gsyms, bool flag_trailing_zeros_only);
809 // G transformation [VSW]
810 ex G_transform(const Gparameter& pendint, const Gparameter& a, int scale,
811 const exvector& gsyms, bool flag_trailing_zeros_only)
813 // main recursion routine
815 // pendint = ( y1, b1, ..., br )
816 // a = ( a1, ..., amin, ..., aw )
819 // int_0^y1 ds1/(s1-b1) ... int dsr/(sr-br) G(a1,...,sr,...,aw,y2)
820 // where sr replaces amin
822 // find smallest alpha, determine depth and trailing zeros, and check for convergence
824 int depth, trailing_zeros;
825 Gparameter::const_iterator min_it;
826 Gparameter::const_iterator firstzero =
827 check_parameter_G(a, scale, convergent, depth, trailing_zeros, min_it);
828 int min_it_pos = min_it - a.begin();
830 // special case: all a's are zero
837 result = G_eval(a, scale, gsyms);
839 if (pendint.size() > 0) {
840 result *= trailing_zeros_G(convert_pending_integrals_G(pendint),
847 // handle trailing zeros
848 if (trailing_zeros > 0) {
850 Gparameter new_a(a.begin(), a.end()-1);
851 result += G_eval1(0, scale, gsyms) * G_transform(pendint, new_a, scale, gsyms, flag_trailing_zeros_only);
852 for (Gparameter::const_iterator it = a.begin(); it != firstzero; ++it) {
853 Gparameter new_a(a.begin(), it);
855 new_a.insert(new_a.end(), it, a.end()-1);
856 result -= G_transform(pendint, new_a, scale, gsyms, flag_trailing_zeros_only);
858 return result / trailing_zeros;
861 // convergence case or flag_trailing_zeros_only
862 if (convergent || flag_trailing_zeros_only) {
863 if (pendint.size() > 0) {
864 return G_eval(convert_pending_integrals_G(pendint),
865 pendint.front(), gsyms)*
866 G_eval(a, scale, gsyms);
868 return G_eval(a, scale, gsyms);
872 // call basic transformation for depth equal one
874 return depth_one_trafo_G(pendint, a, scale, gsyms);
878 // int_0^y1 ds1/(s1-b1) ... int dsr/(sr-br) G(a1,...,sr,...,aw,y2)
879 // = int_0^y1 ds1/(s1-b1) ... int dsr/(sr-br) G(a1,...,0,...,aw,y2)
880 // + int_0^y1 ds1/(s1-b1) ... int dsr/(sr-br) int_0^{sr} ds_{r+1} d/ds_{r+1} G(a1,...,s_{r+1},...,aw,y2)
882 // smallest element in last place
883 if (min_it + 1 == a.end()) {
884 do { --min_it; } while (*min_it == 0);
886 Gparameter a1(a.begin(),min_it+1);
887 Gparameter a2(min_it+1,a.end());
889 ex result = G_transform(pendint, a2, scale, gsyms, flag_trailing_zeros_only)*
890 G_transform(empty, a1, scale, gsyms, flag_trailing_zeros_only);
892 result -= shuffle_G(empty, a1, a2, pendint, a, scale, gsyms, flag_trailing_zeros_only);
897 Gparameter::iterator changeit;
899 // first term G(a_1,..,0,...,a_w;a_0)
900 Gparameter new_pendint = prepare_pending_integrals(pendint, a[min_it_pos]);
901 Gparameter new_a = a;
902 new_a[min_it_pos] = 0;
903 ex result = G_transform(empty, new_a, scale, gsyms, flag_trailing_zeros_only);
904 if (pendint.size() > 0) {
905 result *= trailing_zeros_G(convert_pending_integrals_G(pendint),
906 pendint.front(), gsyms);
910 changeit = new_a.begin() + min_it_pos;
911 changeit = new_a.erase(changeit);
912 if (changeit != new_a.begin()) {
913 // smallest in the middle
914 new_pendint.push_back(*changeit);
915 result -= trailing_zeros_G(convert_pending_integrals_G(new_pendint),
916 new_pendint.front(), gsyms)*
917 G_transform(empty, new_a, scale, gsyms, flag_trailing_zeros_only);
918 int buffer = *changeit;
920 result += G_transform(new_pendint, new_a, scale, gsyms, flag_trailing_zeros_only);
922 new_pendint.pop_back();
924 new_pendint.push_back(*changeit);
925 result += trailing_zeros_G(convert_pending_integrals_G(new_pendint),
926 new_pendint.front(), gsyms)*
927 G_transform(empty, new_a, scale, gsyms, flag_trailing_zeros_only);
929 result -= G_transform(new_pendint, new_a, scale, gsyms, flag_trailing_zeros_only);
931 // smallest at the front
932 new_pendint.push_back(scale);
933 result += trailing_zeros_G(convert_pending_integrals_G(new_pendint),
934 new_pendint.front(), gsyms)*
935 G_transform(empty, new_a, scale, gsyms, flag_trailing_zeros_only);
936 new_pendint.back() = *changeit;
937 result -= trailing_zeros_G(convert_pending_integrals_G(new_pendint),
938 new_pendint.front(), gsyms)*
939 G_transform(empty, new_a, scale, gsyms, flag_trailing_zeros_only);
941 result += G_transform(new_pendint, new_a, scale, gsyms, flag_trailing_zeros_only);
947 // shuffles the two parameter list a1 and a2 and calls G_transform for every term except
948 // for the one that is equal to a_old
949 ex shuffle_G(const Gparameter & a0, const Gparameter & a1, const Gparameter & a2,
950 const Gparameter& pendint, const Gparameter& a_old, int scale,
951 const exvector& gsyms, bool flag_trailing_zeros_only)
953 if (a1.size()==0 && a2.size()==0) {
954 // veto the one configuration we don't want
955 if ( a0 == a_old ) return 0;
957 return G_transform(pendint, a0, scale, gsyms, flag_trailing_zeros_only);
963 aa0.insert(aa0.end(),a1.begin(),a1.end());
964 return shuffle_G(aa0, empty, empty, pendint, a_old, scale, gsyms, flag_trailing_zeros_only);
970 aa0.insert(aa0.end(),a2.begin(),a2.end());
971 return shuffle_G(aa0, empty, empty, pendint, a_old, scale, gsyms, flag_trailing_zeros_only);
974 Gparameter a1_removed(a1.begin()+1,a1.end());
975 Gparameter a2_removed(a2.begin()+1,a2.end());
980 a01.push_back( a1[0] );
981 a02.push_back( a2[0] );
983 return shuffle_G(a01, a1_removed, a2, pendint, a_old, scale, gsyms, flag_trailing_zeros_only)
984 + shuffle_G(a02, a1, a2_removed, pendint, a_old, scale, gsyms, flag_trailing_zeros_only);
987 // handles the transformations and the numerical evaluation of G
988 // the parameter x, s and y must only contain numerics
990 G_numeric(const std::vector<cln::cl_N>& x, const std::vector<int>& s,
993 // do acceleration transformation (hoelder convolution [BBB])
994 // the parameter x, s and y must only contain numerics
996 G_do_hoelder(std::vector<cln::cl_N> x, /* yes, it's passed by value */
997 const std::vector<int>& s, const cln::cl_N& y)
1000 const std::size_t size = x.size();
1001 for (std::size_t i = 0; i < size; ++i)
1004 for (std::size_t r = 0; r <= size; ++r) {
1005 cln::cl_N buffer(1 & r ? -1 : 1);
1010 for (std::size_t i = 0; i < size; ++i) {
1011 if (x[i] == cln::cl_RA(1)/p) {
1012 p = p/2 + cln::cl_RA(3)/2;
1018 cln::cl_RA q = p/(p-1);
1019 std::vector<cln::cl_N> qlstx;
1020 std::vector<int> qlsts;
1021 for (std::size_t j = r; j >= 1; --j) {
1022 qlstx.push_back(cln::cl_N(1) - x[j-1]);
1023 if (instanceof(x[j-1], cln::cl_R_ring) && realpart(x[j-1]) > 1) {
1026 qlsts.push_back(-s[j-1]);
1029 if (qlstx.size() > 0) {
1030 buffer = buffer*G_numeric(qlstx, qlsts, 1/q);
1032 std::vector<cln::cl_N> plstx;
1033 std::vector<int> plsts;
1034 for (std::size_t j = r+1; j <= size; ++j) {
1035 plstx.push_back(x[j-1]);
1036 plsts.push_back(s[j-1]);
1038 if (plstx.size() > 0) {
1039 buffer = buffer*G_numeric(plstx, plsts, 1/p);
1041 result = result + buffer;
1046 class less_object_for_cl_N
1049 bool operator() (const cln::cl_N & a, const cln::cl_N & b) const
1052 if (abs(a) != abs(b))
1053 return (abs(a) < abs(b)) ? true : false;
1056 if (phase(a) != phase(b))
1057 return (phase(a) < phase(b)) ? true : false;
1059 // equal, therefore "less" is not true
1065 // convergence transformation, used for numerical evaluation of G function.
1066 // the parameter x, s and y must only contain numerics
1068 G_do_trafo(const std::vector<cln::cl_N>& x, const std::vector<int>& s,
1069 const cln::cl_N& y, bool flag_trailing_zeros_only)
1071 // sort (|x|<->position) to determine indices
1072 typedef std::multimap<cln::cl_N, std::size_t, less_object_for_cl_N> sortmap_t;
1074 std::size_t size = 0;
1075 for (std::size_t i = 0; i < x.size(); ++i) {
1077 sortmap.insert(std::make_pair(x[i], i));
1081 // include upper limit (scale)
1082 sortmap.insert(std::make_pair(y, x.size()));
1084 // generate missing dummy-symbols
1086 // holding dummy-symbols for the G/Li transformations
1088 gsyms.push_back(symbol("GSYMS_ERROR"));
1089 cln::cl_N lastentry(0);
1090 for (sortmap_t::const_iterator it = sortmap.begin(); it != sortmap.end(); ++it) {
1091 if (it != sortmap.begin()) {
1092 if (it->second < x.size()) {
1093 if (x[it->second] == lastentry) {
1094 gsyms.push_back(gsyms.back());
1098 if (y == lastentry) {
1099 gsyms.push_back(gsyms.back());
1104 std::ostringstream os;
1106 gsyms.push_back(symbol(os.str()));
1108 if (it->second < x.size()) {
1109 lastentry = x[it->second];
1115 // fill position data according to sorted indices and prepare substitution list
1116 Gparameter a(x.size());
1118 std::size_t pos = 1;
1120 for (sortmap_t::const_iterator it = sortmap.begin(); it != sortmap.end(); ++it) {
1121 if (it->second < x.size()) {
1122 if (s[it->second] > 0) {
1123 a[it->second] = pos;
1125 a[it->second] = -int(pos);
1127 subslst[gsyms[pos]] = numeric(x[it->second]);
1130 subslst[gsyms[pos]] = numeric(y);
1135 // do transformation
1137 ex result = G_transform(pendint, a, scale, gsyms, flag_trailing_zeros_only);
1138 // replace dummy symbols with their values
1139 result = result.eval().expand();
1140 result = result.subs(subslst).evalf();
1141 if (!is_a<numeric>(result))
1142 throw std::logic_error("G_do_trafo: G_transform returned non-numeric result");
1144 cln::cl_N ret = ex_to<numeric>(result).to_cl_N();
1148 // handles the transformations and the numerical evaluation of G
1149 // the parameter x, s and y must only contain numerics
1151 G_numeric(const std::vector<cln::cl_N>& x, const std::vector<int>& s,
1154 // check for convergence and necessary accelerations
1155 bool need_trafo = false;
1156 bool need_hoelder = false;
1157 bool have_trailing_zero = false;
1158 std::size_t depth = 0;
1159 for (std::size_t i = 0; i < x.size(); ++i) {
1162 const cln::cl_N x_y = abs(x[i]) - y;
1163 if (instanceof(x_y, cln::cl_R_ring) &&
1164 realpart(x_y) < cln::least_negative_float(cln::float_format(Digits - 2)))
1167 if (abs(abs(x[i]/y) - 1) < 0.01)
1168 need_hoelder = true;
1171 if (zerop(x.back())) {
1172 have_trailing_zero = true;
1176 if (depth == 1 && x.size() == 2 && !need_trafo)
1177 return - Li_projection(2, y/x[1], cln::float_format(Digits));
1179 // do acceleration transformation (hoelder convolution [BBB])
1180 if (need_hoelder && !have_trailing_zero)
1181 return G_do_hoelder(x, s, y);
1183 // convergence transformation
1185 return G_do_trafo(x, s, y, have_trailing_zero);
1188 std::vector<cln::cl_N> newx;
1189 newx.reserve(x.size());
1191 m.reserve(x.size());
1194 cln::cl_N factor = y;
1195 for (std::size_t i = 0; i < x.size(); ++i) {
1199 newx.push_back(factor/x[i]);
1201 m.push_back(mcount);
1207 return sign*multipleLi_do_sum(m, newx);
1211 ex mLi_numeric(const lst& m, const lst& x)
1213 // let G_numeric do the transformation
1214 std::vector<cln::cl_N> newx;
1215 newx.reserve(x.nops());
1217 s.reserve(x.nops());
1218 cln::cl_N factor(1);
1219 for (lst::const_iterator itm = m.begin(), itx = x.begin(); itm != m.end(); ++itm, ++itx) {
1220 for (int i = 1; i < *itm; ++i) {
1221 newx.push_back(cln::cl_N(0));
1224 const cln::cl_N xi = ex_to<numeric>(*itx).to_cl_N();
1226 newx.push_back(factor);
1227 if ( !instanceof(factor, cln::cl_R_ring) && imagpart(factor) < 0 ) {
1234 return numeric(cln::cl_N(1 & m.nops() ? - 1 : 1)*G_numeric(newx, s, cln::cl_N(1)));
1238 } // end of anonymous namespace
1241 //////////////////////////////////////////////////////////////////////
1243 // Generalized multiple polylogarithm G(x, y) and G(x, s, y)
1247 //////////////////////////////////////////////////////////////////////
1250 static ex G2_evalf(const ex& x_, const ex& y)
1252 if ((!y.info(info_flags::numeric)) || (!y.info(info_flags::positive))) {
1253 return G(x_, y).hold();
1255 lst x = is_a<lst>(x_) ? ex_to<lst>(x_) : lst(x_);
1256 if (x.nops() == 0) {
1260 return G(x_, y).hold();
1263 s.reserve(x.nops());
1264 bool all_zero = true;
1265 for (lst::const_iterator it = x.begin(); it != x.end(); ++it) {
1266 if (!(*it).info(info_flags::numeric)) {
1267 return G(x_, y).hold();
1272 if ( !ex_to<numeric>(*it).is_real() && ex_to<numeric>(*it).imag() < 0 ) {
1280 return pow(log(y), x.nops()) / factorial(x.nops());
1282 std::vector<cln::cl_N> xv;
1283 xv.reserve(x.nops());
1284 for (lst::const_iterator it = x.begin(); it != x.end(); ++it)
1285 xv.push_back(ex_to<numeric>(*it).to_cl_N());
1286 cln::cl_N result = G_numeric(xv, s, ex_to<numeric>(y).to_cl_N());
1287 return numeric(result);
1291 static ex G2_eval(const ex& x_, const ex& y)
1293 //TODO eval to MZV or H or S or Lin
1295 if ((!y.info(info_flags::numeric)) || (!y.info(info_flags::positive))) {
1296 return G(x_, y).hold();
1298 lst x = is_a<lst>(x_) ? ex_to<lst>(x_) : lst(x_);
1299 if (x.nops() == 0) {
1303 return G(x_, y).hold();
1306 s.reserve(x.nops());
1307 bool all_zero = true;
1308 bool crational = true;
1309 for (lst::const_iterator it = x.begin(); it != x.end(); ++it) {
1310 if (!(*it).info(info_flags::numeric)) {
1311 return G(x_, y).hold();
1313 if (!(*it).info(info_flags::crational)) {
1319 if ( !ex_to<numeric>(*it).is_real() && ex_to<numeric>(*it).imag() < 0 ) {
1327 return pow(log(y), x.nops()) / factorial(x.nops());
1329 if (!y.info(info_flags::crational)) {
1333 return G(x_, y).hold();
1335 std::vector<cln::cl_N> xv;
1336 xv.reserve(x.nops());
1337 for (lst::const_iterator it = x.begin(); it != x.end(); ++it)
1338 xv.push_back(ex_to<numeric>(*it).to_cl_N());
1339 cln::cl_N result = G_numeric(xv, s, ex_to<numeric>(y).to_cl_N());
1340 return numeric(result);
1344 // option do_not_evalf_params() removed.
1345 unsigned G2_SERIAL::serial = function::register_new(function_options("G", 2).
1346 evalf_func(G2_evalf).
1350 // derivative_func(G2_deriv).
1351 // print_func<print_latex>(G2_print_latex).
1354 static ex G3_evalf(const ex& x_, const ex& s_, const ex& y)
1356 if ((!y.info(info_flags::numeric)) || (!y.info(info_flags::positive))) {
1357 return G(x_, s_, y).hold();
1359 lst x = is_a<lst>(x_) ? ex_to<lst>(x_) : lst(x_);
1360 lst s = is_a<lst>(s_) ? ex_to<lst>(s_) : lst(s_);
1361 if (x.nops() != s.nops()) {
1362 return G(x_, s_, y).hold();
1364 if (x.nops() == 0) {
1368 return G(x_, s_, y).hold();
1370 std::vector<int> sn;
1371 sn.reserve(s.nops());
1372 bool all_zero = true;
1373 for (lst::const_iterator itx = x.begin(), its = s.begin(); itx != x.end(); ++itx, ++its) {
1374 if (!(*itx).info(info_flags::numeric)) {
1375 return G(x_, y).hold();
1377 if (!(*its).info(info_flags::real)) {
1378 return G(x_, y).hold();
1383 if ( ex_to<numeric>(*itx).is_real() ) {
1384 if ( ex_to<numeric>(*itx).is_positive() ) {
1396 if ( ex_to<numeric>(*itx).imag() > 0 ) {
1405 return pow(log(y), x.nops()) / factorial(x.nops());
1407 std::vector<cln::cl_N> xn;
1408 xn.reserve(x.nops());
1409 for (lst::const_iterator it = x.begin(); it != x.end(); ++it)
1410 xn.push_back(ex_to<numeric>(*it).to_cl_N());
1411 cln::cl_N result = G_numeric(xn, sn, ex_to<numeric>(y).to_cl_N());
1412 return numeric(result);
1416 static ex G3_eval(const ex& x_, const ex& s_, const ex& y)
1418 //TODO eval to MZV or H or S or Lin
1420 if ((!y.info(info_flags::numeric)) || (!y.info(info_flags::positive))) {
1421 return G(x_, s_, y).hold();
1423 lst x = is_a<lst>(x_) ? ex_to<lst>(x_) : lst(x_);
1424 lst s = is_a<lst>(s_) ? ex_to<lst>(s_) : lst(s_);
1425 if (x.nops() != s.nops()) {
1426 return G(x_, s_, y).hold();
1428 if (x.nops() == 0) {
1432 return G(x_, s_, y).hold();
1434 std::vector<int> sn;
1435 sn.reserve(s.nops());
1436 bool all_zero = true;
1437 bool crational = true;
1438 for (lst::const_iterator itx = x.begin(), its = s.begin(); itx != x.end(); ++itx, ++its) {
1439 if (!(*itx).info(info_flags::numeric)) {
1440 return G(x_, s_, y).hold();
1442 if (!(*its).info(info_flags::real)) {
1443 return G(x_, s_, y).hold();
1445 if (!(*itx).info(info_flags::crational)) {
1451 if ( ex_to<numeric>(*itx).is_real() ) {
1452 if ( ex_to<numeric>(*itx).is_positive() ) {
1464 if ( ex_to<numeric>(*itx).imag() > 0 ) {
1473 return pow(log(y), x.nops()) / factorial(x.nops());
1475 if (!y.info(info_flags::crational)) {
1479 return G(x_, s_, y).hold();
1481 std::vector<cln::cl_N> xn;
1482 xn.reserve(x.nops());
1483 for (lst::const_iterator it = x.begin(); it != x.end(); ++it)
1484 xn.push_back(ex_to<numeric>(*it).to_cl_N());
1485 cln::cl_N result = G_numeric(xn, sn, ex_to<numeric>(y).to_cl_N());
1486 return numeric(result);
1490 // option do_not_evalf_params() removed.
1491 // This is safe: in the code above it only matters if s_ > 0 or s_ < 0,
1492 // s_ is allowed to be of floating type.
1493 unsigned G3_SERIAL::serial = function::register_new(function_options("G", 3).
1494 evalf_func(G3_evalf).
1498 // derivative_func(G3_deriv).
1499 // print_func<print_latex>(G3_print_latex).
1502 //////////////////////////////////////////////////////////////////////
1504 // Classical polylogarithm and multiple polylogarithm Li(m,x)
1508 //////////////////////////////////////////////////////////////////////
1511 static ex Li_evalf(const ex& m_, const ex& x_)
1513 // classical polylogs
1514 if (m_.info(info_flags::posint)) {
1515 if (x_.info(info_flags::numeric)) {
1516 int m__ = ex_to<numeric>(m_).to_int();
1517 const cln::cl_N x__ = ex_to<numeric>(x_).to_cl_N();
1518 const cln::cl_N result = Lin_numeric(m__, x__);
1519 return numeric(result);
1521 // try to numerically evaluate second argument
1522 ex x_val = x_.evalf();
1523 if (x_val.info(info_flags::numeric)) {
1524 int m__ = ex_to<numeric>(m_).to_int();
1525 const cln::cl_N x__ = ex_to<numeric>(x_val).to_cl_N();
1526 const cln::cl_N result = Lin_numeric(m__, x__);
1527 return numeric(result);
1531 // multiple polylogs
1532 if (is_a<lst>(m_) && is_a<lst>(x_)) {
1534 const lst& m = ex_to<lst>(m_);
1535 const lst& x = ex_to<lst>(x_);
1536 if (m.nops() != x.nops()) {
1537 return Li(m_,x_).hold();
1539 if (x.nops() == 0) {
1542 if ((m.op(0) == _ex1) && (x.op(0) == _ex1)) {
1543 return Li(m_,x_).hold();
1546 for (lst::const_iterator itm = m.begin(), itx = x.begin(); itm != m.end(); ++itm, ++itx) {
1547 if (!(*itm).info(info_flags::posint)) {
1548 return Li(m_, x_).hold();
1550 if (!(*itx).info(info_flags::numeric)) {
1551 return Li(m_, x_).hold();
1558 return mLi_numeric(m, x);
1561 return Li(m_,x_).hold();
1565 static ex Li_eval(const ex& m_, const ex& x_)
1567 if (is_a<lst>(m_)) {
1568 if (is_a<lst>(x_)) {
1569 // multiple polylogs
1570 const lst& m = ex_to<lst>(m_);
1571 const lst& x = ex_to<lst>(x_);
1572 if (m.nops() != x.nops()) {
1573 return Li(m_,x_).hold();
1575 if (x.nops() == 0) {
1579 bool is_zeta = true;
1580 bool do_evalf = true;
1581 bool crational = true;
1582 for (lst::const_iterator itm = m.begin(), itx = x.begin(); itm != m.end(); ++itm, ++itx) {
1583 if (!(*itm).info(info_flags::posint)) {
1584 return Li(m_,x_).hold();
1586 if ((*itx != _ex1) && (*itx != _ex_1)) {
1587 if (itx != x.begin()) {
1595 if (!(*itx).info(info_flags::numeric)) {
1598 if (!(*itx).info(info_flags::crational)) {
1604 for (lst::const_iterator itx = x.begin(); itx != x.end(); ++itx) {
1605 GINAC_ASSERT((*itx == _ex1) || (*itx == _ex_1));
1606 // XXX: 1 + 0.0*I is considered equal to 1. However
1607 // the former is a not automatically converted
1608 // to a real number. Do the conversion explicitly
1609 // to avoid the "numeric::operator>(): complex inequality"
1610 // exception (and similar problems).
1611 newx.append(*itx != _ex_1 ? _ex1 : _ex_1);
1613 return zeta(m_, newx);
1617 lst newm = convert_parameter_Li_to_H(m, x, prefactor);
1618 return prefactor * H(newm, x[0]);
1620 if (do_evalf && !crational) {
1621 return mLi_numeric(m,x);
1624 return Li(m_, x_).hold();
1625 } else if (is_a<lst>(x_)) {
1626 return Li(m_, x_).hold();
1629 // classical polylogs
1637 return (pow(2,1-m_)-1) * zeta(m_);
1643 if (x_.is_equal(I)) {
1644 return power(Pi,_ex2)/_ex_48 + Catalan*I;
1646 if (x_.is_equal(-I)) {
1647 return power(Pi,_ex2)/_ex_48 - Catalan*I;
1650 if (m_.info(info_flags::posint) && x_.info(info_flags::numeric) && !x_.info(info_flags::crational)) {
1651 int m__ = ex_to<numeric>(m_).to_int();
1652 const cln::cl_N x__ = ex_to<numeric>(x_).to_cl_N();
1653 const cln::cl_N result = Lin_numeric(m__, x__);
1654 return numeric(result);
1657 return Li(m_, x_).hold();
1661 static ex Li_series(const ex& m, const ex& x, const relational& rel, int order, unsigned options)
1663 if (is_a<lst>(m) || is_a<lst>(x)) {
1666 seq.push_back(expair(Li(m, x), 0));
1667 return pseries(rel, seq);
1670 // classical polylog
1671 const ex x_pt = x.subs(rel, subs_options::no_pattern);
1672 if (m.info(info_flags::numeric) && x_pt.info(info_flags::numeric)) {
1673 // First special case: x==0 (derivatives have poles)
1674 if (x_pt.is_zero()) {
1677 // manually construct the primitive expansion
1678 for (int i=1; i<order; ++i)
1679 ser += pow(s,i) / pow(numeric(i), m);
1680 // substitute the argument's series expansion
1681 ser = ser.subs(s==x.series(rel, order), subs_options::no_pattern);
1682 // maybe that was terminating, so add a proper order term
1684 nseq.push_back(expair(Order(_ex1), order));
1685 ser += pseries(rel, nseq);
1686 // reexpanding it will collapse the series again
1687 return ser.series(rel, order);
1689 // TODO special cases: x==1 (branch point) and x real, >=1 (branch cut)
1690 throw std::runtime_error("Li_series: don't know how to do the series expansion at this point!");
1692 // all other cases should be safe, by now:
1693 throw do_taylor(); // caught by function::series()
1697 static ex Li_deriv(const ex& m_, const ex& x_, unsigned deriv_param)
1699 GINAC_ASSERT(deriv_param < 2);
1700 if (deriv_param == 0) {
1703 if (m_.nops() > 1) {
1704 throw std::runtime_error("don't know how to derivate multiple polylogarithm!");
1707 if (is_a<lst>(m_)) {
1713 if (is_a<lst>(x_)) {
1719 return Li(m-1, x) / x;
1726 static void Li_print_latex(const ex& m_, const ex& x_, const print_context& c)
1729 if (is_a<lst>(m_)) {
1735 if (is_a<lst>(x_)) {
1740 c.s << "\\mathrm{Li}_{";
1741 lst::const_iterator itm = m.begin();
1744 for (; itm != m.end(); itm++) {
1749 lst::const_iterator itx = x.begin();
1752 for (; itx != x.end(); itx++) {
1760 REGISTER_FUNCTION(Li,
1761 evalf_func(Li_evalf).
1763 series_func(Li_series).
1764 derivative_func(Li_deriv).
1765 print_func<print_latex>(Li_print_latex).
1766 do_not_evalf_params());
1769 //////////////////////////////////////////////////////////////////////
1771 // Nielsen's generalized polylogarithm S(n,p,x)
1775 //////////////////////////////////////////////////////////////////////
1778 // anonymous namespace for helper functions
1782 // lookup table for special Euler-Zagier-Sums (used for S_n,p(x))
1784 std::vector<std::vector<cln::cl_N> > Yn;
1785 int ynsize = 0; // number of Yn[]
1786 int ynlength = 100; // initial length of all Yn[i]
1789 // This function calculates the Y_n. The Y_n are needed for the evaluation of S_{n,p}(x).
1790 // The Y_n are basically Euler-Zagier sums with all m_i=1. They are subsums in the Z-sum
1791 // representing S_{n,p}(x).
1792 // The first index in Y_n corresponds to the parameter p minus one, i.e. the depth of the
1793 // equivalent Z-sum.
1794 // The second index in Y_n corresponds to the running index of the outermost sum in the full Z-sum
1795 // representing S_{n,p}(x).
1796 // The calculation of Y_n uses the values from Y_{n-1}.
1797 void fill_Yn(int n, const cln::float_format_t& prec)
1799 const int initsize = ynlength;
1800 //const int initsize = initsize_Yn;
1801 cln::cl_N one = cln::cl_float(1, prec);
1804 std::vector<cln::cl_N> buf(initsize);
1805 std::vector<cln::cl_N>::iterator it = buf.begin();
1806 std::vector<cln::cl_N>::iterator itprev = Yn[n-1].begin();
1807 *it = (*itprev) / cln::cl_N(n+1) * one;
1810 // sums with an index smaller than the depth are zero and need not to be calculated.
1811 // calculation starts with depth, which is n+2)
1812 for (int i=n+2; i<=initsize+n; i++) {
1813 *it = *(it-1) + (*itprev) / cln::cl_N(i) * one;
1819 std::vector<cln::cl_N> buf(initsize);
1820 std::vector<cln::cl_N>::iterator it = buf.begin();
1823 for (int i=2; i<=initsize; i++) {
1824 *it = *(it-1) + 1 / cln::cl_N(i) * one;
1833 // make Yn longer ...
1834 void make_Yn_longer(int newsize, const cln::float_format_t& prec)
1837 cln::cl_N one = cln::cl_float(1, prec);
1839 Yn[0].resize(newsize);
1840 std::vector<cln::cl_N>::iterator it = Yn[0].begin();
1842 for (int i=ynlength+1; i<=newsize; i++) {
1843 *it = *(it-1) + 1 / cln::cl_N(i) * one;
1847 for (int n=1; n<ynsize; n++) {
1848 Yn[n].resize(newsize);
1849 std::vector<cln::cl_N>::iterator it = Yn[n].begin();
1850 std::vector<cln::cl_N>::iterator itprev = Yn[n-1].begin();
1853 for (int i=ynlength+n+1; i<=newsize+n; i++) {
1854 *it = *(it-1) + (*itprev) / cln::cl_N(i) * one;
1864 // helper function for S(n,p,x)
1866 cln::cl_N C(int n, int p)
1870 for (int k=0; k<p; k++) {
1871 for (int j=0; j<=(n+k-1)/2; j++) {
1875 result = result - 2 * cln::expt(cln::pi(),2*j) * S_num(n-2*j,p,1) / cln::factorial(2*j);
1878 result = result + 2 * cln::expt(cln::pi(),2*j) * S_num(n-2*j,p,1) / cln::factorial(2*j);
1885 result = result + cln::factorial(n+k-1)
1886 * cln::expt(cln::pi(),2*j) * S_num(n+k-2*j,p-k,1)
1887 / (cln::factorial(k) * cln::factorial(n-1) * cln::factorial(2*j));
1890 result = result - cln::factorial(n+k-1)
1891 * cln::expt(cln::pi(),2*j) * S_num(n+k-2*j,p-k,1)
1892 / (cln::factorial(k) * cln::factorial(n-1) * cln::factorial(2*j));
1897 result = result - cln::factorial(n+k-1) * cln::expt(cln::pi(),2*j) * S_num(n+k-2*j,p-k,1)
1898 / (cln::factorial(k) * cln::factorial(n-1) * cln::factorial(2*j));
1901 result = result + cln::factorial(n+k-1)
1902 * cln::expt(cln::pi(),2*j) * S_num(n+k-2*j,p-k,1)
1903 / (cln::factorial(k) * cln::factorial(n-1) * cln::factorial(2*j));
1911 if (((np)/2+n) & 1) {
1912 result = -result - cln::expt(cln::pi(),np) / (np * cln::factorial(n-1) * cln::factorial(p));
1915 result = -result + cln::expt(cln::pi(),np) / (np * cln::factorial(n-1) * cln::factorial(p));
1923 // helper function for S(n,p,x)
1924 // [Kol] remark to (9.1)
1925 cln::cl_N a_k(int k)
1934 for (int m=2; m<=k; m++) {
1935 result = result + cln::expt(cln::cl_N(-1),m) * cln::zeta(m) * a_k(k-m);
1942 // helper function for S(n,p,x)
1943 // [Kol] remark to (9.1)
1944 cln::cl_N b_k(int k)
1953 for (int m=2; m<=k; m++) {
1954 result = result + cln::expt(cln::cl_N(-1),m) * cln::zeta(m) * b_k(k-m);
1961 // helper function for S(n,p,x)
1962 cln::cl_N S_do_sum(int n, int p, const cln::cl_N& x, const cln::float_format_t& prec)
1964 static cln::float_format_t oldprec = cln::default_float_format;
1967 return Li_projection(n+1, x, prec);
1970 // precision has changed, we need to clear lookup table Yn
1971 if ( oldprec != prec ) {
1978 // check if precalculated values are sufficient
1980 for (int i=ynsize; i<p-1; i++) {
1985 // should be done otherwise
1986 cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
1987 cln::cl_N xf = x * one;
1988 //cln::cl_N xf = x * cln::cl_float(1, prec);
1992 cln::cl_N factor = cln::expt(xf, p);
1996 if (i-p >= ynlength) {
1998 make_Yn_longer(ynlength*2, prec);
2000 res = res + factor / cln::expt(cln::cl_I(i),n+1) * Yn[p-2][i-p]; // should we check it? or rely on magic number? ...
2001 //res = res + factor / cln::expt(cln::cl_I(i),n+1) * (*it); // should we check it? or rely on magic number? ...
2002 factor = factor * xf;
2004 } while (res != resbuf);
2010 // helper function for S(n,p,x)
2011 cln::cl_N S_projection(int n, int p, const cln::cl_N& x, const cln::float_format_t& prec)
2014 if (cln::abs(cln::realpart(x)) > cln::cl_F("0.5")) {
2016 cln::cl_N result = cln::expt(cln::cl_I(-1),p) * cln::expt(cln::log(x),n)
2017 * cln::expt(cln::log(1-x),p) / cln::factorial(n) / cln::factorial(p);
2019 for (int s=0; s<n; s++) {
2021 for (int r=0; r<p; r++) {
2022 res2 = res2 + cln::expt(cln::cl_I(-1),r) * cln::expt(cln::log(1-x),r)
2023 * S_do_sum(p-r,n-s,1-x,prec) / cln::factorial(r);
2025 result = result + cln::expt(cln::log(x),s) * (S_num(n-s,p,1) - res2) / cln::factorial(s);
2031 return S_do_sum(n, p, x, prec);
2035 // helper function for S(n,p,x)
2036 const cln::cl_N S_num(int n, int p, const cln::cl_N& x)
2040 // [Kol] (2.22) with (2.21)
2041 return cln::zeta(p+1);
2046 return cln::zeta(n+1);
2051 for (int nu=0; nu<n; nu++) {
2052 for (int rho=0; rho<=p; rho++) {
2053 result = result + b_k(n-nu-1) * b_k(p-rho) * a_k(nu+rho+1)
2054 * cln::factorial(nu+rho+1) / cln::factorial(rho) / cln::factorial(nu+1);
2057 result = result * cln::expt(cln::cl_I(-1),n+p-1);
2064 return -(1-cln::expt(cln::cl_I(2),-n)) * cln::zeta(n+1);
2066 // throw std::runtime_error("don't know how to evaluate this function!");
2069 // what is the desired float format?
2070 // first guess: default format
2071 cln::float_format_t prec = cln::default_float_format;
2072 const cln::cl_N value = x;
2073 // second guess: the argument's format
2074 if (!instanceof(realpart(value), cln::cl_RA_ring))
2075 prec = cln::float_format(cln::the<cln::cl_F>(cln::realpart(value)));
2076 else if (!instanceof(imagpart(value), cln::cl_RA_ring))
2077 prec = cln::float_format(cln::the<cln::cl_F>(cln::imagpart(value)));
2080 // the condition abs(1-value)>1 avoids an infinite recursion in the region abs(value)<=1 && abs(value)>0.95 && abs(1-value)<=1 && abs(1-value)>0.95
2081 // we don't care here about abs(value)<1 && real(value)>0.5, this will be taken care of in S_projection
2082 if ((cln::realpart(value) < -0.5) || (n == 0) || ((cln::abs(value) <= 1) && (cln::abs(value) > 0.95) && (cln::abs(1-value) > 1) )) {
2084 cln::cl_N result = cln::expt(cln::cl_I(-1),p) * cln::expt(cln::log(value),n)
2085 * cln::expt(cln::log(1-value),p) / cln::factorial(n) / cln::factorial(p);
2087 for (int s=0; s<n; s++) {
2089 for (int r=0; r<p; r++) {
2090 res2 = res2 + cln::expt(cln::cl_I(-1),r) * cln::expt(cln::log(1-value),r)
2091 * S_num(p-r,n-s,1-value) / cln::factorial(r);
2093 result = result + cln::expt(cln::log(value),s) * (S_num(n-s,p,1) - res2) / cln::factorial(s);
2100 if (cln::abs(value) > 1) {
2104 for (int s=0; s<p; s++) {
2105 for (int r=0; r<=s; r++) {
2106 result = result + cln::expt(cln::cl_I(-1),s) * cln::expt(cln::log(-value),r) * cln::factorial(n+s-r-1)
2107 / cln::factorial(r) / cln::factorial(s-r) / cln::factorial(n-1)
2108 * S_num(n+s-r,p-s,cln::recip(value));
2111 result = result * cln::expt(cln::cl_I(-1),n);
2114 for (int r=0; r<n; r++) {
2115 res2 = res2 + cln::expt(cln::log(-value),r) * C(n-r,p) / cln::factorial(r);
2117 res2 = res2 + cln::expt(cln::log(-value),n+p) / cln::factorial(n+p);
2119 result = result + cln::expt(cln::cl_I(-1),p) * res2;
2124 if ((cln::abs(value) > 0.95) && (cln::abs(value-9.53) < 9.47)) {
2127 for (int s=0; s<p-1; s++)
2130 ex res = H(m,numeric(value)).evalf();
2131 return ex_to<numeric>(res).to_cl_N();
2134 return S_projection(n, p, value, prec);
2139 } // end of anonymous namespace
2142 //////////////////////////////////////////////////////////////////////
2144 // Nielsen's generalized polylogarithm S(n,p,x)
2148 //////////////////////////////////////////////////////////////////////
2151 static ex S_evalf(const ex& n, const ex& p, const ex& x)
2153 if (n.info(info_flags::posint) && p.info(info_flags::posint)) {
2154 const int n_ = ex_to<numeric>(n).to_int();
2155 const int p_ = ex_to<numeric>(p).to_int();
2156 if (is_a<numeric>(x)) {
2157 const cln::cl_N x_ = ex_to<numeric>(x).to_cl_N();
2158 const cln::cl_N result = S_num(n_, p_, x_);
2159 return numeric(result);
2161 ex x_val = x.evalf();
2162 if (is_a<numeric>(x_val)) {
2163 const cln::cl_N x_val_ = ex_to<numeric>(x_val).to_cl_N();
2164 const cln::cl_N result = S_num(n_, p_, x_val_);
2165 return numeric(result);
2169 return S(n, p, x).hold();
2173 static ex S_eval(const ex& n, const ex& p, const ex& x)
2175 if (n.info(info_flags::posint) && p.info(info_flags::posint)) {
2181 for (int i=ex_to<numeric>(p).to_int()-1; i>0; i--) {
2189 if (x.info(info_flags::numeric) && (!x.info(info_flags::crational))) {
2190 int n_ = ex_to<numeric>(n).to_int();
2191 int p_ = ex_to<numeric>(p).to_int();
2192 const cln::cl_N x_ = ex_to<numeric>(x).to_cl_N();
2193 const cln::cl_N result = S_num(n_, p_, x_);
2194 return numeric(result);
2199 return pow(-log(1-x), p) / factorial(p);
2201 return S(n, p, x).hold();
2205 static ex S_series(const ex& n, const ex& p, const ex& x, const relational& rel, int order, unsigned options)
2208 return Li(n+1, x).series(rel, order, options);
2211 const ex x_pt = x.subs(rel, subs_options::no_pattern);
2212 if (n.info(info_flags::posint) && p.info(info_flags::posint) && x_pt.info(info_flags::numeric)) {
2213 // First special case: x==0 (derivatives have poles)
2214 if (x_pt.is_zero()) {
2217 // manually construct the primitive expansion
2218 // subsum = Euler-Zagier-Sum is needed
2219 // dirty hack (slow ...) calculation of subsum:
2220 std::vector<ex> presubsum, subsum;
2221 subsum.push_back(0);
2222 for (int i=1; i<order-1; ++i) {
2223 subsum.push_back(subsum[i-1] + numeric(1, i));
2225 for (int depth=2; depth<p; ++depth) {
2227 for (int i=1; i<order-1; ++i) {
2228 subsum[i] = subsum[i-1] + numeric(1, i) * presubsum[i-1];
2232 for (int i=1; i<order; ++i) {
2233 ser += pow(s,i) / pow(numeric(i), n+1) * subsum[i-1];
2235 // substitute the argument's series expansion
2236 ser = ser.subs(s==x.series(rel, order), subs_options::no_pattern);
2237 // maybe that was terminating, so add a proper order term
2239 nseq.push_back(expair(Order(_ex1), order));
2240 ser += pseries(rel, nseq);
2241 // reexpanding it will collapse the series again
2242 return ser.series(rel, order);
2244 // TODO special cases: x==1 (branch point) and x real, >=1 (branch cut)
2245 throw std::runtime_error("S_series: don't know how to do the series expansion at this point!");
2247 // all other cases should be safe, by now:
2248 throw do_taylor(); // caught by function::series()
2252 static ex S_deriv(const ex& n, const ex& p, const ex& x, unsigned deriv_param)
2254 GINAC_ASSERT(deriv_param < 3);
2255 if (deriv_param < 2) {
2259 return S(n-1, p, x) / x;
2261 return S(n, p-1, x) / (1-x);
2266 static void S_print_latex(const ex& n, const ex& p, const ex& x, const print_context& c)
2268 c.s << "\\mathrm{S}_{";
2278 REGISTER_FUNCTION(S,
2279 evalf_func(S_evalf).
2281 series_func(S_series).
2282 derivative_func(S_deriv).
2283 print_func<print_latex>(S_print_latex).
2284 do_not_evalf_params());
2287 //////////////////////////////////////////////////////////////////////
2289 // Harmonic polylogarithm H(m,x)
2293 //////////////////////////////////////////////////////////////////////
2296 // anonymous namespace for helper functions
2300 // regulates the pole (used by 1/x-transformation)
2301 symbol H_polesign("IMSIGN");
2304 // convert parameters from H to Li representation
2305 // parameters are expected to be in expanded form, i.e. only 0, 1 and -1
2306 // returns true if some parameters are negative
2307 bool convert_parameter_H_to_Li(const lst& l, lst& m, lst& s, ex& pf)
2309 // expand parameter list
2311 for (lst::const_iterator it = l.begin(); it != l.end(); it++) {
2313 for (ex count=*it-1; count > 0; count--) {
2317 } else if (*it < -1) {
2318 for (ex count=*it+1; count < 0; count++) {
2329 bool has_negative_parameters = false;
2331 for (lst::const_iterator it = mexp.begin(); it != mexp.end(); it++) {
2337 m.append((*it+acc-1) * signum);
2339 m.append((*it-acc+1) * signum);
2345 has_negative_parameters = true;
2348 if (has_negative_parameters) {
2349 for (std::size_t i=0; i<m.nops(); i++) {
2351 m.let_op(i) = -m.op(i);
2359 return has_negative_parameters;
2363 // recursivly transforms H to corresponding multiple polylogarithms
2364 struct map_trafo_H_convert_to_Li : public map_function
2366 ex operator()(const ex& e)
2368 if (is_a<add>(e) || is_a<mul>(e)) {
2369 return e.map(*this);
2371 if (is_a<function>(e)) {
2372 std::string name = ex_to<function>(e).get_name();
2375 if (is_a<lst>(e.op(0))) {
2376 parameter = ex_to<lst>(e.op(0));
2378 parameter = lst(e.op(0));
2385 if (convert_parameter_H_to_Li(parameter, m, s, pf)) {
2386 s.let_op(0) = s.op(0) * arg;
2387 return pf * Li(m, s).hold();
2389 for (std::size_t i=0; i<m.nops(); i++) {
2392 s.let_op(0) = s.op(0) * arg;
2393 return Li(m, s).hold();
2402 // recursivly transforms H to corresponding zetas
2403 struct map_trafo_H_convert_to_zeta : public map_function
2405 ex operator()(const ex& e)
2407 if (is_a<add>(e) || is_a<mul>(e)) {
2408 return e.map(*this);
2410 if (is_a<function>(e)) {
2411 std::string name = ex_to<function>(e).get_name();
2414 if (is_a<lst>(e.op(0))) {
2415 parameter = ex_to<lst>(e.op(0));
2417 parameter = lst(e.op(0));
2423 if (convert_parameter_H_to_Li(parameter, m, s, pf)) {
2424 return pf * zeta(m, s);
2435 // remove trailing zeros from H-parameters
2436 struct map_trafo_H_reduce_trailing_zeros : public map_function
2438 ex operator()(const ex& e)
2440 if (is_a<add>(e) || is_a<mul>(e)) {
2441 return e.map(*this);
2443 if (is_a<function>(e)) {
2444 std::string name = ex_to<function>(e).get_name();
2447 if (is_a<lst>(e.op(0))) {
2448 parameter = ex_to<lst>(e.op(0));
2450 parameter = lst(e.op(0));
2453 if (parameter.op(parameter.nops()-1) == 0) {
2456 if (parameter.nops() == 1) {
2461 lst::const_iterator it = parameter.begin();
2462 while ((it != parameter.end()) && (*it == 0)) {
2465 if (it == parameter.end()) {
2466 return pow(log(arg),parameter.nops()) / factorial(parameter.nops());
2470 parameter.remove_last();
2471 std::size_t lastentry = parameter.nops();
2472 while ((lastentry > 0) && (parameter[lastentry-1] == 0)) {
2477 ex result = log(arg) * H(parameter,arg).hold();
2479 for (ex i=0; i<lastentry; i++) {
2480 if (parameter[i] > 0) {
2482 result -= (acc + parameter[i]-1) * H(parameter, arg).hold();
2485 } else if (parameter[i] < 0) {
2487 result -= (acc + abs(parameter[i]+1)) * H(parameter, arg).hold();
2495 if (lastentry < parameter.nops()) {
2496 result = result / (parameter.nops()-lastentry+1);
2497 return result.map(*this);
2509 // returns an expression with zeta functions corresponding to the parameter list for H
2510 ex convert_H_to_zeta(const lst& m)
2512 symbol xtemp("xtemp");
2513 map_trafo_H_reduce_trailing_zeros filter;
2514 map_trafo_H_convert_to_zeta filter2;
2515 return filter2(filter(H(m, xtemp).hold())).subs(xtemp == 1);
2519 // convert signs form Li to H representation
2520 lst convert_parameter_Li_to_H(const lst& m, const lst& x, ex& pf)
2523 lst::const_iterator itm = m.begin();
2524 lst::const_iterator itx = ++x.begin();
2529 while (itx != x.end()) {
2530 GINAC_ASSERT((*itx == _ex1) || (*itx == _ex_1));
2531 // XXX: 1 + 0.0*I is considered equal to 1. However the former
2532 // is not automatically converted to a real number.
2533 // Do the conversion explicitly to avoid the
2534 // "numeric::operator>(): complex inequality" exception.
2535 signum *= (*itx != _ex_1) ? 1 : -1;
2537 res.append((*itm) * signum);
2545 // multiplies an one-dimensional H with another H
2547 ex trafo_H_mult(const ex& h1, const ex& h2)
2552 ex h1nops = h1.op(0).nops();
2553 ex h2nops = h2.op(0).nops();
2555 hshort = h2.op(0).op(0);
2556 hlong = ex_to<lst>(h1.op(0));
2558 hshort = h1.op(0).op(0);
2560 hlong = ex_to<lst>(h2.op(0));
2562 hlong = h2.op(0).op(0);
2565 for (std::size_t i=0; i<=hlong.nops(); i++) {
2569 newparameter.append(hlong[j]);
2571 newparameter.append(hshort);
2572 for (; j<hlong.nops(); j++) {
2573 newparameter.append(hlong[j]);
2575 res += H(newparameter, h1.op(1)).hold();
2581 // applies trafo_H_mult recursively on expressions
2582 struct map_trafo_H_mult : public map_function
2584 ex operator()(const ex& e)
2587 return e.map(*this);
2595 for (std::size_t pos=0; pos<e.nops(); pos++) {
2596 if (is_a<power>(e.op(pos)) && is_a<function>(e.op(pos).op(0))) {
2597 std::string name = ex_to<function>(e.op(pos).op(0)).get_name();
2599 for (ex i=0; i<e.op(pos).op(1); i++) {
2600 Hlst.append(e.op(pos).op(0));
2604 } else if (is_a<function>(e.op(pos))) {
2605 std::string name = ex_to<function>(e.op(pos)).get_name();
2607 if (e.op(pos).op(0).nops() > 1) {
2610 Hlst.append(e.op(pos));
2615 result *= e.op(pos);
2618 if (Hlst.nops() > 0) {
2619 firstH = Hlst[Hlst.nops()-1];
2626 if (Hlst.nops() > 0) {
2627 ex buffer = trafo_H_mult(firstH, Hlst.op(0));
2629 for (std::size_t i=1; i<Hlst.nops(); i++) {
2630 result *= Hlst.op(i);
2632 result = result.expand();
2633 map_trafo_H_mult recursion;
2634 return recursion(result);
2645 // do integration [ReV] (55)
2646 // put parameter 0 in front of existing parameters
2647 ex trafo_H_1tx_prepend_zero(const ex& e, const ex& arg)
2651 if (is_a<function>(e)) {
2652 name = ex_to<function>(e).get_name();
2657 for (std::size_t i=0; i<e.nops(); i++) {
2658 if (is_a<function>(e.op(i))) {
2659 std::string name = ex_to<function>(e.op(i)).get_name();
2667 lst newparameter = ex_to<lst>(h.op(0));
2668 newparameter.prepend(0);
2669 ex addzeta = convert_H_to_zeta(newparameter);
2670 return e.subs(h == (addzeta-H(newparameter, h.op(1)).hold())).expand();
2672 return e * (-H(lst(ex(0)),1/arg).hold());
2677 // do integration [ReV] (49)
2678 // put parameter 1 in front of existing parameters
2679 ex trafo_H_prepend_one(const ex& e, const ex& arg)
2683 if (is_a<function>(e)) {
2684 name = ex_to<function>(e).get_name();
2689 for (std::size_t i=0; i<e.nops(); i++) {
2690 if (is_a<function>(e.op(i))) {
2691 std::string name = ex_to<function>(e.op(i)).get_name();
2699 lst newparameter = ex_to<lst>(h.op(0));
2700 newparameter.prepend(1);
2701 return e.subs(h == H(newparameter, h.op(1)).hold());
2703 return e * H(lst(ex(1)),1-arg).hold();
2708 // do integration [ReV] (55)
2709 // put parameter -1 in front of existing parameters
2710 ex trafo_H_1tx_prepend_minusone(const ex& e, const ex& arg)
2714 if (is_a<function>(e)) {
2715 name = ex_to<function>(e).get_name();
2720 for (std::size_t i=0; i<e.nops(); i++) {
2721 if (is_a<function>(e.op(i))) {
2722 std::string name = ex_to<function>(e.op(i)).get_name();
2730 lst newparameter = ex_to<lst>(h.op(0));
2731 newparameter.prepend(-1);
2732 ex addzeta = convert_H_to_zeta(newparameter);
2733 return e.subs(h == (addzeta-H(newparameter, h.op(1)).hold())).expand();
2735 ex addzeta = convert_H_to_zeta(lst(ex(-1)));
2736 return (e * (addzeta - H(lst(ex(-1)),1/arg).hold())).expand();
2741 // do integration [ReV] (55)
2742 // put parameter -1 in front of existing parameters
2743 ex trafo_H_1mxt1px_prepend_minusone(const ex& e, const ex& arg)
2747 if (is_a<function>(e)) {
2748 name = ex_to<function>(e).get_name();
2753 for (std::size_t i = 0; i < e.nops(); i++) {
2754 if (is_a<function>(e.op(i))) {
2755 std::string name = ex_to<function>(e.op(i)).get_name();
2763 lst newparameter = ex_to<lst>(h.op(0));
2764 newparameter.prepend(-1);
2765 return e.subs(h == H(newparameter, h.op(1)).hold()).expand();
2767 return (e * H(lst(ex(-1)),(1-arg)/(1+arg)).hold()).expand();
2772 // do integration [ReV] (55)
2773 // put parameter 1 in front of existing parameters
2774 ex trafo_H_1mxt1px_prepend_one(const ex& e, const ex& arg)
2778 if (is_a<function>(e)) {
2779 name = ex_to<function>(e).get_name();
2784 for (std::size_t i = 0; i < e.nops(); i++) {
2785 if (is_a<function>(e.op(i))) {
2786 std::string name = ex_to<function>(e.op(i)).get_name();
2794 lst newparameter = ex_to<lst>(h.op(0));
2795 newparameter.prepend(1);
2796 return e.subs(h == H(newparameter, h.op(1)).hold()).expand();
2798 return (e * H(lst(ex(1)),(1-arg)/(1+arg)).hold()).expand();
2803 // do x -> 1-x transformation
2804 struct map_trafo_H_1mx : public map_function
2806 ex operator()(const ex& e)
2808 if (is_a<add>(e) || is_a<mul>(e)) {
2809 return e.map(*this);
2812 if (is_a<function>(e)) {
2813 std::string name = ex_to<function>(e).get_name();
2816 lst parameter = ex_to<lst>(e.op(0));
2819 // special cases if all parameters are either 0, 1 or -1
2820 bool allthesame = true;
2821 if (parameter.op(0) == 0) {
2822 for (std::size_t i = 1; i < parameter.nops(); i++) {
2823 if (parameter.op(i) != 0) {
2830 for (int i=parameter.nops(); i>0; i--) {
2831 newparameter.append(1);
2833 return pow(-1, parameter.nops()) * H(newparameter, 1-arg).hold();
2835 } else if (parameter.op(0) == -1) {
2836 throw std::runtime_error("map_trafo_H_1mx: cannot handle weights equal -1!");
2838 for (std::size_t i = 1; i < parameter.nops(); i++) {
2839 if (parameter.op(i) != 1) {
2846 for (int i=parameter.nops(); i>0; i--) {
2847 newparameter.append(0);
2849 return pow(-1, parameter.nops()) * H(newparameter, 1-arg).hold();
2853 lst newparameter = parameter;
2854 newparameter.remove_first();
2856 if (parameter.op(0) == 0) {
2859 ex res = convert_H_to_zeta(parameter);
2860 //ex res = convert_from_RV(parameter, 1).subs(H(wild(1),wild(2))==zeta(wild(1)));
2861 map_trafo_H_1mx recursion;
2862 ex buffer = recursion(H(newparameter, arg).hold());
2863 if (is_a<add>(buffer)) {
2864 for (std::size_t i = 0; i < buffer.nops(); i++) {
2865 res -= trafo_H_prepend_one(buffer.op(i), arg);
2868 res -= trafo_H_prepend_one(buffer, arg);
2875 map_trafo_H_1mx recursion;
2876 map_trafo_H_mult unify;
2877 ex res = H(lst(ex(1)), arg).hold() * H(newparameter, arg).hold();
2878 std::size_t firstzero = 0;
2879 while (parameter.op(firstzero) == 1) {
2882 for (std::size_t i = firstzero-1; i < parameter.nops()-1; i++) {
2886 newparameter.append(parameter[j+1]);
2888 newparameter.append(1);
2889 for (; j<parameter.nops()-1; j++) {
2890 newparameter.append(parameter[j+1]);
2892 res -= H(newparameter, arg).hold();
2894 res = recursion(res).expand() / firstzero;
2904 // do x -> 1/x transformation
2905 struct map_trafo_H_1overx : public map_function
2907 ex operator()(const ex& e)
2909 if (is_a<add>(e) || is_a<mul>(e)) {
2910 return e.map(*this);
2913 if (is_a<function>(e)) {
2914 std::string name = ex_to<function>(e).get_name();
2917 lst parameter = ex_to<lst>(e.op(0));
2920 // special cases if all parameters are either 0, 1 or -1
2921 bool allthesame = true;
2922 if (parameter.op(0) == 0) {
2923 for (std::size_t i = 1; i < parameter.nops(); i++) {
2924 if (parameter.op(i) != 0) {
2930 return pow(-1, parameter.nops()) * H(parameter, 1/arg).hold();
2932 } else if (parameter.op(0) == -1) {
2933 for (std::size_t i = 1; i < parameter.nops(); i++) {
2934 if (parameter.op(i) != -1) {
2940 map_trafo_H_mult unify;
2941 return unify((pow(H(lst(ex(-1)),1/arg).hold() - H(lst(ex(0)),1/arg).hold(), parameter.nops())
2942 / factorial(parameter.nops())).expand());
2945 for (std::size_t i = 1; i < parameter.nops(); i++) {
2946 if (parameter.op(i) != 1) {
2952 map_trafo_H_mult unify;
2953 return unify((pow(H(lst(ex(1)),1/arg).hold() + H(lst(ex(0)),1/arg).hold() + H_polesign, parameter.nops())
2954 / factorial(parameter.nops())).expand());
2958 lst newparameter = parameter;
2959 newparameter.remove_first();
2961 if (parameter.op(0) == 0) {
2964 ex res = convert_H_to_zeta(parameter);
2965 map_trafo_H_1overx recursion;
2966 ex buffer = recursion(H(newparameter, arg).hold());
2967 if (is_a<add>(buffer)) {
2968 for (std::size_t i = 0; i < buffer.nops(); i++) {
2969 res += trafo_H_1tx_prepend_zero(buffer.op(i), arg);
2972 res += trafo_H_1tx_prepend_zero(buffer, arg);
2976 } else if (parameter.op(0) == -1) {
2978 // leading negative one
2979 ex res = convert_H_to_zeta(parameter);
2980 map_trafo_H_1overx recursion;
2981 ex buffer = recursion(H(newparameter, arg).hold());
2982 if (is_a<add>(buffer)) {
2983 for (std::size_t i = 0; i < buffer.nops(); i++) {
2984 res += trafo_H_1tx_prepend_zero(buffer.op(i), arg) - trafo_H_1tx_prepend_minusone(buffer.op(i), arg);
2987 res += trafo_H_1tx_prepend_zero(buffer, arg) - trafo_H_1tx_prepend_minusone(buffer, arg);
2994 map_trafo_H_1overx recursion;
2995 map_trafo_H_mult unify;
2996 ex res = H(lst(ex(1)), arg).hold() * H(newparameter, arg).hold();
2997 std::size_t firstzero = 0;
2998 while (parameter.op(firstzero) == 1) {
3001 for (std::size_t i = firstzero-1; i < parameter.nops() - 1; i++) {
3005 newparameter.append(parameter[j+1]);
3007 newparameter.append(1);
3008 for (; j<parameter.nops()-1; j++) {
3009 newparameter.append(parameter[j+1]);
3011 res -= H(newparameter, arg).hold();
3013 res = recursion(res).expand() / firstzero;
3025 // do x -> (1-x)/(1+x) transformation
3026 struct map_trafo_H_1mxt1px : public map_function
3028 ex operator()(const ex& e)
3030 if (is_a<add>(e) || is_a<mul>(e)) {
3031 return e.map(*this);
3034 if (is_a<function>(e)) {
3035 std::string name = ex_to<function>(e).get_name();
3038 lst parameter = ex_to<lst>(e.op(0));
3041 // special cases if all parameters are either 0, 1 or -1
3042 bool allthesame = true;
3043 if (parameter.op(0) == 0) {
3044 for (std::size_t i = 1; i < parameter.nops(); i++) {
3045 if (parameter.op(i) != 0) {
3051 map_trafo_H_mult unify;
3052 return unify((pow(-H(lst(ex(1)),(1-arg)/(1+arg)).hold() - H(lst(ex(-1)),(1-arg)/(1+arg)).hold(), parameter.nops())
3053 / factorial(parameter.nops())).expand());
3055 } else if (parameter.op(0) == -1) {
3056 for (std::size_t i = 1; i < parameter.nops(); i++) {
3057 if (parameter.op(i) != -1) {
3063 map_trafo_H_mult unify;
3064 return unify((pow(log(2) - H(lst(ex(-1)),(1-arg)/(1+arg)).hold(), parameter.nops())
3065 / factorial(parameter.nops())).expand());
3068 for (std::size_t i = 1; i < parameter.nops(); i++) {
3069 if (parameter.op(i) != 1) {
3075 map_trafo_H_mult unify;
3076 return unify((pow(-log(2) - H(lst(ex(0)),(1-arg)/(1+arg)).hold() + H(lst(ex(-1)),(1-arg)/(1+arg)).hold(), parameter.nops())
3077 / factorial(parameter.nops())).expand());
3081 lst newparameter = parameter;
3082 newparameter.remove_first();
3084 if (parameter.op(0) == 0) {
3087 ex res = convert_H_to_zeta(parameter);
3088 map_trafo_H_1mxt1px recursion;
3089 ex buffer = recursion(H(newparameter, arg).hold());
3090 if (is_a<add>(buffer)) {
3091 for (std::size_t i = 0; i < buffer.nops(); i++) {
3092 res -= trafo_H_1mxt1px_prepend_one(buffer.op(i), arg) + trafo_H_1mxt1px_prepend_minusone(buffer.op(i), arg);
3095 res -= trafo_H_1mxt1px_prepend_one(buffer, arg) + trafo_H_1mxt1px_prepend_minusone(buffer, arg);
3099 } else if (parameter.op(0) == -1) {
3101 // leading negative one
3102 ex res = convert_H_to_zeta(parameter);
3103 map_trafo_H_1mxt1px recursion;
3104 ex buffer = recursion(H(newparameter, arg).hold());
3105 if (is_a<add>(buffer)) {
3106 for (std::size_t i = 0; i < buffer.nops(); i++) {
3107 res -= trafo_H_1mxt1px_prepend_minusone(buffer.op(i), arg);
3110 res -= trafo_H_1mxt1px_prepend_minusone(buffer, arg);
3117 map_trafo_H_1mxt1px recursion;
3118 map_trafo_H_mult unify;
3119 ex res = H(lst(ex(1)), arg).hold() * H(newparameter, arg).hold();
3120 std::size_t firstzero = 0;
3121 while (parameter.op(firstzero) == 1) {
3124 for (std::size_t i = firstzero - 1; i < parameter.nops() - 1; i++) {
3128 newparameter.append(parameter[j+1]);
3130 newparameter.append(1);
3131 for (; j<parameter.nops()-1; j++) {
3132 newparameter.append(parameter[j+1]);
3134 res -= H(newparameter, arg).hold();
3136 res = recursion(res).expand() / firstzero;
3148 // do the actual summation.
3149 cln::cl_N H_do_sum(const std::vector<int>& m, const cln::cl_N& x)
3151 const int j = m.size();
3153 std::vector<cln::cl_N> t(j);
3155 cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
3156 cln::cl_N factor = cln::expt(x, j) * one;
3162 t[j-1] = t[j-1] + 1 / cln::expt(cln::cl_I(q),m[j-1]);
3163 for (int k=j-2; k>=1; k--) {
3164 t[k] = t[k] + t[k+1] / cln::expt(cln::cl_I(q+j-1-k), m[k]);
3166 t[0] = t[0] + t[1] * factor / cln::expt(cln::cl_I(q+j-1), m[0]);
3167 factor = factor * x;
3168 } while (t[0] != t0buf);
3174 } // end of anonymous namespace
3177 //////////////////////////////////////////////////////////////////////
3179 // Harmonic polylogarithm H(m,x)
3183 //////////////////////////////////////////////////////////////////////
3186 static ex H_evalf(const ex& x1, const ex& x2)
3188 if (is_a<lst>(x1)) {
3191 if (is_a<numeric>(x2)) {
3192 x = ex_to<numeric>(x2).to_cl_N();
3194 ex x2_val = x2.evalf();
3195 if (is_a<numeric>(x2_val)) {
3196 x = ex_to<numeric>(x2_val).to_cl_N();
3200 for (std::size_t i = 0; i < x1.nops(); i++) {
3201 if (!x1.op(i).info(info_flags::integer)) {
3202 return H(x1, x2).hold();
3205 if (x1.nops() < 1) {
3206 return H(x1, x2).hold();
3209 const lst& morg = ex_to<lst>(x1);
3210 // remove trailing zeros ...
3211 if (*(--morg.end()) == 0) {
3212 symbol xtemp("xtemp");
3213 map_trafo_H_reduce_trailing_zeros filter;
3214 return filter(H(x1, xtemp).hold()).subs(xtemp==x2).evalf();
3216 // ... and expand parameter notation
3217 bool has_minus_one = false;
3219 for (lst::const_iterator it = morg.begin(); it != morg.end(); it++) {
3221 for (ex count=*it-1; count > 0; count--) {
3225 } else if (*it <= -1) {
3226 for (ex count=*it+1; count < 0; count++) {
3230 has_minus_one = true;
3237 if (cln::abs(x) < 0.95) {
3241 if (convert_parameter_H_to_Li(m, m_lst, s_lst, pf)) {
3242 // negative parameters -> s_lst is filled
3243 std::vector<int> m_int;
3244 std::vector<cln::cl_N> x_cln;
3245 for (lst::const_iterator it_int = m_lst.begin(), it_cln = s_lst.begin();
3246 it_int != m_lst.end(); it_int++, it_cln++) {
3247 m_int.push_back(ex_to<numeric>(*it_int).to_int());
3248 x_cln.push_back(ex_to<numeric>(*it_cln).to_cl_N());
3250 x_cln.front() = x_cln.front() * x;
3251 return pf * numeric(multipleLi_do_sum(m_int, x_cln));
3253 // only positive parameters
3255 if (m_lst.nops() == 1) {
3256 return Li(m_lst.op(0), x2).evalf();
3258 std::vector<int> m_int;
3259 for (lst::const_iterator it = m_lst.begin(); it != m_lst.end(); it++) {
3260 m_int.push_back(ex_to<numeric>(*it).to_int());
3262 return numeric(H_do_sum(m_int, x));
3266 symbol xtemp("xtemp");
3269 // ensure that the realpart of the argument is positive
3270 if (cln::realpart(x) < 0) {
3272 for (std::size_t i = 0; i < m.nops(); i++) {
3274 m.let_op(i) = -m.op(i);
3281 if (cln::abs(x) >= 2.0) {
3282 map_trafo_H_1overx trafo;
3283 res *= trafo(H(m, xtemp).hold());
3284 if (cln::imagpart(x) <= 0) {
3285 res = res.subs(H_polesign == -I*Pi);
3287 res = res.subs(H_polesign == I*Pi);
3289 return res.subs(xtemp == numeric(x)).evalf();
3292 // check transformations for 0.95 <= |x| < 2.0
3294 // |(1-x)/(1+x)| < 0.9 -> circular area with center=9.53+0i and radius=9.47
3295 if (cln::abs(x-9.53) <= 9.47) {
3297 map_trafo_H_1mxt1px trafo;
3298 res *= trafo(H(m, xtemp).hold());
3301 if (has_minus_one) {
3302 map_trafo_H_convert_to_Li filter;
3303 return filter(H(m, numeric(x)).hold()).evalf();
3305 map_trafo_H_1mx trafo;
3306 res *= trafo(H(m, xtemp).hold());
3309 return res.subs(xtemp == numeric(x)).evalf();
3312 return H(x1,x2).hold();
3316 static ex H_eval(const ex& m_, const ex& x)
3319 if (is_a<lst>(m_)) {
3324 if (m.nops() == 0) {
3332 if (*m.begin() > _ex1) {
3338 } else if (*m.begin() < _ex_1) {
3344 } else if (*m.begin() == _ex0) {
3351 for (lst::const_iterator it = ++m.begin(); it != m.end(); it++) {
3352 if ((*it).info(info_flags::integer)) {
3363 } else if (*it < _ex_1) {
3383 } else if (step == 1) {
3395 // if some m_i is not an integer
3396 return H(m_, x).hold();
3399 if ((x == _ex1) && (*(--m.end()) != _ex0)) {
3400 return convert_H_to_zeta(m);
3406 return H(m_, x).hold();
3408 return pow(log(x), m.nops()) / factorial(m.nops());
3411 return pow(-pos1*log(1-pos1*x), m.nops()) / factorial(m.nops());
3413 } else if ((step == 1) && (pos1 == _ex0)){
3418 return pow(-1, p) * S(n, p, -x);
3424 if (x.info(info_flags::numeric) && (!x.info(info_flags::crational))) {
3425 return H(m_, x).evalf();
3427 return H(m_, x).hold();
3431 static ex H_series(const ex& m, const ex& x, const relational& rel, int order, unsigned options)
3434 seq.push_back(expair(H(m, x), 0));
3435 return pseries(rel, seq);
3439 static ex H_deriv(const ex& m_, const ex& x, unsigned deriv_param)
3441 GINAC_ASSERT(deriv_param < 2);
3442 if (deriv_param == 0) {
3446 if (is_a<lst>(m_)) {
3462 return 1/(1-x) * H(m, x);
3463 } else if (mb == _ex_1) {
3464 return 1/(1+x) * H(m, x);
3471 static void H_print_latex(const ex& m_, const ex& x, const print_context& c)
3474 if (is_a<lst>(m_)) {
3479 c.s << "\\mathrm{H}_{";
3480 lst::const_iterator itm = m.begin();
3483 for (; itm != m.end(); itm++) {
3493 REGISTER_FUNCTION(H,
3494 evalf_func(H_evalf).
3496 series_func(H_series).
3497 derivative_func(H_deriv).
3498 print_func<print_latex>(H_print_latex).
3499 do_not_evalf_params());
3502 // takes a parameter list for H and returns an expression with corresponding multiple polylogarithms
3503 ex convert_H_to_Li(const ex& m, const ex& x)
3505 map_trafo_H_reduce_trailing_zeros filter;
3506 map_trafo_H_convert_to_Li filter2;
3508 return filter2(filter(H(m, x).hold()));
3510 return filter2(filter(H(lst(m), x).hold()));
3515 //////////////////////////////////////////////////////////////////////
3517 // Multiple zeta values zeta(x) and zeta(x,s)
3521 //////////////////////////////////////////////////////////////////////
3524 // anonymous namespace for helper functions
3528 // parameters and data for [Cra] algorithm
3529 const cln::cl_N lambda = cln::cl_N("319/320");
3531 void halfcyclic_convolute(const std::vector<cln::cl_N>& a, const std::vector<cln::cl_N>& b, std::vector<cln::cl_N>& c)
3533 const int size = a.size();
3534 for (int n=0; n<size; n++) {
3536 for (int m=0; m<=n; m++) {
3537 c[n] = c[n] + a[m]*b[n-m];
3544 static void initcX(std::vector<cln::cl_N>& crX,
3545 const std::vector<int>& s,
3548 std::vector<cln::cl_N> crB(L2 + 1);
3549 for (int i=0; i<=L2; i++)
3550 crB[i] = bernoulli(i).to_cl_N() / cln::factorial(i);
3554 std::vector<std::vector<cln::cl_N> > crG(s.size() - 1, std::vector<cln::cl_N>(L2 + 1));
3555 for (int m=0; m < (int)s.size() - 1; m++) {
3558 for (int i = 0; i <= L2; i++)
3559 crG[m][i] = cln::factorial(i + Sm - m - 2) / cln::factorial(i + Smp1 - m - 2);
3564 for (std::size_t m = 0; m < s.size() - 1; m++) {
3565 std::vector<cln::cl_N> Xbuf(L2 + 1);
3566 for (int i = 0; i <= L2; i++)
3567 Xbuf[i] = crX[i] * crG[m][i];
3569 halfcyclic_convolute(Xbuf, crB, crX);
3575 static cln::cl_N crandall_Y_loop(const cln::cl_N& Sqk,
3576 const std::vector<cln::cl_N>& crX)
3578 cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
3579 cln::cl_N factor = cln::expt(lambda, Sqk);
3580 cln::cl_N res = factor / Sqk * crX[0] * one;
3585 factor = factor * lambda;
3587 res = res + crX[N] * factor / (N+Sqk);
3588 } while ((res != resbuf) || cln::zerop(crX[N]));
3594 static void calc_f(std::vector<std::vector<cln::cl_N> >& f_kj,
3595 const int maxr, const int L1)
3597 cln::cl_N t0, t1, t2, t3, t4;
3599 std::vector<std::vector<cln::cl_N> >::iterator it = f_kj.begin();
3600 cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
3602 t0 = cln::exp(-lambda);
3604 for (k=1; k<=L1; k++) {
3607 for (j=1; j<=maxr; j++) {
3610 for (i=2; i<=j; i++) {
3614 (*it).push_back(t2 * t3 * cln::expt(cln::cl_I(k),-j) * one);
3622 static cln::cl_N crandall_Z(const std::vector<int>& s,
3623 const std::vector<std::vector<cln::cl_N> >& f_kj)
3625 const int j = s.size();
3634 t0 = t0 + f_kj[q+j-2][s[0]-1];
3635 } while (t0 != t0buf);
3637 return t0 / cln::factorial(s[0]-1);
3640 std::vector<cln::cl_N> t(j);
3647 t[j-1] = t[j-1] + 1 / cln::expt(cln::cl_I(q),s[j-1]);
3648 for (int k=j-2; k>=1; k--) {
3649 t[k] = t[k] + t[k+1] / cln::expt(cln::cl_I(q+j-1-k), s[k]);
3651 t[0] = t[0] + t[1] * f_kj[q+j-2][s[0]-1];
3652 } while (t[0] != t0buf);
3654 return t[0] / cln::factorial(s[0]-1);
3659 cln::cl_N zeta_do_sum_Crandall(const std::vector<int>& s)
3661 std::vector<int> r = s;
3662 const int j = r.size();
3666 // decide on maximal size of f_kj for crandall_Z
3670 L1 = Digits * 3 + j*2;
3674 // decide on maximal size of crX for crandall_Y
3677 } else if (Digits < 86) {
3679 } else if (Digits < 192) {
3681 } else if (Digits < 394) {
3683 } else if (Digits < 808) {
3693 for (int i=0; i<j; i++) {
3700 std::vector<std::vector<cln::cl_N> > f_kj(L1);
3701 calc_f(f_kj, maxr, L1);
3703 const cln::cl_N r0factorial = cln::factorial(r[0]-1);
3705 std::vector<int> rz;
3708 for (int k=r.size()-1; k>0; k--) {
3710 rz.insert(rz.begin(), r.back());
3711 skp1buf = rz.front();
3715 std::vector<cln::cl_N> crX;
3718 for (int q=0; q<skp1buf; q++) {
3720 cln::cl_N pp1 = crandall_Y_loop(Srun+q-k, crX);
3721 cln::cl_N pp2 = crandall_Z(rz, f_kj);
3726 res = res - pp1 * pp2 / cln::factorial(q);
3728 res = res + pp1 * pp2 / cln::factorial(q);
3731 rz.front() = skp1buf;
3733 rz.insert(rz.begin(), r.back());
3735 std::vector<cln::cl_N> crX;
3736 initcX(crX, rz, L2);
3738 res = (res + crandall_Y_loop(S-j, crX)) / r0factorial
3739 + crandall_Z(rz, f_kj);
3745 cln::cl_N zeta_do_sum_simple(const std::vector<int>& r)
3747 const int j = r.size();
3749 // buffer for subsums
3750 std::vector<cln::cl_N> t(j);
3751 cln::cl_F one = cln::cl_float(1, cln::float_format(Digits));
3758 t[j-1] = t[j-1] + one / cln::expt(cln::cl_I(q),r[j-1]);
3759 for (int k=j-2; k>=0; k--) {
3760 t[k] = t[k] + one * t[k+1] / cln::expt(cln::cl_I(q+j-1-k), r[k]);
3762 } while (t[0] != t0buf);
3768 // does Hoelder convolution. see [BBB] (7.0)
3769 cln::cl_N zeta_do_Hoelder_convolution(const std::vector<int>& m_, const std::vector<int>& s_)
3771 // prepare parameters
3772 // holds Li arguments in [BBB] notation
3773 std::vector<int> s = s_;
3774 std::vector<int> m_p = m_;
3775 std::vector<int> m_q;
3776 // holds Li arguments in nested sums notation
3777 std::vector<cln::cl_N> s_p(s.size(), cln::cl_N(1));
3778 s_p[0] = s_p[0] * cln::cl_N("1/2");
3779 // convert notations
3781 for (std::size_t i = 0; i < s_.size(); i++) {
3786 s[i] = sig * std::abs(s[i]);
3788 std::vector<cln::cl_N> s_q;
3789 cln::cl_N signum = 1;
3792 cln::cl_N res = multipleLi_do_sum(m_p, s_p);
3797 // change parameters
3798 if (s.front() > 0) {
3799 if (m_p.front() == 1) {
3800 m_p.erase(m_p.begin());
3801 s_p.erase(s_p.begin());
3802 if (s_p.size() > 0) {
3803 s_p.front() = s_p.front() * cln::cl_N("1/2");
3809 m_q.insert(m_q.begin(), 1);
3810 if (s_q.size() > 0) {
3811 s_q.front() = s_q.front() * 2;
3813 s_q.insert(s_q.begin(), cln::cl_N("1/2"));
3816 if (m_p.front() == 1) {
3817 m_p.erase(m_p.begin());
3818 cln::cl_N spbuf = s_p.front();
3819 s_p.erase(s_p.begin());
3820 if (s_p.size() > 0) {
3821 s_p.front() = s_p.front() * spbuf;
3824 m_q.insert(m_q.begin(), 1);
3825 if (s_q.size() > 0) {
3826 s_q.front() = s_q.front() * 4;
3828 s_q.insert(s_q.begin(), cln::cl_N("1/4"));
3832 m_q.insert(m_q.begin(), 1);
3833 if (s_q.size() > 0) {
3834 s_q.front() = s_q.front() * 2;
3836 s_q.insert(s_q.begin(), cln::cl_N("1/2"));
3841 if (m_p.size() == 0) break;
3843 res = res + signum * multipleLi_do_sum(m_p, s_p) * multipleLi_do_sum(m_q, s_q);
3848 res = res + signum * multipleLi_do_sum(m_q, s_q);
3854 } // end of anonymous namespace
3857 //////////////////////////////////////////////////////////////////////
3859 // Multiple zeta values zeta(x)
3863 //////////////////////////////////////////////////////////////////////
3866 static ex zeta1_evalf(const ex& x)
3868 if (is_exactly_a<lst>(x) && (x.nops()>1)) {
3870 // multiple zeta value
3871 const int count = x.nops();
3872 const lst& xlst = ex_to<lst>(x);
3873 std::vector<int> r(count);
3875 // check parameters and convert them
3876 lst::const_iterator it1 = xlst.begin();
3877 std::vector<int>::iterator it2 = r.begin();
3879 if (!(*it1).info(info_flags::posint)) {
3880 return zeta(x).hold();
3882 *it2 = ex_to<numeric>(*it1).to_int();
3885 } while (it2 != r.end());
3887 // check for divergence
3889 return zeta(x).hold();
3892 // decide on summation algorithm
3893 // this is still a bit clumsy
3894 int limit = (Digits>17) ? 10 : 6;
3895 if ((r[0] < limit) || ((count > 3) && (r[1] < limit/2))) {
3896 return numeric(zeta_do_sum_Crandall(r));
3898 return numeric(zeta_do_sum_simple(r));
3902 // single zeta value
3903 if (is_exactly_a<numeric>(x) && (x != 1)) {
3905 return zeta(ex_to<numeric>(x));
3906 } catch (const dunno &e) { }
3909 return zeta(x).hold();
3913 static ex zeta1_eval(const ex& m)
3915 if (is_exactly_a<lst>(m)) {
3916 if (m.nops() == 1) {
3917 return zeta(m.op(0));
3919 return zeta(m).hold();
3922 if (m.info(info_flags::numeric)) {
3923 const numeric& y = ex_to<numeric>(m);
3924 // trap integer arguments:
3925 if (y.is_integer()) {
3929 if (y.is_equal(*_num1_p)) {
3930 return zeta(m).hold();
3932 if (y.info(info_flags::posint)) {
3933 if (y.info(info_flags::odd)) {
3934 return zeta(m).hold();
3936 return abs(bernoulli(y)) * pow(Pi, y) * pow(*_num2_p, y-(*_num1_p)) / factorial(y);
3939 if (y.info(info_flags::odd)) {
3940 return -bernoulli((*_num1_p)-y) / ((*_num1_p)-y);
3947 if (y.info(info_flags::numeric) && !y.info(info_flags::crational)) {
3948 return zeta1_evalf(m);
3951 return zeta(m).hold();
3955 static ex zeta1_deriv(const ex& m, unsigned deriv_param)
3957 GINAC_ASSERT(deriv_param==0);
3959 if (is_exactly_a<lst>(m)) {
3962 return zetaderiv(_ex1, m);
3967 static void zeta1_print_latex(const ex& m_, const print_context& c)
3970 if (is_a<lst>(m_)) {
3971 const lst& m = ex_to<lst>(m_);
3972 lst::const_iterator it = m.begin();
3975 for (; it != m.end(); it++) {
3986 unsigned zeta1_SERIAL::serial = function::register_new(function_options("zeta", 1).
3987 evalf_func(zeta1_evalf).
3988 eval_func(zeta1_eval).
3989 derivative_func(zeta1_deriv).
3990 print_func<print_latex>(zeta1_print_latex).
3991 do_not_evalf_params().
3995 //////////////////////////////////////////////////////////////////////
3997 // Alternating Euler sum zeta(x,s)
4001 //////////////////////////////////////////////////////////////////////
4004 static ex zeta2_evalf(const ex& x, const ex& s)
4006 if (is_exactly_a<lst>(x)) {
4008 // alternating Euler sum
4009 const int count = x.nops();
4010 const lst& xlst = ex_to<lst>(x);
4011 const lst& slst = ex_to<lst>(s);
4012 std::vector<int> xi(count);
4013 std::vector<int> si(count);
4015 // check parameters and convert them
4016 lst::const_iterator it_xread = xlst.begin();
4017 lst::const_iterator it_sread = slst.begin();
4018 std::vector<int>::iterator it_xwrite = xi.begin();
4019 std::vector<int>::iterator it_swrite = si.begin();
4021 if (!(*it_xread).info(info_flags::posint)) {
4022 return zeta(x, s).hold();
4024 *it_xwrite = ex_to<numeric>(*it_xread).to_int();
4025 if (*it_sread > 0) {
4034 } while (it_xwrite != xi.end());
4036 // check for divergence
4037 if ((xi[0] == 1) && (si[0] == 1)) {
4038 return zeta(x, s).hold();
4041 // use Hoelder convolution
4042 return numeric(zeta_do_Hoelder_convolution(xi, si));
4045 return zeta(x, s).hold();
4049 static ex zeta2_eval(const ex& m, const ex& s_)
4051 if (is_exactly_a<lst>(s_)) {
4052 const lst& s = ex_to<lst>(s_);
4053 for (lst::const_iterator it = s.begin(); it != s.end(); it++) {
4054 if ((*it).info(info_flags::positive)) {
4057 return zeta(m, s_).hold();
4060 } else if (s_.info(info_flags::positive)) {
4064 return zeta(m, s_).hold();
4068 static ex zeta2_deriv(const ex& m, const ex& s, unsigned deriv_param)
4070 GINAC_ASSERT(deriv_param==0);
4072 if (is_exactly_a<lst>(m)) {
4075 if ((is_exactly_a<lst>(s) && s.op(0).info(info_flags::positive)) || s.info(info_flags::positive)) {
4076 return zetaderiv(_ex1, m);
4083 static void zeta2_print_latex(const ex& m_, const ex& s_, const print_context& c)
4086 if (is_a<lst>(m_)) {
4092 if (is_a<lst>(s_)) {
4098 lst::const_iterator itm = m.begin();
4099 lst::const_iterator its = s.begin();
4101 c.s << "\\overline{";
4109 for (; itm != m.end(); itm++, its++) {
4112 c.s << "\\overline{";
4123 unsigned zeta2_SERIAL::serial = function::register_new(function_options("zeta", 2).
4124 evalf_func(zeta2_evalf).
4125 eval_func(zeta2_eval).
4126 derivative_func(zeta2_deriv).
4127 print_func<print_latex>(zeta2_print_latex).
4128 do_not_evalf_params().
4132 } // namespace GiNaC