CSE330: Numerical Methods
Assignment 1 Solution
1. Use Bi-section method to find the root of the following equations up to 3rd iterations
in the range mentioned
a. − − + = , =− . =− .
( ) ( ) ( )∗ ( )
-196.57 13.008 -2557 <0
As ( )∗ ( ) < , there is a root between and .
Iteration
( ) ( ) ( )∗ ( ) sign %Error
Count
1 -6.2 -2.8 -4.5 -196.57 -49.875 9803.829 + ve -
2 -4.5 -2.8 -3.65 -49.875 -9.7996 488.7562969 - ve 23.2877%
3 -4.5 -3.65 -4.075 -49.875 -27.449 1368.996275 + ve 10.4294%
b. − + + = , = . = .
( ) ( ) ( )∗ ( )
-174.38 -307.77 53667 >0
As ( )∗ ( ) > , there is no root between and .
c. + − = , =− =
( ) ( ) ( )∗ ( )
-6.45969769 0.01001 -0.0646 <0
As ( )∗ ( ) < , there is a root between and .
Iteration
( ) ( ) ( )∗ ( ) sign %Error
Count
1 -1 3 1 -6.45969769 -2.45969769 15.88890352 + ve -
2 1 3 2 -2.45969769 -1.41614684 3.483293108 + ve 50%
3 2 3 2.5 -1.41614684 -0.80114362 1.134536997 + ve 20%
2. Use false position method to find the root of the following equations up to 3rd
iterations in the range mentioned
a. + − − = , = . = .
( ) ( ) ( )∗ ( )
-10.608 24.864 -263.76 <0
As ( )∗ ( ) < , there is a root between and .
Iteration
( ) ( ) ( ) ( )∗ ( ) sign %Error
Count
1 2.8 3.4 2.97943 -10.608 24.864 -1.14548965 12.15135419 + ve -
2 2.97943 3.4 2.99795 -1.1455 24.864 -0.11451283 0.131173263 + ve 0.61783%
3 2.99795 3.4 2.9998 -0.1145 24.864 -0.01135797 0.001300633 + ve 0.06144%
b. − = , = =
( ) ( ) ( )∗ ( )
-3 1.63129 -4.8939 <0
As ( )∗ ( ) < , there is a root between and .
Iteration
( ) ( ) ( ) ( )∗ ( ) sign %Error
Count
1 0 4 2.59107 -3 1.63129 -4.59045218 13.77135654 + ve -
2 2.59107 4 3.63059 -4.59045218 1.63129 -1.06815047 4.903293665 + ve 28.6322
3 3.63059 4 3.77676 -1.06815047 1.63129 -0.21627588 0.231015183 + ve 3.87031
c. + − = , =− =
( ) ( ) ( )∗ ( )
3.47976 -3.2769 -11.403 <0
As ( )∗ ( ) < , there is a root between and .
Iteration
( ) ( ) ( ) ( )∗ ( ) sign %Error
Count
1 -1 3 1.06004 3.47975867 -3.2769 -2.02707391 -7.053728007 - ve -
2 -1 1.06004 0.30173 3.47975867 -2.0271 -1.88558738 -6.561389022 - ve 251.315%
3 -1 0.30173 -0.1557 3.47975867 -1.8856 -1.94101878 -6.754276933 - ve 293.735%
3. Use Newton Raphson method to find the root of the following equations up to 3
iterations in the range given if the error tolerance is not mentioned.
a. − . = , = . , ∈= . %
( )=− −
= −( − )
Iteration
( ) ′( ) % Error
Count
1 0.2 -0.4672508 0.29474307 1.78528161 88.7972856%
2 1.78528161 0.03465731 0.06430401 1.24632121 43.2441005%
3 1.24632121 -0.0533272 0.27011323 1.44374641 13.6745066%
b. + − + = , =
( )= + −
Iteration
( ) ′( ) % Error
Count
1 2 21 38 1.44736842 38.1818182%
2 1.44736842 5.46508237 18.83241 1.15717283 25.0779819%
3 1.15717283 1.27194522 10.2347133 1.03289527 12.0319616%
c. + − = , =
( )= ( )− ( )
= − ( ( )− ( ))
Iteration
( ) ′( ) % Error
Count
1 1 -2.5068494 -2.65088853 0.05433617 1740.39487%
2 0.05433617 -1.8974405 1.771284824 1.12555884 95.1725167%
3 1.12555884 -2.8516723 -2.81282696 0.11174879 907.222427%
4. Use Secant’s method to find the root of the following equations up to 3rd iterations in
the range mentioned
a. + − + = , =− . =− .
Iteration
( ) ( ) % Error
Count
1 -5.5 -4.5 -39 27.5 -4.91353383 8.416220352%
2 -4.5 -4.91353383 27.5 5.5361 -5.01776696 2.077281208%
3 -4.91353383 -5.01776696 5.5361 -1.1799 -4.99945489 0.366281339%
b. − + . = , = . = .
Iteration
( ) ( ) % Error
Count
1 0.1 0.5 -0.29533733 0.58127 0.234764026 112.9798204%
2 0.5 0.234764026 0.581268515 -0.0073 0.238072555 1.3897149%
3 0.234764026 0.238072555 -0.00734228 -0.0001 0.238134227 0.025897894%
c. + − = , =− . = .
Iteration
( ) ( ) % Error
Count
1 -0.9 0.9 -1.37675725 2.24293 -0.21536543 517.8943731%
2 0.9 -0.21536543 2.242930021 -0.4075 -0.04389459 390.6422949%
3 -0.21536543 -0.04389459 -0.40745767 -0.0868 0.002538918 1828.870134%
