Sunteți pe pagina 1din 9

MAT 382 – TUTORAL 3

[SUGGESTED ANSWER]

Question 1
(a)
 2 4 1 2 5 
 4 14 1 6 11 

 1 1 5 1 9 
 
 4 2 6 1 2 

We implemented ERO to reduce the matrices


 2 4 1 2 5  2 4 1 2 5
 4 14 1 6 11  0 6 3 2 1 
 ERO 
 1 1 5 1 9  0 0 3 1 7
   
 4 2 6 1 2  0 0 0 2 4

By using backward substituition we will get the value of the following


 x1   3 
x   
 2   1 
 x3   3 
   
 x4   4 

1
(b)

1 1 2 1 8 
2 2 3 3 20 

1 1 1 0 2 
 
1 1 4 3 4 

We implemented ERO to reduce the matrices

1 1 2 1 8  1 1 2 1 8 
2 2 3 3 20  0 2 1 1 6 
 ERO 
1 1 1 0 2  0 0 1 1 4 
   
1 1 4 3 4  0 0 0 2 4 

By using backward substituition we will get the value of the following


 x1   7 
x   
 2   3 
 x3   2 
   
 x4   2 

2
Question 2

a11  a21  Pivoting x


5.291
m21   0.1764
30.00

Leads to the system


 30.00 591400 591700   30.00 591400 591700 
 5.291 6.130  E2  m21 E1 
 46.78   0 104300 104400 

This will create the following inaccurate solutions


x2 1.001 and x1 10.00

We utilized scaled partial pivoting


5.291x1  6.130 x2  46.78
3  105 x1  0.5914 x2  0.5917
x1  10.00 and x2  1.000

3
Question 3

1 1 2   1 0 0  U11 U12 U13 


A  1 3 1    l21 1 0 
 0 U 22 U 23 

1 5 1   l l 1  0 U 33 
   31 32  0
1
 0  0 5   1
A 1 A 1
l21  210   1 l31  310   1 l32  1  2
A11 1 A11 1 1
3   1
1
U11  1 U12  1 U13  2
l21U12  U 22  3
11  U 22
3
U 22  2
l21U13  U 23  1
1 2   U 23
 1
U 23  1
l31U13  l32U 23  U 33  1
1 2    2 1  U 33
1
U 33  1
1 0 0   1 1 2 
L  1 1 0  U   0 2 1 
1 2 1  0 0 1 
   

4
Question 4 [By using Gaussian elimination]

 1 2 1 2 
 4 3 1 3
 
2 2 3 5
 
We implemented ERO to reduce the matrices
 
 1 2 1 2   1 0 4 3 
 4 3 1 3   0 1 5 3 
   
2 2 3 5  5 1
   
0 1
 2 2
By using backward substituition we will get the value of the following
 x1   1
x   2 
 2  
 x  1 
 3  

5
Question 4 [By using LU Decomposition]
A  LU
 1 2 1  1 0 0  u11 u12 u13 
4 3 1    1 0  u23 
   21  0 u22
2 2 3   1  u33 
   31 32  0 0
2
2  ( )(2)
4 2 1 2  4 2 2
 4  2    
 
21 31 32
1 1 4 3 8 5 5
3  ( )(2)
1
 
1 0 0
 
L   4 1 0
 2 
 2 1 
 5 
u11  1 u12  2 u13  1
21
u12  u22  3
4(2)  u22  3
u22  3  8
 5
u  u23  1
21 13

4(1)  u23  1
u23  5
u13 
31 32
u23  u33  3
2
2(1)  (5)  u33  3
5
u33  3

6
Until we can form matrix U,
 1 2 1
U   0 5 5 
0 0 3 
 
Apply forward substitution,
L y b
 
1 0 0   y1   2 
  
4 1 0   y2    3 
   y  5
1  3   
2
2
 5 

 y1   2 
   
 y2    5 
 y  3 
 3  
Finally, perform backward substitution to obtain the solutions.
Ux y
 1 2 1  x1   2 
 0 5 5   x    5 
  2  
0 0 3   x  3 
  3  

Therefore,
 x1   1
   
 x2    2 
 x  1 
 3  
7
Question 5

1.2 
 0.01 
A 
 5.3 
 
 0.67 
A 1  1.2  0.01  5.3  0.67  7.18
A 2  (1.2) 2  (0.01) 2  ( 5.3) 2  (0.67) 2  5.48
A   max{1.2,0.01, 5.3,0.67}  5.3

Question 6
1
x1  (16  x2  2 x3 )
4
1
x2  (10  x1  x3 )
3
1
x3  (12  x1  2 x2 )
4
k 0 1 2 3 4 5 6 7
x1 0 4 1.9667 3.5667 2.5896 3.2654 2.8228 3.11826
x2 0 3.3333 1.2 2.5882 1.6355 2.2530 1.83556 2.1105
x3 0 2.4 0.2667 1.5267 0.65138 1.2278 0.8457 1.101216

Therefore, x1  3 x2  2 x3  1

8
Question 7
1
x1  (11  2 x2  x3 )
4
1
x2  (3 x3  x1  6)
5
1
x3  (7  2 x2  2 x1 )
5
k 0 1 2 3 4 5 6 7
x1 0 2.75 1.625 2.0075 2.04305 1.98791 1.99798 2.00198
x2 0 -1.75 -0.925 -0.9295 -1.02733 -1.00135 -0.996368 -1.00078
x3 0 1 1.12 0.9688 0.993712 1.00538 0.999355 0.999522

Therefore, x1  2 x2  1 x3  1

S-ar putea să vă placă și