Linear Algebra

ENGE600004 - 4 SKS
MUHAMMAD IBADURROHMAN, ST, MT, PHD (DIC)
Instructor

 Nama : Muhammad Ibadurrohman, PhD (DIC)

 Educational background:
 Sarjana Teknik (Teknik Kimia UI) – 2009
 Magister Teknik & Master of Science in Engineering (Teknik Kimia UI &
Chemical Engineering Taiwan Tech dual-degree program) – 2011
 Doctor of Philosophy (Chemical Engineering, Imperial College London) –
2016
 Field of Expertise: Photocatalysis, Photoelectrochemistry
Buku Ajar

 Howard Anton, Elementary Linear Algebra

9th Edition, Wiley, 2005
 Gilbert Strang, Introduction to Linear
Algebra 3rd Edition, Wellesley Cambridge
Press, 2003
Instrumen Evaluasi dan Code of Conduct

 Mid Exam: 35%

 Final Exam: 35%
 Quiz and Assignments: 30%
 Attendance requirement: 80%

 Codes of Conduct:
 No cheating!
 Tolerance for late comers: 15 mins
 Electronic devices are not allowed during lectures (laptop, mobile,
tablet, etc)
 Be respectful to each other
 Linear Equations
 Which of these are linear  A linear equation in the n variables (1 equation, 𝑛 unknowns):
equations?
 2𝑥 − 𝑦 = 3
𝑎1 𝒙𝟏 + 𝑎2 𝒙𝟐 + ⋯ + 𝑎𝑛 𝒙𝒏 = 𝒃 𝑎1 , 𝑎2 , … , 𝑎𝑛 not all 0
 𝑥=4
 ln 5𝑥 − 3𝑦 = 1
 ln 5𝑥 − 3𝑦 = 1  𝑎1 , 𝑎2 , … , 𝑎𝑛 are coefficients
 𝑥1 + 3𝑥2 − 35𝑥3 = 5  𝑥1 , 𝑥2 , … , 𝑥𝑛 are variables or unknowns
 cos 3𝑥 − 2𝑦 = 0  𝒃 is termed a constant
 5Τ𝑦 + 2𝑧
 when 𝒃 = 0, it is called a homogenous linear equation
2 2
 𝑥 + 𝑦 = 16
 A set of values 𝑥1 = 𝑘1 , 𝑥2 = 𝑘2 , … , 𝑥𝑛 = 𝑘𝑛 are a solution for the
 𝑥 + 3𝑦 − 9𝑧 = 5
linear equation if these satisfy 𝑎1 𝒌𝟏 + 𝑎2 𝒌𝟐 + ⋯ + 𝑎𝑛 𝒌𝒏 = 𝒃
 2𝑥 + 𝑧 = 8
 the solution is often expressed in a vector notation: 𝒌𝟏 , 𝒌𝟐 , … , 𝒌𝒏
 2𝑥 + 𝑧 = 8
 𝑥1 𝑥2 − 𝑥2 + 7𝑥3 = 5
Systems of Linear equations
 A general form of a system of  Examples
linear equations
 2 equations 2 unknowns
𝑎11 𝒙𝟏 + 𝑎12 𝒙𝟐 + ⋯ + 𝑎1𝑛 𝒙𝒏 = 𝒃𝟏 2𝑥1 − 𝑥2 = 5
𝑥1 + 2𝑥2 = 3
𝑎21 𝒙𝟏 + 𝑎22 𝒙𝟐 + ⋯ + 𝑎2𝑛 𝒙𝒏 = 𝒃𝟐
⋮ ⋮ ⋮ ⋮  3 equations 3 unknowns
𝑎𝑚1 𝒙𝟏 + 𝑎𝑚2 𝒙𝟐 + ⋯ + 𝑎𝑚𝑛 𝒙𝒏 = 𝒃𝒎 2𝑥 − 𝑦 + 3𝑧 = 5
𝑥 + 3𝑦 − 2𝑧 = 9
3𝑥 + 2𝑦 + 𝑧 = 4
 𝑚 denotes the number of equations
 𝑛 denotes the number of unknowns  2 equations 3 unknowns

 A linear system is consistent if it has at 2𝑥 − 𝑦 + 3𝑧 = 5

least one solution 𝑥 + 3𝑦 − 2𝑧 = 9
 A linear system is inconsistent if it has no
solution
 Systems of Linear equations
 Representation in the form of matrix
products
𝑎11 𝑎12 … 𝑎1𝑛 𝒙𝟏 𝒃𝟏
𝑎21 𝑎22 … 𝑎2𝑛 𝒙𝟐 𝒃𝟐
⋮ ⋮ ⋱ ⋮ ⋮ = ⋮
𝑎11 𝒙𝟏 + 𝑎12 𝒙𝟐 + ⋯ + 𝑎1𝑛 𝒙𝒏 = 𝒃𝟏 𝑎𝑚1 𝑎𝑚2 … 𝑎𝑚𝑛 𝒙𝒏 𝒃𝒎
𝑎21 𝒙𝟏 + 𝑎22 𝒙𝟐 + ⋯ + 𝑎2𝑛 𝒙𝒏 = 𝒃𝟐
⋮ ⋮ ⋮ ⋮ 𝐴𝒙 = 𝒃
𝑎𝑚1 𝒙𝟏 + 𝑎𝑚2 𝒙𝟐 + ⋯ + 𝑎𝑚𝑛 𝒙𝒏 = 𝒃𝒎
OR

𝑎11 𝑎12 𝑎1𝑛 𝒃𝟏

𝑎21 𝑎22 𝑎2𝑛 𝒃𝟐
𝒙𝟏 ⋮ + 𝒙 𝟐 ⋮ + ⋯ + 𝒙 𝒏 ⋮ =
⋮
𝑎𝑚1 𝑎𝑚2 𝑎𝑚𝑛 𝒃𝒎
 Two-dimensional linear systems (𝑛 = 2)

𝑎1 𝑥 + 𝑏1 𝑦 = 𝑐1
𝑎1 𝑥 + 𝑏1 𝑦 = 𝑐1
 Example of “no solutions”
2𝑥 + 3𝑦 = 7
4𝑥 + 6𝑦 = 5
 Example of “infinitely many solutions”  Example of “exactly one solution”
2𝑥 + 3𝑦 = 7 𝑥 + 2𝑦 = 4
4𝑥 + 6𝑦 = 14 2𝑥 − 𝑦 = 3
 Three-dimensional linear systems (𝑛 = 3)
𝑎1 𝑥 + 𝑏1 𝑦 + 𝑐1 𝑧 = 𝑑1
𝑎2 𝑥 + 𝑏2 𝑦 + 𝑐2 𝑧 = 𝑑2
𝑎3 𝑥 + 𝑏3 𝑦 + 𝑐3 𝑧 = 𝑑3
 Example of “no solutions”
𝑥+ 𝑦− 𝑧=6
2𝑥 + 𝑦 + 3𝑧 = 1
2𝑥 + 2𝑦 − 2𝑧 = 3
 Example of “infinitely many solutions”  Example of “exactly one solution”
𝑥+ 𝑦− 𝑧=4 𝑥+ 𝑦− 𝑧=4 𝑥+𝑦− 𝑧 =6
2𝑥 + 𝑦 − 2𝑧 = 1 2𝑥 + 𝑦 − 2𝑧 = 1 2𝑥 − 𝑦 + 3𝑧 = 1
3𝑥 + 2𝑦 − 3𝑧 = 5 2𝑥 + 2𝑦 − 2𝑧 = 8 3𝑥 + 2𝑦 − 𝑧 = 14
 Augmented matrices
 For convenience, linear systems are abbreviated in the form of augmented matrices
𝑎11 𝒙𝟏 + 𝑎12 𝒙𝟐 + 𝑎13 𝒙𝟑 + ⋯ + 𝑎1𝑛 𝒙𝒏 = 𝒃𝟏 𝑎11 𝑎12 𝑎13 … 𝑎1𝑛 𝒃𝟏
𝑎11 𝒙𝟏 + 𝑎12 𝒙𝟐 + 𝑎13 𝒙𝟑 + ⋯ + 𝑎1𝑛 𝒙𝒏 = 𝒃𝟐 𝑎11 𝑎12 𝑎13 … 𝑎1𝑛 𝒃𝟐
𝑎11 𝒙𝟏 + 𝑎12 𝒙𝟐 + 𝑎13 𝒙𝟑 + ⋯ + 𝑎1𝑛 𝒙𝒏 = 𝒃𝟑 𝑎11 𝑎12 𝑎13 … 𝑎1𝑛 𝒃𝟑
⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋱ ⋮ ⋮
𝑎𝑚1 𝒙𝟏 + 𝑎𝑚2 𝒙𝟐 + 𝑎𝑚3 𝒙𝟑 + ⋯ + 𝑎𝑚𝑛 𝒙𝒏 = 𝒃𝒎 𝑎11 𝑎12 𝑎13 … 𝑎1𝑛 𝒃𝒎

 Examples
𝒙𝟏 + 𝒙𝟐 − 𝒙𝟑 = 6 1 1 −1 6  Each row of an augmented matrix
2𝒙𝟏 − 𝒙𝟐 + 3𝒙𝟑 = 1 2 −1 3 1 represents constants from one
3𝒙𝟏 + 2𝒙𝟐 − 𝒙𝟑 = 14 3 2 −1 14 equation
𝒙𝟏 =3 1 0 0 3  Each column of an augmented
𝒙𝟐 =2 0 1 0 2 matrix represents all coefficients for
𝒙𝟑 = −1 0 0 1 −1 a single variable
Elementary row operations

 Algebraic operations need to be performed so that the matrix

become simple enough to ascertain its consistency and extract its
solutions (if consistent).
 A set of algebraic operations in a matrix is termed elementary row
operations (recall that rows in an augmented matrix represent
equations in a linear system)
 Typical algebraic operations in a matrix are as follows:
 Multiply a row through by a nonzero constant
 Interchange two rows
 Add a constant times one row to another.
 Gauss-Jordan elimination
 Reduced row-echelon form (Gauss-Jordan elimination)
 Reduced echelon form of an
augmented matrix is the solution
for the corresponding linear
system

 Row-echelon form (Gaussian elimination)  When a reduced echelon form

of an augmented matrix is
obtained, a solution of the
corresponding linear system can
be easily obtained by back
substitution
 Gauss-Jordan elimination
 Properties of reduced echelon form
 If a row does not consist entirely of zeros,
then the first nonzero number in the row is
a 1. We call this a leading 1.
 If there are any rows that consist entirely
of zeros, then they are grouped together
at the bottom of the matrix.
 In any two successive rows that do not
consist entirely of zeros, the leading 1 in
the lower row occurs farther to the right
than the leading 1 in the higher row.
 Each column that contains a leading 1
has zeros everywhere else in that column.

 Properties of echelon form

 The same as those of reduced echelon
form, except for the 4th
 Gauss-Jordan elimination
 Which of these matrices are in the row-echelon and reduced row-echelon form
(or neither)
 Gauss Jordan elimination
 Solution for a reduced row-echelon form is really easy!

a. b.

c. d.
 Gauss-Jordan elimination
 Linear system: 1 1 −1 6 1 1 −1 6 1 0 −1 4
𝒙𝟏 + 𝒙𝟐 − 𝒙𝟑 = 6 2 −1 3 1 0 −1 0 −2 0 −1 0 −2
2𝒙𝟏 − 𝒙𝟐 + 3𝒙𝟑 = 1 3 2 −1 14 0 0 −1 1 𝑅1 + 𝑅2 0 0 −1 1
3𝒙𝟏 + 𝟐𝒙𝟐 − 𝒙𝟑 = 14 𝑅2 + (2)𝑅3
𝑅2 + (−2)𝑅1 𝑅1 + (−1)𝑅3

 Solution: 1 1 −1 6 1 1 −1 6 1 0 0 3
𝒙𝟏 = 3 0 −3 5 −11 0 −1 2 −4 0 −1 0 −2
𝒙𝟐 = 2 3 2 −1 14 0 0 −1 1 0 0 −1 1
𝒙𝟑 = −1 (−1)𝑅2
𝑅3 + (−3)𝑅1 𝑅3 + (−3)𝑅2
(−1)𝑅3
1 1 −1 6 1 1 −1 6 1 0 0 3
0 −3 5 −11 0 −1 2 −4 0 1 0 2
0 −1 2 −4 𝑅3 ֞ 𝑅2 0 −3 5 −11 0 0 1 −1
 Gauss-Jordan elimination
 Find solutions for these linear systems using Gaussian elimination (back substitution)
and Gauss-Jordan elimination

𝑥1 + 2𝑥2 + 3𝑥3 + 4𝑥4 = 9

2𝑥1 + 3𝑥2 + 4𝑥3 + 𝑥4 = 3
3𝑥1 + 4𝑥2 + 𝑥3 + 2𝑥4 = 9
4𝑥1 + 𝑥2 + 2𝑥3 + 3𝑥4 = −1