Asymptotic near optimality of the bisection method
From MaRDI portal
The authors prove that, roughly speaking, the bisection method has asymptotically the best rate of convergence only for the class of functions with zeros of infinite multiplicity.
Cites work
Cited in
(14)- Lepp-bisection algorithms, applications and mathematical properties
- Optimal solution of nonlinear equations
- Bisection is optimal
- 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?
- Bisection hardly ever converges linearly
- Complexity of the bisection method
- A polylogarithmic approximation of the minimum bisection
- scientific article; zbMATH DE number 4060637 (Why is no real title available?)
- Average-Case Optimality of a Hybrid Secant-Bisection Method
- An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality
- Bisections above Tight Lower Bounds
- On the complexity of isolating real roots and computing with certainty the topological degree
- Noisy information for linear problems in the asymptotic setting
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)