Asymptotic near optimality of the bisection method

DOI10.1007/BF01386421MaRDI QIDQ913453zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3388498 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• Bisection is optimal
• Lower Bounds and Fast Algorithms for Sequence Acceleration
• Study of linear information for classes of polynomial equations

Cited in

(14)

• A polylogarithmic approximation of the minimum bisection
• scientific article; zbMATH DE number 4060637 (Why is no real title available?)
• Lepp-bisection algorithms, applications and mathematical properties
• On the complexity of isolating real roots and computing with certainty the topological degree
• An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality
• Bisection is optimal
• Complexity of the bisection method
• Optimal solution of nonlinear equations
• Bisections above Tight Lower Bounds
• Average-Case Optimality of a Hybrid Secant-Bisection Method
• Bisection hardly ever converges linearly
• RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions
• Noisy information for linear problems in the asymptotic setting
• Why does information-based complexity use the real number model?

Describes a project that uses

Uses Software

• BRENT

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

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