Efficiently Computing Many Roots of a Function

DOI10.1137/S1064827502406531zbMath1113.65049OpenAlexW2014855291MaRDI QIDQ5693188

Frosso S. Makri, Dimitris J. Kavvadias, Michael N. Vrahatis

Publication date: 22 September 2005

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827502406531

zbMATH Keywords

zeta-functionRiemann's hypothesisElbert's conjecturezerofindingvery large problemsbisection based methodscounting the roots of a function

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Complexity and performance of numerical algorithms (65Y20)

Related Items

Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions, Global root bracketing method with adaptive mesh refinement

Uses Software

• CHABIS
• RFSFNS