Abstract
We show that the multiple zeta sum: ζ ( s 1 , s 2 , . . . , s d ) = ∑ n 1 > n 2 > . . . > n d 1 n 1 s 1 n 2 s 2 . . . n d s d , \begin{equation*}\zeta (s_{1}, s_{2}, ..., s_{d}) = \sum _{n_{1} > n_{2} > ... > n_{d}} {{\frac {1 }{{n_{1}^{s_{1}} n_{2}^{s_{2}} ... n_{d}^{s_{d}}}}}},\end{equation*} for positive integers s i s_{i} with s 1 > 1 s_{1}>1 , can always be written as a finite sum of products of rapidly convergent series. Perhaps surprisingly, one may develop fast summation algorithms of such efficiency that the overall complexity can be brought down essentially to that of one-dimensional summation. In particular, for any dimension d d one may resolve D D good digits of ζ \zeta in O ( D log D / log log D ) O(D \log D / \log \log D) arithmetic operations, with the implied big- O O constant depending only on the set { s 1 , . . . , s d } \{s_{1},...,s_{d}\} .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.