MA1513 Tutorial 1 T03
MA1513 Tutorial 1 T03
15 August 2022
1 Review
2 Tutorial Problems
Outline
1 Review
2 Tutorial Problems
a1 x1 + a2 x2 + · · · + an xn = b
Here,
variables: x1 , x2 , . . . , xn
coefficients: a1 , a2 , . . . , an
constant term: b
Important!
Different variables in a linear equation can only be combined using
addition or subtraction.
Geometric interpretation of linear equation:
ax + by = c (2 variables): line in xy -plane
ax + by + cz = d (3 variables): plane in xyz-space
Clifton NG Wei Zhi MA1513 Tutorial 1 15 August 2022 5 / 50
Review
x1 = u1 , x2 = u2 , . . . , xn = un , u1 , u2 , . . . , un ∈ R
Important!
A linear system has either no solution, exactly one solution, or
infinitely many solutions.
Important!
A homogeneous linear system has either only the trivial solution, or
infinitely many solutions in addition to the trivial solution.
A homogeneous linear system with more variables than equations has
infinitely many solutions.
Clifton NG Wei Zhi MA1513 Tutorial 1 15 August 2022 7 / 50
Review
∗ ∗ ∗ ∗ ∗ ∗
0 L
0 0 0 L ∗ ∗ ∗ ∗
0 0 0 0 0 L ∗ ∗
0 0 0 0 0 0 L ∗
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
Important!
The solutions of a linear system can be obtained from its REF using
back substitution.
When every column of the REF is a pivot column, except the last
column, the linear system has exactly one solution.
When there is at least one non-pivot column in the REF other than
the last column, the linear system has infinitely many solutions.
When the last column of the REF is a pivot column, the linear system
has no solution.
General solution of non-homogeneous linear system =
General solution of associated homogeneous linear system +
A particular solution of non-homogeneous linear system.
∗ ∗ ∗
0 1 0 0 0
0 0 0 1 ∗ 0 0 ∗
0 0 0 0 0 1 0 ∗
0 0 0 0 0 0 1 ∗
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
Important!
Gaussian elimination (GE): reduce augmented matrix to REF
Gauss-Jordan elimination (GJE): further reduce augmented matrix to
RREF
The solutions of a linear system obtained using either GE or GJE are
the same.
1.4 Matrices
m × n matrix:
a11 a12 ··· a1n
a21 a22 ··· a2n
A= .
.. ..
.. . .
am1 am2 · · · amn
Special types of matrices:
Square matrix
Diagonal matrix
Scalar matrix
Identity matrix
Zero matrix
Symmetric matrix
Upper/lower triangular matrix
Clifton NG Wei Zhi MA1513 Tutorial 1 15 August 2022 13 / 50
Review
1.4 Matrices
Matrix operations:
Matrix addition: A + B
Matrix subtraction: A − B
Scalar multiplication: cA
Negative of matrix: −A
Matrix multiplication: AB (only when number of columns of A =
number of rows of B)
Power of matrix: An
Matrix transpose: AT
1.4 Matrices
Important!
Properties of matrix multiplication:
AB 6= BA (not commutative)
AB = 0 does not imply A = 0 or B = 0
A(BC) = (AB)C (associative property)
A(B1 + B2 ) = AB1 + AB2 (left distributive property)
(C1 + C2 )A = C1 A + C2 A (right distributive property)
c(AB) = (cA)B = A(cB)
A0n×q = 0m×q and 0p×m A = 0p×n (zero matrix behaves like number
’0’)
AIn = Im A = A (identity matrix behaves like number ’1’)
1.4 Matrices
Important!
A is symmetric ⇔ A = AT
Properties of matrix transpose:
(AT )T = A
(A + B)T = AT + BT
(cA)T = cAT
(AB)T = BT AT
Inverse of A:
Invertible A:
A−1 exists
Important!
We can solve a linear system in matrix equation form Ax = b if A is
invertible/non-singular, and the solution is given by x = A−1 b.
a b
Inverse of A = :
c d
If ad − bc 6= 0, then A is invertible/non-singular and
−1 1 d −b
A = .
ad − bc −c a
Outline
1 Review
2 Tutorial Problems
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
x1 + 3x2 + 3x3 + 2x4 = 1
(a) 2x1 + 6x2 + 9x3 + 5x4 = 5
−x1 − 3x2 + 3x3 = 5
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
x1 + 3x2 + 3x3 + 2x4 = 1
(a) 2x1 + 6x2 + 9x3 + 5x4 = 5
−x1 − 3x2 + 3x3 = 5
Solution
1 3 3 2 1
2 6 9 5 5
−1 −3 3 0 5
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
x1 + 3x2 + 3x3 + 2x4 = 1
(a) 2x1 + 6x2 + 9x3 + 5x4 = 5
−x1 − 3x2 + 3x3 = 5
Solution
1 3 3 2 1 1 3 3 2 1
R −2R1
2 6 9 5 5 −−2−−−→ 0 0 3 1 3
R3 +R1
−1 −3 3 0 5 0 0 6 2 6
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
x1 + 3x2 + 3x3 + 2x4 = 1
(a) 2x1 + 6x2 + 9x3 + 5x4 = 5
−x1 − 3x2 + 3x3 = 5
Solution
1 3 3 2 1 1 3 3 2 1
R −2R1
2 6 9 5 5 −−2−−−→ 0 0 3 1 3
R3 +R1
−1 −3 3 0 5 0 0 6 2 6
1 3 3 2 1
R −2R2
−−3−−−→ 0 0 3 1 3
0 0 0 0 0
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
x1 + 3x2 + 3x3 + 2x4 = 1
(a) 2x1 + 6x2 + 9x3 + 5x4 = 5
−x1 − 3x2 + 3x3 = 5
Solution
1 3 3 2 1 1 3 3 2 1
R −2R1
2 6 9 5 5 −−2−−−→ 0 0 3 1 3
R3 +R1
−1 −3 3 0 5 0 0 6 2 6
1 3 3 2 1
R −2R2
−−3−−−→ 0 0 3 1 3
0 0 0 0 0
By back substitution, we have x1 = −2 − 3s − t, x2 = s, x3 = 1 − 3t ,
x4 = t, where s, t are arbitrary parameters.
Clifton NG Wei Zhi MA1513 Tutorial 1 15 August 2022 21 / 50
Tutorial Problems
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
x + y + 2z = 4
(b) x − y − z = −1
2x − 4y − 5z = 1
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
x + y + 2z = 4
(b) x − y − z = −1
2x − 4y − 5z = 1
Solution
1 1 2 4
1 −1 −1 −1
2 −4 −5 1
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
x + y + 2z = 4
(b) x − y − z = −1
2x − 4y − 5z = 1
Solution
1 1 2 4 1 1 2 4
R2 −R1
1 −1 −1 −1 −−−−−→ 0 −2 −3 −5
R3 −2R1
2 −4 −5 1 0 −6 −9 −7
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
x + y + 2z = 4
(b) x − y − z = −1
2x − 4y − 5z = 1
Solution
1 1 2 4 1 1 2 4
R2 −R1
1 −1 −1 −1 −− −−−→ 0 −2 −3 −5
R3 −2R1
2 −4 −5 1 0 −6 −9 −7
1 1 2 4
R −3R2
−−3−−−→ 0 −2 −3 −5
0 0 0 8
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
x + y + 2z = 4
(b) x − y − z = −1
2x − 4y − 5z = 1
Solution
1 1 2 4 1 1 2 4
R2 −R1
1 −1 −1 −1 −− −−−→ 0 −2 −3 −5
R3 −2R1
2 −4 −5 1 0 −6 −9 −7
1 1 2 4
R −3R2
−−3−−−→ 0 −2 −3 −5
0 0 0 8
Since the last column of the row echelon form is a pivot column, the
system is inconsistent.
Clifton NG Wei Zhi MA1513 Tutorial 1 15 August 2022 22 / 50
Tutorial Problems
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
u − v + 2w = 6
(c) 2u + 2v − 5w = 3
2u + 5v + w = 9
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
u − v + 2w = 6
(c) 2u + 2v − 5w = 3
2u + 5v + w = 9
Solution
1 −1 2 6
2 2 −5 3
2 5 1 9
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
u − v + 2w = 6
(c) 2u + 2v − 5w = 3
2u + 5v + w = 9
Solution
1 −1 2 6 1 −1 2 6
R2 −2R1
2 2 −5 3 − −−−−→ 0 4 −9 −9
R3 −2R1
2 5 1 9 0 7 −3 −3
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
u − v + 2w = 6
(c) 2u + 2v − 5w = 3
2u + 5v + w = 9
Solution
1 −1 2 6 1 −1 2 6
R2 −2R1
2 2 −5 3 − −−−−→ 0 4 −9 −9
R3 −2R1
2 5 1 9 0 7 −3 −3
R3 − 7 R2
1 −1 2 6
−−−−4−→ 0 4 −9 −9
51 51
0 0 4 4
Problem 1
Solve each of the following systems by Gaussian Elimination or
Gauss-Jordan
Elimination.
u − v + 2w = 6
(c) 2u + 2v − 5w = 3
2u + 5v + w = 9
Solution
1 −1 2 6 1 −1 2 6
R2 −2R1
2 2 −5 3 − −−−−→ 0 4 −9 −9
R3 −2R1
2 5 1 9 0 7 −3 −3
R3 − 7 R2
1 −1 2 6
−−−−4−→ 0 4 −9 −9
51 51
0 0 4 4
Since every column (except the last column) is a pivot column, the
system has exactly one solution. By back substitution, we obtain the
unique solution u = 4, v = 0, w = 1.
Clifton NG Wei Zhi MA1513 Tutorial 1 15 August 2022 23 / 50
Tutorial Problems
Problem 2
In the downtown section of a certain city, two sets of one-way streets
intersect as shown in the following:
480 330
520 x3 600
x4 x2
610 x1 640
450 310
The average hourly volume of traffic entering and leaving this section
during rush hour is given in the diagram.
Clifton NG Wei Zhi MA1513 Tutorial 1 15 August 2022 24 / 50
Tutorial Problems
Problem 2
(a) Set up a linear system with four equations to find the traffic volumes
x1 , x2 , x3 , x4 . (The average hourly volume of traffic entering an
intersection must be equal to the volume of traffic leaving.)
Problem 2
(a) Set up a linear system with four equations to find the traffic volumes
x1 , x2 , x3 , x4 . (The average hourly volume of traffic entering an
intersection must be equal to the volume of traffic leaving.)
Solution
At each junction, equate the incoming volume with the outgoing
volume.
x1 + 310 = x2 + 640
610 + 450 = x1 + x4
x + 600 = x3 + 330
2
x3 + x4 = 480 + 520
x1 − x2 = 330
x1 + x4 = 1060
⇔
x2 − x3 = −270
x3 + x4 = 1000
Problem 2
1 −1 0 0 330 1 0 0 1 1060
1 0 0 1 1060 0 1 0 1 730
G .J.E .
0 1 −1 0 −270 −−−−→
0 0 1 1 1000
0 0 1 1 1000 0 0 0 0 0
Problem 2
1 −1 0 0 330 1 0 0 1 1060
1 0 0 1 1060 0 1 0 1 730
G .J.E .
0 1 −1 0 −270 −−−−→
0 0 1 1 1000
0 0 1 1 1000 0 0 0 0 0
The general solution of this system is given by
x1 = 1060 − t
x2 = 730 − t
x = 1000 − t
3
x4 = t
Problem 2
Problem 2
Problem 2
Problem 2
Problem 2
Problem 2
Problem 2
Problem 2
Problem 3
When propane gas burns, the propane combines with oxygen to form
carbon dioxide and water:
Problem 3
Problem 3
Problem 3
(b) Find a general solution for the homogeneous system obtained in (a).
Problem 3
(b) Find a general solution for the homogeneous system obtained in (a).
Solution
1 0 0 − 41
3 0 −1 0 0 0
G .J.E .
8 0 0 −2 0 −−−−→ 0 1 0 − 5
4 0
0 2 −2 −1 0 0 0 1 − 43 0
Problem 3
(b) Find a general solution for the homogeneous system obtained in (a).
Solution
1 0 0 − 41
3 0 −1 0 0 0
G .J.E .
8 0 0 −2 0 −−−−→ 0 1 0 − 5
4 0
0 2 −2 −1 0 0 0 1 − 43 0
The general solution of this system is given by
1
w = 45 t
x = 4t
y = 43 t
z = t
Problem 3
Problem 3
Problem 4
Given a quadric surface in the xyz-space with equation
ax 2 + by 2 + cz 2 = d,
where a, b, c, d are real constants, that passes through the points
(1, 1, −1), (1, 3, 3) and (−2, 0, 2), find a formula for the quadric surface.
Problem 4
Given a quadric surface in the xyz-space with equation
ax 2 + by 2 + cz 2 = d,
where a, b, c, d are real constants, that passes through the points
(1, 1, −1), (1, 3, 3) and (−2, 0, 2), find a formula for the quadric surface.
Solution
By substituting (x, y , z) = (1, 1, −1), (1, 3, 3) and (−2, 0, 2) into the
equation
ax 2 + by 2 + cz 2 = d,
we obtain a homogeneous system of linear equations
a + b + c − d = 0
a + 9b + 9c − d = 0
4a + 4c − d = 0
Problem 4
1 1 1 −1 0 1 0 0 −1 0
G .J.E .
1 9 9 −1 0 −
−−−→ 0 1 0 − 43 0
4 0 4 −1 0 0 0 1 43 0
Problem 4
1 1 1 −1 0 1 0 0 −1 0
G .J.E .
1 9 9 −1 0 −
−−−→ 0 1 0 − 43 0
4 0 4 −1 0 0 0 1 43 0
The general solution of this system is given by
a = t
= 34 t
b
c = − 43 t
d = t
Problem 4
1 1 1 −1 0 1 0 0 −1 0
G .J.E .
1 9 9 −1 0 −
−−−→ 0 1 0 − 43 0
4 0 4 −1 0 0 0 1 43 0
The general solution of this system is given by
a = t
= 34 t
b
c = − 43 t
d = t
Any one of the non-trivial solutions gives us a formula for the same
quadric surface. In particular, by taking t = 4, we get the formula
4x 2 + 3y 2 − 3z 2 = 4 for the quadric surface.
Problem 5
Problem 5
(a) Based on the information given above, find a 3 × 3 matrix A such that
x1 x0
y1 = A y0 .
z1 z0
Problem 5
(a) Based on the information given above, find a 3 × 3 matrix A such that
x1 x0
y1 = A y0 .
z1 z0
Solution
Since each adult in 2020 gives birth to one baby in 2021, the number
of babies in 2021, x1 = z0 .
Since 50% of the babies in 2020 become cubs in 2021, the number of
one-year-old cubs in 2021, y1 = 0.5x0 .
Since 60% of the cubs in 2020 become adults in 2021 and 70% of the
adults in 2020 remain as adults in 2021, the number of adults in
2021, z1 = 0.6y0 + 0.7z0 .
Clifton NG Wei Zhi MA1513 Tutorial 1 15 August 2022 37 / 50
Tutorial Problems
Problem 5
Problem 5
Problem 5
Problem 5
xn x0
(b) Let yn = An y0 where n is a positive integer. What do the
zn z0
numbers xn , yn and zn represent?
Problem 5
xn x0
(b) Let yn = An y0 where n is a positive integer. What do the
zn z0
numbers xn , yn and zn represent?
Solution
xn , yn and zn are the numbers of babies, one-year-old cubs and
adults, respectively, after n years, i.e. at the end of 2020 + n.
Problem 5
Problem 5
Problem 5
Problem 5
Problem 5
Problem 5
Problem 5
Problem 6
Problem 6
Problem 6
Problem 6
Problem 6
Problem 6
Problem 6
Problem 6
Problem 6
Problem 7
The steady-state heat flow problem for the plate as shown in the diagram
below can be approximated by the solution of a linear system with 8
equations and the variables are the temperatures at the eight internal grid
points represented by T1 , T2 , . . . , T8 in degree Celsius, using the fact that
the temperature at each grid point is approximately equal to the average
of the four nearest grid points on the left, right, top and below.
Problem 7
0o C 0o C 0o C 0o C
T1 T3 T5 T7
5o C 20o C
T2 T4 T6 T8
5o C 20o C
Problem 7
Problem 7
Problem 7
Problem 7
Problem 7
1 0 0 0 0 0 0 0 3.9569
0 1 0 0 0 0 0 0 6.5885
0 0 1 0 0 0 0 0 4.2392
0 0 0 1 0 0 0 0 7.3971
0 0 0 0 1 0 0 0 5.6029
0 0 0 0 0 1 0 0 8.7608
0 0 0 0 0 0 1 0 9.4115
0 0 0 0 0 0 0 1 12.0431
Problem 7
1 0 0 0 0 0 0 0 3.9569
0 1 0 0 0 0 0 0 6.5885
0 0 1 0 0 0 0 0 4.2392
0 0 0 1 0 0 0 0 7.3971
0 0 0 0 1 0 0 0 5.6029
0 0 0 0 0 1 0 0 8.7608
0 0 0 0 0 0 1 0 9.4115
0 0 0 0 0 0 0 1 12.0431
So T1 = 3.9569, T2 = 6.5885, T3 = 4.2392, T4 = 7.3971,
T5 = 5.6029, T6 = 8.7608, T7 = 9.4115, T8 = 12.0431.