Lecture-4
Mathematics 1 (15B11MA111)
CO [C105.6]
Module: Matrices
Topic: Solution of Non-Homogenous System of Equations
Reference for the lecture
R.K Jain and S.R.K. Iyenger, “Advanced Engineering
Mathematics” fifth edition, Narosa publishing house, 2016.
1
Topics to be covered
Linear System of Equations
Augmented Matrix
Solution of system of equations
Consistency of system of equations
Solved Examples
2
Linear system of equations
A linear system of m equations in n unknowns is of
the following form
Note:
• If all are zero, then the above system is called
Homogenous system.
• If at least one is non zero, then the above system is called
Non-Homogenous system.
3
Matrix form of System of linear equations
Using Matrix multiplication, the linear system of m equations in n
unknowns can be written as following vector equation
AX=B
where,
and
4
Augmented matrix
• A is a non-zero matrix of order , is called Coefficient
matrix.
• X and B are column vectors with n and m component
respectively.
• Augmented matrix obtained by appending the column
B to the matrix A:
5
Solution of linear system of equations
▪ Solution: A set of values (of variables) satisfying the given system of
equations is termed as its solution.
▪ Let us consider a given system of equations in matrix form as AX=B.
▪ The coefficient matrix is given by A and corresponding Augmented matrix
is represented as 𝑨ȁ𝑩 .
▪ Evaluate the rank of A i.e. r[A] and rank of augmented matrix i.e. r( 𝑨ȁ𝑩 )
using elementary row operations.
Now, the following cases arise:
Unique Solution: If r (A) = r( 𝐴ȁ𝐵 ) = number of unknowns (n)
Infinite number of solutions: If r (A) = r( 𝐴ȁ𝐵 ) < number of
unknowns (n)
No solution: If r (A) ≠ r( 𝐴ȁ𝐵 )
6
consistency of the system and solution
❖ Consistent: A system of linear equations is said to be consistent if it
has at least one solution.
❖ Inconsistent: A system of linear equations is said to be inconsistent if
it has no solution.
Consider system of linear
equations AX=B
Consistent Inconsistent
System System
Unique solution Infinite number of
solutions No Solution
r (A) = r( 𝐴ȁ𝐵 ) = number
of unknowns (n) If r (A) = r( 𝐴ȁ𝐵 ) < If r (A) ≠ r( 𝐴ȁ𝐵 )
number of unknowns (n)
7
Example 1:
Test the consistency of the following system of linear equations
2𝑥 + 𝑦 + 𝑧 = 6
𝑥 + 3𝑦 + 𝑧 = 6
𝑥 + 𝑦 + 6𝑧 = 9
Solution:
Step 1: Convert the linear system of equations into matrix form AX=B.
2 1 1
Here A = 1 3 1
1 1 6
𝑥 6
𝑋= 𝑦 B= 6
𝑧 9
Step 2: Form the augmented matrix 𝐴ȁ𝐵 .
2 1 1 6
𝐴ȁ𝐵 = 1 3 1 6
1 1 6 9
8
Step 3: Reduce 𝐴ȁ𝐵 using suitable elementary row transformations.
2 1 1 6
𝐴ȁ𝐵 = 1 3 1 6
1 1 6 9
1 1 6 9
~ 1 3 1 6 𝑅3 ↔ 𝑅1
2 1 1 6
1 1 6 9
~ 0 2 −5 −3 𝑅2 → 𝑅2 − 𝑅1 𝑎𝑛𝑑 𝑅3 → 𝑅3 − 2𝑅1
0 −1 −11 −12
1 1 6 9
~ 0 2 −5 −3 𝑅3 → 2𝑅3 + 𝑅2
0 0 −27 −27
Row echelon form.
9
Step 4: Find the rank of A and rank of 𝐴ȁ𝐵 :
1 1 6 9
Reduced row echelon form of 𝐴ȁ𝐵 𝑖𝑠 0 2 −5 −3
0 0 −27 −27
r(A)=3
r( 𝐴ȁ𝐵 )=3
Step 5: Check the consistency
Here number of unknowns =3
and r (A) = r( 𝐴ȁ𝐵 ) = number of unknowns =3
So system is consistent and possess unique solution.
10
Example 2:
Test the consistency of the following system of linear equations
2𝑥 + 𝑦 + 𝑧 = 6
𝑥 + 3𝑦 + 𝑧 = 6
4𝑥 + 2𝑦 + 2𝑧 = 9
Solution:
Step 1: Convert the linear system of equations into matrix form AX=B.
2 1 1
Here A = 1 3 1
4 2 2
𝑥 6
𝑋= 𝑦 B= 6
𝑧 9
Step 2: Form the augmented matrix 𝐴ȁ𝐵 .
2 1 1 6
𝐴ȁ𝐵 = 1 3 1 6
4 2 2 9
11
Step 3: Reduce 𝐴ȁ𝐵 using suitable elementary row transformations.
2 1 1 6
𝐴ȁ𝐵 = 1 3 1 6
4 2 2 9
1 3 1 6
~ 2 1 1 6 𝑅2 ↔ 𝑅1
4 2 2 9
1 3 1 6
~ 0 −5 −1 −6 𝑅2 → 𝑅2 − 2𝑅1
4 2 2 9
1 3 1 6
~ 0 −5 −1 −6 𝑅3 → 𝑅3 − 4𝑅1
0 −10 −2 −3
1 1 6 9
~ 0 2 −5 −3 𝑅3 → 𝑅3 − 2𝑅2
0 0 0 9
Row echelon form.
12
Step 4: Find the rank of A and rank of 𝐴ȁ𝐵 :
1 1 6 9
Reduced row echelon form of 𝐴ȁ𝐵 𝑖𝑠 0 2 −5 −3
0 0 0 9
r(A) =2
r( 𝐴ȁ𝐵 )=3
Step 5: Check the consistency
Here
r (A) ≠ r( 𝐴ȁ𝐵 )
So the system is inconsistent.
13
Example 3:
For what value of b and c following system of linear equations
𝑥 + 2𝑦 + 𝑧 = 7
3𝑥 + 2𝑦 + 2𝑧 = 11
2𝑥 + 1𝑦 + 𝑏𝑧 = 𝑐
has
I. No solution
II. A unique solution
III. Infinite number of solutions
1 2 1 7
Solution: augmented matrix 𝐴ȁ𝐵 = 3 2 2 11
2 1 𝑏 𝑐
1 2 1 7
~ 0 −4 −1 −10 𝑅2 → 𝑅2 − 3𝑅1
2 1 𝑏 𝑐
1 2 1 7
~ 0 −4 −1 −10 𝑅3 → 𝑅3 − 2𝑅1
0 −3 𝑏 − 2 𝑐 − 14
1 2 1 7
~ 0 −4 −1 −10 𝑅3 → 4𝑅3 − 3𝑅2
0 0 4𝑏 − 5 4𝑐 − 26
14
1 2 1 7
Row echelon matrix 0 −4 −1 −10
0 0 4𝑏 − 5 4𝑐 − 26
Following three cases may arise
I. No solution,
if r (A) ≠ r( 𝐴ȁ𝐵 )
i.e. when 4𝑏 − 5=0 and 4𝑐 − 26 ≠ 0
II. A unique solution,
if r (A) = r( 𝐴ȁ𝐵 )=3(no of unknowns)
i.e. when 4𝑏 − 5 ≠0
III. Infinite number of solutions
if r (A) = r( 𝐴ȁ𝐵 )< 3(no of unknowns)
4𝑏 − 5=0 and 4𝑐 − 26 = 0
15
16