0% found this document useful (0 votes)
7 views

Chap-2.Fixed Iteration Method

The document outlines the Fixed Point Iteration Method for solving algebraic and transcendental equations, detailing the steps involved in finding a root of a given function. It includes a specific example using the equation Sin x - 5x + 2 = 0, demonstrating the iterative process and convergence to the root. The method is characterized by successive approximations until the desired accuracy is achieved.

Uploaded by

yousufimam15963
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
0% found this document useful (0 votes)
7 views

Chap-2.Fixed Iteration Method

The document outlines the Fixed Point Iteration Method for solving algebraic and transcendental equations, detailing the steps involved in finding a root of a given function. It includes a specific example using the equation Sin x - 5x + 2 = 0, demonstrating the iterative process and convergence to the root. The method is characterized by successive approximations until the desired accuracy is achieved.

Uploaded by

yousufimam15963
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
You are on page 1/ 22

Chapter 02

Solution of Algebraic
and Transcendental
Equations
3. Fixed Point Iteration Method
Procedure of Fixed Point Iteration Method:

Step 1 : Find the function = 𝒇 (𝒙) from the given


Equation.

3
Let, x  x 2
 1 0

Given, f ( x)  x  x 1
3 2
Step 2 : Choose , two real numbers 𝑎 and 𝑏
such that , 𝑓 (𝑎) × 𝑓 (𝑏) < 0
3
Let, x  x 2
 1 0

Given, f ( x)  x  x 1 For , b 1  f (b)  b  b 1


3 2 3 2

 f (1) 1  1  1   1  0
3 2

For , a  0, f (a)  a  a 13 2

 f (0)  0  0  1   1
3 2
For , a  x   1, f (a)  a  a 1
3 2

 f (1)  (1)  (1)  1   1  0


3 2

For , b  x  2  f (b)  b  b 1
3 2

 f (2)  2  2  2   10  0
3 2

 f (a )  f (b)  f (0)  f (1)  (1) 1   1  0

Since , 𝒇 𝒂 = 𝒇( 𝟎) is negative and 𝒇( 𝒃 ) = 𝒇(𝟏) is


positive so at least one real root lies between 0 and 1.
Step 3 :
Convert from the given equation 𝑓(𝑥) = 0 into the form
of 𝑥 = 𝑔(𝑥) .
The successive approximation is given by,
𝑥𝑛+1 = 𝑔 𝑥𝑛 … … … (1)
The given equation is  ( x)...
x  x 1  0
3 2

 x ( x  1) 1
2
1
x  2

( x  1)
1  ( x)...
x
( x  1)

1
 g ( x)  x  ( say )
( x  1)

1
∴ 𝑥𝑛+1 = 𝑔(𝑥𝑛 ) = … … … (2)
1 + 𝑥𝑛
Step 4 : Find g ( x) and g ( x) 1 for x  a, b 
1
g ( x) 
( x  1)
Find g ( x) and check g ( x) 1 for x  a, b 
d d 1
 g ( x) 
dx dx ( x  1)
1 1
d  1  1
 g ( x)  ( x  1) 2
  ( x  1) 2
dx 2
3
1 
  ( x  1) 2
2
3
1 
g  ( x )   (1  x) 2
2 Find g ( x) and check g ( x) 1 for x  a, b 

3
1 
 g  ( x )   (1  x) 2
2

𝑤𝑒 𝑡𝑎𝑘𝑒, 𝑥 = 0.5 𝑡ℎ𝑒𝑛,



1 −
3
∴ 𝑔 (0.5) = − 1 + 0.5 2 < 1 𝑓𝑜𝑟 𝑥 ∈ (0,1)
2
Step 5 : Let , the initial value , x  x0  (a , b) and putting the value, n  0 in the above equation (1)

we are capable to find the successive improved approximations are as follows:

𝑥𝑛+1 = 𝑔 𝑥𝑛 … … … (1) 1
𝑥𝑛+1 = 𝑔(𝑥𝑛 ) = … … … (2)
1 + 𝑥𝑛
Putting 𝑛 = 0, and let the initial value
𝑥 = 𝑥0 in equation (1) For, 𝑛 = 0, and 𝑥 = 𝑥0 = 0 (say)
[From interval 0,1 ] in equation (2)
𝑥0+1 = 𝑔 𝑥0 1
First approximatevalue , x1  g ( x0 ) 
𝑥1 = 𝑔 𝑥0 1  x0
1
for x0  0  x1  g (0)  1
Putting , 𝑛 = 0 and then take 1 0
initial value and then find
first approximate value.
Step 5 (Remain Part) :

Again, substituting the value of x  x1 in the equation of (1)


Then we get , 2nd approximate value, x2  g ( x1 )
1
First approximate value , x1  g (0)  1 Similarly find
1 0 the 2nd
approximate
1 1
for x  x1 1  x2  g ( x1 )    0.7071 value
1  x1 11

2nd approximate value, x2  0.7071


Similarly find
Step 5 (Remain Part) : the 3rd & 4-th
approximate
value
Similarly ,
1
x3  g ( x2 ) x3  g ( x2 ) 
1  x2
x4  g ( x3 ) for x  x2  0.7071
1 1
 x3  g ( x2 )    0.7654
1  0.7071 1.7071
1 1
 x4  g ( x3 )    0.7526
1  0.7654 1.7654
Step 5 (Remain Part) : 1
x5  g ( x4 ) 
Similarly , 𝑥5 = 𝑔 𝑥4 1  x4
………………. for x  x4  0.7526
……………….
1 1
……………….  x5  g ( x4 )    0.7554
𝑥𝑛+1 = 𝑔 𝑥𝑛 1  0.7526 1.7526

1 1
Therefore the iterative formula for successive  x6  g ( x5 )    0.7548
approximation method is, 1  0.7554 1.7554
1 1
∴ 𝑥𝑛+1 = 𝑔 𝑥𝑛 for 𝑛 = 0,1,2,3, … … etc  x7  g ( x6 )    0.7549
1  0.7548 1.7548
Here, 𝑥𝑛+1 is the 𝑛 + 1 − 𝑡ℎ approximation of the
desired root of 𝑓(𝑥) = 0 1 1
 x8  g ( x7 )    0.7549
1  0.7549 1.7548
Step 6 : We shall continue this iterative cycle until the values of two successive
approximations are almost equal.

1 1
 x7  g ( x6 )    0.7549
1  0.7548 1.7548
1 1
 x8  g ( x7 )    0.7549
1  0.7549 1.7548

sin ce , x7  x8
Hence the require root is 0.7549.

This above mentioned method is known as Iteration method. Or Method of successive


approximation or Fixed point Iteration.
Problem 1 : Find the real root of the equation Sin x  5 x  2  0 that lies on [0, 1] using fixed
point iteration method.

Solution: Given That , Sin x  5 x  2  0


You have to do mode
on radian to your
Let , f ( x)  Sin x  5 x  2  0 calculator.

 f ( x)  Sin x  5 x  2

For x  0, f (0)  sin 0  5  0  2  2  0


For x 1, f (1)  sin1  5 1  2   2.1585290152  0

Since 𝑓(0) and 𝑓(1) are the opposite sign , So the root lies on [0, 1]
Step 3 : Test
Now we rewrite the equation f(x) = 0
2  Sin x
Step 2:  g ( x) 
Sin x  5 x  2  0 5
d  2  Sin x   g ( x)  1 d 2  Sin x
 Sin x  5 x  2  0
d
g ( x)     
dx dx  5  5 dx
  5 x   2  Sin x 1 d d
 ( 2  Sin x )
5 dx dx
 5 x  2  Sin x 1 1
 (0  cos x )  cos x
2  Sin x 5 5
 x
5 1
 g ( x)  cos x
5
1
 g ( x)  cos x
2  Sin x 5
x
5 1
 cos 0 for (0,1)
2  Sin x 5
 g ( x)  x  ..........(1)
5 1
 g ( x)  .1  1 for (0,1)
5
You have to do mode
Step 4: on radian to your
calculator
We take Initial Value, 𝑥 = 𝑥0 = 0.5
Then successive approximation using fixed point iteration method are tabulated below.
Step 5:
2 + sin 𝑥𝑛
Values of n Valuesof xn 𝑥𝑛+1 = 𝑔 𝑥𝑛 =
5
0 𝒙𝟎 = 𝟎. 𝟓 𝒙𝟏 = 𝟎. 𝟒𝟗𝟓𝟖𝟖𝟓𝟏𝟎𝟕
1 𝒙𝟏 = 𝟎. 𝟒𝟗𝟓𝟖𝟖𝟓𝟏𝟎𝟕 𝒙𝟐 = 𝟎. 𝟒𝟗𝟓𝟏𝟔𝟐𝟎𝟔𝟔𝟑
2 𝒙𝟐 = 𝟎. 𝟒𝟗𝟓𝟏𝟔𝟐𝟎𝟔𝟔𝟑 𝒙𝟑 = 𝟎. 𝟒𝟗𝟓𝟎𝟑𝟒𝟖𝟓𝟏𝟕
3 𝐱 𝟑 = 𝟎. 𝟒𝟗𝟓𝟎𝟑𝟒𝟖𝟓𝟏𝟕 𝒙𝟒 = 𝟎. 𝟒𝟗𝟓𝟎𝟏𝟐𝟒𝟔𝟑
4 𝑥4 = 𝟎. 𝟒𝟗𝟓𝟎𝟏𝟐𝟒𝟔𝟑 𝒙𝟓 = 𝟎. 𝟒𝟗𝟓𝟎𝟎𝟖𝟓𝟐𝟑𝟖
5 𝒙𝟓 = 𝟎. 𝟒𝟗𝟓𝟎𝟎𝟖𝟓𝟐𝟑𝟖 𝒙𝟔 = 𝟎. 𝟒𝟗𝟓𝟎𝟎𝟕𝟖𝟑𝟎𝟒

Since 𝑥6 − 𝑥5 ≈ 0.000001
Hence the root of the given equation is equal to 0.49501.
Problem 2:
Find the real root of the equation 𝒙 − 𝒍𝒏 𝒙 − 𝟐 = 𝟎 that lies on [3, 4] using fixed point iteration
method.

Solution: Let , f ( x)  x  ln x  2  0

For x  3, f (3)  3  ln 3  2 For x  4, f (4)  4  ln 4  2


 0.0986  0  0.61370  0

Hence there exist a root in [3, 4].

Now,
x  ln x  2  0
1
 x  ln x  2  g ( x)   0
x
 g ( x )  x  ln x  2 ( say ) 1
 g ( x) 
x
For (3, 4)
1
 g (3)  1
3

Now let the initial value , x  x0  3

Then successive approximation using fixed point iteration method are tabulated below.
Values of 𝑛 Valuesof xn 𝑥𝑛+1 = 𝑔 𝑥𝑛 = ln 𝑥𝑛 + 2

0 𝒙𝟎 = 𝟑 𝒙𝟏 = 𝟑. 𝟎𝟗𝟖𝟔𝟏𝟐𝟐𝟖𝟗
1 𝒙𝟏 = 𝟑. 𝟎𝟗𝟖𝟔𝟏𝟐𝟐𝟖𝟗 𝒙𝟐 = 𝟑. 𝟏𝟑𝟎𝟗𝟓𝟒𝟑𝟔𝟐
2 𝒙𝟐 = 𝟑. 𝟏𝟑𝟎𝟗𝟓𝟒𝟑𝟔𝟐 𝒙𝟑 = 𝟑. 𝟏𝟒𝟏𝟑𝟑𝟕𝟖𝟔𝟔
3 𝒙𝟑 = 𝟑. 𝟏𝟒𝟏𝟑𝟑𝟕𝟖𝟔𝟔 𝒙𝟒 = 𝟑. 𝟏𝟒𝟒𝟔𝟒𝟖𝟕𝟖𝟏
4 𝒙𝟒 = 𝟑. 𝟏𝟒𝟒𝟔𝟒𝟖𝟕𝟖𝟏 𝒙𝟓 = 𝟑. 𝟏𝟒𝟓𝟕𝟎𝟐𝟐𝟎𝟗
5 𝒙𝟓 = 𝟑. 𝟏𝟒𝟓𝟕𝟎𝟐𝟐𝟎𝟗 𝒙𝟔 = 𝟑. 𝟏𝟒𝟔𝟎𝟑𝟕𝟏𝟒𝟑
6 𝒙𝟔 = 𝟑. 𝟏𝟒𝟔𝟎𝟑𝟕𝟏𝟒𝟑 𝒙𝒙𝟕𝟕 == 𝟑.
𝟑.𝟏𝟒𝟔𝟏𝟒𝟑𝟔𝟏𝟏
𝟏𝟒𝟔𝟏𝟒𝟑𝟔𝟏𝟏
7 𝒙𝟕 = 𝟑. 𝟏𝟒𝟔𝟏𝟒𝟑𝟔𝟏𝟏 𝒙𝒙𝟖𝟖 =
= 𝟑.
𝟑.𝟏𝟒𝟔𝟏𝟕𝟕𝟒𝟓𝟐
𝟏𝟒𝟔𝟏𝟕𝟕𝟒𝟓𝟐

Since 𝑥8 − 𝑥7 ≈ 0.00001
Hence the root of the given equation is equal to 3.1462
Algorithm for Iteration method:

Steps Task
01 Define 𝑔(𝑥)
02 Read initial value, 𝑥0
03 Set 𝑛 = 0
04 𝑥𝑛+1 = 𝑔(𝑥𝑛 )
05 If 𝑥𝑛+1 − 𝑥𝑛 ≈ 0.0001
Then go to step 6
Else
𝑛 =𝑛+1
Go to step 4
End if

06 Print 𝑥𝑛+1 ,the desired root


07 Stop
Practice Work
Find the root of the following equation by using Iteration method :

1. 2 x  ln x  7 correct to 4 decimal places

2. 3 x  sin x  e correct to 3 decimal places.


x

3. cos x  3 x 1 correct to 3 decimal places.


4. e x tan x =1 correct to 3 decimal
5. 3 x  ln10 x  7 correct to 4 decimal places

You might also like