#include <multiple_polylog.h>
Inheritance diagram for multiple_polylog:
Public Member Functions | |
| multiple_polylog (const GiNaC::ex &llc) | |
| void | archive (GiNaC::archive_node &node) const |
| void | read_archive (const GiNaC::archive_node &node, GiNaC::lst &sym_lst) |
| void | print (const GiNaC::print_context &c, unsigned level=0) const |
| GiNaC::ex | eval (int level=0) const |
| virtual GiNaC::ex | eval_approx (int level=0) const |
Multiple polylogs are in the notation of Goncharov defined by
![\[ \mbox{Li}_{m_k,...,m_1}(x_k,...,x_1) = Z(\infty;m_1,...,m_k;x_1,...,x_k) \]](form_122.png)
There are two "print" formats available. The default option prints multiple polylogarithms with reversed order of the arguments, as in the definition above. This notation is for example used by Goncharov.
If the flag "print_format::no_reversed_order" in the variable "_print_format" is set, multiple polylogarithms are printed without reversing the order of the arguments, e.g.
![\[ Z(\infty;m_1,...,m_k;x_1,...,x_k) = \mbox{Li}_{m_1,...,m_k}(x_1,...,x_k) \]](form_123.png)
This notation is used in the french literature.
|
|
The simplifications are done in the following order:
Reimplemented from Zsum. Reimplemented in classical_polylog, harmonic_polylog, multiple_zeta_value, and nielsen_polylog. |
|
|
This method provides a simple numerical evaluation routine for multiple polylogarithms. Multiple polylogarithms are evaluated as power series up to an upper summation limit _NMAX. This is not a routine designed for performance. It only provides a simple way to check a result for a few selected points. |
1.3.7
's are equal to 1, we have a multiple zeta value.
, we have a harmonic polylog.