Fast computation of the Riemann zeta function for integer argument
From MaRDI portal
The author uses the method of fast evaluating \(E\)-functions (FEE) in order to evaluate the Riemann zeta functions at integers (see the corresponding article [\textit{E. A. Karatsuba}, Integral Transforms Spec. Funct. 1, No. 4, 269-276 (1993; Zbl 0827.65022)]. The speed of the computations is based on new formulas for \(\zeta(k)\) and the possibility to quickly evaluate some special improper integrals using FEE.
Recommendations
- Fast computation of (3) and of some special integrals using the Ramanujan formula and polylogarithms
- Fast evaluation of the Riemann zeta-function (s) at integral values of the argument s
- Computational strategies for the Riemann zeta function
- Numerical calculation of the Riemann zeta function at odd-integer arguments: a direct formula method
Cited in
(11)- Fast evaluation of the Hurwitz zeta function and Dirichlet \(L\)-series
- Computational strategies for the Riemann zeta function
- Fast computation of the Riemann zeta-function \(\zeta (s)\) for integer values of the argument \(s\)
- Numerical calculation of the Riemann zeta function at odd-integer arguments: a direct formula method
- On an evaluation method for zeta constants based on a number theoretic approach
- On one method for fast approximation of zeta constants by rational fractions
- 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
- Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
- New computations of the Riemann zeta function on the critical line
- Fast computation of (3) and of some special integrals using the Ramanujan formula and polylogarithms
This page was built for publication: Fast computation of the Riemann zeta function for integer argument
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385953)
