Echelon forms

Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Section 1.2: Gaussian Elimination

Dr K
Department of Mathematics and Applied Mathemathematics
University of Johannesburg

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

1 Echelon forms

2 Gaussian Elimination

3 Gauss-Jordan Elimination

4 Homogeneous Linear Systems

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Goals

The aim of this section is :

develop a systematic procedure for solving systems of
linear equations.
Note: procedure is based on the idea of performing certain row
operations
The idea is to perform operations on the rows of the
augmented matrix such that the solution of the system can
be ascertained by inspection.
Question: But why do we need a systematic
procedure to solve systems of linear equations?

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon form

The whole point of row operations is to reduce an augmented
matrix so that the solution can be read easily from the reduced
matrix. Such reduced matrix is said to be in row echelon form.

To be in this form, a matrix must have the following properties:

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.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon form

The whole point of row operations is to reduce an augmented
matrix so that the solution can be read easily from the reduced
matrix. Such reduced matrix is said to be in row echelon form.

To be in this form, a matrix must have the following properties:

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.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon form

The whole point of row operations is to reduce an augmented
matrix so that the solution can be read easily from the reduced
matrix. Such reduced matrix is said to be in row echelon form.

To be in this form, a matrix must have the following properties:

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.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon form

The whole point of row operations is to reduce an augmented
matrix so that the solution can be read easily from the reduced
matrix. Such reduced matrix is said to be in row echelon form.

To be in this form, a matrix must have the following properties:

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.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon form

The whole point of row operations is to reduce an augmented
matrix so that the solution can be read easily from the reduced
matrix. Such reduced matrix is said to be in row echelon form.

To be in this form, a matrix must have the following properties:

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.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
1 0 11 35
 
2 2
0 1 − 7 − 17 
2 2
0 0 1 3

Example
     
1 2 1 0 1 3 −2 0 1 −2
0 1 −1 4  0 0 1  0 0 1 
0 0 1 −1 0 0 0 0 0 0

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
1 0 11 35
 
2 2
0 1 − 7 − 17 
2 2
0 0 1 3

Example
     
1 2 1 0 1 3 −2 0 1 −2
0 1 −1 4  0 0 1  0 0 1 
0 0 1 −1 0 0 0 0 0 0

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
1 0 11 35
 
2 2
0 1 − 7 − 17 
2 2
0 0 1 3

Example
     
1 2 1 0 1 3 −2 0 1 −2
0 1 −1 4  0 0 1  0 0 1 
0 0 1 −1 0 0 0 0 0 0

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
1 0 11 35
 
2 2
0 1 − 7 − 17 
2 2
0 0 1 3

Example
     
1 2 1 0 1 3 −2 0 1 −2
0 1 −1 4  0 0 1  0 0 1 
0 0 1 −1 0 0 0 0 0 0

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Reduced row echelon form

Definition
A matrix is in reduced row echelon form if it satisfies the
following properties:
1 It is in row echelon form.
2 Each column containing a leading 1 has zeros everywhere
else in the column.
Note: The reason we need reduced row echelon form is because we can
read the solution right away instead of having to do back substitution to
determine the solution of other unknowns.
Example
     
1 0 0 −1 1 2 0 0 1 0
0 1 0 4  0 0 1 0 0 1
0 0 1 −1 0 0 0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Reduced row echelon form

Definition
A matrix is in reduced row echelon form if it satisfies the
following properties:
1 It is in row echelon form.
2 Each column containing a leading 1 has zeros everywhere
else in the column.
Note: The reason we need reduced row echelon form is because we can
read the solution right away instead of having to do back substitution to
determine the solution of other unknowns.
Example
     
1 0 0 −1 1 2 0 0 1 0
0 1 0 4  0 0 1 0 0 1
0 0 1 −1 0 0 0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon and reduced row echelon forms

Example
Determine whether the given matrix is in row echelon form,
reduced row echelon form or neither
   
7 0 1 0 0 0 0
1. 0 1 −1 4 Neither. 2. 0 0 0 RE and RRE.
0 0 0 0  0 0  0
  1 1 3 5
0 0 1 0 0 1 −1
3. 0 1 0 Neither. 4.  0 0 0 1  RE but not RRE.

1 0 0
0 0 0 0
 
1 0 1 0
5. 0 1 −1 4 RE and RRE.
0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon and reduced row echelon forms

Example
Determine whether the given matrix is in row echelon form,
reduced row echelon form or neither
   
7 0 1 0 0 0 0
1. 0 1 −1 4 Neither. 2. 0 0 0 RE and RRE.
0 0 0 0  0 0  0
  1 1 3 5
0 0 1 0 0 1 −1
3. 0 1 0 Neither. 4.  0 0 0 1  RE but not RRE.

1 0 0
0 0 0 0
 
1 0 1 0
5. 0 1 −1 4 RE and RRE.
0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon and reduced row echelon forms

Example
Determine whether the given matrix is in row echelon form,
reduced row echelon form or neither
   
7 0 1 0 0 0 0
1. 0 1 −1 4 Neither. 2. 0 0 0 RE and RRE.
0 0 0 0  0 0  0
  1 1 3 5
0 0 1 0 0 1 −1
3. 0 1 0 Neither. 4.  0 0 0 1  RE but not RRE.

1 0 0
0 0 0 0
 
1 0 1 0
5. 0 1 −1 4 RE and RRE.
0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon and reduced row echelon forms

Example
Determine whether the given matrix is in row echelon form,
reduced row echelon form or neither
   
7 0 1 0 0 0 0
1. 0 1 −1 4 Neither. 2. 0 0 0 RE and RRE.
0 0 0 0  0 0  0
  1 1 3 5
0 0 1 0 0 1 −1
3. 0 1 0 Neither. 4.  0 0 0 1  RE but not RRE.

1 0 0
0 0 0 0
 
1 0 1 0
5. 0 1 −1 4 RE and RRE.
0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon and reduced row echelon forms

Example
Determine whether the given matrix is in row echelon form,
reduced row echelon form or neither
   
7 0 1 0 0 0 0
1. 0 1 −1 4 Neither. 2. 0 0 0 RE and RRE.
0 0 0 0  0 0  0
  1 1 3 5
0 0 1 0 0 1 −1
3. 0 1 0 Neither. 4.  0 0 0 1  RE but not RRE.

1 0 0
0 0 0 0
 
1 0 1 0
5. 0 1 −1 4 RE and RRE.
0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row echelon and reduced row echelon forms

Example
Determine whether the given matrix is in row echelon form,
reduced row echelon form or neither
   
7 0 1 0 0 0 0
1. 0 1 −1 4 Neither. 2. 0 0 0 RE and RRE.
0 0 0 0  0 0  0
  1 1 3 5
0 0 1 0 0 1 −1
3. 0 1 0 Neither. 4.  0 0 0 1  RE but not RRE.

1 0 0
0 0 0 0
 
1 0 1 0
5. 0 1 −1 4 RE and RRE.
0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

If, by a sequence of elementary row operations, the augmented

matrix for a system of linear equations is put in reduced row
echelon form, then the solution set can be obtained either by
inspection or by converting certain linear equations to
parametric form.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Unique Solution
Example
Suppose that the augmented matrix for a linear system in the
unknowns x1 , x2 , x3 , and x4 has been reduced by elementary
 
row operations to 1 0 0 0 3
0 1 0 0 −1
 
0 0 1 0 0 
0 0 0 1 5
This matrix is in reduced row echelon form and corresponds to
the equations
x1 = 3
x2 = −1
x3 = 0
x4 = 5
Thus, the system has a unique solution, namely, x1 = 3,
x2 = −1, x3 = 0, x4 = 5.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Infinitely many solutions

Example
Suppose that the augmented matrix for a linear system in the
unknowns x, y , and z has been reduced by elementary row
operations to the given reduced row echelon form.
 
1 0 0 0
0 1 2 0
0 0 0 1

Solution:
The equation that corresponds to the last row of the augmented
matrix is 0x + 0y + 0z = 1.
Since this equation is not satisfied by any values of x, y , and z,
the system is inconsistent.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Infinitely many solutions

Example
Suppose that the augmented matrix for a linear system in the
unknowns x, y , and z has been reduced by elementary row
operations to the given reduced row echelon form.
 
1 0 0 0
0 1 2 0
0 0 0 1

Solution:
The equation that corresponds to the last row of the augmented
matrix is 0x + 0y + 0z = 1.
Since this equation is not satisfied by any values of x, y , and z,
the system is inconsistent.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Suppose that the augmented matrix for a linear system in the
unknowns x, y , and z has been reduced by elementary row
operations to the given reduced row echelon form.
 
1 0 3 −1
0 1 −4 2 
0 0 0 0

Solution:
The equation that corresponds to the last row of the augmented
matrix is 0x + 0y + 0z = 0.
This equation can be omitted since it imposes no restrictions on
x, y , and z.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Suppose that the augmented matrix for a linear system in the
unknowns x, y , and z has been reduced by elementary row
operations to the given reduced row echelon form.
 
1 0 3 −1
0 1 −4 2 
0 0 0 0

Solution:
The equation that corresponds to the last row of the augmented
matrix is 0x + 0y + 0z = 0.
This equation can be omitted since it imposes no restrictions on
x, y , and z.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Suppose that the augmented matrix for a linear system in the
unknowns x, y , and z has been reduced by elementary row
operations to the given reduced row echelon form.
 
1 0 3 −1
0 1 −4 2 
0 0 0 0

Solution:
The equation that corresponds to the last row of the augmented
matrix is 0x + 0y + 0z = 0.
This equation can be omitted since it imposes no restrictions on
x, y , and z.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Hence, the linear system corresponding to the augmented

matrix is
 
1 0 3 −1
0 1 −4 2  x + 3z = −1
⇒
y − 4z = 2
0 0 0 0
Since x and y correspond to the leading 1’s in the augmented
matrix, we call these the leading variables. The remaining
variables (in this case z) are called free variables.
Solving for the leading variables in terms of the free variables
gives
x = −1 − 3z
y = 2 + 4z
From these equations we see that the free variable z can be
treated as a parameter and assigned an arbitrary value t, which
then determines values for x and y .
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Hence, the linear system corresponding to the augmented

matrix is
 
1 0 3 −1
0 1 −4 2  x + 3z = −1
⇒
y − 4z = 2
0 0 0 0
Since x and y correspond to the leading 1’s in the augmented
matrix, we call these the leading variables. The remaining
variables (in this case z) are called free variables.
Solving for the leading variables in terms of the free variables
gives
x = −1 − 3z
y = 2 + 4z
From these equations we see that the free variable z can be
treated as a parameter and assigned an arbitrary value t, which
then determines values for x and y .
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Hence, the linear system corresponding to the augmented

matrix is
 
1 0 3 −1
0 1 −4 2  x + 3z = −1
⇒
y − 4z = 2
0 0 0 0
Since x and y correspond to the leading 1’s in the augmented
matrix, we call these the leading variables. The remaining
variables (in this case z) are called free variables.
Solving for the leading variables in terms of the free variables
gives
x = −1 − 3z
y = 2 + 4z
From these equations we see that the free variable z can be
treated as a parameter and assigned an arbitrary value t, which
then determines values for x and y .
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Hence, the linear system corresponding to the augmented

matrix is
 
1 0 3 −1
0 1 −4 2  x + 3z = −1
⇒
y − 4z = 2
0 0 0 0
Since x and y correspond to the leading 1’s in the augmented
matrix, we call these the leading variables. The remaining
variables (in this case z) are called free variables.
Solving for the leading variables in terms of the free variables
gives
x = −1 − 3z
y = 2 + 4z
From these equations we see that the free variable z can be
treated as a parameter and assigned an arbitrary value t, which
then determines values for x and y .
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Hence, the linear system corresponding to the augmented

matrix is
 
1 0 3 −1
0 1 −4 2  x + 3z = −1
⇒
y − 4z = 2
0 0 0 0
Since x and y correspond to the leading 1’s in the augmented
matrix, we call these the leading variables. The remaining
variables (in this case z) are called free variables.
Solving for the leading variables in terms of the free variables
gives
x = −1 − 3z
y = 2 + 4z
From these equations we see that the free variable z can be
treated as a parameter and assigned an arbitrary value t, which
then determines values for x and y .
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Thus, the solution set can be represented by the parametric

equations

x = −1 − 3t, y = 2 + 4t, z=t

By substituting various values for t in these equations we can

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

x = −1, y = 2, z=0

and setting t = 1 yields the solution

x = −4, y = 6, z=1

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Thus, the solution set can be represented by the parametric

equations

x = −1 − 3t, y = 2 + 4t, z=t

By substituting various values for t in these equations we can

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

x = −1, y = 2, z=0

and setting t = 1 yields the solution

x = −4, y = 6, z=1

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Suppose that the augmented matrix for a linear system in the
unknowns x, y , and z has been reduced by elementary row
operations to the given reduced row echelon form.
 
1 −5 1 4
0 0 0 0
0 0 0 0

Solution:
As explained in previous example, we can omit the equations
corresponding to the zero rows, in which case the linear system
associated with the augmented matrix consists of the single
equation
x − 5y + z = 4 . . . (1)
from which we see that the solution set is a plane in
three-dimensional space.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Suppose that the augmented matrix for a linear system in the
unknowns x, y , and z has been reduced by elementary row
operations to the given reduced row echelon form.
 
1 −5 1 4
0 0 0 0
0 0 0 0

Solution:
As explained in previous example, we can omit the equations
corresponding to the zero rows, in which case the linear system
associated with the augmented matrix consists of the single
equation
x − 5y + z = 4 . . . (1)
from which we see that the solution set is a plane in
three-dimensional space.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Although (1) is a valid form of the solution set, there are many
applications in which it is preferable to express the solution set
in parametric form. We can convert (1) to parametric form by
solving for the leading variable x in terms of the free variables y
and z to obtain
x = 4 + 5y − z
From this equation we see that the free variables can be
assigned arbitrary values, say y = s and z = t, which then
determine the value of x. Thus, the solution set can be
expressed parametrically as

x = 4 + 5s − t, y = s, z=t

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Although (1) is a valid form of the solution set, there are many
applications in which it is preferable to express the solution set
in parametric form. We can convert (1) to parametric form by
solving for the leading variable x in terms of the free variables y
and z to obtain
x = 4 + 5y − z
From this equation we see that the free variables can be
assigned arbitrary values, say y = s and z = t, which then
determine the value of x. Thus, the solution set can be
expressed parametrically as

x = 4 + 5s − t, y = s, z=t

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

If a linear system has infinitely many solutions, then a set of

parametric equations from which all solutions can be obtained
by assigning numerical values for the parameters is called the
general solution of the system.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Gaussian Elimination

The process of performing row reductions to a system of linear

equations to create an equivalent system that can be solved by
back substitution.
The process:
1 Write down the augmented matrix of the system of linear
equations.
2 Use elementary row operations to reduce the matrix to row
echelon form.
3 Using back-substitution, solve the system.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x −y +z =0
3x + y + 2z = 2
−2x + y − z = 1
   
1 −1 1 0 1 −1 1 0
R2 −3R1
 3 1 2 2  −→  0 4 −1 2 
−2 1 −1 1 −2 1 −1 1
   
1 −1 1 0 1 −1 1 0
R3 +2R1 R2 ↔R3
−→  0 4 −1 2  −→  0 −1 1 1 
0 −1 1 1 0 4 −1 2
   
1 −1 1 0 1
−R2 ; 3 R3
1 −1 1 0
R3 +4R2
−→  0 −1 1 1  −→  0 1 −1 −1 
0 0 3 6 0 0 1 2
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x −y +z =0
3x + y + 2z = 2
−2x + y − z = 1
   
1 −1 1 0 1 −1 1 0
R2 −3R1
 3 1 2 2  −→  0 4 −1 2 
−2 1 −1 1 −2 1 −1 1
   
1 −1 1 0 1 −1 1 0
R3 +2R1 R2 ↔R3
−→  0 4 −1 2  −→  0 −1 1 1 
0 −1 1 1 0 4 −1 2
   
1 −1 1 0 1
−R2 ; 3 R3
1 −1 1 0
R3 +4R2
−→  0 −1 1 1  −→  0 1 −1 −1 
0 0 3 6 0 0 1 2
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x −y +z =0
3x + y + 2z = 2
−2x + y − z = 1
   
1 −1 1 0 1 −1 1 0
R2 −3R1
 3 1 2 2  −→  0 4 −1 2 
−2 1 −1 1 −2 1 −1 1
   
1 −1 1 0 1 −1 1 0
R3 +2R1 R2 ↔R3
−→  0 4 −1 2  −→  0 −1 1 1 
0 −1 1 1 0 4 −1 2
   
1 −1 1 0 1
−R2 ; 3 R3
1 −1 1 0
R3 +4R2
−→  0 −1 1 1  −→  0 1 −1 −1 
0 0 3 6 0 0 1 2
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x −y +z =0
3x + y + 2z = 2
−2x + y − z = 1
   
1 −1 1 0 1 −1 1 0
R2 −3R1
 3 1 2 2  −→  0 4 −1 2 
−2 1 −1 1 −2 1 −1 1
   
1 −1 1 0 1 −1 1 0
R3 +2R1 R2 ↔R3
−→  0 4 −1 2  −→  0 −1 1 1 
0 −1 1 1 0 4 −1 2
   
1 −1 1 0 1
−R2 ; 3 R3
1 −1 1 0
R3 +4R2
−→  0 −1 1 1  −→  0 1 −1 −1 
0 0 3 6 0 0 1 2
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x −y +z =0
3x + y + 2z = 2
−2x + y − z = 1
   
1 −1 1 0 1 −1 1 0
R2 −3R1
 3 1 2 2  −→  0 4 −1 2 
−2 1 −1 1 −2 1 −1 1
   
1 −1 1 0 1 −1 1 0
R3 +2R1 R2 ↔R3
−→  0 4 −1 2  −→  0 −1 1 1 
0 −1 1 1 0 4 −1 2
   
1 −1 1 0 1
−R2 ; 3 R3
1 −1 1 0
R3 +4R2
−→  0 −1 1 1  −→  0 1 −1 −1 
0 0 3 6 0 0 1 2
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x −y +z =0
3x + y + 2z = 2
−2x + y − z = 1
   
1 −1 1 0 1 −1 1 0
R2 −3R1
 3 1 2 2  −→  0 4 −1 2 
−2 1 −1 1 −2 1 −1 1
   
1 −1 1 0 1 −1 1 0
R3 +2R1 R2 ↔R3
−→  0 4 −1 2  −→  0 −1 1 1 
0 −1 1 1 0 4 −1 2
   
1 −1 1 0 1
−R2 ; 3 R3
1 −1 1 0
R3 +4R2
−→  0 −1 1 1  −→  0 1 −1 −1 
0 0 3 6 0 0 1 2
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example continued

 
1 −1 1 0 x − y + z = 0
0 1 −1 −1 =⇒ y − z = −1
0 0 1 2 z = 2

From back-substitution: z = 2, y = 1, x = −1.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x + 2y − z = 5
−x − y + z = −2
2x + y − 2z = 1
   
1 2 −1 5 1 2 −1 5
R2 +R1
 −1 −1 1 −2  −→  0 1 0 3 
2 1 −2 1 2 1 −2 1
   
1 2 −1 5 1 2 −1 5
R3 −2R1 R3 +3R2
−→  0 1 0 3  −→  0 1 0 3 
0 −3 0 −9 0 0 0 0

x + 2y − z = 5
y = 3
Hence, from back substitution:
z = t, y = 3, x = −2y + z + 5 = t − 1.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x + 2y − z = 5
−x − y + z = −2
2x + y − 2z = 1
   
1 2 −1 5 1 2 −1 5
R2 +R1
 −1 −1 1 −2  −→  0 1 0 3 
2 1 −2 1 2 1 −2 1
   
1 2 −1 5 1 2 −1 5
R3 −2R1 R3 +3R2
−→  0 1 0 3  −→  0 1 0 3 
0 −3 0 −9 0 0 0 0

x + 2y − z = 5
y = 3
Hence, from back substitution:
z = t, y = 3, x = −2y + z + 5 = t − 1.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x + 2y − z = 5
−x − y + z = −2
2x + y − 2z = 1
   
1 2 −1 5 1 2 −1 5
R2 +R1
 −1 −1 1 −2  −→  0 1 0 3 
2 1 −2 1 2 1 −2 1
   
1 2 −1 5 1 2 −1 5
R3 −2R1 R3 +3R2
−→  0 1 0 3  −→  0 1 0 3 
0 −3 0 −9 0 0 0 0

x + 2y − z = 5
y = 3
Hence, from back substitution:
z = t, y = 3, x = −2y + z + 5 = t − 1.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x + 2y − z = 5
−x − y + z = −2
2x + y − 2z = 1
   
1 2 −1 5 1 2 −1 5
R2 +R1
 −1 −1 1 −2  −→  0 1 0 3 
2 1 −2 1 2 1 −2 1
   
1 2 −1 5 1 2 −1 5
R3 −2R1 R3 +3R2
−→  0 1 0 3  −→  0 1 0 3 
0 −3 0 −9 0 0 0 0

x + 2y − z = 5
y = 3
Hence, from back substitution:
z = t, y = 3, x = −2y + z + 5 = t − 1.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x + 2y − z = 5
−x − y + z = −2
2x + y − 2z = 1
   
1 2 −1 5 1 2 −1 5
R2 +R1
 −1 −1 1 −2  −→  0 1 0 3 
2 1 −2 1 2 1 −2 1
   
1 2 −1 5 1 2 −1 5
R3 −2R1 R3 +3R2
−→  0 1 0 3  −→  0 1 0 3 
0 −3 0 −9 0 0 0 0

x + 2y − z = 5
y = 3
Hence, from back substitution:
z = t, y = 3, x = −2y + z + 5 = t − 1.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x + 2y − z = 5
−x − y + z = −2
2x + y − 2z = 1
   
1 2 −1 5 1 2 −1 5
R2 +R1
 −1 −1 1 −2  −→  0 1 0 3 
2 1 −2 1 2 1 −2 1
   
1 2 −1 5 1 2 −1 5
R3 −2R1 R3 +3R2
−→  0 1 0 3  −→  0 1 0 3 
0 −3 0 −9 0 0 0 0

x + 2y − z = 5
y = 3
Hence, from back substitution:
z = t, y = 3, x = −2y + z + 5 = t − 1.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
2y − z = −4
2x − y + 2z = 7
−x + 3y + z = −2
   
0 2 −1 −4 −1 3 1 −2
R1 ↔R3
 2 −1 2 7  −→  2 −1 2 7 
−1 3 1 −2 0 2 −1 −4
   
−1 3 1 −2 R3 − 52 R2
−1 3 1 −2
R2 +2R1
−→  0 5 4 3  −→  0 5 4 3 
0 2 −1 −4 0 0 − 5 − 26
13
5
 
−R1 ; 51 R2 ;− 13
5
R3
1 −3 −1 2
4 3 
−→  0 1
5 5
0 0 1 2

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
2y − z = −4
2x − y + 2z = 7
−x + 3y + z = −2
   
0 2 −1 −4 −1 3 1 −2
R1 ↔R3
 2 −1 2 7  −→  2 −1 2 7 
−1 3 1 −2 0 2 −1 −4
   
−1 3 1 −2 R3 − 52 R2
−1 3 1 −2
R2 +2R1
−→  0 5 4 3  −→  0 5 4 3 
0 2 −1 −4 0 0 − 5 − 26
13
5
 
−R1 ; 51 R2 ;− 13
5
R3
1 −3 −1 2
4 3 
−→  0 1
5 5
0 0 1 2

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
2y − z = −4
2x − y + 2z = 7
−x + 3y + z = −2
   
0 2 −1 −4 −1 3 1 −2
R1 ↔R3
 2 −1 2 7  −→  2 −1 2 7 
−1 3 1 −2 0 2 −1 −4
   
−1 3 1 −2 R3 − 25 R2
−1 3 1 −2
R2 +2R1
−→  0 5 4 3  −→  0 5 4 3 
0 2 −1 −4 0 0 − 5 − 26
13
5
 
−R1 ; 51 R2 ;− 13
5
R3
1 −3 −1 2
4 3 
−→  0 1
5 5
0 0 1 2

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
2y − z = −4
2x − y + 2z = 7
−x + 3y + z = −2
   
0 2 −1 −4 −1 3 1 −2
R1 ↔R3
 2 −1 2 7  −→  2 −1 2 7 
−1 3 1 −2 0 2 −1 −4
   
−1 3 1 −2 R3 − 25 R2
−1 3 1 −2
R2 +2R1
−→  0 5 4 3  −→  0 5 4 3 
0 2 −1 −4 0 0 − 5 − 26
13
5
 
−R1 ; 51 R2 ;− 13
5
R3
1 −3 −1 2
4 3 
−→  0 1
5 5
0 0 1 2

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
2y − z = −4
2x − y + 2z = 7
−x + 3y + z = −2
   
0 2 −1 −4 −1 3 1 −2
R1 ↔R3
 2 −1 2 7  −→  2 −1 2 7 
−1 3 1 −2 0 2 −1 −4
   
−1 3 1 −2 R3 − 25 R2
−1 3 1 −2
R2 +2R1
−→  0 5 4 3  −→  0 5 4 3 
0 2 −1 −4 0 0 − 5 − 26
13
5
 
−R1 ; 51 R2 ;− 13
5
R3
1 −3 −1 2
4 3 
−→  0 1
5 5
0 0 1 2

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example continued

 
1 −3 −1 2 x − 3y − z = 2
4 3 4
0 1
5 5
=⇒ y + 5z = 35
0 0 1 2 z = 2

Hence from back-substitution:

z = 2, y = −1, x = 1.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example continued

 
1 −3 −1 2 x − 3y − z = 2
4 3 4
0 1
5 5
=⇒ y + 5z = 35
0 0 1 2 z = 2

Hence from back-substitution:

z = 2, y = −1, x = 1.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Gauss-Jordan Elimination

The process:
1 Write down the augmented matrix of the system of linear
equations.
2 Perform Gaussian elimination to reduce the augmented
matrix to row echelon form.
3 Locate the right-most leading one - reduce the entries
above it to zeros by adding a multiple of this row to the
ones above it.
4 Continue this process with each leading one, moving from
the bottom of the matrix to the top.
5 Solve the resulting system easily by inspection.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Row reduction
Tips when doing row reduction
1 If there are rows consisting of zeros only: swap rows to
place them at the bottom of the matrix
2 Locate the leftmost column that is not all zeros.
3 Swap rows if necessary so that the top of this column is
non-zero. This is the first leading entry (a 1 as a leading
entry is usually most useful)
4 Use the leading entry to create zeros below it (by adding
multiples of this row to those underneath it)
5 Cover up the row containing the leading entry, and repeat
the procedure.
6 Divide each row by an appropriate constant so that leading
1s remain.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Finding the solution from the reduced row echelon

form
Variables corresponding to columns with leading 1’s are called
leading variables. The remaining variables are said to be free
variables.
When solving the system: For each free variable, a parameter
must be introduced.
If a linear system has infinitely many solutions, then a set of
parametric equations from which all solutions can be obtained
by assigning numerical values for the parameters is called the
general solution of the system.
In general:
Every system of linear equations has zero, one, or
infinitely many solutions. There are no other possibilities.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Finding the solution from the reduced row echelon

form
Variables corresponding to columns with leading 1’s are called
leading variables. The remaining variables are said to be free
variables.
When solving the system: For each free variable, a parameter
must be introduced.
If a linear system has infinitely many solutions, then a set of
parametric equations from which all solutions can be obtained
by assigning numerical values for the parameters is called the
general solution of the system.
In general:
Every system of linear equations has zero, one, or
infinitely many solutions. There are no other possibilities.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Finding the solution from the reduced row echelon

form
Variables corresponding to columns with leading 1’s are called
leading variables. The remaining variables are said to be free
variables.
When solving the system: For each free variable, a parameter
must be introduced.
If a linear system has infinitely many solutions, then a set of
parametric equations from which all solutions can be obtained
by assigning numerical values for the parameters is called the
general solution of the system.
In general:
Every system of linear equations has zero, one, or
infinitely many solutions. There are no other possibilities.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Finding the solution from the reduced row echelon

form
Variables corresponding to columns with leading 1’s are called
leading variables. The remaining variables are said to be free
variables.
When solving the system: For each free variable, a parameter
must be introduced.
If a linear system has infinitely many solutions, then a set of
parametric equations from which all solutions can be obtained
by assigning numerical values for the parameters is called the
general solution of the system.
In general:
Every system of linear equations has zero, one, or
infinitely many solutions. There are no other possibilities.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Solve the system by Gauss-Jordan elimination:
x −y +z =0
3x + y + 2z = 2
−2x + y − z = 1

First we reduce to row echelon form as above:

   
1 −1 1 0 1 −1 1 0
?
 3 1 2 2  −→  0 1 −1 −1 
−2 1 −1 1 0 0 1 2
   
1 −1 1 0 1 −1 1 0
 0 1 −1 −1  R−→
2 +R3
 0 1 0 1 
0 0 1 2 0 0 1 2

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Solve the system by Gauss-Jordan elimination:
x −y +z =0
3x + y + 2z = 2
−2x + y − z = 1

First we reduce to row echelon form as above:

   
1 −1 1 0 1 −1 1 0
?
 3 1 2 2  −→  0 1 −1 −1 
−2 1 −1 1 0 0 1 2
   
1 −1 1 0 1 −1 1 0
 0 1 −1 −1  R−→
2 +R3
 0 1 0 1 
0 0 1 2 0 0 1 2

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Solve the system by Gauss-Jordan elimination:
x −y +z =0
3x + y + 2z = 2
−2x + y − z = 1

First we reduce to row echelon form as above:

   
1 −1 1 0 1 −1 1 0
?
 3 1 2 2  −→  0 1 −1 −1 
−2 1 −1 1 0 0 1 2
   
1 −1 1 0 1 −1 1 0
 0 1 −1 −1  R−→
2 +R3
 0 1 0 1 
0 0 1 2 0 0 1 2

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example continued

   
1 −1 0 −2 1 0 0 −1
R1 −R3 R1 +R2
−→  0 1 0 1  −→  0 1 0 1 
0 0 1 2 0 0 1 2
Hence x = −1, y = 1, z = 2.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Solve the system by Gauss-Jordan elimination:
x + 2y − z = 5
−x − y + z = −2
2x + y − 2z = 1

We reduce it to row echelon form as above:

   
1 2 −1 5 1 2 −1 5
 −1 −1 1 −2  −→ ? 
0 1 0 3 
2 1 −2 1 2 1 −2 1

   
1 2 −1 5 R1 −2R2 1 0 −1 −1
? ?
−→  0 1 0 3  −→  0 1 0 3 
0 −3 0 −9 0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Solve the system by Gauss-Jordan elimination:
x + 2y − z = 5
−x − y + z = −2
2x + y − 2z = 1

We reduce it to row echelon form as above:

   
1 2 −1 5 1 2 −1 5
 −1 −1 1 −2  −→ ? 
0 1 0 3 
2 1 −2 1 2 1 −2 1

   
1 2 −1 5 R1 −2R2 1 0 −1 −1
? ?
−→  0 1 0 3  −→  0 1 0 3 
0 −3 0 −9 0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Solve the system by Gauss-Jordan elimination:
x + 2y − z = 5
−x − y + z = −2
2x + y − 2z = 1

We reduce it to row echelon form as above:

   
1 2 −1 5 1 2 −1 5
 −1 −1 1 −2  −→ ? 
0 1 0 3 
2 1 −2 1 2 1 −2 1

   
1 2 −1 5 R1 −2R2 1 0 −1 −1
? ?
−→  0 1 0 3  −→  0 1 0 3 
0 −3 0 −9 0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Solve the system by Gauss-Jordan elimination:
x + 2y − z = 5
−x − y + z = −2
2x + y − 2z = 1

We reduce it to row echelon form as above:

   
1 2 −1 5 1 2 −1 5
 −1 −1 1 −2  −→ ? 
0 1 0 3 
2 1 −2 1 2 1 −2 1

   
1 2 −1 5 R1 −2R2 1 0 −1 −1
? ?
−→  0 1 0 3  −→  0 1 0 3 
0 −3 0 −9 0 0 0 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example continued

 
1 0 −1 −1
0 1 0 x − z = −1
3 =⇒
y = 3
0 0 0 0
Hence, z = t, y = 3, x = z − 1 = t − 1.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Solve the corresponding linear system in the variables x, y , z with the
following augmented forms; find the reduced row echelon forms.
 
1 0 0 −1
(a) 0 1 0 4  (a) (x, y , z) = (−1, 4, 2)
0 0 1 2
 
1 2 1 6
(b) 0 1 −1 1 (b) (x, y , z) = (1, 2, 1)
0 0 1 1
 
1 1 1 0
(c) 0 1 −1 2 (c) (x, y , z) = (−2, 2, 0) + t(−2, 1, 1)
0 0 0 0
 
1 3 2 0
(d) 0 1 1 4 (d) No solutions
0 0 0 1

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Homogeneous Linear Systems

Definition
A system of linear equations is called homogeneous if the
constant term in each equation is zero.

a11 x1 + a12 x2 + ··· + a1n xn = 0

a21 x1 + a22 x2 + ··· + a2n xn = 0
.. .. .. ..
. . ··· . .
am1 x1 + am2 x2 + ··· + amn xn = 0
 
a11 a12 ··· a1n 0
 a21 a22
 ··· a2n 0 
 .. .. .. .. 
 . . ··· . . 
am1 am2 ··· amn 0
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Solutions to homogeneous systems

Definition
A solution is called the trivial solution if it assigns zero to
every variable, i.e., x1 = 0, x2 = 0, . . . , xn = 0. Other solutions
are said to be nontrivial.

Observe:
A homogeneous system of linear equations always has the
trivial solution.

There are only two possibilities for its solution set:

1 The system has only the trivial solution.
2 The system has infinitely many solutions in addition to the
trivial solution.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
x + 2y − z = 0
−x − y + z = 0
   
1 2 −1 0 R2 +R1 1 2 −1 0
−→
−1 −1 1 0 0 1 0 0

x + 2y − z = 0
y = 0

Hence, from back substitution:

z = t, y = 0, x = −2y + z = t.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example

Example
Solve the following linear system.

x1 − x2 + 2x3 − x4 = 0
−x1 − x2 − x3 + 2x4 = 0
−x1 − 3x2 + 3x4 = 0

(x1 , x2 , x3 , x4 ) = s − 32 , 12 , 1, 0 + t 3 1



, , 0, 1
2 2

Note that:
A homogeneous linear system remains homogeneous when
performing elementary row operations.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Theorem (Theorem 1.2.1 - Free Variable Theorem for

Homogeneous Systems)
If a homogeneous linear system has n unknowns, and if the
reduced row echelon form of its augmented matrix has r
nonzero rows, then the system has n − r free variables.

Theorem (Theorem 1.2.2)

A homogeneous linear system with more unknowns than
equations has infinitely many solutions.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Example
Determine which of the following homogeneous systems have
nontrivial solutions, by inspection:
1

2x1 − 3x2 + 4x3 − x4 = 0

7x1 + x2 − 8x3 + 9x4 = 0
2x1 + 8x2 + x3 − x4 = 0

2 Nontrivial solutions.

3x1 − 2x2 = 0
6x1 − 4x2 = 0

Nontrivial solutions.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

More on the (reduced) row echelon form

Remarks:
1 The reduced row echelon form of a matrix is unique.
2 The row echelon form of a matrix is not unique.
3 In row echelon form:
1 there are always the same number of zero rows
2 the leading 1’s occur in the same positions (pivot position,
or pivot column).

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Extra Exercises
Example
(a) If A is a 4 × 6 matrix, what is the maximum possible number of leading
1’s in its reduced row echelon form?
(b) If B is a 4 × 7 matrix whose last column has all zeros, what is the
maximum possible number of parameters in the general solution of the
linear system with augmented matrix B?
(c) If C is a 6 × 3 matrix, what is the minimum possible number of rows of
zeros in any row echelon form of C?
(d) Find values of a, b and c such that the graph of the polynomial
p(x) = ax 2 + bx + c passes through the points (1, 2), (−1, 6) and (2, 3).
(e) The following is not an elementary row operation:

2R3 − 4R1

(where Row 3 is being changed). Explain why, and convert it to an

equivalent sequence of elementary row operations.
Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

In conclusion: Do you know these concepts?

Reduced row echelon

form
Forward phase
Row echelon form
Backward phase
Leading 1
Augmented matrix
Leading variables
Homogeneous linear
Free variables system
General solution to a Trivial solution
linear system
Non-trivial solution
Gaussian elimination
Back-substitution
Gauss-Jordan
elimination

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Can you?

Recognize whether a given matrix i in row echelon form,

reduced row echelon form, or neither.
Construct solutions to linear systems whose corresponding
augmented matrices that are in row echelon form or
reduced row echelon form.
Use Gaussian elimination to find the general solution of
linear systems
Use Gauss-Jordan elimination to find the general solution
of a linear system
Analyse homogeneous linear systems using the Free
Variables Theorem for Homogeneous Systems.

Dr K Gaussian Elimination
 Echelon forms
Gaussian Elimination
Gauss-Jordan Elimination
Homogeneous Linear Systems

Extra Exercises continued

Example
(f) Find the value(s) of k for which the system has a unique solution.
x + ky = 4
kx + 9y = 6
(g) Find (if possible) coditions on a, b and c such that the system has no
solution, one solution, or infinitely many solutions.
x + ay = 0
y + bz = 0
z + cx = 0
(h) Solve the following system of nonlinear equations for the unknown
angles α, β and γ, where 0 ≤ α ≤ 2π, 0 ≤ β ≤ 2π, and 0 ≤ γ ≤ π.
2 sin α − cos β + 3 tan γ = 3
4 sin α + 2 cos β − 2 tan γ = 2
6 sin α − 3 cos β + tan γ = 9

Dr K Gaussian Elimination