Scribd
Upload
209 views7 pages

Bisection Method

The bisection method is an algorithm for finding the root of a continuous function between two real numbers a and b where f(a) and f(b) have opposite signs. It works by repeatedly bisecting the interval [a,b] and narrowing in on the root. Specifically, it calculates the midpoint x1 of [a,b], evaluates f(x1), and determines if the root lies in [a,x1] or [x1,b]. It then replaces the endpoint of that interval with x1 and repeats, converging on the root. Examples are given of using the bisection method to find roots of specific equations.

Uploaded by

Kauser Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
209 views7 pages

Bisection Method

The bisection method is an algorithm for finding the root of a continuous function between two real numbers a and b where f(a) and f(b) have opposite signs. It works by repeatedly bisecting the interval [a,b] and narrowing in on the root. Specifically, it calculates the midpoint x1 of [a,b], evaluates f(x1), and determines if the root lies in [a,x1] or [x1,b]. It then replaces the endpoint of that interval with x1 and repeats, converging on the root. Examples are given of using the bisection method to find roots of specific equations.

Uploaded by

Kauser Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 7

BISECTION METHOD(BOLZANO METHOD)

This method describes a procedure to locate the


root of the equation f (x)  0, between two real
numbers a and b, ab.
METHOD

Let f (x) be continuous function in the interval  a, b


f (a) fand
(b) and are of opposite
signs. Then we know that there exists aaroot b
f (a)0
between andf (b)0.
Let
(a, b) and .We now bisectx the interval
1
and denote thea mid b point by ,so that
x1 
2
Working Rule

• If f (x1)  0 then x1 is root of f (x)  0.


• If f (x1)  0 ,then the root lies between a and x1 or x1 and b
f (x1)0 or f (x1)0
Case-I: Let f (x1)0 ,then the root lies between a and x1 then the
2n approximation is x2  a  x1 .  f (a)0
2
Case-II: Let f (x1)0 ,then the root lies between x1 and b then the
2n approximation is x  x1  b  f (b)0
2
2

If f (x )  0 then x is root of f (x)  0.


2 2
Continue

• Otherwise( f (x2 )  0 ) the root lies between a and x2 or x2 and


x1 depending on f (x2 )0 or f (x2 )0 .

Now choose that interval in which the root lies and bisect and
continue the process until the root is found desired accuracy.
PROBLEMS

Find a real root of the equation x 1 0 lying between 1


3
I. x
and 2 to three places of decimal by using bisection method.
II. Find the positive real root of the equation x log 10 x  1.2
using bisection method in four iteration.
III. Find positive real root of the equation x  cos x  0 by using
bisection method .
1(v): Find a root of the equation e x
 3x using the
bisection method.
Solution: Let f (x)  e  3x
x

f (0)  e  0  1
0
f (1)  e  3  0.2817
1

Thus root is lying between 0 & 1


Calculations are shown in the table
f (x)  e  3x
x
0 0.5 0.625 0.75 1

+ + - - -
i a b xi 
a  b
f ( xi )
2

f ( 0 . 5 )  0 . 1487
1 0 1 0.5

2 0.5 1 0.75
f ( 0 . 75 )   0 . 133
f ( 0 . 625 )   0 . 0068
3 0.5 0.75 0.625

You might also like