Several zeros of a function can lie in one initial root bracket: the bisection method seeks one, rather than enumerating them. For instance, the polynomial has opposite endpoint signs on , but its first midpoint evaluation returns only the polynomial root . The initial zero of a function need not be unique for the bisection error bound to apply to a retained zero of a function.
A zero of a function without a sign change cannot be located by the strict sign-change test alone. The polynomial touches zero at but is positive on either side. On both endpoint values are positive: although the closed interval contains a polynomial root, it fails the usual starting test for the bisection method. An endpoint or evaluated midpoint zero of a function can still be recognized directly.
Opposite signs certify a root bracket only with the required continuity. For , the values at and have opposite signs, but is undefined at the midpoint and has no zero of a function. Hence is invalid input for the bisection method; the intermediate value theorem does not apply across the gap.

There are no discussions about this article yet.

Articles by others on the same topic (NaN)

There are currently no matching articles.