Scribd
Upload
29 views8 pages

Khushnawaz Math

The document discusses the bisection method, which is a root-finding algorithm that repeatedly bisects an interval and selects a subinterval in which the root must lie. It provides the definition, algorithm, graphical representation, and an example of using the bisection method to find the root of an equation between 1 and 2.

Uploaded by

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

Khushnawaz Math

The document discusses the bisection method, which is a root-finding algorithm that repeatedly bisects an interval and selects a subinterval in which the root must lie. It provides the definition, algorithm, graphical representation, and an example of using the bisection method to find the root of an equation between 1 and 2.

Uploaded by

mhsanakpur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

BRAINWARE UNIVERSITY

TOPIC : BISECTION METHOD


STUDENT CODE : BWU/BCA/22/605
PRESENTED BY KHUSHNAWAZ AHMED
DEFINITION
The bisection method in mathematics is a root finding
method which repeatedly bisects an interval and then
selects a subinterval in which a root must lie for further
processing.
It is a very simple and robust method, but it is
also relatively slow. Because of this, it is often
used to obtain a rough approximation to a
solution which is then used as a starting point
for more rapidly converging methods. The
method is also called the binary search method
or the dichotomy method.
ALGORITHM
• Step 1: Choose two approximations A and B (B>A) such that
f(A)*f(B)<0
• Step 2: Evaluate the midpoint C of [A,B] given by C=(A+B/2
• Step 3: If f(C)*f(B)<0 then rename B & C as A & B. If not
rename of C as B. Then apply the formula of step 2.
• Step 4: Stop evaluation when the different of two successive
values of C obtained from Step 2 is numerically less than E, the
prescribed accuracy.
GRAPHICALLY
REPRESENTATION
EXAMPLE
Question: Determine the root of the given equation x 2-3 = 0 for x ∈ [1, 2]
Solution:
Given: x2-3 = 0
Let f(x) = x2-3
Now, find the value of f(x) at a= 1 and b=2.
f(x=1) = 12-3 = 1 – 3 = -2 < 0
f(x=2) = 22-3 = 4 – 3 = 1 > 0
The given function is continuous, and the root lies in the interval [1, 2].
Let “c” be the midpoint of the interval.
I.e., c = (1+2)/2
c =3 / 2
c = 1.5
Therefore, the value of the function at “c” is
f(c) = f(1.5) = (1.5)2-3 = 2.25 – 3 = -0.75 < 0
If f(c)<0, assume a = c.
and
If f(c)>0, assume b = c.
f(c) is negative, so a is replaced with c = 1.5 for the next iterations.
The iterations for the given functions are:

Iterations a b c f(a) f(b) f(c)

1 1 2 1.5 -2 1 -0.75

2 1.5 2 1.75 -0.75 1 0.062

3 1.5 1.75 1.625 -0.75 0.0625 -0.359

4 1.625 1.75 1.6875 -0.3594 0.0625 -0.1523

5 1.6875 1.75 1.7188 -01523 0.0625 -0.0457

6 1.7188 1.75 1.7344 -0.0457 0.0625 0.0081

7 1.7188 1.7344 1.7266 -0.0457 0.0081 -0.0189

So, at the seventh iteration, we get the final interval [1.7266, 1.7344]
Hence, 1.7344 is the approximated solution.
THANK YOU

You might also like