论文信息 - An efficient algorithm for the Hurwitz zeta and related functions

An efficient algorithm for the Hurwitz zeta and related functions

A simple class of algorithms for the efficient computation of the Hurwitz zeta and related special functions is given. The algorithms also provide a means of computing fundamental mathematical constants to arbitrary precision. A number of extensions as well as numerical examples are briefly described. The algorithms are easy to implement and compete with Euler-Maclaurin summation-based methods.

Mark W. Coffey | M. Coffey

[1] New results on the Stieltjes constants: Asymptotic and exact evaluation , 2005, math-ph/0506061.

[2] Hari M. Srivastava,et al. Series Associated with the Zeta and Related Functions , 2001 .

[3] Peter Borwein,et al. An efficient algorithm for the Riemann zeta function , 1995 .

[4] F. V. Atkinson,et al. The Riemann zeta-function , 1950 .

[5] Rick Kreminski. Newton-Cotes integration for approximating Stieltjes (generalized Euler) constants , 2003, Math. Comput..

[6] E. Hansen,et al. Some relations and values for the generalized Riemann zeta functions. , 1962 .

[7] M. Coffey. New summation relations for the Stieltjes constants , 2006, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[8] H. Cohen,et al. Calcul des valeurs de la fonction zêta de Riemann en multiprécision , 1992 .

[9] J. Todd,et al. The Stieltjes Constants , 1972 .

[10] É. Picard,et al. Correspondance d'Hermite et de Stieltjes , 2022 .

[11] Michael Rosen,et al. A classical introduction to modern number theory , 1982, Graduate texts in mathematics.