ASSIGNMENT # 01

Course: Numerical Computing

Submission Date: Feb 27,2019

Submitted to: Dr. Nadeem Alam Khan

Group Members:
 M. Iftikhar Uddin Khan Sami (13275)
 Raghib Uddin (13273)
 Hamza Arif (14446)
 Azlan Waseem (15096)
 Raja Zaryab (16566)
 Assignment#1: (G-IV)
(Solution of Algebraic and Transcendental Equations by Iteration Methods)
SECTION CODE :031901061
SUBMISSION DATE:27.2.2019
MARKS: 2.5

COURSE TITLE: Numerical Computing

Q # Find the Positive root of 𝑐𝑜𝑠𝑥 − 𝑥 2 − 𝑥 = 0 , Using Calculator method

(1) Bisection Method

(2) Fixed point iteration Method

(3) Regula-False Position Method

(4) Newton Raphson Method

(5) Chebyshev’s Iteration Method

After that, Comparison between with the help of table which one method gives us
better result with accuracy, then write the conclusion.

2
Using Bisection Method:
𝐿𝑒𝑡 𝑓 (𝑥) = cos(𝑥) − 𝑥 2 − 𝑥

𝐻𝑒𝑟𝑒,
𝑎𝑡 𝑓(0) = cos(0) − 02 − 0 = +1

𝑎𝑡 𝑓(1) = cos(1) − 12 − 1 = −1.4596

𝑆𝑖𝑛𝑐𝑒, 𝑓(0) > 0 𝑎𝑛𝑑 𝑓 (1) < 0, 𝑡ℎ𝑒 𝑟𝑜𝑜𝑡 𝑙𝑖𝑒𝑠 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 0 𝑎𝑛𝑑 1
0+1
𝑊𝑒 𝑡𝑎𝑘𝑒 𝑥0 = = 0.5, 𝑎𝑛𝑑
2
𝑓 (0.5) = cos(0.5) − 0.52 − 0.5 = +0.1275, 𝑤ℎ𝑖𝑐ℎ 𝑖𝑠 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒. 𝐻𝑒𝑛𝑐𝑒, 𝑡ℎ𝑒 𝑟𝑜𝑜𝑡 𝑙𝑖𝑒𝑠 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 0.5 𝑎𝑛𝑑 1
𝑙𝑜𝑤𝑒𝑟 𝑙𝑖𝑚𝑖𝑡 ≫ − − − − −𝑟𝑜𝑜𝑡 − − − −− ≪ 𝑢𝑝𝑝𝑒𝑟 𝑙𝑖𝑚𝑖𝑡

0.5 + 1
𝑥1 = = 0.75 𝑓(0.75) = −0.5808 0.75 > 𝑟𝑜𝑜𝑡 < 0.5
2

0.5 + 0.75
𝑥2 = = 0.625 𝑓 (0.625) = −0.2046 0.625 > 𝑟𝑜𝑜𝑡 < 0.75
2

0.5 + 0.625
𝑥3 = = 0.5625 𝑓(0.5625) = −0.0329 0.5625 > 𝑟𝑜𝑜𝑡 < 0.5
2

0.5 + 0.5625
𝑥4 = = 0.53125 𝑓 (0.53125) = 0.0486 0.53125 > 𝑟𝑜𝑜𝑡 < 0.5
2

0.5 + 0.53125
𝑥5 = = 0.51562 𝑓 (0.51562) = 0.0885 0.51562 > 𝑟𝑜𝑜𝑡 < 0.5
2

0.5 + 0.51562
𝑥6 = = 0.50781 𝑓 (0.50781) = 0.1081 0.50781 > 𝑟𝑜𝑜𝑡 < 0.5
2

0.5 + 0.50781
𝑥7 = = 0.50390 𝑓 (0.50390) = 0.1178 0.50390 > 𝑟𝑜𝑜𝑡 < 0.5
2

0.5 + 0.50390
𝑥8 = = 0.50195 𝑓 (0.50195) = 0.1227 0.50195 > 𝑟𝑜𝑜𝑡 < 0.5
2

0.5 + 0.50195
𝑥9 = = 0.50097 𝑓 (0.50097) = 0.1251 0.50097 > 𝑟𝑜𝑜𝑡 < 0.5
2

0.5 + 0.50097
𝑥10 = = 0.50048 𝑓 (0.50048) = 0.1263 0.50048 > 𝑟𝑜𝑜𝑡 < 0.5
2
𝐻𝑒𝑛𝑐𝑒, 𝑜𝑢𝑟 𝑟𝑒𝑞𝑢𝑖𝑟𝑒𝑑 𝑟𝑜𝑜𝑡 𝑖𝑠 + 0.50048(𝐶𝑜𝑟𝑟𝑒𝑐𝑡𝑒𝑑 𝑢𝑝𝑡𝑜 3 𝐷𝑒𝑐𝑖𝑚𝑎𝑙 𝑃𝑙𝑎𝑐𝑒𝑠) 𝑨𝒏𝒔

3
Using Fixed-point Iteration Method:
𝐿𝑒𝑡 𝑓 (𝑥) = cos(𝑥) − 𝑥 2 − 𝑥

𝐻𝑒𝑟𝑒,
𝑎𝑡 𝑓(0) = cos(0) − 02 − 0 = +1 𝑎𝑛𝑑 𝑎𝑡 𝑓 (1) = cos(1) − 12 − 1 = −1.4596

∴ 𝑂𝑛𝑒 𝑟𝑜𝑜𝑡 𝑙𝑖𝑒𝑠 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 0 𝑎𝑛𝑑 1.

𝑁𝑜𝑤, 𝑓 (𝑥) = 0 𝑔𝑖𝑣𝑒𝑠

cos(𝑥) − 𝑥 2 − 𝑥 = 0

𝑂𝑅 cos(𝑥) = 𝑥 2 + 𝑥
𝑂𝑅 cos(𝑥) = 𝑥(𝑥 + 1)
cos(𝑥)
=> 𝑥 =
(𝑥 + 1)

𝐿𝑒𝑡 𝑥0 = 1

cos( 1 )
𝑥1 = 𝜑(𝑥0 ) = ( )= +0.270
1+1
cos( 0.270 )
𝑥2 = 𝜑(𝑥1 ) = ( )= +0.758
0.270 + 1
cos( 0.758 )
𝑥3 = 𝜑(𝑥2 ) = ( )= +0.413
0.758 + 1
cos( 0.413)
𝑥4 = 𝜑(𝑥3 ) = ( )= +0.648
0.413 + 1
cos( 0.648)
𝑥5 = 𝜑(𝑥4 ) = ( )= +0.483
0.648 + 1
cos( 0.483)
𝑥6 = 𝜑(𝑥5 ) = ( )= +0.597
0.483 + 1
cos( 0.597)
𝑥7 = 𝜑(𝑥6 ) = ( )= +0.517
0.597 + 1
cos( 0.517)
𝑥8 = 𝜑(𝑥7 ) = ( )= +0.573
0.517 + 1
cos( 0.573)
𝑥9 = 𝜑(𝑥8 ) = ( )= +0.534
0.573 + 1
cos( 0.534)
𝑥10 = 𝜑(𝑥9 ) = ( )= +0.561
0.534 + 1
cos( 0.561)
𝑥11 = 𝜑(𝑥10 ) = ( )= +0.542
0.561 + 1
cos( 0.542)
𝑥12 = 𝜑(𝑥11 ) = ( )= +0.565
0.542 + 1

4
 cos( 0.565)
𝑥13 = 𝜑(𝑥12 ) = ( )= +0.546
0.565 + 1
cos( 0.546)
𝑥14 = 𝜑(𝑥13 ) = ( )= +0.552
0.546 + 1
cos( 0.552)
𝑥15 = 𝜑(𝑥14 ) = ( )= +0.548
0.552 + 1
cos( 0.548)
𝑥16 = 𝜑(𝑥15 ) = ( )= +0.551
0.548 + 1
cos( 0.551)
𝑥17 = 𝜑(𝑥16 ) = ( )= +0.549
0.551 + 1
cos( 0.549)
𝑥18 = 𝜑(𝑥17 ) = ( )= +0.550
0.549 + 1
cos( 0.550)
𝑥19 = 𝜑(𝑥18 ) = ( )= +0.550
0.550 + 1

𝑁𝑜𝑤, 𝑥18 = 𝑥19 , 𝑢𝑝𝑡𝑜 3 𝑑𝑒𝑐𝑖𝑚𝑎𝑙 𝑝𝑙𝑎𝑐𝑒𝑠

𝐻𝑒𝑛𝑐𝑒, 𝑎𝑝𝑝𝑟𝑜𝑥𝑖𝑚𝑎𝑡𝑒 𝑣𝑎𝑙𝑢𝑒 𝑜𝑓 𝑟𝑒𝑞𝑢𝑖𝑟𝑒𝑑 𝑟𝑜𝑜𝑡 𝑖𝑠 + 0.550 𝑨𝒏𝒔

5
 Using Regula-False Position Method:
𝐿𝑒𝑡 𝑓 (𝑥) = cos(𝑥) − 𝑥 2 − 𝑥

𝑆𝑖𝑛𝑐𝑒,
𝑎𝑡 𝑓(0) = cos(0) − 02 − 0 = +1 𝑎𝑛𝑑 𝑎𝑡 𝑓 (1) = cos(1) − 12 − 1 = −1.4596

∴ 𝑂𝑛𝑒 𝑟𝑜𝑜𝑡 𝑙𝑖𝑒𝑠 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 0 𝑎𝑛𝑑 1.

𝐿𝑒𝑡 𝑎 = 0 , 𝑏 = 1
𝑇ℎ𝑒𝑛, 𝑓 (𝑎) = +1 , 𝑓 (𝑏) = −1.4596. 𝑂𝑢𝑟 𝐹𝑖𝑟𝑠𝑡 𝐴𝑝𝑝𝑟𝑜𝑥𝑖𝑚𝑎𝑡𝑖𝑜𝑛, 𝑈𝑠𝑖𝑛𝑔 𝐺𝑒𝑛𝑒𝑟𝑎𝑙 𝐹𝑜𝑟𝑚𝑢𝑙𝑎 𝑖𝑠,
𝑎. 𝑓(𝑏) − 𝑏. 𝑓(𝑎) (0). (−1.4596) − (1). (1)
∵ 𝑥1 = => => 0.4065
𝑓 (𝑏) − 𝑓 (𝑎) (−1.4596) − (1)

𝑁𝑜𝑤, 𝑓 (𝑥1 ) = 𝑓(0.4065) = 0.3467

𝑆𝑖𝑛𝑐𝑒, 𝑓(0.4065)𝑖𝑠 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒 𝑎𝑛𝑑 𝑓(1) 𝑖𝑠 𝑛𝑒𝑔𝑎𝑡𝑖𝑣𝑒.

𝑇ℎ𝑒 𝑟𝑜𝑜𝑡 𝑙𝑖𝑒𝑠 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 0.4065 𝑡𝑜 1.

𝑇𝑎𝑘𝑒 𝑎 = 0.4065 , 𝑏 = 1
𝑇ℎ𝑒𝑛, 𝑓 (𝑎) = 0.3467 , 𝑓(𝑏) = −1.4596. 𝑂𝑢𝑟 𝑆𝑒𝑐𝑜𝑛𝑑 𝐴𝑝𝑝𝑟𝑜𝑥𝑖𝑚𝑎𝑡𝑖𝑜𝑛, 𝑈𝑠𝑖𝑛𝑔 𝐺𝑒𝑛𝑒𝑟𝑎𝑙 𝐹𝑜𝑟𝑚𝑢𝑙𝑎 𝑖𝑠,
𝑎. 𝑓(𝑏) − 𝑏. 𝑓(𝑎) (04065). (−1.4596) − (1). (0.3467)
∵ 𝑥2 = => => 0.5204
𝑓 (𝑏) − 𝑓 (𝑎) (−1.4596) − (0.3467)

𝑁𝑜𝑤, 𝑓 (𝑥2 ) = 𝑓(0.5204) = 0.0764

𝑆𝑖𝑛𝑐𝑒, 𝑓(0.5204)𝑖𝑠 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒 𝑎𝑛𝑑 𝑓(1) 𝑖𝑠 𝑛𝑒𝑔𝑎𝑡𝑖𝑣𝑒.

𝑇ℎ𝑒 𝑟𝑜𝑜𝑡 𝑙𝑖𝑒𝑠 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 0.5204 𝑡𝑜 1.

(0). (−1.4596) − (1). (1)

𝑥1 = => 0.4065 𝑓(0.4065) = 0.3467 0.4065 > 𝑟𝑜𝑜𝑡 < 1
(−1.4596) − (1)

(0.4065). (−1.4596) − (1). (0.3467)

𝑥2 = => 0.5204 𝑓(0.5204) = 0.0764 0.5204 > 𝑟𝑜𝑜𝑡 < 1
(−1.4596) − (0.3467)

(0.5204). (−1.4596) − (1). (0.0764)

𝑥3 = => 0.5442 𝑓(0.5442) = 0.0151 0.0151 > 𝑟𝑜𝑜𝑡 < 1
(−1.4596) − (0.0764)

(0.5442). (−1.4596) − (1). (0.0151)

𝑥4 = => 0.5488 𝑓(0.5488) = 0.0003 0.0003 > 𝑟𝑜𝑜𝑡 < 1
(−1.4596) − (0.0151)

(0.5488). (−1.4596) − (1). (0.0003)

𝑥5 = => 0.5488 𝑓(0.5488) = 0.0003 0.0003 > 𝑟𝑜𝑜𝑡 < 1
(−1.4596) − (0.0003)
𝐻𝑒𝑛𝑐𝑒, 𝑜𝑢𝑟 𝑟𝑒𝑞𝑢𝑖𝑟𝑒𝑑 𝑟𝑜𝑜𝑡 𝑖𝑠 + 0.5488 (𝐶𝑜𝑟𝑟𝑒𝑐𝑡𝑒𝑑 𝑢𝑝𝑡𝑜 4 𝐷𝑒𝑐𝑖𝑚𝑎𝑙 𝑃𝑙𝑎𝑐𝑒𝑠) 𝑨𝒏𝒔

6
Using Newton- Raphson Method:
𝒅
𝐻𝑒𝑟𝑒, 𝑓 (𝑥) = cos(𝑥) − 𝑥 2 − 𝑥 ==>> 𝑓 ′(𝑥) = −sin(x) − 2𝑥 − 1 〈∵
𝒅𝒙
(𝒙𝒏 ) = (𝒏. 𝒙)𝒏−𝟏 〉

𝑎𝑛𝑑 𝑎𝑡 𝑓 (0) = cos(0) − 02 − 0 = +1 > 0 𝑎𝑡 𝑓(1) = cos(1) − 12 − 1 = −1.4596 < 0

∴ 𝐻𝑒𝑛𝑐𝑒, 𝑡ℎ𝑒 𝑟𝑜𝑜𝑡 𝑙𝑖𝑒𝑠 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 0 𝑎𝑛𝑑 1.

𝑊𝑒 𝑘𝑛𝑜𝑤, 𝑁𝑒𝑤𝑡𝑜𝑛 𝑅𝑎𝑝ℎ𝑠𝑜𝑛 𝐹𝑜𝑟𝑚𝑢𝑙𝑎,
𝑓(𝑥)
∵ 𝑥𝑛+1 = 𝑥𝑛 −
𝑓′(𝑥)
cos(𝑥𝑛 ) − 𝑥𝑛 2 − 𝑥𝑛
∴ 𝑥𝑛+1 = 𝑥𝑛 −
−sin(x𝑛 ) − 2𝑥𝑛 − 1
𝐿𝑒𝑡, 𝑥0 = 0,

𝐹𝑖𝑟𝑠𝑡 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛:
cos(𝑥0 ) − 𝑥0 2 − 𝑥0
𝑥1 = 𝑥0 −
−sin(x0 ) − 2𝑥0 − 1
cos(0) − (0)2 − (0)
𝑥1 = 0− => 1
− sin(0) − 2(0) − 1

𝑆𝑒𝑐𝑜𝑛𝑑 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛:
cos(𝑥1 ) − 𝑥1 2 − 𝑥1
𝑥2 = 𝑥1 −
−sin(x1 ) − 2𝑥1 − 1
cos(1) − (1)2 − (1)
𝑥2 = 1− => 0.62001
− sin(1) − 2(1) − 1

𝑇ℎ𝑖𝑟𝑑 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛:
cos(𝑥2 ) − 𝑥2 2 − 𝑥2
𝑥3 = 𝑥2 −
−sin(x2 ) − 2𝑥2 − 1
cos(0.62001) − (0.62001)2 − (0.62001)
𝑥3 = 0.62001 − => 0.55246
− sin(0.62001) − 2(0.62001) − 1

𝐹𝑜𝑢𝑟𝑡ℎ 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛:
cos(𝑥3 ) − 𝑥3 2 − 𝑥3
𝑥4 = 𝑥3 −
−sin(x3 ) − 2𝑥3 − 1
cos(0.55246) − (0.55246)2 − (0.55246)
𝑥4 = 0.55246 − => 0.55001
− sin(0.55246) − 2(0.55246) − 1

𝐹𝑖𝑓𝑡ℎ 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛:
cos(𝑥4 ) − 𝑥4 2 − 𝑥4
𝑥5 = 𝑥4 −
−sin(x4 ) − 2𝑥4 − 1
cos(0.55001) − (0.55001)2 − (0.55001)
𝑥5 = 0.55001 − => 0.55000
− sin(0.55001) − 2(0.55001) − 1

𝑆𝑖𝑥𝑡ℎ 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛:
cos(𝑥5 ) − 𝑥5 2 − 𝑥5
𝑥6 = 𝑥5 −
−sin(x5 ) − 2𝑥5 − 1
cos(0.55000) − (0.55000)2 − (0.55000)
𝑥6 = 0.55000 − => 0.55000
− sin(0.55000) − 2(0.55000) − 1

7
∴ 𝑅𝑒𝑞𝑢𝑖𝑟𝑒𝑑 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒 𝑟𝑜𝑜𝑡 𝑖𝑠 0.55000 (𝐶𝑜𝑟𝑟𝑒𝑐𝑡𝑒𝑑 𝑢𝑝𝑡𝑜 5 𝑑𝑒𝑐𝑖𝑚𝑎𝑙 𝑝𝑙𝑎𝑐𝑒𝑠) 𝑨𝒏𝒔

Using Chebyshev’s Iteration Method:

𝐻𝑒𝑟𝑒, 𝑡ℎ𝑒 𝑔𝑖𝑣𝑒𝑛 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 𝑖𝑠 cos(𝑥) − 𝑥 2 − 𝑥

𝑙𝑒𝑡 𝑓(𝑥) = cos(𝑥) − 𝑥 2 − 𝑥

𝑤ℎ𝑒𝑛 𝑥 = 0, 𝑓 (0) = cos(0) − 02 − 0 = +1 > 0

𝑤ℎ𝑒𝑛 𝑥 = 1, 𝑓 (1) = cos(1) − 12 − 1 = −1.4596 < 0

𝑤ℎ𝑒𝑛 𝑥 = 0.5, 𝑓 (0.5) = cos(0.5) − 0.52 − 0.5 = +0.1275 > 0

𝑤ℎ𝑒𝑛 𝑥 = 0.6, 𝑓(0.6) = cos(0.6) − 0.62 − 0.6 = −0.1346 < 0

∴ 𝐻𝑒𝑛𝑐𝑒, 𝑡ℎ𝑒 𝑟𝑜𝑜𝑡 𝑙𝑖𝑒𝑠 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 0.5 𝑎𝑛𝑑 0.6 .

𝐴𝑐𝑐𝑜𝑟𝑑𝑖𝑛𝑔 𝑡𝑜 𝐶ℎ𝑒𝑏𝑦𝑠ℎ𝑒𝑣 ′ 𝑠 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛 𝑀𝑒𝑡ℎ𝑜𝑑,

𝑓 (𝑥𝑛 ) 1 [𝑓(𝑥𝑛 )]2

∵ 𝑥𝑛+1 = 𝑥𝑛 − − ( ) × 𝑓′′(𝑥𝑛 )
𝑓 ′ (𝑥𝑛 ) 2 [𝑓 ′ (𝑥𝑛 )]3
𝒅
∵ 𝑓 (𝑥) = cos(𝑥) − 𝑥 2 − 𝑥 〈∵
𝒅𝒙
(𝒙𝒏 ) = (𝒏. 𝒙)𝒏−𝟏 〉

∴ 𝑓 ′(𝑥) = −sin(x) − 2𝑥 − 1

∴ 𝑓 ′′(𝑥) = −cos(x) − 2

𝑝𝑢𝑡 𝑛 = 0, 𝑥0 = 0.5

𝑥1 = 𝑓 (𝑥) = 𝑓(0.5) = +0.1275 => +0.54988

𝑓 ′ (𝑥) = 𝑓′(0.5) = −2.4794
𝑓 ′′ (𝑥) = 𝑓′′(0.5) = −2.8775
𝑝𝑢𝑡 𝑛 = 1, 𝑥1 = 0.5498

𝑥2 = 𝑓 (𝑥) = 𝑓 (0.5498) = 5.49x10−4 => +0.550009

𝑓 ′ (𝑥) = 𝑓′(0.5498) = −2.6221
𝑓 ′′ (𝑥) = 𝑓′′(0.5498) = −2.8526

𝑝𝑢𝑡 𝑛 = 2, 𝑥1 = 0.55001

𝑥3 = 𝑓 (𝑥) = 𝑓 (0.55001) = −1.70x10−6 => +0.550009

𝑓 ′ (𝑥) = 𝑓′(0.55001) = −2.6227
𝑓 ′′ (𝑥) = 𝑓′′(0.55001) = −2.8525
∴ 𝑅𝑒𝑞𝑢𝑖𝑟𝑒𝑑 𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒 𝑟𝑜𝑜𝑡 𝑖𝑠 0.55000 (𝐶𝑜𝑟𝑟𝑒𝑐𝑡𝑒𝑑 𝑢𝑝𝑡𝑜 5 𝑑𝑒𝑐𝑖𝑚𝑎𝑙 𝑝𝑙𝑎𝑐𝑒𝑠) 𝑨𝒏𝒔

8
Comparisons:
𝐹𝑖𝑥𝑒𝑑 𝑝𝑜𝑖𝑛𝑡 𝑅𝑒𝑔𝑢𝑙𝑎 − 𝐹𝑎𝑙𝑠𝑒 𝑁𝑒𝑤𝑡𝑜𝑛 − 𝐶ℎ𝑒𝑏𝑦𝑠ℎ𝑒𝑣′𝑠
𝑁𝑜. 𝑜𝑓 𝐵𝑖𝑠𝑒𝑐𝑡𝑖𝑜𝑛
𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛 𝑃𝑜𝑠𝑖𝑡𝑖𝑜𝑛 𝑅𝑎𝑝ℎ𝑠𝑜𝑛 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛
𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛 𝑀𝑒𝑡ℎ𝑜𝑑
𝑀𝑒𝑡ℎ𝑜𝑑 𝑀𝑒𝑡ℎ𝑜𝑑 𝑀𝑒𝑡ℎ𝑜𝑑 𝑀𝑒𝑡ℎ𝑜𝑑

1 0.75 +0.270 0.4065 1 +0.54988

2 0.625 +0.758 0.5204 0.62001 +0.550009
3 0.5625 +0.413 0.5442 0.55246 +0.550009
4 0.53125 +0.648 0.5488 0.55001
5 0.51562 +0.483 0.5488 0.55000
6 0.50781 +0.597 0.55000
7 0.50390 +0.517
8 0.50195 +0.573
9 0.50097 +0.534
10 0.50048 +0.561
11 +0.542
12 +0.565
13 +0.546
14 +0.552
15 +0.548
16 +0.551
17 +0.549
18 +0.550
19 +0.550
20

Conclusion:
𝐴𝑠 𝑚𝑒𝑛𝑡𝑖𝑜𝑛𝑒𝑑 𝑖𝑛 𝑡ℎ𝑒 𝑎𝑏𝑜𝑣𝑒 𝑐𝑖𝑡𝑒𝑑 𝑡𝑎𝑏𝑙𝑒, 𝐵𝑖𝑠𝑒𝑐𝑡𝑖𝑜𝑛 𝑀𝑒𝑡ℎ𝑜𝑑 𝑝𝑟𝑜𝑣𝑖𝑑𝑒 𝑟𝑒𝑠𝑢𝑙𝑡 𝑢𝑝𝑡𝑜
3𝐷𝑃𝑠 𝑖𝑛 10 𝑖𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛𝑠, 𝐹𝑖𝑥𝑒𝑑 𝑃𝑜𝑖𝑛𝑡 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛 𝑀𝑒𝑡ℎ𝑜𝑑 𝑝𝑟𝑜𝑣𝑖𝑑𝑒 𝑟𝑒𝑠𝑢𝑙𝑡 𝑖𝑛
19 𝑖𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛𝑠 𝑐𝑜𝑟𝑟𝑒𝑐𝑡𝑒𝑑 𝑢𝑝𝑡𝑜 3𝐷𝑃𝑠. 𝑆𝑖𝑚𝑖𝑙𝑎𝑟𝑙𝑦, 𝑅𝑒𝑔𝑢𝑙𝑎 𝐹𝑎𝑙𝑠𝑒 𝑃𝑜𝑠𝑖𝑡𝑖𝑜𝑛 𝑚𝑒𝑡ℎ𝑜𝑑

𝑝𝑟𝑜𝑣𝑖𝑑𝑒 𝑟𝑒𝑢𝑙𝑡 𝑢𝑝𝑡𝑜 4𝐷𝑃𝑠 𝑖𝑛 5 𝑖𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛𝑠, 𝑤ℎ𝑖𝑙𝑒 𝑁 − 𝑅 𝑚𝑒𝑡ℎ𝑜𝑑 𝑝𝑟𝑜𝑣𝑖𝑑𝑒𝑠 𝑟𝑒𝑠𝑢𝑙𝑡 𝑢𝑝𝑡𝑜
5𝐷𝑃𝑠 𝑖𝑛 𝑜𝑛𝑙𝑦 6 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛𝑠 𝑎𝑛𝑑
𝐶ℎ𝑒𝑏𝑦𝑠ℎ𝑒𝑣 ′ 𝑠𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛 𝑀𝑒𝑡ℎ𝑜𝑑 𝑝𝑟𝑜𝑣𝑖𝑑𝑒 𝑟𝑒𝑠𝑢𝑙𝑡 𝑢𝑝𝑡𝑜 6𝐷𝑃𝑠 𝑖𝑛 𝑜𝑛𝑙𝑦 3 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛𝑠.
𝑆𝑜, 𝐼𝑡 𝑖𝑠 𝑐𝑙𝑒𝑎𝑟 𝑡ℎ𝑎𝑡 𝐶ℎ𝑒𝑏𝑦𝑠ℎ𝑒𝑣 ′ 𝑠 𝐼𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛 𝑀𝑒𝑡ℎ𝑜𝑑 𝑐𝑎𝑛 𝑝𝑟𝑜𝑣𝑖𝑑𝑒 𝑟𝑒𝑠𝑢𝑙𝑡 𝑤𝑖𝑡ℎ 𝑙𝑒𝑠𝑠 𝑛𝑜. 𝑜𝑓 𝑠𝑡𝑒𝑝𝑠
𝑎𝑙𝑜𝑛𝑔 𝑤𝑖𝑡ℎ 𝑏𝑒𝑠𝑡 𝑎𝑐𝑐𝑢𝑟𝑎𝑐𝑦 𝑎𝑠 𝑐𝑜𝑚𝑝𝑎𝑟𝑒𝑑 𝑡𝑜 𝑜𝑡ℎ𝑒𝑟 𝑖𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛 𝑚𝑒𝑡ℎ𝑜𝑑𝑠.

Group Members:
 M. Iftikhar Uddin Khan Sami (13275)
 Raghib Uddin (13273)
 Hamza Arif (14446)
 Azlan Waseem (15096)
 Raja Zaryab (16566)
9