arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0702243math.CAcs.NAmath.NAmath.NT

加速振荡级数收敛的高效算法,用于计算多对数函数和Hurwitz zeta函数

An efficient algorithm for accelerating the convergence of oscillatory series, useful for computing the polylogarithm and Hurwitz zeta functions

Linas Vepstas

AI总结:

本文提出一种加速振荡级数收敛的算法,并将其应用于多对数函数和Hurwitz zeta函数的高效计算,扩展了Borwein的Riemann zeta函数算法。

摘要:

本文概述了一种提高一般振荡序列收敛速度的技术,然后将该级数加速算法应用于多对数函数和Hurwitz zeta函数。因此,它可以被视为Borwein的“计算Riemann zeta函数的高效算法”中给出的技术向更一般级数的扩展。该算法为复数s的一般值和复数z的区域|z^2/(z-1)|<4提供了快速计算Li_s(z)的方法。或者,可以通过Euler-Maclaurin级数非常快速地计算Hurwitz zeta函数。多对数函数和Hurwitz zeta函数是相关的,因为对其中一个进行两次评估可以得到另一个的值;因此,任一算法都可用于评估任一函数。对于Hurwitz zeta函数,Euler-Maclaurin级数在性能上明显胜出,而Borwein算法在肾形区域评估多对数函数时更优。两种算法都优于简单的Taylor级数或直接求和。本文的主要具体结果是一种算法,允许在临界带中探索Hurwitz zeta函数,而其他快速算法无法实现。文中还讨论了多对数函数的单值群。

英文摘要:

This paper sketches a technique for improving the rate of convergence of a general oscillatory sequence, and then applies this series acceleration algorithm to the polylogarithm and the Hurwitz zeta function. As such, it may be taken as an extension of the techniques given by Borwein's "An efficient algorithm for computing the Riemann zeta function", to more general series. The algorithm provides a rapid means of evaluating Li_s(z) for general values of complex s and the region of complex z values given by |z^2/(z-1)|<4. Alternatively, the Hurwitz zeta can be very rapidly evaluated by means of an Euler-Maclaurin series. The polylogarithm and the Hurwitz zeta are related, in that two evaluations of the one can be used to obtain a value of the other; thus, either algorithm can be used to evaluate either function. The Euler-Maclaurin series is a clear performance winner for the Hurwitz zeta, while the Borwein algorithm is superior for evaluating the polylogarithm in the kidney-shaped region. Both algorithms are superior to the simple Taylor's series or direct summation. The primary, concrete result of this paper is an algorithm allows the exploration of the Hurwitz zeta in the critical strip, where fast algorithms are otherwise unavailable. A discussion of the monodromy group of the polylogarithm is included.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑