Scribd
Upload
4 views5 pages

Bisection Method

The Bisection Method is a numerical technique used to find roots of a function by iteratively narrowing down an interval [a, b] where the function changes sign. The method involves calculating the midpoint c, evaluating the function at c, and updating the interval based on the sign of the function values. This process is repeated until the interval is sufficiently small or the desired accuracy is achieved.

Uploaded by

Jerick Jurado
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views5 pages

Bisection Method

The Bisection Method is a numerical technique used to find roots of a function by iteratively narrowing down an interval [a, b] where the function changes sign. The method involves calculating the midpoint c, evaluating the function at c, and updating the interval based on the sign of the function values. This process is repeated until the interval is sufficiently small or the desired accuracy is achieved.

Uploaded by

Jerick Jurado
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

The primary formula in the Bisection Method is to find the

midpoint of an interval [a, b] using c = (a + b) / 2. This


midpoint c is then used to determine if the root lies in the new
interval [a, c] or [c, b] by checking the signs
of f(a) and f(c) or f(c) and f(b). The process is repeated,
replacing a or b with c, until the desired level of accuracy is
achieved.

Formula for the Midpoint

The core formula to find the next potential root (c) is the average
of the current interval's endpoints (a and b): c = (a + b) / 2.
The Bisection Method Steps
[Link] Interval: Select two points, a and b, such that f(a) and f(b) have opposite
signs, meaning f(a) * f(b) < 0. This guarantees a root lies within the interval [a, b].
[Link] Midpoint: Find the midpoint c = (a + b) / 2.
[Link] Function at Midpoint: Calculate f(c).

[Link] Interval:
•If f(c) = 0, then c is the exact root, and you can stop.
•If f(c) * f(a) < 0, the root is in the interval [a, c]. Replace b with c for the next
iteration.
•If f(c) * f(b) < 0 (or f(c) * f(a) > 0), the root is in the interval [c, b].
• Replace a with c for the next iteration.

[Link]: Continue steps 2–4 until the interval (b - a) is sufficiently small or the
desired error tolerance is met.
Example:
Exercise Problem:

You might also like