Linear Algebra (1) (2) System of Linear Equations
Linear Algebra (1) (2) System of Linear Equations
Session 01-02
Acknowledgement
These slides have been
adapted from:
Section 1.1-1.2
Learning Objectives
LO 1 : Solve systems of linear equations using
various methods.
1
System of linear equations
2
Solution
3
Gaussian and Gauss-Jordan
4
Elimination
Homogeneous System
of Linear Equations
Definition
Linear Equations in several variables are equations in the form of
polynomials which have degrees one or zero and there is no
multiplication between variables.
Example :
2𝑥1 − 𝑥2 + 1.5𝑥3 = 8 … (1)
2𝑥1 𝑥2 + 𝑥2 = 2 … (2) The equation (2) and (3) are not linear because
2𝑥1 − 𝑥2 + 𝑥3 = 8 … (3) of the presence of 𝑥1 𝑥2 in the first equation
and 𝑥3 in the second
Definition
Example:
2𝑥1 − 𝑥2 + 1.5𝑥3 = 8
𝑥1 − 4𝑥3 = −7
SOLUTION OF LINEAR
SYSTEM
A solution of a linear system in n unknowns 𝑥1, 𝑥2, … , 𝑥𝑛 is is a sequence of n
numbers
𝑠1, 𝑠2, … , 𝑠𝑛 for which the substitution
𝑥1= 𝑠1,𝑥2=𝑠2,… 𝑥𝑛= 𝑠𝑛
Example : Determine solution for system of linear equations as follows :
5𝑥 + 𝑦 = 3
2𝑥 − 𝑦 = 4
Solution : the system has the solution 𝑥 = 1 , 𝑦 = −2
Examples :
A linear system with no A linear system with one A linear System with
solution solution infinitely many solutions
𝑥+𝑦 =4 5𝑥 + 𝑦 = 3 4𝑥 − 2𝑦 = 1
3𝑥 + 3𝑦 = 6 2𝑥 − 𝑦 = 4 16𝑥 − 8𝑦 = 4
Linear Systems with
Three Unknowns
A matrix that has the first three properties is said to be in row echelon form
Gauss-Jordan elimination.
A matrix that has the following properties is said to be in reduced row echelon form.
1. 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.
2. If there are any rows that consist entirely of zeros, then they are grouped together at the
bottom of the matrix.
3. 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.
4. Each column that contains a leading 1 has zeros everywhere else in that column.
A matrix that has the first three properties is said to be in row echelon form
The procedure (or algorithm) to reduce a matrix into reduced row echelon form
is called Gauss-Jordan elimination.
The procedure (or algorithm) to reduce a matrix into row echelon form
followed by back substitutions is called Gaussian elimination.
Example 1 : Solve by Gauss elimination.
In the left column we solve a system of linear equations by operating on the
equations in the system, and in the right column we solve the same system by
operating on the rows of the augmented matrix.
the graphs of the equations are lines through the origin, and the
trivial solution corresponds to the point of intersection at the
origin.
Bina Nusantara University 28
Illustration