MATH 2220 LINEAR ALGEBRA FOR

ENGINEERING
Gaussian elimination

Section 1. 2

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

In Example of the last section,
 
1 1 2 9
 0 2 −7 −17 
3 6 −5 0
we solved a linear system in the unknowns x, y , and z by reducing the
augmented matrix to the form
 
1 0 0 1
 0 1 0 2 
0 0 1 3

from which the solution x = 1, y = 2, z = 3 became evident. This is an

example of a matrix that is in reduced row echelon form. To be of this
form, a matrix must have the following properties:

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

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 .

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

If there are any rows that consist entirely of zeros, then they are
grouped together at the bottom of the matrix.

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

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.

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

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

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

 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.

A matrix that has the first three properties is said to be in

row echelon form. (Thus, a matrix in reduced row echelon
form is of necessity in row echelon form, but not conversely.)

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Example
The following matrices are in reduced row echelon form.
 
    0 1 −2 0 1
1 0 0 4 1 0 0  0 0 0
 
 0 1 0 1 3  0 0
7 ,  0 1 0 ,   0 0 0
,
0 0  0 0
0 0 1 −1 0 0 1
0 0 0 0 0

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Example
The following matrices are in row echelon form but not reduced row
echelon form.
     
1 4 −3 7 1 1 0 0 1 2 6 0
 0 1 6 2  ,  0 1 0  ,  0 0 1 −1 0 
0 0 1 5 0 0 0 0 0 0 0 1

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Example
Thus, with any real numbers substituted for the ∗ ’s, all matrices of the
following
 types are in row echelon form:
  
1 ∗ ∗ ∗ 1 ∗ ∗ ∗ 1 ∗ ∗ ∗
 0 1 ∗ ∗   0 1 ∗ ∗   0 1 ∗ ∗ 
 0 0 1 ∗ ,  0 0 1 ∗ ,  0 0 0 0 
     

0 0 0 1 0 0 0 0 0 0 0 0
 
0 1 ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗
 0 0 0 1 ∗ ∗ ∗ ∗ ∗ ∗ 
 
 0 0 0 0 1 ∗ ∗ ∗ ∗ ∗ 
 
 0 0 0 0 0 1 ∗ ∗ ∗ ∗ 
0 0 0 0 0 0 0 0 1 ∗

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Example
All
 matrices of 
the following
 types are
 in reduced row echelon
 form:
1 0 0 0 1 0 0 ∗ 1 0 ∗ ∗
 0 1 0 0   0 1 0 ∗   0 1 ∗ ∗ 
 0 0 1 0 ,  0 0 1 ∗ ,  0 0 0 0 
     

0 0 0 1 0 0 0 0 0 0 0 0
 
0 1 ∗ 0 0 0 ∗ ∗ 0 ∗
 0 0 0 1 0 0 ∗ ∗ 0 ∗ 
 
 0 0 0 0 1 0 ∗ ∗ 0 ∗ 
 
 0 0 0 0 0 1 ∗ ∗ 0 ∗ 
0 0 0 0 0 0 0 0 1 ∗

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

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

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

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.

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

In each part, suppose that the augmented matrix for a linear
system in the unknowns x, y , and z has been reduced by ele-
mentary row operationsto the given reduced
  row echelon form.

1 0 0 0 1 0 3 −1
Solve the system. (a)  0 1 2 0  (b)  0 1 −4 2 
0 0 0 1 0 0 0 0
 
1 −5 1 4
(c)  0 0 0 0 
0 0 0 0

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

  
1 0 0 0
(a)  0 1 2 0 
0 0 0 1
Solution (a) 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.

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

  
1 0 3 −1
(b)  0 1 −4 2 
0 0 0 0
Solution (b) 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; hence, the linear system corresponding to the augmented
matrix is
x + 3z = −1
y − 4z = 2
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

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Since x and y correspond to the leading l’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 . 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
MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el
  
1 −5 1 4
(c)  0 0 0 0 
0 0 0 0
Solution (c) As explained in part (b), 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

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

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Gauss-Jordan elimination

We have just seen how easy it is to solve a system of linear equations

once its augmented matrix is in reduced row echelon form. Now we
will give a step-by-step elimination procedure that can be used to
reduce any matrix to reduced row echelon form. As we state each step
in the procedure, we illustrate the idea by reducing the following matrix
to reduced row echelon form.
 
0 0 −2 0 7 12
 2 4 −10 6 12 28 
2 4 −5 6 −5 −1

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Gauss-Jordan elimination: Step 1

Locate the leftmost column that does not consist entirely of zeros.
 
0 0 −2 0 7 12
 2 4 −10 6 12 28 
2 4 −5 6 −5 −1

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Gauss-Jordan elimination:Step 2

Interchange the top row with another row, if necessary, to bring a

nonzero entry to the top of the column found in Step 1
 
2 4 −10 6 12 28
 0 0 −2 0 7 12  ←
2 4 −5 6 −5 −1

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Gauss-Jordan elimination:Step 3

If the entry that is now at the top of the column found in Step 1 is a,
multiply the first row by 1/a in order to introduce a leading 1
 
1 2 −5 3 6 14
 0 0 −2 0 7 12  ←
2 4 −5 6 −5 −1

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Gauss-Jordan elimination:Step 4

Add suitable multiples of the top row to the rows below so that all
entries below the leading 1 become zeros.
 
1 2 −5 3 6 14
 0 0 −2 0 −2 times the first row of
7 12  +
matrix was added to the third row
0 0 5 0 −17 −29

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Gauss-Jordan elimination:Step 5

Now cover the top row in the matrix and begin again with Step 1
applied to the submatrix that remains. Continue in this way until the
entire matrix is in row echelon form.
 
1 2 −5 3 6 14
 0 0 −2 0 7 12 
0 0 5 0 −17 −29
 
1 2 −5 3 6 14
 0 0 1 0 − 27 −6 
0 0 5 0 −17 −29

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

  
1 2 −5 3 6 14
 0 0 1 0 − 72 −6 
1
0 0 0 0 2 1
 
1 2 −5 3 6 14
 0 0 1 0 − 72 −6 
0 0 0 0 1 2
The entire matrix is now in row echelon form. To find the reduced row
echelon form we need the following additional step.

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Gauss-Jordan elimination:Step 6

 
1 2 −5 3 6 14 7
 0 0 1 0 0 1  ←− 2 times the third r
matrix was added
0 0 0 0 1 2
 
1 2 −5 3 0 2
 0 0 1 0 0 1 
0 0 0 0 1 2
−6 times the third row was added to the
 first row. 
1 2 0 3 0 7
 0 0 1 0 0 1 
0 0 0 0 1 2
5 times the second row was added to the
first row.
The last matrix is in reduced row echelon form.

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Gauss-Jordan Elimination
Example
Solve by Gauss-Jordan elimination.

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

2x1 + 6x2 − 5x3 − 2x4 + 4x5 − 3x6 = −1
5x3 + 10x4 + 15x6 =5
2x1 + 6x2 +8x4 + 4x5 + 18x6 = 6

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
Solution The augmented matrix for the system is
 
1 3 −2 0 2 0 0
 2 6 −5 −2 4 −3 −1 
 
 0 0 5 10 0 15 5 
2 6 0 8 4 18 6

Adding -2 times the first row to the second and fourth rows gives
 
1 3 −2 0 2 0 0
 0 0 −1 −2 0 −3 −1 
 
 0 0 5 10 0 15 5 
0 0 4 8 0 18 6

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
Multiplying the second row by -1 and then adding -5 times the new
second row to the third row and -4 times the new second row to the
fourth row gives  
1 3 −2 0 2 0 0
 0 0 1 2 0 3 1 
 
 0 0 0 0 0 0 0 
0 0 0 0 0 6 2

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
Interchanging the third and fourth rows and then multiplying the third
row of the resulting matrix by 16 gives the row echelon form
 
1 3 −2 0 2 0 0
 0 0 1 2 0 3 1 
 
 0 0 0 0 0 1 31 
0 0 0 0 0 0 0

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
Adding -3 times the third row to the second row and then adding 2
times the second row of the resulting matrix to the first row yields the
reduced row echelon form
 
1 3 0 4 2 0 0
 0 0 1 2 0 0 0 
 
 0 0 0 0 0 1 1 
3
0 0 0 0 0 0 0

This completes the backward phase sinc

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
The corresponding system of equations is

x1 + 3x2 + 4x4 + 2x5 =0

x3 + 2x4 =0
1
x6 =
3

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
Solving for the leading variables, we obtain

x1 = −3x2 − 4x4 − 2x5

x3 = −2x4
x6 = 31

Finally, we express the general solution of the system parametrically

by assigning the free variables x2 , x4 , and x5 arbitrary values r , s, and
t, respectively. This yields

1
x1 = −3r − 4s − 2t, x2 = r , x3 = −2s, x4 = s, x5 = t, x6 =
3

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

A system of linear equations is said to be homogeneous if the constant
terms are all zero; that is, the system has the form

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

a21 x1 + a22 x2 + · · · + a2n xn = 0
.. .. ..
. . .
..
.
am1 x1 + am2 x2 + · · · + amn xn = 0

Every homogeneous system of linear equations is consistent because

all such systems have x1 = 0, x2 = 0, . . . , xn = 0 as a solution. This
solution is called the trivial solution; if there are other solutions. thev
are called nontrivial solutions.

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Because a homogeneous linear system always has the trivial so-
lution, there are only two possibilities for its solutions:
The system has only the trivial solution.
The system has infinitely many solutions in addition to the
trivial solution.

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Example
Use Gauss-Jordan elimination to solve the homogeneous linear
system

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

2x1 + 6x2 − 5x3 − 2x4 + 4x5 − 3x6 = 0
5x3 + 10x4 + 15x6 = 0
2x1 + 6x2 + 8x4 + 4x5 + 18x6 = 0

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
The augmented matrix for the given homogeneous system is
 
1 3 −2 0 2 0 0
 2 6 −5 −2 4 −3 0 
 
 0 0 5 10 0 15 0 
2 6 0 8 4 18 0

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
which is the same as the augmented matrix for the system in Example
5, except for zeros in the last column. Thus, the reduced row echelon
form of this matrix will be the same as that of the augmented matrix in
Example 5, except for the last column. However, a moment’s reflection
will make it evident that a column of zeros is not changed by an
elementary row operation, so the reduced row echelon form of (5) is
 
1 3 0 4 2 0 0
 0 0 1 2 0 0 0 
 
 0 0 0 0 0 1 0 
0 0 0 0 0 0 0

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
The corresponding system of equations is

x1 + 3x2 +4x4 + 2x5 = 0

x3 + 2x4 =0
x6 = 0

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
Solving for the leading variables, we obtain

x1 = −3x2 − 4x4 − 2x5

x3 = −2x4
x6 = 0

If we now assign the free variables x2 , x4 , and x5 arbitrary values r , s,

and t, respectively, then we can express the solution set parametrically
as

x1 = −3r − 4s − 2t, x2 = r , x3 = −2s, x4 = s, x5 = t, x6 = 0

Note that the trivial solution results when r = s = t = 0

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Example
a row echelon form of the augmented matrix is
 
1 3 −2 0 2 0 0
 0 0 1 2 0 3 1 
 
 0 0 0 0 0 1 13 
0 0 0 0 0 0 0

To solve the corresponding system of equations

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

x3 + 2x4 + 3x6 = 1
1
x6 =
3
we proceed as follows:

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
Solve the equations for the leading variables.

x1 = −3x2 + 2x3 − 2x5

x3 = 1 − 2x4 − 3x6
x6 = 31

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
Beginning with the bottom equation and working upward, successively
substitute each equation into all the equations above it. Substituting
x6 = 13 into the second equation yields

x1 = −3x2 + 2x3 − 2x5

x3 = −2x4
x6 = 31

Substituting x3 = −2x4 into the first equation yields

x1 = −3x2 − 4x4 − 2x5

x3 = −2x4
x6 = 31

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Solution
Assign arbitrary values to the free variables, if any. If we now assign
x2 , x4 , and x5 the arbitrary values r , s, and t, respectively, the general
solution is given by the formulas

1
x1 = −3r − 4s − 2t, x2 = r , x3 = −2s, x4 = s, x5 = t, x6 =
3

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el

Example
Earlier in this section we found a row echelon form of
 
0 0 −2 0 7 12
A =  2 4 −10 6 12 28 
2 4 −5 6 −5 −1

to be  
1 2 −5 3 6 14
 0 0 1 0 − 27 −6 
0 0 0 0 1 2
The leading 1’s occur in positions (row 1, column 1), (row 2, column 3
), and (row 3 column 5). These are the pivot positions. The pivot
columns are columns 1, 3, and 5.

MATH 2220 LINEAR ALGEBRA FOR ENGINEERINGGaussian el