Systems of Linear Equations Matrices: Section 3 Gauss-Jordan Elimination

Chapter 4
Systems of
Linear Equations;
Matrices
Section 3
Gauss-Jordan
Elimination
Copyrightfor
Barnett, Finite Mathematics © 2015, 2011, and
Business, 2008 Pearson
Economics, Education, Inc.
Life Sciences, and Social Sciences, 14e, GE
Copyright © 2019, 2015, 2011 Pearson Education Ltd. Slide 1
Gauss-Jordan Elimination
We expand the use of row operations to systems involving

more than two variables.
The number of equations is not required to match the number
of variables.
Regardless of the number of equations or number of
variables, a system of equations will have either
1. Exactly one solution (consistent and independent), or
2. Infinitely many solutions (consistent and dependent), or
3. No solution (inconsistent).
Barnett, Finite Mathematics for Business, Economics, Life Sciences, and Social Sciences, 14e, GE
Reduced Matrices
In the preceding section we used row operations to transform
the augmented matrix for a system of two equations in two
variables into one of the following simplified forms:
Form 1 Form 2 Form 3

1 0 m  1 m n  1 m n 
     
0 1 n  0 0 0  0 0 p 
where m, n, and p are real numbers, p ≠ 0.
Each of these reduced forms has a different type of solution

set.
Reduced Form
A list of all simplified matrix forms is not practical for large
linear systems.
We define a simplified form called a reduced matrix.
Definition Reduced Form
A matrix is said to be in reduced row echelon form, or more

simply, in reduced form, if
1. Each row consisting entirely of zeros is below any row
having at least one nonzero element.
2. The leftmost nonzero element in each row is 1.
3. All other elements in the column containing the left most
1 of a given row are zeros.
4. The leftmost 1 in any row is to the right of the leftmost 1
in the row above.
Example 1 Reduced Forms
The following matrix is not in reduced form.
Indicate which condition in the definition is violated.
Tell the row operation(s) required to transform the matrix into
reduced form, and find the reduced form.
0 1  2 Solution Condition 4 is violated. The

A.)   left most 1 in row 2 is not to the right of
1 0 3  the left most 1 in row 1. Interchange R1
and R2.
1 0 3 
 
 0 1  2 
The following matrix is not in reduced form. Indicate which
condition in the definition is violated.
Solution Condition 3 is violated. The
1 2 2 3 column containing the left most 1 in row
B.)   2 has a nonzero element above the 1.
0 0 1 1
Perform the row operation 2R2 + R1 → R1.
1 2 0 1
 
0 0 1 1
1 0  3 Solution Condition 1 is violated. The
  second row contains all zeros and is not
C.) 0 0 0
0 1  2  below any row having at least one
nonzero element. Interchange R2 and R3.
1 0  3
 
0 1  2
0 0 0 
1 0 0  1 Solution Condition 2 is violated. The
  leftmost nonzero in row 2 is not a 1.
D.) 0 2 0 3 
0 0 1  5 Perform the row operation ½ R2 → R2.
1 0 0  1 
 3
0 1 0 2 
0 0 1  5
Example 2 Solving a System
Using Gauss-Jordan Elimination
Solve by Gauss-Jordan elimination:
2 x1  2 x2  x3  3

 3 x1  x2  x3  7
 x  3 x2  2 x3  0
 1
Solution Write the augmented matrix for the system.
 2 2 1 3
 
3 1 1 7
 1 3 2 0 
continued
 2 2 1 3 Step 1 Need a 1 in the left most
 
3 1 1 7 nonzero column.
 1 3 2 0  R1 ↔ R3
 1 3 2 0 Step 2 Use multiples of the row

  containing the 1 (from step 1) to get
3 1 1 7
 2 2 1 3  zeros in all remaining rows
containing this 1.
(–3) R1 + R2 → R2
 1 3 2 0
  (–2) R1 + R3 → R3
0 10 7 7
0 4 3 3 
continued
 1 3 2 0 Step 3 Need a 1 in the second row
  second column.
0 10 7 7
0 4 3 3  0.1R2 ↔ R2
 1 3 2 0 Step 4 Use multiples of row 2 to get

  zeros in all remaining rows
0 1 0.7 0.7 
0 4 3 3  containing this 1.
(3) R2 + R1 → R1
 1 0 0.1 2.1 (–4) R2 + R3 → R3
 
0 1 0.7 0.7 
0 0 0.2 0.2 
continued
 1 0 0.1 2.1 Step 5 Need a 1 in the third row
  third column.
0 1 0.7 0.7 
0 0 0.2 0.2 
–5R3 ↔ R3
 1 0 0.1 2.1 Step 6 Use multiples of row 3 to get

  zeros in all remaining rows
0 1 0.7 0.7 
containing this 1.
0 0 1 1  (0.1) R3 + R1 → R1
(0.7) R3 + R2 → R2
1 0 0 2
 
0 1 0 0
0 0 1 1
continued
1 0 0 2 The matrix is now in reduced form,
  and we can solve the corresponding
0 1 0 0
reduced system.
0 0 1 1
x1  2
x2  0
x3  1
The solution to this system is x1 = 2, x2 = 0, and x3 = –1.
Procedure Gauss-Jordan
Elimination
Step 1 Choose the leftmost nonzero column and use
appropriate row operations to get a 1 at the top.
Step 2 Use multiples of the row containing the 1 from step 1
to get zeros in all remaining places in the column containing
this 1.
Step 3 Repeat step 1 with the submatrix formed by
(mentally) deleting the row used in step 2 and all rows above
this row.
Step 4 Repeat step 2 with the entire matrix, including the
rows deleted mentally. Continue this process until the entire
matrix is in reduced form.
Note: If we obtain a row with all zeros to the left of the vertical line
and a nonzero number to the right, we can conclude that we will
have a contradiction: 0 = n, n ≠ 0. The system has no solution.
 2 x1  4 x2  x3  4

 4 x1  8 x2  7 x3  2
2 x  4 x2  3 x3  5
 1
 2 4 1 4 
 
 4 8 7 2
 2 4 3 5
continued
 2 4 1 4 
 
 4 8 7 2 0.5R1 ↔ R1
 2 4 3 5
 1 2 0.5 2 
  (–4) R1 + R2 → R2
 4 8 7 2
(2) R1 + R3 → R3
 2 4 3 5
 1 2 0.5 2 
 
0 0 5 10 
0 0 2 1
continued
 1 2 0.5 2 
  Column 3 is the
0 0 5 10  0.2R2 ↔ R2 leftmost nonzero
0 0 2 1 column in this
submatrix.
 1 2 0.5 2 
  (–0.5) R2 + R1 → R1
0 0 1 2
0 0 2 1 (2) R2 + R3 → R3
 1 2 0 3 Because the last row produces a

 
0 0 1 2 contradiction, we stop the Gauss-
0 0 0 5 Jordan elimination and conclude that
the system has no solution.
With Calculator Processes
 2 x1  4 x2  x3  4

 4 x1  8 x2  7 x3  2
2 x  4 x2  3 x3  5
 1
Solution Input the augmented matrix into the graphing

calculator.
With Calculator Processes
continued
Solution Complete the row reduction process using calculator
steps.
The graphing calculator process does not stop when a

contradiction first occurs but continues and completes the
reduced form.
The last row still produces a contradiction and there is no
solution.
 3 x1  6 x2  9 x3  15

 2 x1  4 x2  6 x3  10
2 x  3 x2  4 x3  6
 1
 3 6 9 15
 
 2 4 6 10 
 2 3 4 6 
continued
 3 6 9 15
  ⅓R1 ↔ R1
 2 4 6 10 
 2 3 4 6 
 1 2 3 5 (–2) R1 + R2 → R2
 
 2 4 6 10  (2) R1 + R3 → R3
 2 3 4 6 
 1 2 3 5
 
0 0 0 0
0 1 2 4 
continued
 1 2 3 5 Interchange rows 2 and 3
  R2 ↔ R3 to obtain a nonzero entry
0 0 0 0
0 1 2 4  at the top of the second
column of this submatrix.
 1 2 3 5
  (–2) R2 + R1 → R1
0 1 2 4
0 0 0 0 
1 0 1 3 The matrix is now in reduced form.

  Write the corresponding reduced
0 1 2 4
0 0 0 0  system and solve.
continued
1 0 1 3
  The reduced matrix corresponds to
0 1 2 4
the reduced system of equations.
0 0 0 0 
x1  x3  3
x2  2 x3  4
The leftmost variable in each equation appears in one and

only one equation.
We solve for the leftmost variable x1 and x2 in terms of the
remaining variable x3.
continued
x1  x3  3 x1 = –x3 – 3
gives
x2  2 x3  4 x2 = 2x3 + 4
Let x3 = t, then for any real number t,

x1 = –t – 3
x2 = 2t + 4
x3 = t
Particular solutions: (for t = 0), x1 = – 3, x2 = 4, x3 = 0
(for t = –2), x1 = – 1, x2 = 0, x3 = –2
(for t = 3.5), x1 = – 6.5, x2 = 11, x3 = 3.5
General Observation
If the number of leftmost 1’s in a reduced augmented

coefficient matrix is less than the number of variables in the
system and there are not contradictions, then the system is
dependent and has infinitely many solutions.
x1  2 x2  4 x3  x4  x5  1
2 x1  4 x2  8 x3  3 x4  4 x5  2
x1  3 x2  7 x3  3 x5  2
 1 2 4 1 1 1
 
 2 4 8 3 4 2
 1 3 7 0 3 2 
continued
 1 2 4 1 1 1 –2R1 + R2 → R2
 
 2 4 8 3 4 2
 1 3 7 0 3 2  –1R1 + R3 → R3
 1 2 4 1 1 1
 
0 0 0 1 2 0 R2 ↔ R3
0 1 3 1 4 3
 1 2 4 1 1 1
 
0 1 3 1 4 3 –2R2 + R1 → R1
0 0 0 1 2 0 
continued
 1 0 2 3 9 7 –3R3 + R1 → R1
 
0 1 3 1 4 3
0 0 0 1 2 0  R3 + R2 → R2
 1 0 2 0 3 7 Matrix is in reduced form.
 
0 1 3 0 2 3 Write the corresponding
0 0 0 1 2 0  system.
x1  2 x3  3 x5  7
x2  3x3  2 x5  3
x4  2 x5  0
continued
x1  2 x3  3 x5  7 Solve for the left most variables
x2  3x3  2 x5  3 x1, x2, and x4, in terms of the
x4  2 x5  0 remaining variable.
x1  2 x3  3 x5  7 Let x3 = s and x5 = t, then for
x2  3 x3  2 x5  3 any real numbers s and t, we
x4  2 x5 have the solution to the system.
x1  2 s  3t  7
x2  3s  2t  3
x3  s
x4  2t
x5  t
Recall the Three Step Model
Using mathematics to solve real-
world problems can be broken down
into the three steps:
Step 1 Construct a mathematical model whose solution will

provide information about the real-world problem.
Step 2 Solve the mathematical model.
Step 3 Interpret the solution to the mathematical model in

terms of the original real-world problem.
Example 6 Purchasing
A company that rents small moving trucks wants to purchase
25 trucks with a combined capacity of 28,000 cubic feet.
Three different types of trucks are available:
A 10-foot truck with a capacity of 350 cubic feet
A 14-foot truck with a capacity of 700 cubic feet
A 24-foot truck with a capacity of 1,400 cubic feet.
How many of each type of truck should the company

purchase?
Solution Let x1 = number of 10-foot trucks

x2 = number of 14-foot trucks
x3 = number of 24-foot trucks
Example 6 Purchasing continued
Form the mathematical model:
x1  x2  x3  25 Number of trucks
350 x1  700 x2  1, 400 x3  28, 000 Total capacity
Form the augmented matrix of the system and solve by

Gauss-Jordan elimination:
 1 1 1 25
 
1
350 R2  R2
350 700 1, 400 28, 000 
1 1 1 25
   R1  R2  R2
1 2 4 80 
1 1 1 25
   R2  R1  R1
0 1 3 55
 1 0 2 30  Matrix is in reduced form.

 
0 1 3 55 Write the corresponding system
of equations.
x1  2 x3  30 x1  2 x3  30
or
x2  3 x3  55 x2  3 x3  55
Let x3 = t. Then for any real number t,

x1  2t  30
x2  3t  55 is a solution to the system of
x3  t equations in this model.
x1  2t  30
x2  3t  55
x3  t
We interpret this solution in terms of the original problem.
Since the variables, x1, x2, and x3 represent numbers of

trucks, they must be nonnegative whole numbers.
It follows that t must be a nonnegative whole number.
x1  2t  30
x2  3t  55
x3  t
The first and second equations also place restrictions on t.
x1 = 2t – 30 > 0 implies that t > 15

55
x2 = –3t + 55 > 0 implies that t   18 1
3
3
With 15 < t < 18 (can’t have 1/3 of a truck), the only
possible values for t are 15, 16, 17, and 18.
A table of values gives a convenient way to display these

solutions.
The table summarizes the purchasing options for the company.
10-Foot Truck 14-Foot Truck 24-Foot Truck

t x1 x2 x3
15 0 10 15
16 2 7 16
17 4 4 17
18 6 1 18

Systems of Linear Equations Matrices: Section 3 Gauss-Jordan Elimination

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Systems of Linear Equations Matrices: Section 3 Gauss-Jordan Elimination

Uploaded by

Copyright:

Available Formats

Chapter 4

We expand the use of row operations to systems involving

Form 1 Form 2 Form 3

where m, n, and p are real numbers, p ≠ 0.

Each of these reduced forms has a different type of solution

Definition Reduced Form

A matrix is said to be in reduced row echelon form, or more

0 1  2 Solution Condition 4 is violated. The

Solution Write the augmented matrix for the system.

 1 3 2 0 Step 2 Use multiples of the row

 1 3 2 0 Step 4 Use multiples of row 2 to get

 1 0 0.1 2.1 Step 6 Use multiples of row 3 to get

The solution to this system is x1 = 2, x2 = 0, and x3 = –1.

Solution Write the augmented matrix for the system.

 1 2 0 3 Because the last row produces a

Solution Input the augmented matrix into the graphing

The graphing calculator process does not stop when a

Solution Write the augmented matrix for the system.

1 0 1 3 The matrix is now in reduced form.

The leftmost variable in each equation appears in one and

Let x3 = t, then for any real number t,

If the number of leftmost 1’s in a reduced augmented

Solution Write the augmented matrix for the system.

Step 1 Construct a mathematical model whose solution will

Step 2 Solve the mathematical model.

Step 3 Interpret the solution to the mathematical model in

How many of each type of truck should the company

Solution Let x1 = number of 10-foot trucks

Form the augmented matrix of the system and solve by

 1 0 2 30  Matrix is in reduced form.

Let x3 = t. Then for any real number t,

We interpret this solution in terms of the original problem.

Since the variables, x1, x2, and x3 represent numbers of

It follows that t must be a nonnegative whole number.

x1 = 2t – 30 > 0 implies that t > 15

A table of values gives a convenient way to display these

10-Foot Truck 14-Foot Truck 24-Foot Truck

You might also like