MINISTRY OF HIGHER EDUCATIONS

KANDAHAR UNIVERSITY
ENGINEERING FACULTY
BASIC SCIENCE DEPARTMENT
CALCULUS

LINEAR ALGEBRA

CHAPTER 1
Systems of Linear Equations and Matrices

Prepared By : Sr. Teaching Asst. Shahzada Ulfat

Lecturer: Qudratullah Munib

1
Linear Equations?

2
 1.1Introduction to Systems of Linear Equations
Branches of Mathematics:
There are many branches of mathematics, two of which are Algebra and Calculus.
Both are branches of mathematics that are very useful in people’s lives.

➢ Algebra has many serval branches such as linear algebra ,Geometric algebra,
Numerical algebra, universal algebra, Algebraic number theory…etc.

Linear algebra, Covers system of linear equations matrices, vectors

determinants,, vector spaces and linear transformations, eigenvalue problems, and
other topics.
o Linear equation: An equation that makes a straight line when it is
graphed. Often written in the form y = mx+b. Equation of a Straight Line.
o A linear equation does not involve any products or roots of variables.
o The coefficients are often real number and the power of variables are 1.
o Sometimes a linear equation is written as a function, with f(x) instead of y
o System of linear equations: Finite system of linear equations is called
system of linear equations.
3
Introduction to Systems of Linear Equations
Cont’.d…
General form of Linear equations

With 2 Unknowns

With 3 Unknowns

Generally define a linear equation in the n variables x1, x2, . . . , xn

When b = 0 , Call homogeneous linear equation in the variables x1, x2, . . . , xn

4
 Introduction to Systems of Linear Equations
Cont’.d…
EXAMPLE 1

Find the Linear and non linear Equations?

System of linear equations

5
Introduction to Systems of Linear Equations
Cont’.d…
General form of System of linear equations

6
 Introduction to Systems of Linear Equations
Cont’.d…

Solution of two linear equations with two unknowns

Three possible solutions according to graph:

7
 Introduction to Systems of Linear Equations
Cont’.d…

• In general, a linear system is consistent if it has at least one solution

and inconsistent if it has no solutions.

• A consistent linear system of two equations in two unknowns has

either :
• One solution
• Or infinitely many solutions—there are no other possibilities.

• Every system of linear equations has:

• No
• One
• Or infinitely many solutions.

8
 Introduction to Systems of Linear Equations
Cont’.d…
• Same as for three unknowns equations

No Solution

has Solution

9
 Introduction to Systems of Linear Equations
Cont’.d…

Solution :

Geometrically, this means that the lines intersect at the single point .

Examples 3 and 4 are for no and infinitely many solutions

10
 Augmented Matrices and Elementary Row Operations
Cont’.d…

Matrics: Set of numbers or symbol are arranged in columns and rows

is called matrix

A(m-n) means, m = is the number of rows and n= is the number of columns

a(ij) means, i = is the term of location in row and j= is the term of location in
column
11
 Augmented Matrices and Elementary Row
Operation Cont’.d…

Augmented Matrix, the coefficients and constants of linear

equations system is called.

System of liner equations Augmented Matrix

12
 Augmented Matrices and Elementary Row
Operation Cont’.d…

General form of Augmented Matrix

System of liner equations Augmented Matrix

13
 Augmented Matrices and Elementary Row
Operation Cont’.d…

Elementary Row Operation on a Matrix:

When a row of a matrix is

1. Multiply by a nonzero constant.

2. Interchange or swipe two rows.
3. Add a constant times one row to another
These are called elementary row operations on a matrix.

14
 Augmented Matrices and Elementary Row
Operation Cont’.d…
EXAMPLE 6. Use Elementary Row Operations to solve the given
linear equation system ?

Solution:

15
 Augmented Matrices and Elementary Row
Operation Cont’.d…
Solution Cont’.d…

16
 Augmented Matrices and Elementary Row
Operation Cont’.d…
Solution Cont’.d…

17
 1.2 Gaussian Elimination

▪ is a method used for the solution of linear equations system.

▪ the procedure to make the Row echelon form from Augmented
matrix .
▪ is not used for high number of equations with high number of
unknowns.
Procedure for Gauss Elimination method
➢ Make Augmented matrix form from system of linear equations.
➢ Use the Elementary row operation to make the Row echelon form.
• Eliminate variables from equations, one at a time
• Eventually ending up with one equation in one unknown, two equations in
two unknowns etc.
• Solve for all the unknowns by back substitution
18
 1.2 Gaussian Elimination Cont’.d..
Row Echelon Form of Matrix (REF)
Row echelon form of matrix must have the following properties:
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 and the first number also comes zero
2. All entries below leading 1 should be zeros
3. If there are any rows that consist entirely of zeros, then they are grouped
together at the bottom of the matrix.
4. 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.

Leading 1

A=
No row with all zero entries

19
 1.2 Gaussian Elimination Cont’.d..

Reduced Row Echelon Form of Matrix (RREF)

If a Row echelon form has one more property of

• Each column that contains a leading 1 has zeros everywhere else in

that column.
• This procedure is called Jordan elimination.
Note:
• This procedure consist of parts, forward phase and backward phase
• A matrix in row echelon form has zeros below each leading 1,whereas a matrix
in reduced row echelon form has zeros below and above each leading 1.

20
 1.2 Gaussian Elimination Cont’.d..

EXAMPLE 1: Which matrices are in Row Echelon and Reduced Row Echelon
Form?

21
 1.2 Gaussian Elimination Cont’.d..
Solution:

Matrices are in Reduced Row Echelon Form (RREF)

Below matrices are in Row Echelon Form (REF)

Note: Always a matrix in row echelon form has zeros below each leading 1whereas a
matrix in reduced row echelon form has zeros below and above each leading 1.

22
 1.2 Gaussian Elimination Cont’.d..

EXAMPLE 2 More on Row Echelon and Reduced Row Echelon Form.

any real numbers substituted for the ∗’s.

Solution :
A matrix in row echelon form has zeros below each leading 1, there for matrices are REF.
A matrix in reduced row echelon form has zeros below and above each leading 1, There
for matrices are in RREF.
23
 1.2 Gaussian Elimination Cont’.d..

How to find the Solution of SLE from RREF

Example 3 Find the solution , if the augmented matrix for a linear system has been
reduced by elementary row operations to RREF

Solution:
Compare to SLE,we can write.

24
 1.2 Gaussian Elimination Cont’.d..

Solution Cont’.d…..

Thus, the system has a unique solution, namely, x1 = 3, x2 = −1, x3 = 0, x4 = 5

In Example 3 we could, if
desired, express the solution
more succinctly as the 4-tuple
(3,−1, 0, 5).

25
 1.2 Gaussian Elimination Cont’.d..

How to Find Consistent and Inconsistent solution of SLE from

RREF?

EXAMPLE 4: Find the consistent and inconsistent solution from RREF of

matrices? ,

Solution:
We consider the bottom row RREF

(a) The equation that corresponds to the last row of the RREF is 0x + 0y + 0z = 1.
this equation is not satisfied by any values of x, y, and z, the system is inconsistent

26
 1.2 Gaussian Elimination Cont’.d..
Solution Cont’.d…...
(b) We again consider the bottom row RREF

The equation that corresponds to the last row of the augmented matrix is
0x + 0y + 0z = 0
,
No restrictions on x, y, and z; hence, there for Consistent

We can write the equations form RREF first and second equations

x and y are called leading variables and z is called free variable

27
 1.2 Gaussian Elimination Cont’.d..
Solution Cont’.d…...

(b) cont’d….
Free variable z can be treated as a parameter and assigned an arbitrary value t

Various values for t in these equations, we can obtain various solutions

of the system. For example, setting t = 0 yields the solution

(c)
Based on the last bottom row , it is also consistente lES.

28
 1.2 Gaussian Elimination Cont’.d..
Solution Cont’.d.…...
( c)

We will usually denote parameters in a general solution

by the letters r, s, t, . . . , but any letters that do not conflict with the names of the
unknowns can be used.
For systems with more than three unknowns, subscripted letters
such as t1, t2, t3, . . . are convenient.

29
 1.2 Gauss–Jordan Elimination Methods

• The procedure (or algorithm) for reducing a matrix to reduced

row echelon form is called Gauss–Jordan elimination.
,

• is used to solve the SLE by Matrices.

30
 1.2 Gaussian Elimination Cont’.d..
Procedures for Gauss–Jordan Elimination Method

▪ Interchange the top row ,if necessary to bring none zero entry to
top of column
▪ If entry a in the top of the first, column change it to leading 1(by
dividing or multiplication )
▪ Apply the procedures of the Guass (below of each leading 1 must be
zeros )
▪ Apply the procedures of the Jordan (below and above of each
leading 1 must be zeros )

31
 1.2 Gaussian Elimination Cont’.d..

Example:

Consider an augmented matrix of SLE and apply the procedure of

Guass-Jodan elimination
,

32
 1.2 Gaussian Elimination Cont’.d..

Gauss–Jordan Elimination Methods

33
 1.2 Gaussian Elimination Cont’.d..

Gauss–Jordan Elimination Methods Cont'.d…

Start RRF Procedures

( all entries in each row
bellow leading I
must be zero )

34
 1.2 Gaussian Elimination Cont’.d..

Gauss–Jordan Elimination Methods Cont'.d…

The matrix in row echelon form( Procedure of REF completed)

35
 1.2 Gaussian Elimination Cont’.d..

Gauss–Jordan Elimination Methods Cont'.d…

These procedures are called Guass

36 –Jordan elimination
 1.2 Gaussian Elimination Cont’.d..

Gauss–Jordan Elimination Methods Cont'.d…

37
 1.2 Gaussian Elimination Cont’.d..

Gauss–Jordan Elimination Methods Cont'.d…

38
 1.2 Gaussian Elimination Cont’.d..

Gauss–Jordan elimination Elimination Methods Cont'.d…

39
 1.2 Gaussian Elimination Cont’.d..

Gauss–Jordan elimination Elimination Methods Cont'.d…

40
 1.2 Gaussian Elimination Cont’.d..

Homogeneous Linear Systems

A system of linear equations is said to be homogeneous if the constant
terms are all zero.
General form ,

Note: Every homogeneous system of linear equations is consistent because all such systems
have x1 = 0, x2 = 0, . . . , xn = 0 .
The Solution is called the trivial solution

41
 1.2 Gaussian Elimination Cont’.d..

Homogeneous Linear Systems

Two possibilities for its solutions:

• The system has only the trivial, solution.

• The system has infinitely many solutions.

Example

42