Treffer: Efficiently Computing Many Roots of a Function: Efficiently computing many roots of a function

Title:
Efficiently Computing Many Roots of a Function: Efficiently computing many roots of a function
Authors:
Dimitris J. Kavvadias, Frosso S. Makri, Michael N. Vrahatis
Source:
SIAM Journal on Scientific Computing. 27:93-107
Publisher Information:
Society for Industrial & Applied Mathematics (SIAM), 2005.
Publication Year:
2005
Subject Terms:
Nonreal zeros of \(\zeta (s)\) and \(L(s, \chi)\), Riemann and other hypotheses, Complexity and performance of numerical algorithms, bisection based methods, zeta-function, zerofinding, Numerical computation of solutions to single equations, counting the roots of a function, 0101 mathematics, Elbert's conjecture, Riemann's hypothesis, 01 natural sciences, very large problems
Document Type:
Fachzeitschrift Article
File Description:
application/xml
Language:
English
ISSN:
1095-7197
1064-8275
DOI:
10.1137/s1064827502406531
Access URL:
http://www.math.utep.edu/Faculty/yi/CPS5195f09/maria.pdf
https://locus.siam.org/doi/abs/10.1137/S1064827502406531
https://dblp.uni-trier.de/db/journals/siamsc/siamsc27.html#KavvadiasMV05
https://epubs.siam.org/doi/10.1137/S1064827502406531
Accession Number:
edsair.doi.dedup.....68a37a9da61bea02c982e6714cdd20b0
Database:
OpenAIRE

Weitere Informationen

A new bisection based method for counting roots of a function in a given interval is presented. The method is focused on very large problems and requires only the sign of the function at a certain point and not its actual value. The algorithm is accompanied by a probabilistic analysis of its behaviour under the assumption that the roots are randomly and uniformly distributed. No examples are given.