Asymptotic near optimality of the bisection method

DOI10.1007/BF01386421zbMath0699.65033OpenAlexW2044626521MaRDI QIDQ913453

N. E. Zubov

Publication date: 1990

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133459

zbMATH Keywords

bisection methodasymptotic near optimalitybest rate of convergencezeros of infinite multiplicity

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (6)

Optimal solution of nonlinear equations ⋮ Bisection is optimal ⋮ On the complexity of isolating real roots and computing with certainty the topological degree ⋮ RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions ⋮ Why does information-based complexity use the real number model? ⋮ Noisy information for linear problems in the asymptotic setting

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Study of linear information for classes of polynomial equations
• Bisection is optimal
• Lower Bounds and Fast Algorithms for Sequence Acceleration

This page was built for publication: Asymptotic near optimality of the bisection method