2. Bisection Method
Theorem 2.1 (Bisection Theorem). Assume that and that there exists a number
, such that f(r) = 0. If f(a) and f(b) have opposite signs, and represents the sequence midpoints generated by the bisection process, then
for n = 0, 1, . . . (2.1)