Fast evaluation of the Hurwitz zeta function and Dirichlet L-series
Fast evaluation of the Hurwitz zeta function and Dirichlet \(L\)-series
The aim of the author in this paper is to propose an algorithm for the fast evaluation of the Hurwitz zeta function \(\zeta(s,a)\), for integer values of \(s\) and algebraic values of \(a\). The paper follows the lines of previous work by the author (cited in the references), where algorithms for the fast evaluation of elementary and higher transcendental functions -- as well as for the classical constants \(e,\pi\) and the Euler constant \(\gamma\) -- have been presented. The general method is based on the fast evaluation for functions of the type of the Siegel \(E\)-function (the so-called FEE method), which has a complexity close to the best possible one. It is to be noted that an application of the FEE method to the fast evaluation of the Riemann zeta function \(\zeta(s)\) for integer values of the argument \(s\) was given by the author in [Probl. Inf. Transm. 31, 353-362 (1995; Zbl 0895.11032)] but that for fractional values of \(s\) no method for the fast evaluation of \(\zeta(s)\) has yet been found. The paper finishes with a theorem on the evaluation complexity of Dirichlet series \(L(s,\chi)\) for natural values of the argument, \(s=k\), \(k\geq 2\), and any Dirichlet character \(\chi(l)\) modulo \(m\), \(m\geq 2\), with \(m\) integer, for which the author finds the estimate \(s_L(n)= O(M(n)\log^2n)\). This is the same kind of result as the one obtained for the Hurwitz zeta function under the conditions described. Remarkably, if coincides also with the result corresponding to the evaluation complexity for the above mentioned constants and for the elementary and higher transcendental functions, at algebraic values of the argument.
- scientific article; zbMATH DE number 3884234 (Why is no real title available?)
- scientific article; zbMATH DE number 884971 (Why is no real title available?)
- On the asymptotic representation of the Euler gamma function by Ramanujan
- On the computation of the Euler constant \({\gamma}\)
- Some New Algorithms for High-Precision Computation of Euler's Constant
- An efficient algorithm for the Hurwitz zeta and related functions
- Fast computation of the Riemann zeta-function \(\zeta (s)\) for integer values of the argument \(s\)
- On one method for fast approximation of zeta constants by rational fractions
- An efficient algorithm for accelerating the convergence of oscillatory series, useful for computing the polylogarithm and Hurwitz zeta functions
- A unified strategy to compute some special functions of number-theoretic interest
- On a method for constructing a family of approximations of zeta constants by rational fractions
- Fast evaluation of the Riemann zeta-function (s) at integral values of the argument s
- Computing hypergeometric functions rigorously
- Fast Zeta Transforms for Lattices with Few Irreducibles
- Fast approximations of certain number-theoretic constants
- On computation of the Bessel function by summing up the series
- scientific article; zbMATH DE number 7310208 (Why is no real title available?)
- Fast computation of (3) and of some special integrals using the Ramanujan formula and polylogarithms
- On the computational complexity of compressed power series
- Crandall's computation of the incomplete gamma function and the Hurwitz zeta function, with applications to Dirichlet \(L\)-series
This page was built for publication: Fast evaluation of the Hurwitz zeta function and Dirichlet \(L\)-series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290835)
