2024 Fall Engineering Linear Algebra Midterm Exam - Solution
2024 Fall Engineering Linear Algebra Midterm Exam - Solution
2024 Fall Engineering Linear Algebra Midterm Exam - Solution
Midterm Exam
※ Do not use any portable electronic device.
2. (20 pts.) The 3 by 3 matrix A reduces to the identity matrix I by the following row operations (in order):
E31:Add -4(row 1) to row 3, E32: Add 3(row 2) to row 3, E23:Add -2(row 3) to row 2, E13:Add -3(row 3)
to row 1, and E12:Add -2(row 2) to row 1.
(a) (6 pts.) Express the inverse matrix 𝐴−1 in terms of the E’s. Then compute 𝐴−1 .
(b) (7 pts.) What is the original matrix 𝐴?
(c) (7 pts.) What is the lower triangular factor L in 𝐴 = 𝐿𝑈, where all diagonal entries of U equal to 1?
4. (20 pts.) Let 𝐛 = [𝑎, 𝑏]T , and suppose that T: R3R2 be a linear transformation defined by T(x) = Ax,
where A is a (2×3) standard matrix such that the augmented matrix [A | b] reduces to
1 0 7 𝑎 + 2𝑏
[ ]
0 1 −4 3𝑎 + 5𝑏
(a) (6 pts.) Find the vectors x1, x2, x3 in R3 such that 𝐱1T = [𝑐, 𝑑, 0], 𝐱 2T = [𝑒, 𝑓, 0], 𝐱 3T = [𝑔, ℎ, 1], T(x1)
= e1, T(x2) = e2 and T(x3) = 0, where e1= [1, 0]T, e2= [0, 1]T .
(b) (6 pts.) Express each of standard basis vectors e1, e2, e3 of R3 as a linear combination of the vectors x1,
x2, x3.
(c) (8 pts.) Determine the matrix A using the linear combination in problem (b). Other method, such as
row operation of the reduced form, is not allowed.
1 11
1 0
2 −4 16 −14 3 6
−1 5 −17 19 1 2
𝐴𝑇 = [ ] ~ 0 1 −
1 −3 11 −11 3 3
3 −4 18 −13 0 0 0 0
[ 0 0 0 0 ]
𝑎 = 1/3, 𝑏 = 11/6, 𝑐 = −1/3, 𝑑 = 2/3, 𝑎 + 𝑏 + 𝑐 + 𝑑 = 5/2
Solution 2)
Let b b1 , b2 , b3 , b4 .
T
Then, the augmented matrix of the system and the reduced row echelon form of the augmented matrix
are
5 2
𝑏 + 3 𝑏2
6 1
2 −4 16 −14 𝑏1 1 0 2 1 1 1
𝑏2 0 1 −3 4 𝑏 + 3 𝑏2
−1 5 −17 19 6 1
[ ] and 1 1 ,
1 −3 11 −11 𝑏3 0 0 0 0 − 3 𝑏1 + 3 𝑏2 + 𝑏3
3 −4 18 −13 𝑏4 0 0 0 0 11 2
[ − 𝑏1 − 3 𝑏2 + 𝑏4 ]
6
respectively.
The 3rd row and the 4th row of the reduced augmented matrix should be 0 , respectively.
𝑏3 = 13 𝑏1 − 13 𝑏2 , b4 = 11
6
𝑏 + 23 𝑏2
1
𝑏1
𝑏1 1 0
𝑏2
𝑏 0 1
𝒃 = [ 2] = 1 1
𝑏 − 3 𝑏2 = 𝑏1 [ ] + 𝑏2 [ ].
𝑏3 3 1 1/3 −/3
𝑏4 11 2 11/6 2/3
[ 6 𝑏1 + 3 𝑏2 ]
The condition that the vector b must satisfy for the above system to be consistent is 𝒃 ∈ 𝑉 =
span{ 𝒗1 , 𝒗2 }, where 𝒗1 = ( 1, 0, 1/3, 11/6 )𝑇 and 𝒗2 = ( 0, 1, −1/3, 2/3 )𝑇 .
2.(20 pts.)
(a) Apply the three operations to I, i.e.
1 −2 0 1 0 −3 1 0 0 1 0 0 1 0 0
𝐴−1 = 𝐸12 𝐸13 𝐸23 𝐸32 𝐸31 = [0 1 0] [0 1 0 ] [0 1 −2] [0 1 0] [ 0 1 0]
0 0 1 0 0 1 0 0 1 0 3 1 −4 0 1
1 −2 0 1 0 −3 1 0 0 1 0 0
= [0 1 0] [0 1 0 ] [0 1 −2] [ 0 1 0]
0 0 1 0 0 1 0 0 1 −4 3 1
1 −2 0 1 0 −3 1 0 0 1 −2 0 13 −9 −3
= [0 1 0] [0 1 0 ] [ 8 −5 −2] = [0 1 0] [ 8 −5 −2]
0 0 1 0 0 1 −4 3 1 0 0 1 −4 −3 1
−3 1 1
= [ 8 −5 −2]
−4 3 1
1 0 0 1 0 0 1 0 0
−1 −1
(c) L=E21 E32 =[0 1 0] [0 1 0] = [0 1 0]
4 0 1 0 −3 1 4 −3 1
3 (20 pts.)
(a) Guass-Jordan Elimination leads to
3 2 1 3 3 2 1 3 3 2 1 3 3 0 −3 0
𝑇
𝐴 = [6 6 6 9 ] → [0 2 4 3] → [0 2 4 3 ] → [0 2 4 3]
3 4 5 6 0 2 4 3 0 0 0 0 0 0 0 0
1 0 −1 0
→ [0 1 2 3/2]
0 0 0 0
Then, the basis for C(AT ) and N(AT ) is the pivot columns and the special solutions of 𝐴𝑇 .
4. (20 pts.)
1 − 7u 2 − 7v −7w
(a) x1 = [3 + 4u] , x2 = [5 + 4v] , and x3 = [ 4w ] . To satisfy the given constraints,
u v w
1 2 −7
x1 = [3] , x2 = [5] , and x3 = [ 4 ]
0 0 1
(b) To find each combination, let us construct the following augmented matrix and find its reduced row
echelon form,
1 2 −7 1 0 0 1 0 0 −5 2 −43
[3 5 4 0 1 0] → [0 1 0 3 −1 25 ]
0 0 1 0 0 1 0 0 1 0 0 1
−5
(c) 𝑇(𝑒1 ) = −5𝑇(𝑥1 ) + 3𝑇(𝑥2 ) = −5𝑒1 + 3𝑒2 = [ ].
3
2
𝑇(𝑒2 ) = 2𝑇(𝑥1 ) − 𝑇(𝑥2 ) = 2𝑒1 − 𝑒2 = [ ].
−1
−43
𝑇(𝑒3 ) = −43𝑇(𝑥1 ) + 25𝑇(𝑥2 ) + 𝑇(𝑥3 ) = −43𝑒1 + 25𝑒2 = [ ].
25
−5 2 −43
𝐴=[ ]
3 −1 25
1 1 0 1 1 0
5. 𝐴𝐵𝐶 = [ [𝑇(𝑥 2 − 1)]𝐶 [𝑇(𝑥 + 1)]𝑐 [𝑇(𝑥 2 − 1)]𝑐 ] = [ [0] [2] [−2] ] = [−1 1 −2]
1 𝐶 −1 𝑐 0 𝑐 2 −2 2
Engineering Linear Algebra, Fall Semester, 2024
Or you can use the transition matrix as follows,
Let the matrix of ASS represent the linear transformation with respect to the standard bases S = {1, x, x 2 } for P₂
and D = {e1 , e2 , e3 } for R3. Then,
0 1 1
𝐴 = [[𝐿(1)]𝑠 , [𝐿(𝑥)]𝑠 , [𝐿(𝑥 2 )]𝑠 ] = [ 0 2 0] .
−1 0 0
1 0 0 0 1 1 −1 1 0 0 1 1 −1 1 0
𝐴BC = 𝑇C←B = 𝐶 −1 𝐴 𝐵 = [−1 1 0] [ 0 2 0] [ 0 1 −1] = [ 0 1 −1] [ 0 1 −1]
1 −1 1 −1 0 0 1 0 1 −1 −1 1 1 0 1
1 1 0
= [−1 1 −2]
2 −2 2
Note: