, Volume 40, Issue 1, pp 111-117

Bisection is optimal

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Summary

We seek an approximation to a zero of a continuous functionf:[a,b]→ℝ such thatf(a)≦0 andf(b)≧0. It is known that the bisection algorithm makes optimal use ofn function evaluations, i.e., yields the minimal error which is (b−a)/2 n+1, see e.g. Kung [2]. Traub and Wozniakowski [5] proposed using more general information onf by permitting the adaptive evaluations ofn arbitrary linear functionals. They conjectured [5, p. 170] that the bisection algorithm remains optimal even if these general evaluations are permitted. This paper affirmatively proves this conjecture. In fact we prove optimality of the bisection algorithm even assuming thatf is infinitely many times differentiable on [a, b] and has exactly one simple zero.