Gauss Jordan PDF
Gauss Jordan PDF
Gauss Jordan PDF
blends, robust and mild. A pound of the robust blend requires 12 ounces of Colombian beans and 4 ounces of
Brazilian beans. A pound of the mild blend requires 6
ounces of Colombian beans and 10 ounces of Brazilian
beans. Coffee is shipped in 132-pound burlap bags. The
company has 50 bags of Colombian beans and 40 bags of
Brazilian beans on hand. How many pounds of each blend
should it produce in order to use all the available beans?
SECTION
8-2
Gauss-Jordan Elimination
Reduced Matrices
Solving Systems by GaussJordan Elimination
Application
Now that you have had some experience with row operations on simple augmented
matrices, we will consider systems involving more than two variables. In addition,
we will not require that a system have the same number of equations as variables. It
turns out that the results for two-variabletwo-equation linear systems, stated in Theorem 1 in Section 8-1, actually hold for linear systems of any size.
Reduced Matrices
In the last section we used row operations to transform the augmented coefficient
matrix for a system of two equations in two variables
aa
11
21
a12 k1
a22 k2
a11x1 a12x2 k1
a21x1 a22x2 k2
8-2
GaussJordan Elimination
605
Form 1
10
Form 2
10
0 m
1 n
Form 3
10
m n
0 0
m n
0 p
(1)
where m, n, and p are real numbers, p 0. Each of these reduced forms represents
a system that has a different type of solution set, and no two of these forms are rowequivalent. Thus, we consider each of these to be a different simplified form. Now
we want to consider larger systems with more variables and more equations.
EXPLORE-DISCUSS 1
Forms 1, 2, and 3 above represent systems that have, respectively, a unique solution, an infinite number of solutions, and no solution. Discuss the number of solutions for the systems of three equations in three variables represented by the following augmented coefficient matrices.
1
(A) 0
0
1
0
0
1 2
0 3
0 0
1
(B) 0
0
1
0
0
1 2
0 0
0 0
1
(C) 0
0
0
1
0
0 2
0 3
1 4
Since there is no upper limit on the number of variables or the number of equations in a linear system, it is not feasible to explicitly list all possible simplified
forms for larger systems, as we did for systems of two equations in two variables.
Instead, we state a general definition of a simplified form called a reduced matrix that
can be applied to all matrices and systems, regardless of size.
DEFINITION 1
Reduced Matrix
A matrix is in reduced form if:
1. Each row consisting entirely of 0s is below any row having at least one
nonzero element.
2. The leftmost nonzero element in each row is 1.
3. The column containing the leftmost 1 of a given row has 0s above and
below the 1.
4. The leftmost 1 in any row is to the right of the leftmost 1 in the preceding
row.
EXAMPLE 1
Reduced Forms
The matrices below are not in reduced form. Indicate which condition in the definition is violated for each matrix. State the row operation(s) required to transform the
matrix to reduced form, and find the reduced form.
606
(A)
1 2
0
3
(B)
0 3
0
0
1 2
1
(D) 0
0
1
(C) 0
0
Solutions
01
10
2
0
2
3
1 1
0
2
0
0 1
0
3
1 5
(A) Condition 4 is violated: The leftmost 1 in row 2 is not to the right of the leftmost 1 in row 1. Perform the row operation R1 R2 to obtain the reduced form:
0
1
0
3
1 2
(B) Condition 3 is violated: The column containing the leftmost 1 in row 2 does not
have a zero above the 1. Perform the row operation 2R2 R1 R1 to obtain
the reduced form:
10
2
0
0
1
1 1
(C) Condition 1 is violated: The second row contains all zeros, and it is not below
any row having at least one nonzero element. Perform the row operation R2
R3 to obtain the reduced form:
0 3
1 2
0
0
1
0
0
(D) Condition 2 is violated: The leftmost nonzero element in row 2 is not a 1. Perform the row operation 12R2 R2 to obtain the reduced form:
1
0
0
Matched Problem 1
0
1
0
0 1
3
0
2
1 5
The matrices below are not in reduced form. Indicate which condition in the definition is violated for each matrix. State the row operation(s) required to transform the
matrix to reduced form and find the reduced form.
(A)
1
0
0
(C) 1
0
0
2
3 6
1
0
0
0 3
0
0
1
2
1
(B) 0
0
5
1
0
1
(D) 0
0
4
3
2 1
0
0
2
0
0
0 3
0 0
1 4
8-2
Solving Systems by
Gauss=Jordan
Elimination
EXAMPLE 2
607
We are now ready to outline the GaussJordan elimination method for solving systems of linear equations. The method systematically transforms an augmented matrix
into a reduced form. The system corresponding to a reduced augmented coefficient
matrix is called a reduced system. As we will see, reduced systems are easy to solve.
The GaussJordan elimination method is named after the German mathematician
Carl Friedrich Gauss (17771885) and the German geodesist Wilhelm Jordan
(18421899). Gauss, one of the greatest mathematicians of all time, used a method
of solving systems of equations that was later generalized by Jordan to solve problems in large-scale surveying.
Solution
GaussJordan Elimination
2x1 2x2 x3 3
3x1 x2 x3 7
x1 3x2 2x3 0
Write the augmented matrix and follow the steps indicated at the right to produce a
reduced form.
Need a 1 here
2
3
1
2
1
3
1
1
2
Need 0s here
1
3
2
3
1
2
2
1
1
Need a 1 here
1
0
0
3
10
4
2
7
3
Need 0s here
1
0
0
3
1
4
2
0.7
3
0
0.7
3
1
0
0
0
1
0
0.1
0.7
0.2
2.1
0.7
0.2
0
1
0
0.1
0.7
1
2.1
0.7
1
Need a 1 here
Need 0s here
1
0
0
R1 R3
3
7
0
0
7
3
(3)R1 R2 R2
0
7
3
0.1R2 R2
(2)R1 R3 R3
3R2 R1 R1
(4)R2 R3 R3
(5)R3 R3
0.1R3 R1 R1
0.7R3 R2 R2
608
1
0
0
0
1
0
0
0
1
2
0
1
x1 x2 x3 2
x1 x2 x3 0
x1 x2 x3 1
The solution to this system is x1 2, x2 0, x3 1. You should check this solution in the original system.
GaussJordan 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 mentally deleted
rows. Continue this process until it is impossible to go further.
[Note: If at any point in this process we obtain a row with all zeros to the left
of the vertical line and a nonzero number to the right, we can stop, since we
will have a contradiction: 0 n, n 0. We can then conclude that the system
has no solution.]
Remarks
1. Even though each matrix has a unique reduced form, the sequence of steps (algorithm) presented here for transforming a matrix into a reduced form is not unique.
That is, other sequences of steps (using row operations) can produce a reduced
matrix. (For example, it is possible to use row operations in such a way that computations involving fractions are minimized.) But we emphasize again that we are
not interested in the most efficient hand methods for transforming small matrices
into reduced forms. Our main interest is in giving you a little experience with a
method that is suitable for solving large-scale systems on a computer or graphing
utility.
2. Most graphing utilities have the ability to find reduced forms, either directly or
with some programming. Figure 1 illustrates the solution of Example 2 on a graphing calculator that has a built-in routine for finding reduced forms. Notice that in
row 2 and column 4 of the reduced form the graphing calculator has displayed the
very small number 3.5E-13 instead of the exact value 0. This is a common occurrence on a graphing calculator and causes no problems. Just replace any very small
numbers displayed in scientific notation with 0.
8-2
GaussJordan Elimination
Matched Problem 2
EXAMPLE 3
3x1 x2 2x3 2
x1 2x2 x3 3
2x1 x2 3x3 3
4
8
4
1
7
3
2
8
4
0.5
7
3
2
4
2
Solution
1
4
2
1
0
0
2
0
0
0.5
5
2
1
0
0
2
0
0
0.5
1
2
2
0
0
0
1
0
1
0
0
4
2
5
2
2
5
2x1 4x2 x3 4
4x1 8x2 7x3 2
2x1 4x2 3x3 5
0.5R1 R1
(4)R1 R2 R2
2R1 R3 R3
2
10
1
2
2
1
(0.5)R2 R1 R1
3
2
5
2R2 R3 R3
Matched Problem 3
2x1 4x2 x3 8
4x1 8x2 3x3 4
2x1 4x2 x3 11
609
610
CAUTION
EXAMPLE 4
6
4
3
9
6
4
2
4
3
3
6
4
1
0
0
2
0
1
3
0
2
1
0
0
2
1
0
3
2
0
0
1
0
1
2
0
3
2
2
Solution
1
2
2
1
0
0
x1
15
10
6
5
10
6
1
3 1
(2)R1 R2 R2
2R1 R3 R3
5
0
4
5
4
0
(2)R2 R1 R1
3
4
0
x3 3
x2 2x3 4
Note that the leftmost variable in each equation appears in one and only one equa-
8-2
GaussJordan Elimination
611
tion. We solve for the leftmost variables x1 and x2 in terms of the remaining variable x3:
x1 x3 3
x2 2x3 4
This dependent system has an infinite number of solutions. We will use a parameter
to represent all the solutions. If we let x3 t, then for any real number t,
x1 t 3
x2 2t 4
x3 t
You should check that (t 3, 2t 4, t) is a solution of the original system for any
real number t. Some particular solutions are
Matched Problem 4
t 0
t 2
t 3.5
(3, 4, 0)
(1, 0, 2)
In general,
If the number of leftmost 1s in a reduced augmented coefficient matrix
is less than the number of variables in the system and there are no
contradictions, then the system is dependent and has infinitely many
solutions.
There are many different ways to use the reduced augmented coefficient matrix
to describe the infinite number of solutions of a dependent system. We will always
proceed as follows: Solve each equation in a reduced system for its leftmost variable
and then introduce a different parameter for each remaining variable. As the solution
to Example 4 illustrates, this method produces a concise and useful representation of
the solutions to a dependent system. Example 5 illustrates a dependent system where
two parameters are required to describe the solution.
EXPLORE-DISCUSS 2
Explain why the definition of reduced form ensures that each leftmost variable in
a reduced system appears in one and only one equation and no equation contains
more than one leftmost variable. Discuss methods for determining if a consistent
system is independent or dependent by examining the reduced form.
612
EXAMPLE 5
Solution
1
1
4
2
3 2
2
4
3
4
8
7
1
3
0
2
0
1
4
0
3
1
1
1
1
1
2
0
4 3
2
1
0
4
3
0
1
1
1
1
1
4 3
2
0
0
1
0
2
3
3 1
0
1
0
1
0
2
3
0
1
2
1
1
0
0
1
0
0
1
0
0
1
0
0
9
7
4 3
2
0
0 3
7
0
2 3
1 2
0
(2)R1 R2 R2
(1)R1 R3 R3
R2 R3
(2)R2 R1 R1
(3)R3 R1 R1
R3 R2 R2
x1 x0 2x3 x0 3x5 7
x0 x2 3x3 x0 2x5 3
x0 x0 0x0 x4 2x5 0
Solve for the leftmost variables x1, x2, and x4 in terms of the remaining variables x3
and x5:
x1 2x3 3x5 7
x2 3x3 2x5 3
x4 2x5
If we let x3 s and x5 t, then for any real numbers s and t,
x1 2s 3t 7
x2 3s 2t 3
x3 s
x4 2t
x5 t
is a solution. The check is left for you to perform.
8-2
Matched Problem 5
Application
EXAMPLE 6
GaussJordan Elimination
613
Purchasing
A chemical manufacturer wants to purchase a fleet of 24 railroad tank cars with a
combined carrying capacity of 250,000 gallons. Tank cars with three different carrying capacities are available: 6,000 gallons, 8,000 gallons, and 18,000 gallons. How
many of each type of tank car should be purchased?
Solution
Let
x1 Number of 6,000-gallon tank cars
x2 Number of 8,000-gallon tank cars
x3 Number of 18,000-gallon tank cars
Then
0,000x1 0,000x2 00,000x3 000,024
Now we can form the augmented matrix of the system and solve by using Gauss
Jordan elimination:
6,0001
1
8,000
16
1
8
1 24
18 250
10
1
2
1 24
12 106
10
1
1
1 24
6 53
10
0
1
1
24
18,000 250,000
1
1,000 R2
(6)R1 R2 R2
1
2 R2
5 29
6
53
R2 (simplify R2)
R2
(1) R2 R1 R1
x1 x2 5x3 29
or
x1 5x3 29
x1 x2 6x3 53
or
x2 6x3 53
614
TABLE 1
6,000-gallon
tank cars
x1
8,000-gallon
tank cars
x2
18,000-gallon
tank cars
x3
01
17
06
11
11
05
The final choice would probably be influenced by other factors. For example, the
company might want to minimize the cost of the 24 tank cars.
Matched Problem 6
A commuter airline wants to purchase a fleet of 30 airplanes with a combined carrying capacity of 960 passengers. The three available types of planes carry 18, 24, and
42 passengers, respectively. How many of each type of plane should be purchased?
10
0
2
1 2
(B) Condition 3 is violated: The 5 in row 1 and column 2 should be a 0. Perform the operation
(5)R2 R1 R1 to obtain:
1
0
0
0
1
0
6
8
2 1
0
0
8-2
615
GaussJordan Elimination
(C) Condition 4 is violated: The leftmost 1 in the second row is not to the right of the leftmost 1 in
the first row. Perform the operation R1 R2 to obtain:
1
0
0
0
1
0
0
0
0 3
1
2
(D) Condition 1 is violated: The all-zero second row should be at the bottom. Perform the operation
R2 R3 to obtain:
1
0
0
2.
3.
4.
5.
6.
18-passenger
planes
x1
24-passenger
planes
x2
02
14
14
15
05
10
15
16
08
06
16
17
11
02
17
8-2
11.
10
0 1
2
6
0
3. 0
0
1
0
0
0
5. 0
1
00
7.
2
0
0
2.
10
0
5
1 3
0
1
0
1
4. 0
0
4 0
0 0
0 1
0
1
0
1
2
0 5
0
4
1
0
0
1
6. 0
0
2
0
0
4
1
1 3
0
0
1
0
6
0
00
0
0
0
1
8
1
8.
1
0
0
0
1
9. 0
0
0
1
0
0 2
0
3
1
0
1
0
10.
0
0
42-passenger
planes
x3
14
1.
0 3
1 4
0 0
x1 1, x2 1, x3 0
Inconsistent; no solution
x1 5t 4, x2 3t 5, x3 t, t any real number
x1 s 7, x2 s, x3 t 2, x4 3t 1, x5 t, s and t any real numbers
EXERCISE
2
0
0
0
1
0
0
0
0
1
0
0 2
0
0
0
1
1
3
15.
0
1
0
10
2
0
1
13. 0
0
0 2
3
1
1 5
0
0
0
1
0
0
0
0
1
1
12. 0
0
0 3
1
5
0
0
0
5
1 3
0
0
10
0
1
1
14. 0
0
3 5
16.
3
2
0
1
2
0
0
2
1
B
Use row operations to change each matrix in Problems
1722 to reduced form.
17.
10
2 1
1
3
0 3
1
1
2
0
0
3 6
1
19. 0
0
18.
10
3
1
2 4
0
4
0
1 3 1
0 2
2
1
20. 0
0
3
4
2 1
616
1
21. 0
0
2
3
1
2 1
1
6
2 13
0
22. 2
0
2
2
1
44. Consider a system of three linear equations in three variables. Give examples of two reduced forms that are not row
equivalent if the system is
(A) Consistent and dependent
(B) Inconsistent
1
8
6 4
1
4
2
29. 2x1 x2 0
3x1 2x2 7
x1 x2 1
30. 2x1 x2 0
3x1 2x2 7
x1 x2 2
C
Solve Problems 4550 using GaussJordan elimination.
45.
50.
x1 x2 4x3 x4 1.3
x1 x2 x3 0x0 1.1
2x1 x0 0x3 3x4 4.4
2x1 5x2 11x3 3x4 5.6
x1 2x2 4x3 x4 7
2x1 5x2 9x3 4x4 16
x1 5x2 7x3 7x4 13
x1 3x2 x3 x4 2x5 2
x1 5x2 2x3 2x4 2x5 0
2x1 6x2 2x3 2x4 4x5 4
x1 3x2 x3 0x0 0x5 3
APPLICATIONS
51. Puzzle. A friend of yours came out of the post office after
spending $14.00 on 15, 20, and 35 stamps. If she
bought 45 stamps in all, how many of each type did she
buy?
8-2
GaussJordan Elimination
617
Food A
Food B
Food C
Calcium
30
10
20
Iron
10
10
20
Vitamin A
10
30
20
66. Nutrition. Repeat Problem 65 if the diet is to include exactly 400 units of calcium, 160 units of iron, and 240 units
of vitamin A.
Oneperson
boat
Twoperson
boat
Fourperson
boat
Cutting
department
0.5 h
1.0 h
1.5 h
Assembly
department
0.6 h
0.9 h
1.2 h
Packaging
department
0.2 h
0.3 h
0.5 h
61.
62.