Scribd
Upload
23 views

Bisection Method

The document discusses the bisection method for finding roots of polynomial equations. It defines the bisection method, provides the algorithm and steps for it, and gives an example of using it to find the root of an equation. The bisection method works by repeatedly subdividing an interval containing the root until the interval is smaller than a given accuracy level.

Uploaded by

fictionlight30
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
23 views

Bisection Method

The document discusses the bisection method for finding roots of polynomial equations. It defines the bisection method, provides the algorithm and steps for it, and gives an example of using it to find the root of an equation. The bisection method works by repeatedly subdividing an interval containing the root until the interval is smaller than a given accuracy level.

Uploaded by

fictionlight30
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Mathematical Structures for Computer

DEPARTMENT OF MATHEMATICS

Science

Programme B.Sc. CT

Solution of Numerical
Unit I
Algebraic and Transcendental
equations
DEPARTMENT OF MATHEMATICS

Text Books
Solution of Numerical Algebraic and Transcendental equations

1. Bisection Method

2. Newton Raphson Method

3. Regular-Falsi Method

4. Gauss Elimination Method

5. Gauss Jordan Method and Gauss Seidal method


DEPARTMENT OF MATHEMATICS

Bisection Method Definition


The bisection method is used to find the roots of a
polynomial equation.
It separates the interval and subdivides the interval in
which the root of the equation lies.
The principle behind this method is the intermediate
theorem for continuous functions.
It works by narrowing the gap between the positive
and negative intervals until it closes in on the correct
answer.
DEPARTMENT OF MATHEMATICS

This method narrows the gap by taking the average


of the positive and negative intervals.
It is a simple method and it is relatively slow.
The bisection method is also known as interval
halving method, root-finding method, binary search method
or dichotomy method.
DEPARTMENT OF MATHEMATICS

Let us consider a continuous function “f” which is


defined on the closed interval [a, b], is given with f(a) and
f(b) of different signs.
Then there exists a point x belong to (a, b) for which
f(x) = 0.
Algorithm
Bisection method Steps (Rule)
Step-1: Find points a and b such that a < b and
f(a) ⋅ f(b) < 0.
Step-2: Take the interval [a, b] and
a+b
find next value x 0 =
2
Step-3:
( )
If f x 0 = 0 then x 0 is an exact root,

( )
else if f(a) ⋅ f x 0 < 0 then b = x 0,
( )
else if f x 0 ⋅ f(b) < 0 then a = x 0.

Step-4:
()
Repeat steps 2 & 3 until f x i = 0 or

|f (xi )| ≤ Accuracy
Example-1
Find a root of an equation f(x) = x 3 - x - 1 using Bisection method

Solution:
Here x 3 - x - 1 = 0

Let f(x) = x 3 - x - 1

Here
x 0 1 2
f(x) -1 -1 5

1 st iteration :

Here f(1) = - 1 < 0 and f(2) = 5 > 0

∴ Now, Root lies between 1 and 2


1+2
x0 = = 1.5
2

( )
f x 0 = f(1.5) = 0.875 > 0

2 nd iteration :

Here f(1) = - 1 < 0 and f(1.5) = 0.875 > 0

∴ Now, Root lies between 1 and 1.5

1 + 1.5
x1 = = 1.25
2

( )
f x 1 = f(1.25) = - 0.29688 < 0
3 rd iteration :

Here f(1.25) = - 0.29688 < 0 and f(1.5) = 0.875 > 0

∴ Now, Root lies between 1.25 and 1.5

1.25 + 1.5
x2 = = 1.375
2

( )
f x 2 = f(1.375) = 0.22461 > 0

4 th iteration :

Here f(1.25) = - 0.29688 < 0 and f(1.375) = 0.22461 > 0

∴ Now, Root lies between 1.25 and 1.375


1.25 + 1.375
x3 = = 1.3125
2

( )
f x 3 = f(1.3125) = - 0.05151 < 0

5 th iteration :

Here f(1.3125) = - 0.05151 < 0 and f(1.375) = 0.22461 > 0

∴ Now, Root lies between 1.3125 and 1.375

1.3125 + 1.375
x4 = = 1.34375
2

( )
f x 4 = f(1.34375) = 0.08261 > 0
6 th iteration :

Here f(1.3125) = - 0.05151 < 0 and f(1.34375) = 0.08261 > 0

∴ Now, Root lies between 1.3125 and 1.34375

1.3125 + 1.34375
x5 = = 1.32812
2

( )
f x 5 = f(1.32812) = 0.01458 > 0

7 th iteration :

Here f(1.3125) = - 0.05151 < 0 and f(1.32812) = 0.01458 > 0

∴ Now, Root lies between 1.3125 and 1.32812


1.3125 + 1.32812
x6 = = 1.32031
2

( )
f x 6 = f(1.32031) = - 0.01871 < 0

8 th iteration :

Here f(1.32031) = - 0.01871 < 0 and f(1.32812) = 0.01458 > 0

∴ Now, Root lies between 1.32031 and 1.32812

1.32031 + 1.32812
x7 = = 1.32422
2

( )
f x 7 = f(1.32422) = - 0.00213 < 0
9 th iteration :

Here f(1.32422) = - 0.00213 < 0 and f(1.32812) = 0.01458 > 0

∴ Now, Root lies between 1.32422 and 1.32812

1.32422 + 1.32812
x8 = = 1.32617
2

( )
f x 8 = f(1.32617) = 0.00621 > 0

10 th iteration :

Here f(1.32422) = - 0.00213 < 0 and f(1.32617) = 0.00621 > 0

∴ Now, Root lies between 1.32422 and 1.32617


1.32422 + 1.32617
x9 = = 1.3252
2

( )
f x 9 = f(1.3252) = 0.00204 > 0

11 th iteration :

Here f(1.32422) = - 0.00213 < 0 and f(1.3252) = 0.00204 > 0

∴ Now, Root lies between 1.32422 and 1.3252

1.32422 + 1.3252
x 10 = = 1.32471
2

( )
f x 10 = f(1.32471) = - 0.00005 < 0
Approximate root of the equation x 3 - x - 1 = 0 using Bisection method is
1.32471

a+b
n a f(a) b f(b) c= f(c) Update
2
1 1 -1 2 5 1.5 0.875 b=c
2 1 -1 1.5 0.875 1.25 -0.29688 a=c
3 1.25 -0.29688 1.5 0.875 1.375 0.22461 b=c
4 1.25 -0.29688 1.375 0.22461 1.3125 -0.05151 a=c
5 1.3125 -0.05151 1.375 0.22461 1.34375 0.08261 b=c
6 1.3125 -0.05151 1.34375 0.08261 1.32812 0.01458 b=c
7 1.3125 -0.05151 1.32812 0.01458 1.32031 -0.01871 a=c
8 1.32031 -0.01871 1.32812 0.01458 1.32422 -0.00213 a=c
9 1.32422 -0.00213 1.32812 0.01458 1.32617 0.00621 b=c
10 1.32422 -0.00213 1.32617 0.00621 1.3252 0.00204 b=c
11 1.32422 -0.00213 1.3252 0.00204 1.32471 -0.00005 a=c
DEPARTMENT OF MATHEMATICS

Summary
DEPARTMENT OF MATHEMATICS

Thank You

You might also like