Bisection Method definition
The bisection method locates a root of a continuous function by repeatedly halving an interval whose endpoints have opposite signs.
Bisection Method in a picture
How it works
Evaluate the midpoint. If it is a root, stop. Otherwise retain the half whose endpoints still have opposite signs. Continuity guarantees a root in each retained interval, and the interval width halves each time.
Worked examples
Bisect [0, 4] for f(x) = x − 3. Which half stays?
f(2) = −1 and f(4) = 1, so keep [2, 4].
What width remains after four halvings of a width-8 interval?
8/2⁴ = 0.5.
Can the method start with [−1, 1] for f(x) = x² using only the sign-change test?
The endpoint signs agree, so that test does not give a valid starting bracket, even though 0 is a root.
Common mistake
Verify continuity as well as opposite signs. A jump from negative to positive can skip zero.
Quick check
What point do you test at each step?
Show answer
The midpoint.
What theorem guarantees a root in the bracket?
Show answer
The intermediate value theorem.
What happens to the width each step?
Show answer
It is halved.
Sources
Flashcard
Bisection Method
Reveal the definition
The bisection method locates a root of a continuous function by repeatedly halving an interval whose endpoints have opposite signs.
Effortless Math. “Bisection Method.” Math Dictionary.
