Scribd
Upload
2 views1 page

Bisection Method Full Process

The Bisection Method is a numerical technique for finding a root of a continuous function f(x) = 0 by selecting two initial points with opposite signs. The process involves calculating the midpoint, checking the function value, and updating the interval until the desired accuracy is achieved. The method continues iterating until the difference between the interval endpoints is less than a specified tolerance or a maximum number of iterations is reached.

Uploaded by

mridulhasan16260
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
2 views1 page

Bisection Method Full Process

The Bisection Method is a numerical technique for finding a root of a continuous function f(x) = 0 by selecting two initial points with opposite signs. The process involves calculating the midpoint, checking the function value, and updating the interval until the desired accuracy is achieved. The method continues iterating until the difference between the interval endpoints is less than a specified tolerance or a maximum number of iterations is reached.

Uploaded by

mridulhasan16260
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

Bisection Method — Full Process

The Bisection Method is used to find a root of a continuous equation f(x) = 0 when two initial points
have function values of opposite signs.

Algorithm
1. Choose a and b such that:

f(a) × f(b) < 0

This means f(a) and f(b) have opposite signs, so at least one root lies between a and b.

2. Find the midpoint:

c = (a + b) / 2

3. Calculate f(c).

4. Check the root:

If f(c) = 0 → c is the root.

5. Choose the half containing the root:

Condition New interval Update

f(a) × f(c) < 0 [a, c] b=c

f(c) × f(b) < 0 [c, b] a=c

6. Repeat the process


With the new interval [a, b], calculate c = (a+b)/2 again and repeat the same steps.

Stopping Criterion
Stop when the required accuracy is achieved, for example when:

|b − a| < ε

where ε is the allowed error/tolerance. Another common stopping rule is to stop after a specified
number of iterations.

Short Exam Version


1) Choose a, b so that f(a)f(b) < 0.
2) Calculate c = (a+b)/2.
3) Find f(c).
4) If f(c)=0, c is the root.
5) If f(a)f(c)<0, set b=c; otherwise set a=c.
6) Repeat until the required accuracy is obtained.

You might also like