MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

UNIT-III SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS

PART-B
1 Derive Newton’s iterative formula to find the reciprocal of a given number N and hence obtain the BL
value of 1 5
19
Solution:
1 1 1
We need to find the reciprocal of a given number N (i.e) x   N  N 0
N x x
1 1 1
Let f  x    N  f  xn    N  f '  xn   2
x xn xn
f  xn 
Newton’s iterative formula is xn1  xn 
f '  xn 
 1 
 x N  x2  1 
 xn   n   xn  n    N 
 1  1  xn 
 x2 
 n 
1   1  Nxn 
 xn  xn2   N   xn  xn2  
 xn   xn 
 xn  xn 1  Nxn   xn  xn  Nxn2
 2xn  Nxn2  xn  2  Nxn  ------ (1)
1
To find Substitute N=19 in (1)
19
xn1  xn  2 19xn 
1 1
The nearest approximate value of is  0.05 .  x0  0.05
19 20
x1  x0  2  19 x0   0.05 2  19  0.05  0.0525
x2  x1  2  19 x1   0.0525 2  19  0.0525  0.0526
x3  x2  2  19 x2   0.0526 2  19  0.0526  0.0526
2nd and 3rd iterations are equal, stop the process. The root is 0.0526

2 𝟑
Derive Newton’s iterative formula for √𝑵 and hence find the value of √𝟐𝟒
𝟑 BL
5
Solution:
Let x  3 N  x  N  x  N  0
3 3

Let f  x   x3  N ; f ( x)  3x2
 f  xn   xn3  N; f ( xn )  3xn2
f ( xn )
The Newton-Raphson formula is xn 1  xn 
f ( xn )
 xn3  N  3xn3  xn3  N
 xn   2 
 3xn  3xn 2

St. Joseph’s Institute of Technology 13

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

2 xn3  N 1  2 xn3 N  1  N 
 2
  2  2    2 xn  2 
3xn 3  xn xn  3  xn 
1 N 
Therefore, the Newton-Raphson iterative formula for 3 N is  2 xn  2 
3 xn 

1 24 
 2 xn  2 
3
Hence, the Newton-Raphson iterative formula for 24 is
3 xn 

Since the nearest approximate value of 3

24 is 3
27  3 , Let x0  3

1 24 
xn1   2 xn  2 
3 xn 

1 24  1  24 
x1   2 x0  2    2  3  2   2.8889
3 x0  3   3 
1 24  1  24 
x2   2 x1  2    2  2.8889     2.8845
3 x1  3   2.8889 
2

1 24  1  24 
x3   2 x2  2    2  2.8845     2.8845
3 x2  3   2.8845 
2

2nd and 3rd iterations are equal, stop the process. The root is 2.8845
3 Find a root of x log10 x  1.2  0 by Newton - Raphson method correct to three decimal places. BL
5
Solution:
Given x log10 x  1.2  0
Let f  x   x log10 x 1.2
When x  1  f 1  1log10 1 1.2  1.2  ve
When x  2  f  2  2log10  2 1.2  0.5979  ve
When x  3  f 3  3log10 3 1.2  0.2314  ve
Here f  2 is negative and f  3 is positive. Therefore, the root lies between 2 and 3.
Since f  3  f  2   0.2314  0.5979 , Let x0  3
f  xn 
Newton’s formula is xn1  xn 
f '  xn 
Given f  x   x log10 x 1.2

 x log10 x  1.2   x  log10 e   log10 x 1  0  log10 e  log10 x

d 1
 f ' x 
dx x 
f  xn 
Newton’s formula is xn1  xn 
f '  xn 
Where f  xn   xn log10 xn 1.2  f '  xn   log10 e  log10 xn
Now,

St. Joseph’s Institute of Technology 14

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

f  x0   x log  x   1.2   3log10  3  1.2 

x1  x0   x0   0 10 0   3    2.746
f '  x0   log10 e  log10  x0    log10 e  log10  3  
f  x1   x log  x   1.2   2.746log10  2.746   1.2 
x2  x1   x1   1 10 1   2.746     2.741
f '  x1  log
 10 e  log10  x 
1   log10 e  log10  2.746  
f  x2   x log  x   1.2   2.741 log10  2.741  1.2 
x3  x2   x2   2 10 2   2.741     2.741
f '  x2   log10 e  log10  x2    log10 e  log10  2.741 
2nd and 3rd iterations are equal, stop the process. The root is 2.741
4 Using Newton - Raphson method, find the real root of 3 x  sin x  e x  0 by choosing initial BL
5
value x0  0.5
Solution:
Given 3x  sin x  ex  0
Let f  x   3x  sin x  ex
f '  x   3  cos x  ex
When x  0  f  0  3 0  sin  0  e0  1 ve
When x  1  f 1  31  sin 1  e1  1.1232  ve
Here f  0 is negative and f 1 is positive. Therefore, the root lies between 0 and 1.
x0  0.5
Given
f  xn 
Newton’s formula is xn1  xn 
f '  xn 
Where f  xn   3xn  sin xn  e n ; f   xn   3  cos  xn   e n
x x

f  xn  3xn  sin xn  e xn
Now, xn1  xn   xn 
f '  xn  3  cos  xn   e xn
f  x0   3  0.5  sin  0.5  e0.5 
x1  x0   0.5     0.3516
f '  x0   3  cos  0.5   e 0.5

f  x1   3  0.3516   sin  0.3516   e0.3516 
x2  x1   0.3516     0.3604
f '  x1   3  cos  0.3516   e 0.3516

f  x2   3  0.3604   sin  0.3604   e0.3604 
x3  x2   0.3604     0.3604
f '  x2   3  cos  0.3604   e0.3604 
2nd and 3rd iterations are equal, stop the process. The root is 0.3604
5 Solve x  2 y  5z  9, 3 x  y  2z  5, 2 x  3 y  z  3 by Gauss elimination BL
method. 5
Solution:
Given x  2 y  5z  9
3x  y  2 z  5
2x  3 y  z  3
The matrix form for the given system of linear equations is
 1 2 5  x   9 
    
 3 1 2  y    5 
 2 3 1  z   3 
    
(i.e) AX  B

St. Joseph’s Institute of Technology 15

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

Therefore, the augmented matrix is

 1 2 5 9 
 
 A B    3 1 2 5 
 2 3 1 3 
 
R2 : 3 1 2 5
STAGE: 1 3R1 : 3 6 15 27
 1 2 5 9  R2 : 0  7 17 32
  R2 : R2  3R1
 0 7 17 32 
 0 1 9 21  R3 : R3  2 R1
  R3 : 2 3 1 3
2 R1 : 2 4 10 18
R3 : 0  1 9 21
STAGE: 2
 1 2 5 9  7 R3 : 0 7 63 147
 
 0 7 17 32  R3 : 7 R3  R2  R2 : 0 7 17 32
 0 0 46 115  R3 : 0 0 46 115
 

 x  2 y  5z  9 …………………………(1)
0 x  7 y  17 z  32 …………………..…..(2)
0x  0 y  46z  115 ………..……………(3)
115
From (3), 46 z  115  z   2.5
46
Substitute z  2.5 in (2),
7 y  17  2.5  32  7 y  32  42.5
 7 y  10.5
10.5
y  1.5
7
Substitute z  2.5, y  1.5 in (1),
x  2 y  5z  9  x  9  5z  2 y  9  5  2.5  2 1.5  9  12.5  3  0.5
 x  0.5, y  1.5, z  2.5
6 Solve 2 x1  3 x2  x3  1, 5 x1  x2  x3  9, 3 x1  2 x2  4 x3  11 by Gauss BL
elimination method. [May 2021] 5
Solution:
Given 2 x1  3x2  x3  1
5 x1  x2  x3  9
3x1  2 x2  4 x3  11
The matrix form for the given system of linear equations is
 2 3 1  x1   1
    
 5 1 1  x2    9 
 3 2 4  x   11 
  3   
(i.e) AX  B
Therefore, the augmented matrix is

St. Joseph’s Institute of Technology 16

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

 2 3 1 1 
 
 A B    5 1 1 9 
 3 2 4 11 
 
STAGE :1 2 R2 : 10 2 2 18
5 R1 : 10 15 5 5
2 3 1 1 
  R2 : 2 R2  5 R1 R2 : 0 13 3 23
 0 13 3 23  R3 : 2 R3  3R1
 0 5 5 25 
 
2 R3 : 6 4 8 22
3R1 : 6 9 3 3
R3 : 0  5 5 25
STAGE:2 13R3 : 0 65 65 325
2 3 1 1  5 R2 : 0 65 15  115
 
 0 13 3 23  R3 :13R3  5R2 R3 : 0 0 80 210
 0 0 80 210 
 

 2 x1  3x2  x3  1 ……………………………(1)
0 x1  13 x2  3 x3  23 ………………………..(2)
0 x1  0 x2  80 x3  210 ………..….…………(3)

From (3) 80x 3  210

210
x3   x 3  2.625
80

Substitute the value x3  2.625 in  2 ,

13 x2  3 x3  23
13x 2  3(2.625)  23
 x 2  2.375

Substitute the values x3  2.625 & x2  2.375 in 1 ,

2x1  3x 2  x 3  1
2x1  3(2.375)  2.625  1
 x1  1.75
 x1  1.75, x2  2.375, x3  2.625
7 Solve 2 x  3 y  z  5, 4 x  4 y  3z  3, 2x  3 y  2z  2 by Gauss elimination method. BL
5

Solution:
Given 2 x  3 y  z  5,
4 x  4 y  3z  3,
2x  3 y  2 z  2
The matrix form for the given system of linear equations is

St. Joseph’s Institute of Technology 17

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

 2 3 1  x   5 
    
 4 4 3  y    3 
 2 3 2  z   2 
    
(i.e) AX  B
Therefore, the augmented matrix is
 2 3 1 5 
 
 A B    4 4 3 3 
 2 3 2 2 
 
R2 : 4 4 3 3
STAGE :1 2 R1 : 4 6 2 10
R2 : 0 2 1 7
 2 3 1 5 
  R2  R2  2 R1
 0 2 1 7  R3  R3  R1 R3 : 2 3 2 2
 0 6 3 3 
   R1 : 2  3 1 5
R3 : 0  6 3 3
STAGE:2
R3 : 0 6 3 3
 2 3 1 5 
   3R2 : 0 6 3 21
 0 2 1 7  R3  R3  3R2
 0 0 6 18  R3 : 0 0 6 18
 

 2 x  3 y  z  5 ……………………………(1)
2 y  z  7 …………………………..(2)
6 z  18 …………..….…………(3)
18
From (3) 6z  18  z  z3
6
Substitute the value z  3in  2 ,
2 y  z  7  2 y  3  7  2y  7  3  2y  4 y2
Substitute the values z  3 & y  2in 1 ,
 2x  3 2  3  5  2 x  6  3  5  2 x  3  5
2x  3 y  z  5
 2x  5  3  2x  2  x  1

 x  1, y  2 , z  3
8 Solve 10 x  y  z  12, 2 x  10 y  z  13, x  y  5z  7 by Gauss - Jordan method. BL
5
Solution:
Given 10 x  y  z  12
2 x  10 y  z  13
x  y  5z  7
The matrix form for the given system of linear equations is

St. Joseph’s Institute of Technology 18

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

10 1 1  x   12 
    
 2 10 1  y    13 
 1 1 5  z   7 
    
(i.e) AX  B
Therefore, the augmented matrix is
10 1 1 12 
 
 A B    2 10 1 13 
 1 1 5 7 

5R2 : 10 50 5 65
STAGE: 1
 R1 : 10 1 1 12
10 1 1 12 
  R2 : 5R2  R1 R2 : 0 49 4 53
 0 49 4 53  R3 :10 R3  R1
 0 9 49 58 
10 R3 : 10 10 50 70
 R1 : 10  1 1 12
R3 : 0 9 49 58
STAGE: 2
10 1 1 12  49 R3 : 0 441 2401 2842
  R3 : 49 R3  9 R2 9 R2 : 0 441 36 477
 0 49 4 53 
 0 0 2365 2365  R3 : 0 0 2365 2365

R3
10 1 1 12  R3 :
  R3 2365
 0 49 4 53 
R3 :
2365
 0 0 1 1 
STAGE: 3
10 1 0 11 
  R1 : 10 1 1 12
 0 49 0 49   R3 : 0 0  1  1
 0 0 1 1 
R1 : 10 1 0 11

R1 : R1  R3 R2 : 0 49 4 53
R2 : R2  4 R3  4 R3 : 0 0 4 4
R2 : 0 49 0 49

STAGE: 4
 490 0 0 490  49 R1 : 490 49 0 539
  R1 : 49 R1  R2
 0 49 0 49   R2 : 0  49 0  49
 0 0 1 1  R1 : 490 0 0 490

490 x  490  x  1
49 y  49  y  1
z 1  x  1, y  1, z  1

St. Joseph’s Institute of Technology 19

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

9 Solve 3 x1  x2  2 x3  12, x1  2 x2  3 x3  11, 2 x1  2 x2  x3  2 by Gauss -Jordan method. BL

5
Solution:
Given 3x1  x2  2 x3  12
x1  2 x2  3x3  11
2 x1  2 x2  x3  2
The matrix form for the given system of linear equations is
 3 1 2  x1   12 
    
 1 2 3  x2    11 
 2 2 1 x   2 
  3   
(i.e) AX  B
Therefore, the augmented matrix is
 3 1 2 12 
 
[ A B]  1 2 3 11 
 2 2 1 2 
3R2 : 3 6 9 33
 R1 : 3 1 2 12
STAGE: 1
R2 : 0 7 7 21
 3 1 2 12 
  R2 : 3R2  R1
0 7 7 21 
R3 : 3R3  2 R1
0 4 7 18  3R3 : 6  6 3 6
2 R1 : 6 2 4 24
R3 : 0  4  7  18
STAGE: 2
 3 1 2 12  7 R3 : 0 28 49 126
 
0 7 7 21  4 R2 : 0 28 28 84
0 0 21 42  R3 : 0 0  21  42

21R1 : 63 21 42 252

STAGE: 3 2 R3 : 0 0  42 84
R1 : 63  21 0 168
63 21 0 168 
  R : 21R1  2 R3 3R2 : 0 21 21 63
 0 21 0 21  1
R : 3R2  R3 R3 : 0 0  21 42
 0 0 21 42  2
R2 : 0 21 0 21
STAGE: 4

R1 : 63 21 0 168
63 0 0 189 
  R2 : 0 21 0 21
 0 21 0 21  R1 : R1  R3 R1 : 63 0 0 189
 0 0 21 42 

St. Joseph’s Institute of Technology 20

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

189
63x1  3  x1   x1  3
63
21
21x 2  21 x 2   x2  1
21
42
 21x 3  42  x 3  2  x1  3, x 2  1, x3  2
21
10 Solve 2 x  y  3z  8,  x  2 y  z  4, 3 x  y  4z  0 by Gauss - Jordan method. B
L
5
Solution:
 2 1 3 8 
 
Write the given system of equation in augmented matrix form [A,B] =  1 2 1 4 
 3 1 4 0 
 
STAGE 1: 2 R2 : 2 4 2 8
 2 1 3 8  R1 : 2 1 3 8
 
 0 3 5 16  R2 : 2 R2  R1 R2 : 0 3 5 16
 3 1 4 0 
 
STAGE 2: 2 R3 : 6 2 8 0
 2 1 3 8  3R1 : 6 3 9 24
 
0 3 5 16  R3 : 2 R3  3R1 R3 : 0 5  17 24
 0 5 17 24 
 
STAGE 3: 3R3 : 0 15 51  72
 2 1 3 8  5 R2 : 0 15 25  80
 
 0 3 5 16  R3 : 3R3  5R2 R3 : 0 0 76 152
 0 0 76 152 
 
 2 1 3 8 
  R3
0 3 5 16  R3 :
0 0 76
 1 2 
STAGE 4: R2 : 0 3 5 16
 2 1 3 8   5 R3 : 0 0 5 10
 
0 3 0 6  R2 : R2  5R3 R2 : 0 3 0 6
0 0 1 2 


STAGE 5:
 2 1 0 2  R1 : 2 1 3 8
  3R3 : 0 0 3 6
 0 3 0 6  R1 : R1  3R3
0 0 1 2  R1 : 2  1 0 2
 

STAGE 6:
 6 0 0 12  3R1 : 6 3 0 6
  R2 : 0 3 0 6
 0 3 0 6  R1 : 3R1  R2
0 0 1 2  R1 : 6 0 0 12
 

St. Joseph’s Institute of Technology 21

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

 6x  0 y  0z  12 ………..………………………(1)
12
x 2
6
0 x  3 y  0 z  6 ………………………..………..(2)
6
 y 2
3
0 x  0 y  1z  2 …………………………………(3)
z2
 x  2, y  2, z  2 .
11 Solve x  3 y  3z  16, x  4 y  3z  18, x  3 y  4z  19 by Gauss - Jordan method. B
L
5
Solution:
1 3 3 16 
 
Write the given system of equation in augmented matrix form [A,B] = 1 4 3 18 
1 3 4 19 
 
STAGE 1: R2 : 1 4 3 18
1 3 3 16   R1 :  1  3 3 16
 
1 4 3 18  R2  R2  R1 R2 : 0 1 0 2
1 3 4 19  R3  R3  R1
 
R3 : 1 3 4 19
 1 3 3 16 
   R1 :  1 3 3 16
 0 1 0 2  R2 : 0 0 1 3
0 0 1 3 
 

STAGE 2:

R1 : 1 3 3 16
 1 0 3 10 
  3R2 : 0 3 0 6
 0 1 0 2  R1  R1  3R2 R1 : 1 0 3 10
0 0 1 3 
 

STAGE 3: R1 : 1 0 3 10
1 0 0 1  3R3 : 0 0 3  9
 
 0 1 0 2  R1  R1  3R3 R1 : 1 0 0 1
0 0 1 3
 
 x  0 y  0z  1 ………..………………………(1)
 x 1
0 x  y  0 z  2 ………………………..………..(2)
 y2
0 x  0 y  z  3 …………………………………(3)
 z 3
 x  1, y  2, z  3 .

12 Solve 27 x  6 y  z  85, x  y  54z  110,6 x  15 y  2z  72 by Gauss-Jacobi method. B

L
[May 2021] 5

St. Joseph’s Institute of Technology 22

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

Solution:
The given system is
27 x  6 y – z  85
x  y  54 z  110
6 x  15 y  2 z  72
Since the equation does not satisfy diagonally dominant condition, we rearrange the equations
27 x  6 y – z  85
6 x  15 y  2 z  72
x  y  54 z  110
1
x 85  6 y  z 
27
1
y   72  6 x  2 z 
15
1
z  110  x  y 
54
Let the initial values be x0  0, y0  0, z0  0
Iterations 1 1 1
xn 1  85  6 yn  zn  yn 1  72  6 xn  2 zn  zn 1  110  xn  yn 
27 15 54
1 1 1
x1  85  6 y0  z0  y1  [72  6 x0  2 z0 ] z1  110  x0  y0 
Initial 27 15 54
Iteration 1 1 1
 [85  6  0   0]  72  6  0   2  0    110  0  0
(n=0) 27 15 54
 3.148  4.800  2.037
1 1 1
x2  85  6 y1  z1  y2   72  6 x1  2 z1  z2  110  x1  y1 
27 15 54
1 1 1
1  85  6  4.800   2.037   72  6  3.148  2  2.037    110  3.148  4.800
27  15 54
 2.157  3.269  1.890

1 1 1
x3  85  6 y2  z2  y3  72  6 x2  2 z2  z3  110  x2  y2 
27 15 54
1 1 1
2  85  6  3.269   1.890   72  6  2.157   2 1.890    110  2.157  3.269
27  15 54
 2.492  3.685  1.937

1 1 1
x4  85  6 y3  z3  y4  72  6 x3  2 z3  z4  110  x3  y3 
27 15 54
1 1 1
3  85  6  3.685   1.937   72  6  2.492   2 1.937    110  2.492  3.685
27  15 54
 2.401  3.545  1.923

1 1 1
x5  85  6 y4  z4  y5  72  6 x4  2 z4  z5  110  x4  y4 
27 15 54
4 1 1 1
 85  6  3.545   1.923  72  6  2.401  2 1.923   110  2.401  3.545
27  15 54
 2.432  3.583  1.927

St. Joseph’s Institute of Technology 23

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

1 1 1
x6  85  6 y5  z5  y6  72  6 x5  2 z5  z6  110  x5  y5 
27 15 54
1 1 1
5  85  6  3.583  1.927   72  6  2.432   2 1.927    110  2.432  3.583
27  15 54
 2.423  3.570  1.926

1 1 1
x7  85  6 y6  z6  y7  72  6 x6  2 z6  z7  110  x6  y6 
27 15 54
1 1 1
6  85  6  3.570   1.926   72  6  2.423  2 1.926    110  2.423  3.570
27  15 54
 2.425  3.573  1.926

1 1 1
x8  85  6 y7  z7  y8  72  6 x7  2 z7  z8  110  x7  y7 
27 15 54
1 1 1
7  85  6  3.574   1.926   72  6  2.426   2 1.926    110  2.426  3.574
27  15 54
 2.425  3.573  1.926

Two successive iteration values are equal stop the process.

x  2.425, y  3.573, z  1.926
13 Solve 20 x  y  2z  17, 3 x  20 y  z  18, 2 x  3 y  20z  25 by Gauss-Jacobi method. B
L
5
Solution:

The given equation satisfies the diagonally dominant condition.

1 1 1
x
20
17  y  2 z  , y   18  3x  z  & z   25  2 x  3 y 
20 20
Let the initial values be x0  0, y0  0, z0  0

1 1 1
Iterations xn1 
20
17  yn  2 zn  yn1 
20
 18  3xn  zn  zn1 
20
 25  2 xn  3 yn 
1 1 1
x1  17  y0  2 z0  y1   18  3x0  z0  z1   25  2 x0  3 y0 
Initial 20 20 20
Iteration 1 1 1
 17   0   2  0     18  3  0    0     25  2  0   3  0  
(n=0) 20 20 20
x1  0.85 y1  0.9 z1  1.25
1 1 1
x2  17  y1  2 z1  y2   18  3x1  z1  z2   25  2 x1  3 y1 
20 20 20
1 1 1 1
 17   0.9   2 1.25   18  3  0.85   1.25     25  2  0.85   3  0.9  
20  20  20 
x2  1.02 y2  0.965 z2  1.030
1 1 1
x3  17  y2  2 z2  y3   18  3x2  z2  z3   25  2 x2  3 y2 
20 20 20
2 1 1 1
 17   0.965  2 1.03    18  3 1.02   1.03    25  2 1.02   3  0.965 
20  20  20 
x3  1.001 y3  1.002 z3  1.003

St. Joseph’s Institute of Technology 24

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

1 1
x4 
20
17  y3  2 z3  1
y4   18  3x3  z3 
z4 
20
 25  2 x3  3 y3 
20
1 1
3  17   1.002   2 1.003  1   25  2 1.001  3  1.002  
20    18  3 1.001  1.003  20 
20
x4  1.000 z4  1.000
y4  1.000

1 1
x5  17  y4  2 z4  y5   18  3x4  z4  z5 
1
 25  2 x4  3 y4 
20 20
20
1 1
4  17   1.000   2 1.000     18  3 1.000   1.000   1
20  20    25  2 1  3  1.000  
20 
x5  1.000 y5  1.000
z5  1.000

Two successive iteration values are equal stop the process.

x  1 , y  1, z 1
14 Solve 8 x  y  z  18, 2 x  5 y – 2z  3, x  y – 3z  6 by Gauss-Jacobi method. B
L
5
Solution:
As the coefficient matrix is diagonally dominant solving for x, y, z we get
1
8 x  y  z  18  8 x  18  y  z  x  18  y  z 
8
1
2x  5 y  2z  3  5 y  3  2x  2z  y  3  2x  2z 
5
1
x  y  3 z  6  3 z  6  x  y  z   6  x  y 
3
The initial values is x0  0, y0  0, z0  0
1 1 1
Iteration xn 1  18  yn  zn  yn 1   3  2 xn  2 zn  zn 1   6  xn  yn 
8 5 3
1 1 1
x1  18  y0  z0  y1   3  2 x0  2 z0  z1   6  x0  y0 
8 5 3
Initial
1 1 1
Iteration  18  0  0   3  0  0   6  0  0
(n=0) 8 5 3
1 1 1
 18   2.250   3  0.600   6   2.000
8 5 3
1 1 1
x2  18  y1  z1  y2   3  2 x1  2 z1  z2   6  x1  y1 
8 5 3
1 1 1 1
 18  0.600  2.000   3  2  2.250   2  2.000     6  2.250  0.600 
8 5 3
 2.075  0.500  2.950
1 1 1
x3  18  y2  z2  y3   3  2 x2  2 z2  z3   6  x2  y2 
8 5 3
2 1 1 1
 18  0.500  2.950   3  2  2.075  2  2.950     6  2.075  0.500 
8 5 3
 1.944  0.950  2.858

St. Joseph’s Institute of Technology 25

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

1 1 1
x4  18  y3  z3  y4   3  2 x3  2 z3  z4   6  x3  y3 
8 5 3
1 1 1
3  18  0.950  2.858   3  2 1.944   2  2.858    6  1.944  0.950 
8 5 3
 2.012  0.966  2.965

1 1 1
x5  18  y4  z4  y5   3  2 x4  2 z4  z5   6  x4  y4 
8 5 3
4 1 1 1
 18  0.966  2.965  3  2  2.012   2  2.965     6  2.012  0.966 
8 5 3
 2.000  0.981  2.993
1 1 1
x6  18  y5  z5  y6   3  2 x5  2 z5  z6   6  x5  y5 
8 5 3
1 1 1
5  18  0.981  2.993  3  2  2.000   2  2.993    6  2.000  0.981
8 5 3
 1.999  0.997  2.994

1 1 1
x7  18  y6  z6  y7   3  2 x6  2 z6  z7   6  x6  y6 
8 5 3
6 1 1 1
 18  0.997  2.994   3  2 1.999   2  2.994     6  1.999  0.997 
8 5 3
 2.000  0.998  2.999
1 1 1
x8  18  y7  z7  y8   3  2 x7  2 z7  z8   6  x7  y7 
8 5 3
7 1 1 1
 18  0.998  2.999   3  2  2.000   2  2.999     6  2.000  0.998 
8 5 3
 2.000  1.000  2.999
1 1 1
x9  18  y8  z8  y9   3  2 x8  2 z8  z9   6  x8  y8 
8 5 3
8 1 1 1
 18  1.000  2.999   3  2  2.000   2  2.999     6  2.000  1.000 
8 5 3
 2.000  1.000  3.000
1 1 1
x10  18  y9  z9  y10   3  2 x9  2 z9  z9   6  x8  y8 
8 5 3
9 1 1 1
 18  1.000  3.000   3  2  2.000   2  3.000     6  2.000  1.000 
8 5 3
 2.000  1.000  3.000
Two successive iteration values are equal stop the process.
Hence x  2, y  1, z  3
15 Solve 30 x  2 y  3z  75, 2 x  2 y  18z  30, x  17 y  2z  48 by BL
Gauss – Seidel method. [May 2021] 5
Solution:

St. Joseph’s Institute of Technology 26

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

Solution:
The given system is 30x  2 y  3z  75,
2x  2 y  18z  30  x  y  9z  15
x  17 y  2 z  48
Since the equations does not satisfy diagonally dominant condition, we rearrange the equations
30 x  2 y  3z  75
x  17 y  2 z  48
x  y  9 z  15
Now, the system satisfies diagonally dominant condition.
1
x   75  2 y  3 z 
30
1
y   48  x  2 z 
17
1
z  15  x  y 
9
Let the initial values be y0  0, z0  0

Iterations 1 1 1
xn 1  75  2 yn  3zn  yn 1   48  xn 1  2 zn  zn 1  15  xn 1  yn 1 
30 17 9
1 1 1
x1   75  2 y0  3z0  y1   48  x1  2 z0  z1  15  x1  y1 
Initial 30 17 9
Iteration 1 1 1
  75  0  0    48  2.500  2  0    15  2.500  2.676
(n=0) 30 17 9
 2.500  2.676  1.092
1 1 1
x2   75  2 y1  3z1  y2   48  x2  2 z1  z2  15  x2  y2 
30 17 9
1 1 1
1  75  2  2.676   3 1.092     48  2.569  2 1.092    15  2.569  2.801
30 17 9
 2.569  2.801  1.070

1 1 1
x3  75  2 y2  3z2  y3   48  x3  2 z2  z3  15  x3  y3 
30 17 9
1 1 1
2  75  2  2.801  3 1.070     48  2.580  2 1.070    15  2.580  2.798
30 17 9
 2.580  2.798  1.069

1 1 1
x4  75  2 y3  3z3  y4   48  x4  2 z3  z4  15  x4  y4 
30 17 9
3 1 1 1
 75  2  2.798  3 1.069     48  2.580  2 1.069    15  2.580  2.798
30 17 9
 2.580  2.798  1.069

Two successive iteration values are equal stop the process.

x  2.580, y  2.798, z  1.069

St. Joseph’s Institute of Technology 27

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

16 Solve x  2 y  5z  12, 5 x  2 y  z  6, 2 x  6 y  3z  5 by Gauss - Seidel method. BL

5

Solution:
The given system is
x  2 y  5z  12
5x  2 y  z  6
2 x  6 y  3z  5
Interchanging the equations
5x  2 y  z  6 ----------------- (1)
2 x  6 y  3z  5 -------------------- (2)
x  2 y  5z  12 -------------------- (3)
 5 2 1
 
Clearly the coefficient matrix  2 6 3 is diagonally dominant. Hence we can apply Gauss-Seidel method
1 2 5 
without any difficulty.
From (1), (2) and (3) we get
1
x  6  2 y  z  --------------- (4)
5
1
y   5  2 x  3z  --------------- (5)
6
1
z  12  x  2 y  -------------- (6)
5
1 1 1
Iteration xn 1   6  2 yn  z n  yn 1   5  2 xn 1  3zn  zn 1  12  xn1  2 yn1 
5 6 5
1 1 1
x1   6  2 y0  z0  y1   5  2 x1  3z0  z1  12  x1  2 y1 
Initial 5 6 5
Iteration 1 1 1
  6  0  0  5  2 1.200   0   12  1.200  2  0.433
(n=0) 5 6 5
 1.200  0.433  2.333
1 1 1
x2   6  2 y1  z1  y2   5  2 x2  3z1  z2  12  x2  2 y2 
5 6 5
1 1 1
1  6  2  0.433  2.333  5  2 1.493  3  2.333  12  1.493  2 1.502 
5 6 5
 1.493  1.502  2.702

1 1 1
x3   6  2 y2  z 2  y3   5  2 x3  3z2  z3  12  x3  2 y3 
5 6 5
2 1 1 1
 6  2 1.502   2.702  5  2 1.140   3  2.702   12  1.140  2 1.804 
5 6 5
 1.140  1.804  2.894

St. Joseph’s Institute of Technology 28

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

1 1 1
x4   6  2 y3  z3  y4   5  2 x4  3z3  z4  12  x4  2 y4 
5 6 5
1 1 1
3  6  2 1.804   2.894  5  2 1.057   3  2.894    12  1.057  2 1.928
5 6 5
 1.057  1.928  2.960

1 1 1
x5   6  2 y4  z 4  y5   5  2 x5  3z4  z5  12  x5  2 y5 
5 6 5
4 1 1 1
 6  2 1.928  2.960  5  2 1.021  3  2.960   12  1.021  2 1.973
5 6 5
 1.021  1.973  2.985
1 1 1
x6   6  2 y5  z5  y6   5  2 x6  3z5  z6  12  x6  2 y6 
5 6 5
5 1 1 1
 6  2 1.973  2.985  5  2 1.008  3  2.985   12  1.008  2 1.990 
5 6 5
 1.008  1.990  2.994
1 1 1
x7   6  2 y6  z6  y7   5  2 x7  3z6  z7  12  x7  2 y7 
5 6 5
6 1 1 1
 6  2 1.990   2.994  5  2 1.003  3  2.994   12  1.003  2 1.996 
5 6 5
 1.003  1.996  2.998
1 1 1
x8   6  2 y7  z7  y8   5  2 x8  3z7  z8  12  x8  2 y8 
5 6 5
7 1 1 1
 6  2 1.996   2.998  5  2 1.001  3  2.998   12  1.001  2 1.999 
5 6 5
 1.001  1.999  2.999
1 1 1
x9   6  2 y8  z8  y9   5  2 x9  3z8  z9  12  x9  2 y9 
5 6 5
8 1 1 1
 6  2 1.999   2.999  5  2 1.000   3  2.999   12  1.000  2  2.000 
5 6 5
 1.000  2.000  3.000
1 1 1
x10   6  2 y9  z9  y10  5  2 x10  3z9  z10  12  x10  2 y10 
5 6 5
9 1 1 1
 6  2  2.000   3.000  5  2 1.000   3  3.000   12  1.000  2  2.000 
5 6 5
 1.000  2.000  3.000
Two successive iteration values are equal stop the process.
Hence x  1, y  2, z  3
17 Solve 20 x  4 y  z  32, x  3 y  10z  24, 2 x  17 y  4z  35 by BL
5
Gauss – Seidel method. [Dec 2021]
Solution:
The given system is
St. Joseph’s Institute of Technology 29
 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

20x  4y  z  32
x  3y  10z  24
2x  17y  4z  35
Since the equation does not satisfy diagonally dominant condition, we rearrange the equation
20x  4y  z  32
2x  17y  4z  35
x  3y  10z  24
Now, the system satisfies diagonally dominant condition.
1
x  32  4y  z 
20
1
y  35  2x  4z 
17
1
z   24  x  3y 
10
Let the initial values be y0  0, z0  0

Iterations 1 1 1
x n 1  (32  4y n  z n ) y n 1  (35  2x n 1  4z n ) z n 1  (24  x n 1  3y n 1 )
20 17 10
1 1 1
x1  32  4y0  z 0  y1  35  2x1  4z 0  z1   24  x1  3y1 
Initial 20 17 10
Iteration 1 1 1
 32  4(0)  (0)  35  2(1.6)  4(0)    24  (1.6)  3(1.87) 
(n=0) 20 17 10
x1  1.6 y1  1.87 z1  1.68
1 1 1
x 2  32  4y1  z1  y2  35  2x 2  4z1  z 2   24  x 2  3y 2 
20 17 10
1 1 1
 32  4(1.87)  (1.68)  35  2(1.31)  4(1.68)    24  (1.31)  3(1.51)
1 20 17 10
x 2  1.31 y2  1.51 z 2  1.82

1 1 1
x3  32  4y2  z2  y3  35  2x3  4z2  z3   24  x 3  3y3 
20 17 10
2 1 1 1
 32  4(1.51)  (1.82)  35  2(1.39)  4(1.82)   24  (1.39)  3(1.47)
20 17 10
x 3  1.39 y3  1.47 z3  1.82
1 1 1
x 4  32  4y3  z3  y4  35  2x 4  4z3  z 4   24  x 4  3y 4 
20 17 10
3 1 1 1
 32  4(1.47)  (1.82)  35  2(1.40)  4(1.82)   24  (1.4)  3(1.47) 
20 17 10
x 4  1.40 y4  1.47 z 4  1.82

St. Joseph’s Institute of Technology 30

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

1 1 1
x5  32  4y4  z 4  y5  35  2x 5  4z 4  z5   24  x 5  3y5 
20 17 10
1

1
32  4(1.47)  (1.82)  35  2(1.40)  4(1.82) 
1
 24  (1.4)  3(1.47)
17
4 20 10
y5  1.47
x 5  1.40 z5  1.82

Two successive iteration values are equal stop the process.

x  1.40, y  1.47, z  1.82
18 Find the numerically largest Eigenvalue and the corresponding Eigenvector of the matrix BL
5
 1 3 2   1
 4 4 1 using Power method by taking X   0 
  0  
 6 3 5   0
 
Solution:
1
Let the initial eigenvector be X 0   0 
0
 
1
6
1 3 2   1   1 0  0   1     0.2 
      4  
AX0=  4 4 1 
 0  =  4  0  0    4   6    6  0.7   6 X1
  6
 6 3 5  0  6  0  0  6    1 
      6  
 
6
1 3 2   0.2   0.1   0 
AX1=  4 4 1   =    8.3    8.3 X
   0.7   2.6   0.3  2

 6 3 5   1   8.3   1 
     
1 3 2   0   1.1   0.2 
AX2=  4 4 1   =    5.9    5.9 X
   0.3   0.2   0  3
 1   5.9   1 
 6 3 5       
1 3 2   0.2   2.2   0.4 
AX3=  4 4 1  =   6.2    6.2 X
   0   0.2   0  4

 6 3 5   1   6.2   1 
     
1 3 2   0.4   2.4   0.3 
AX4=  4 4 1   =    7.4    7.4 X
   0   0.6   0.1  5

 6 3 5   1   7.4   1 
     
1 3 2   0.3   2.0   0.3 
AX5=  4 4 1   =    7.1    7.1X
   0.1   0.6   0.1  6

 6 3 5   1   7.1   1 
     
1 3 2   0.3   2.0   0.3 
AX6=  4 4 1   =    7.1    7.1X
   0.1   0.6   0.1  7
 1   7.1   1 
 6 3 5       

St. Joseph’s Institute of Technology 31

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

The two successive Eigenvectors are equal, stop the process.

 0.3 
The numerically largest Eigen value is 7.1 and Eigenvector is  0.1 
 1 
 
19  1 3  1 BL

Find the dominant Eigenvalue and its corresponding Eigenvector for the matrix  3 2 4  using
5
 
 1 4 10 
1
Power method by taking X 0  1
1
Solution:
1

Let the initial eigenvector be X 0  1
1
Now
3
13 
 1 3 1 1  1  3  1   3     0.23
        9
AX 0   3 2 4  1   3  2  4    9   13   13  0.69   13 X 1
13 
 1 4 10  1  1  4  10  13    1 
13 
13 
1 3 1  0.23  1.30  0.10
AX 1   3 2 4  0.69   6.07   12.53  0.48  12.53 X 2
    
 1 4 10   1  12.53  1 
1 3 1 0.10  0.54  0.05
AX 2   3 2 4  0.48   5.26   11.82 0.45  11.82 X 3
    

 1 4 10   1  11.82  1 
1 3 1 0.05  0.40  0.03
AX 3   3 2 4  0.45   5.05   11.75 0.43  11.75 X 4
    
 1 4 10   1  11.75  1 
1 3 1 0.03  0.32   0.03
AX 4   3 2 4  0.43   4.95   11.69 0.42   11.69 X 5
    
 1 4 10   1  11.69   1 
1 3 1  0.03  0.29  0.02
AX 5   3 2 4  0.42    4.93   11.65 0.42  11.65 X 6
    
 1 4 10   1  11.65  1 
1 3 1 0.02  0.28  0.02
AX 6   3 2 4  0.42    4.90   11.66 0.42   11.66 X 7
    

 1 4 10   1  11.66  1 

St. Joseph’s Institute of Technology 32

 MA4202/ Statistics and Numerical Methods Department of Mathematics 2023-2024

 1 3 1 0.02  0.28  0.02

AX 7   3 2 4  0.42   4.90   11.66 0.42   11.66 X 8
     
 1 4 10   1  11.66  1 
The two successive Eigenvectors are equal, stop the process
 0.02 
The dominant Eigenvalue is 11.66 and Eigenvector is  0.42 
 1 
 
1 6 1 BL
5
20 Find the largest eigenvalue and the corresponding eigenvector of A  1 2 0  using Power

 0 0 3 
 1
method by taking X 0   0 
 0
 
Solution:
1 6 1  1
Given A= 1 2 0  . Let the initial eigenvector be X 0   0 
 
 0 0 3   0
 
1 6 1  1  1   1 
AX 0  1 2 0  0   1   1 1   1X1
0 0 3 0  0 0
1 6 1  1   7  1 
AX1  1 2 0  1    3   7 0.4   7 X 2
    
0 0 3 0  0   0 
1 6 1   1  3.4 1 
AX 2  1 2 0  0.4  1.8   3.4  0.5  3.4 X 3
    
0 0 3  0   0   0 
1 6 1   1   4.0  1 
AX 3  1 2 0  0.5   2.0  4 0.5  4 X 4
    
0 0 3  0   0   0 
1 6 1   1   4.0 1 
AX 4  1 2 0 0.5   2.0  4 0.5  4 X 5
    

0 0 3  0   0   0 
The last successive eigen vectors are equal, stop the process. Hence eigen dominant eigen value is 4 and the
 1 
corresponding eigen vector is  0.5 
 0 

St. Joseph’s Institute of Technology 33