Numerical calculation of the Riemann zeta function at odd-integer arguments: a direct formula method

DOI10.1007/S40096-015-0146-9MaRDI QIDQ1992158zbMATH OpenOpenAlexWikidataFDO

Authors Qiang Luo, Zhidan Wang

Publication date 2 November 2018

Published in Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1404.7221

zbMATH Keywords

algorithmnumerical analysisRiemann zeta function

Mathematics Subject Classification ID

(zeta (s)) and (L(s, chi)) (11M06) Number-theoretic algorithms; complexity (11Y16)

Abstract: In this article, we introduce a recurrence formula which only involves two adjacent values of the Riemann zeta function at integer arguments. Based on the formula, an algorithm to evaluate $zeta$-values(i.e. the values of Riemann zeta function) at odd-integers from the two nearest $zeta$-values at even-integers is posed and proved. The behavior of the error bound is $O(10^{-n})$ approximately where $n$ is the argument. Our method is especially powerful for the calculation of Riemann zeta function at large argument, while for smaller ones it can also reach spectacular accuracies such as more than ten decimal places.

Recommendations

• Computational strategies for the Riemann zeta function
• scientific article; zbMATH DE number 55157
• Fast computation of the Riemann zeta function for integer argument
• scientific article; zbMATH DE number 1787206
• Evaluation of Riemann zeta function on the line \(\text{Re}(s)=1\) and odd arguments

Cites work

• A multimodular algorithm for computing Bernoulli numbers
• A simple computation of (2k)
• A simpler proof of a Katsurada's theorem and rapidly converging series for \(\zeta (2n+1)\) and \(\beta (2n)\)
• An Euler-type formula for \(\xi (2k+1)\)
• Asymptotic behaviour of Bernoulli, Euler, and generalized Bernoulli polynomials
• Computational strategies for the Riemann zeta function
• From Fourier series to rapidly convergent series for zeta(3)
• scientific article; zbMATH DE number 3968684 (Why is no real title available?)
• Integral representations of the Riemann zeta function for odd-integer arguments
• Large degree asymptotics of generalized Bernoulli and Euler polynomials
• Numerical approximation to \(\zeta (2n+1)\)
• Numerical computation of the Riemann zeta function and prime counting function by using Gauss-Hermite and Gauss-Laguerre quadratures
• Rapidly converging series for (2 n + 1) from Fourier series
• Riemann's zeta function
• Series Involving the Zeta Functions and a Family of Generalized Goldbach–Euler Series
• Some simple algorithms for the evaluations and representations of the Riemann zeta function at positive integer arguments
• Special functions. A graduate text
• The Basel problem as a telescoping series
• The distribution of \(r\)-free numbers in arithmetic progressions

Cited in

(8)

• On evaluation of the Dirichlet series at positive integers by \(q\)- calculation
• Fast computation of the Riemann zeta function for integer argument
• A few factors from the Euler product are sufficient for calculating the zeta function with high precision
• Fast computation of the Riemann zeta-function \(\zeta (s)\) for integer values of the argument \(s\)
• Plausible ways for calculating the Riemann zeta function via the Riemann-Siegel theta function
• The Euler-Riemann zeta function in some series formulae and its values at odd integer points
• Evaluation of Riemann zeta function on the line \(\text{Re}(s)=1\) and odd arguments
• The value of the zeta function at an odd argument

This page was built for publication: Numerical calculation of the Riemann zeta function at odd-integer arguments: a direct formula method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992158)