1.
Bisection Method
Soln:
Given that,
f(x) = x3-x-2
Let,
a = 0, b = 1
We know,
f (a) = f (0) = 0 − 0 − 2 = −2
f (b) = f (1) = 1 – 1 − 2 = −2
f (0) × f (1) > 0 (+ve)
Again,
a = 1, b = 2
f (1)=1−1−2=−2
f (2)=8−2−2= 4
f (1) × f (2) < 0 (-ve)
root lies between 1 and 2.
Iteration a b f(a) f(b) c= f(c)
1 1 2 -2 4 1.50 -0.125
2 1.5 2 -0.125 4 1.75 1.609
3 1.5 1.75 -0.125 1.609 1.625 0.666
4 1.5 1.625 -0.125 0.666 1.5625 0.252
5 1.5 1.5625 -0.125 0.252 1.53125 0.059
6 1.5 1.53125 -0.125 0.059 1.515625 -0.034
7 1.515625 1.53125 -0.034 0.059 1.5234375 0.012
8 1.515625 1.5234375 -0.034 0.012 1.51953125 -0.011
Therefore,
Root, x ≈ 1.52 (ans)
2. Newton Raphson Method
Soln:
Given that,
f(x) = x3-6x-4
Find,
f′(x) = 3x2-6
Now,
Iteration Table:-
Therefore,
Root, x ≈ 2.7438 (ans)
3. Gauss Jordan Elimination Method
Soln:
4. Gaussian Elimination Method
Soln:
5. Jacobi Method
Soln:
Given that,
Iteration (x) (y) (z)
0 0 0 0
1 0.3000 0.3000 -0.3000
2 0.3900 0.2700 -0.5100
3 0.3330 0.2010 -0.5010
4 0.3003 0.1629 -0.4539
5 0.2907 0.1337 -0.4278
6 0.2813 0.0979 -0.4093
7 0.2671 0.0719 -0.3869