Download as pdf or txt
Download as pdf or txt
You are on page 1of 9

STEPHEN HENRY

9/30/19
LINEAR ALGEBRA HOMEWORK ASSIGNMENT #4

1. What matrix E put A into triangular form EA = U ? Multiply by E −1 = L to factor A into


LU .

2 1 0
A =  0 4 2 
 6 3 5 

SOLUTION:

 1 0 0
l31 = = 3  E31 =  0 1 0 
6
2
 −3 0 1 

 1 0 0 2 1 0  2 1 0  2 1 0 
Using EA = U   0 1 0    0 4 2  =  0 4 2  U =  0 4 2
       
 −3 0 1   6 3 5  0 0 5   0 0 5 

 1 0 0 1 0 0 
Using L = E31−1  L =  0 1 0   L = 0 1 0 
   
l31 0 1   3 0 1 

VERIFICATION:

1 0 0   2 1 0   2 1 0 
LU = A  0 1 0    0 4 2  =  0 4 2 
 3 0 1   0 0 5   6 3 5 

STEPHEN HENRY 1
STEPHEN HENRY
9/30/19
LINEAR ALGEBRA HOMEWORK ASSIGNMENT #4

2. What three elimination matrices E21 , E31 , E32 put A into its upper triangular
E32 E31 E21 A = U ? Multiply by E32−1 , E31−1 and E 21−1 to factor A into L times U :

1 0 1 
A =  2 2 2  and L = E21−1 E31−1 E32−1
 3 4 5 

SOLUTION:

1 0 1   1 0 0  1 0 0
A =  2 2 2  E21 =  −l21 1 0  =  −2 1 0 
2
l21 = = 2
1
 3 4 5   0 0 1   0 0 1 

 1 0 0   1 0 1  1 0 1   1 0 0  1 0 0
E21 A =  −2 1 0    2 2 2  = 0 2 0  E31 =  0 1 0  =  0 1 0 
3
l31 = = 3
1
 0 0 1   3 4 5   3 4 5   −l31 0 1   −3 0 1 

 1 0 0  1 0 1  1 0 1 
E31 E21 A =  0 1 0   0 2 0  = 0 2 0 
 −3 0 1   3 4 5  0 4 2 

1 0 0  1 0 0 
E32 = 0 1 0  = 0 1 0 
4
l32 = = 2
2
0 −l32 1   0 −2 1 

1 0 0  1 0 1  1 0 1 
E32 E31 E21 A = 0 1 0   0 2 0  = 0 2 0  = U
0 −2 1  0 4 2  0 0 2 

1 0 1 
Therefore, E32 E31 E21 A = U  0 2 0 
 
0 0 2 

STEPHEN HENRY 2
STEPHEN HENRY
9/30/19
LINEAR ALGEBRA HOMEWORK ASSIGNMENT #4

 1 0 0  1 0 0   1 0 0  1 0 0 
E = l21 1 0  =  2 1 0 
−1
21 E =  0 1 0  = 0 1 0 
−1
31

 0 0 1  0 0 1  l31 0 1   3 0 1 

1 0 0  1 0 0 
E = 0 1
−1
32 0  = 0 1 0 
0 l32 1  0 2 1 

 1 0 0   1 0 0  1 0 0  
 
L = E ( E E )   2 1 0    0 1 0   0 1 0  
−1
21
−1
31
−1
32

 0 0 1    3 0 1  0 2 1  

 1 0 0  1 0 0  1 0 0  1 0 0
L =  2 1 0   0 1 0   L =  2 1 0 
    hint: L = l21 1 0 
 0 0 1   3 2 1   3 2 1  l31 l32 1 

VERIFICATION:

 1 0 0  1 0 1   1 0 1 
LU = A   2 1 0   0 2 0  =  2 2 2 
 3 2 1  0 0 2   3 4 5 

3. Which number c leads to zero in the second pivot position? A row exchange is needed
and A = LU will not be possible. Which c produces zero in the third pivot position? Then
a row exchange can’t help, and elimination fails.

1 c 0
A =  2 4 1 
 3 5 1 

STEPHEN HENRY 3
STEPHEN HENRY
9/30/19
LINEAR ALGEBRA HOMEWORK ASSIGNMENT #4

SOLUTION:

The objective is to determine the number c that leads to zero in the second pivot
position.

1 2 0  1 2 0 
Let c = 2   2 4 1  l21 = = 2  R2 → R2 − 2 R1  0 0 1 
2
1
 3 5 1   3 5 1 

Next, objective is to determine which c produces 0 in the third pivot position.

1 1 0 1 1 0 
Let c = 1   2 4 1  l21 = = 2  R2 → R2 − 2 R1  0 2 1 
2
1
 3 5 1   3 5 1 

1 1 0 
l31 = = 3  R3 → R3 − 3R1  0 2 1 
3
1
0 2 1 

1 1 0 
l32 = = 1  R3 → R3 − R2  0 2 1  Since the last row are zero then the matrix is
2
2
0 0 0 
not invertible (It’s a Singular Matrix)

4. Find the LU factorization of the following matrix:

 1 4 −1 
A =  3 7 −2 
 −2 −3 1 

STEPHEN HENRY 4
STEPHEN HENRY
9/30/19
LINEAR ALGEBRA HOMEWORK ASSIGNMENT #4

SOLUTION:

 1 4 −1  1 0 0  1 0 0
A =  3 7 2  E21 =  −l21 1 0  =  −3 1 0 
3
l21 = = 3
1
 −2 −3 1   0 0 1   0 0 1 

 1 0 0   1 4 −1  1 4 −1
E21 A =  −3 1 0    3 7 −2  =  0 −5 1 
 0 0 1   −2 −3 1   −2 −3 1 

 1 0 0  1 0 0  1 0 0   1 4 −1
−2
l31 = = −2 E31 =  0 1 0  =  0 1 0  ; E31 E21 A =  0 1 0    0 −5 1 
1
 −l31 0 1   2 0 1   2 0 1   −2 −3 1 

1 4 −1 1 0 0  1 0 0 
 E31 E21 A = 0 −5 1  E32 = 0 1 0  = 0 1 0 
5
l32 = = −1
−5
0 5 −1 0 −l32 1  0 1 1 

1 0 0  1 4 −1 1 4 −1 1 4 −1


E32 E31 E21 A = 0 1 0   0 −5 1  = 0 −5 1   U = 0 −5 1 
0 1 1  0 5 −1 0 0 0  0 0 0 

 1 0 0  1 0 0 
Finding The Lower Triangle L = E21−1 ( E31−1 E32−1 ) E21−1 = l21 1 0  =  3 1 0 
 0 0 1  0 0 1 

 1 0 0  1 0 0 1 0 0  1 0 0 
E =  0 1 0  =  0 1 0 
−1
31 E = 0 1
−1
32 0  = 0 1 0 
l31 0 1   −2 0 1  0 l32 1   0 −1 1 

STEPHEN HENRY 5
STEPHEN HENRY
9/30/19
LINEAR ALGEBRA HOMEWORK ASSIGNMENT #4

 1 0 0  1 0 0   1 0 0 
E31−1 E32−1 =  0 1 0   0 1 0  =  0 1 0 
 −2 0 1  0 −1 1   −2 −1 1 

1 0 0   1 0 0   1 0 0   1 0 0
E ( E E ) =  3 1 0    0 1 0  =  3 1 0   L =  3 1 0 
−1
21
−1
31

−1
32
    

0 0 1   −2 −1 1   −2 −1 1   −2 −1 1 

 1 0 0  1 4 −1  1 4 −1
LU = A   3 1 0   0 −5 1  =  3 7 −2 
 −2 −1 1  0 0 0   −2 −3 1 

ALTERNATIVELY

 1 4 −1  1 4 −1
A =  3 7 −2   0 −5 1 
3
l21 = = 3 R2 → R2 − 3R1  
1
 −2 −3 1   −2 −3 1 

1 4 −1
−2 0 −5 1 
l31 = = −2 R3 → R3 + 2 R1  
1
0 5 −1

1 4 −1
−5 0 −5 1  = U
l32 = = −1 R3 → R3 + R2  
5
0 0 0 

1 0 0  1 0 0
L = E ( E E ) = l21 1
−1
21
−1
31
−1
32 0   L =  3 1 0 

l31 l32 1   −2 −1 1 

STEPHEN HENRY 6
STEPHEN HENRY
9/30/19
LINEAR ALGEBRA HOMEWORK ASSIGNMENT #4

5. Solve Lc = b to find c . Then Solve Ux = c to find x . What is A ?

1 0 0  1 1 1 4
L = 1 1 0  , U = 0 1 1 , b =  5 
1 1 1  0 0 1 6 

SOLUTION:

1 0 0   c1   4 
Lc = b  1 1 0  c2  =  5   c1 = 4, c1 + c2 = 5, c1 + c2 + c3 = 6
1 1 1   c3   6 

c1 = 4 , c2 = 5 − c1  c2 = 1 , c1 + c2 + c3 = 6  c3 = 6 − ( c2 + c1 )  c3 = 1

1 1 1  x1   4 
Ux = c  0 1 1  x2  =  1   x1 + x2 + x3 = 4, x2 + x3 = 1, x3 = 1
0 0 1  x3   1 

x2 = 1 − x3  x2 = 1 − 1  x2 = 0 x1 = 4 − ( x2 + x3 )  x1 = 4 − 1  x1 = 3

6. Solve the matrix equation Ax = b by using LU decomposition method, given

 3 −7 −2   −7 
A =  −3 5 1  , b =  5 
 6 −4 0   2 

SOLUTION:

Solve Lc = b and then solve Ux = c

 3 −7 −2   3 −7 −2 
 −3 5 1  −3
  l21 = = −1  R2 → R2 + R1  0 −2 −1
3
 6 −4 0  6 −4 0 

STEPHEN HENRY 7
STEPHEN HENRY
9/30/19
LINEAR ALGEBRA HOMEWORK ASSIGNMENT #4

 3 −7 2 
 0 −2 −1
6 10
l31 = = 2  R3 → R3 − 2 R1 l32 = = −5  R3 → R3 + 5 R2
3 −2
0 10 4 

 3 −7 2  1 0 0  1 0 0
 0 −2 −1 = U L = l21 1 0   L =  −1 1 0 

0 0 −1 l31 l32 1   2 −5 1 

1 0 0   c1   b1   1 0 0   c1   −7 
Using Lc = b  l21 1 0  c2  = b2    −1 1 0   c2  =  5 
l31 l32 1   c3  b3   2 −5 1   c3   2 

c1 = −7 , − c1 + c2 = 5  c2 = 5 + c1  c2 = −2 , 2c1 − 5c2 + c3 = 2  c3 = 6

 3 −7 2   x1   c1   3 −7 2   x1   −7 
Using Ux = c  0 −2 −1  x2  = c2   0 −2 −1  x2  =  −2 
0 0 −1  x3   c3  0 0 −1  x3   6 

− x3 = 6  x3 = −6 , − 2 x2 − x3 = −2  x2 = 4 , 3 x1 − 7 x2 + 2 x3 = −7  x1 = 3

7. When zero appears in a pivot position, A = LU is not possible! (we require nonzero
pivots in U .) Show directly why these equations are impossible.

1 1 0   1 0 0   d e g
1 1 2  =  l 1 0   0 f h 
   
1 2 1   m n 1   0 0 i 

SOLUTION:

STEPHEN HENRY 8
STEPHEN HENRY
9/30/19
LINEAR ALGEBRA HOMEWORK ASSIGNMENT #4

1 1 0   1 0 0   d e g  1 1 0   d e g 
1 1 2  =  l 1 0   0 f h   1 1 2  =  ld le + f lg + h 
   
1 2 1   m n 1   0 0 i  1 2 1   md me + nf mg + nh + i 

On Equating, d = 1 , e = 1 , g = 0 , ld = 1  l = 1

le + f = 1  f = 0 , lg + h = 2  h = 2 , md = 1  m = 1 , me + nf = 2  1 + 0  2

Which is not possible. Thus, there is no value of n obtained from the above calculation
and no value can be obtained for i .

Hence, no lower and upper decomposition is possible, and this is because f = 0 .

STEPHEN HENRY 9

You might also like