Gaussian Elimination for Students
Gaussian Elimination for Students
Carl Friedrich Gauss lived during the late 18 century and early 19 century, but he is still considered one of the most prolific
th th
mathematicians in history. His contributions to the science of mathematics and physics span fields such as algebra, number theory,
analysis, differential geometry, astronomy, and optics, among others. His discoveries regarding matrix theory changed the way
mathematicians have worked for the last two centuries.
3x + 4y = 7
4x − 2y = 5
3 4 7
[ ]
4 −2 5
We can also write a matrix containing just the coefficients. This is called the coefficient matrix.
3 4
[ ]
4 −2
x +y = 5
2x − 3z = 2
⎢1 1 0 ⎥
⎣ ⎦
2 0 −3
⎡ 3 −1 −1 0 ⎤
⎢ 1 1 0 5 ⎥
⎢ ⎥
⎣ 2 0 −3 2 ⎦
Notice that the matrix is written so that the variables line up in their own columns: x-terms go in the first column, y -terms in the
second column, and z -terms in the third column. It is very important that each equation is written in standard form
ax + by + cz = d so that the variables line up. When there is a missing variable term in an equation, the coefficient is 0 .
2x − y + 2z = 6
x − 3y + 3z = 4
Solution
The augmented matrix displays the coefficients of the variables, and an additional column for the constants.
⎡ 1 2 −1 3 ⎤
⎢ 2 −1 2 6 ⎥
⎢ ⎥
⎣ ⎦
1 −3 3 4
Exercise 11.6.1
3x + 2y = 4
Answer
4 −3 11
[ ]
3 2 4
⎡ 1 −3 −5 −2 ⎤
⎢ 2 −5 −4 5 ⎥
⎢ ⎥
⎣ −3 5 4 6 ⎦
Solution
When the columns represent the variables x, y , and z ,
⎡ 1 −3 −5 −2 ⎤ x − 3y − 5z = −2
⎢ 2 −5 −4 5 ⎥ → 2x − 5y − 4z = 5
⎢ ⎥
⎣ −3 5 4 6 ⎦ −3x + 5y + 4z = 6
Exercise 11.6.2
⎡ 1 −1 1 5 ⎤
⎢ 2 −1 3 1 ⎥
⎢ ⎥
⎣ 0 1 1 −9 ⎦
Answer
x −y +z = 5
2x − y + 3z = 1
y + z = −9
We use row operations corresponding to equation operations to obtain a new matrix that is row-equivalent in a simpler form. Here
are the guidelines to obtaining row-echelon form.
1. In any nonzero row, the first nonzero number is a 1. It is called a leading 1.
2. Any all-zero rows are placed at the bottom on the matrix.
3. Any leading 1 is below and to the right of a previous leading 1.
4. Any column containing a leading 1 has zeros in all other positions in the column.
To solve a system of equations we can perform the following row operations to convert the coefficient matrix to row-echelon form
and do back-substitution to find the solution.
1. Interchange rows. (Notation: R ↔ R )
i j
GAUSSIAN ELIMINATION
The Gaussian elimination method refers to a strategy used to obtain the row-echelon form of a matrix. The goal is to write
matrix A with the number 1 as the entry down the main diagonal and have all zeros below.
a11 a12 a13 1 b12 b13
⎡ ⎤ Af ter Gaussian elimination ⎡ ⎤
The first step of the Gaussian strategy includes obtaining a 1 as the first entry, so that row 1 may be used to alter the rows
below.
How to: Given an augmented matrix, perform row operations to achieve row-echelon form
1. The first equation should have a leading coefficient of 1. Interchange rows or multiply by a constant, if necessary.
2. Use row operations to obtain zeros down the first column below the first entry of 1.
3. Use row operations to obtain a 1 in row 2, column 2.
4. Use row operations to obtain zeros down column 2, below the entry of 1.
5. Use row operations to obtain a 1 in row 3, column 3.
6. Continue this process for all rows until there is a \(1 in every entry down the main diagonal and there are only zeros below.
7. If any rows contain all zeros, place them at the bottom.
2x + 3y = 6
1
x −y =
2
Solution
First, we write this as an augmented matrix.
2 3 6
[ ]
1 −1 12
We want a 1 in row 1, column 1. This can be accomplished by interchanging row 1 and row 2.
1 −1 12
R1 ↔ R2 → [ ]
2 3 6
We now have a 1 as the first entry in row 1, column 1. Now let’s obtain a 0 in row 2, column 1. This can be accomplished by
multiplying row 1 by −2, and then adding the result to row 2.
1 −1 12
−2 R1 + R2 = R2 → [ ]
0 5 5
1
We only have one more step, to multiply row 2 by .
5
1 1 −1 12
R2 = R2 → [ ]
5 0 1 1
Use back-substitution. The second row of the matrix represents y = 1 . Back-substitute y = 1 into the first equation.
3
The solution is the point ( .
, 1)
2
Exercise 11.6.3
Solve the given system by Gaussian elimination.
4x + 3y = 11
x − 3y = −1
Answer
(2, 1)
4x + 2y = 6
Solution
Write the system as an augmented matrix.
2 1 1
[ ]
4 2 6
1
Obtain a 1 in row 1, column 1. This can be accomplished by multiplying the first row by .
2
⎡ 1 1 ⎤
1 1
R1 = R1 → ⎢ 2 2 ⎥
2
⎣ 4 2 6 ⎦
Next, we want a 0 in row 2, column 1. Multiply row 1 by −4 and add row 1 to row 2.
1 1
⎡ ⎤
1
−4 R1 + R2 = R2 → ⎢ 2 2 ⎥
⎣ ⎦
0 0 4
The second row represents the equation 0 = 4 . Therefore, the system is inconsistent and has no solution.
3x + 4y = 12
6x + 8y = 24
Solution
Perform row operations on the augmented matrix to try and achieve row-echelon form.
3 4 12
A =[ ]
6 8 24
6 8 24
R1 ↔ R2 = [ ]
0 0 0
The matrix ends up with all zeros in the last row: 0y = 0. Thus, there are an infinite number of solutions and the system is
classified as dependent. To find the generic solution, return to one of the original equations and solve for y .
3x + 4y = 12
4y = 12 − 3x
3
y =3− x
4
3
So the solution to this system is (x, 3 − x) .
4
Example 11.6.6: Performing Row Operations on a 3 × 3 Augmented Matrix to Obtain Row-Echelon Form
⎡ 1 −3 4 3 ⎤
⎢ 2 −5 6 6 ⎥
⎢ ⎥
⎣ −3 3 4 6 ⎦
Solution
The first row already has a 1 in row 1, column 1. The next step is to multiply row 1 by −2 and add it to row 2. Then replace
row 2 with the result.
⎡ 1 −3 4 3 ⎤
−2 R1 + R2 = R2 ⎢
⎢ 0 1 −2 0 ⎥
⎥
⎣ −3 3 4 6 ⎦
⎡ 1 −3 4 3 ⎤
3 R1 + R3 = R3 ⎢ 0 1 −2 0 ⎥
⎢ ⎥
⎣ 0 −6 16 15 ⎦
⎡ 1 −3 4 3 ⎤
6 R2 + R3 = R3 ⎢
⎢ 0 1 −2 0 ⎥
⎥
⎣ 0 0 4 15 ⎦
⎡ 1 −3 4 3 ⎤
1 ⎢ 0 1 −2 0 ⎥
R3 = R3 ⎢ ⎥
⎢ ⎥
3 ⎢ 21 ⎥
⎣ 0 0 1 ⎦
2
Exercise 11.6.4
−x + 3y = −4
2x − 5y + 5z = 17
Answer
5 5 17
⎡ ⎤
1 −
⎢ 2 2 2 ⎥
⎢ ⎥
⎢ ⎥
⎢ 0 1 5 9 ⎥
⎣ 0 0 1 2 ⎦
2x + 3y − z = −2
3x − 2y − 9z = 9
Solution
First, we write the augmented matrix.
⎡ 1 −1 1 8 ⎤
⎢ 2 3 −1 −2 ⎥
⎢ ⎥
⎣ 3 −2 −9 9 ⎦
⎡ 1 −1 1 8 ⎤
−2 R1 + R2 = R2 → ⎢
⎢ 0 5 −3 −18 ⎥
⎥
⎣ 3 −2 −9 9 ⎦
⎡ 1 −1 1 8 ⎤
−3 R1 + R3 = R3 → ⎢ 0 5 −3 −18 ⎥
⎢ ⎥
⎣ ⎦
0 1 −12 −15
⎡ 1 −1 1 8 ⎤
I nterchange R2 and R3 → ⎢
⎢ 0 1 −12 −15 ⎥
⎥
⎣ 0 5 −3 −18 ⎦
Then
⎡ 1 −1 1 8 ⎤
−5 R2 + R3 = R3 → ⎢ 0 1 −12 −15 ⎥
⎢ ⎥
⎣ 0 0 57 57 ⎦
⎡ 1 −1 1 8 ⎤
1
− R3 = R3 → ⎢ 0 1 −12 −15 ⎥
⎢ ⎥
57
⎣ 0 0 1 1 ⎦
y − 12z = −15
z =1
2x + 3y = 2
y − 2z = 0
Solution
Write the augmented matrix.
⎡ −1 −2 1 −1 ⎤
⎢ 2 3 0 2 ⎥
⎢ ⎥
⎣ 0 1 −2 0 ⎦
First, multiply row 1 by −1 to get a 1 in row 1, column 1. Then, perform row operations to obtain row-echelon form.
⎡ 1 2 −1 1 ⎤
−R1 → ⎢
⎢ 2 3 0 2 ⎥
⎥
⎣ 0 1 −2 0 ⎦
⎡ 1 2 −1 1 ⎤
R2 ↔ R3 → ⎢
⎢ 0 1 −2 0 ⎥
⎥
⎣ 2 3 0 2 ⎦
⎡ 1 2 −1 1 ⎤
−2 R1 + R3 = R3 → ⎢
⎢ 0 1 −2 0 ⎥
⎥
⎣ 0 −1 2 0 ⎦
⎡ 1 2 −1 1 ⎤
R2 + R3 = R3 → ⎢ 0 1 −2 0 ⎥
⎢ ⎥
⎣ 0 0 0 0 ⎦
y − 2z = 0
0 =0
We see by the identity 0 = 0 that this is a dependent system with an infinite number of solutions. We then find the generic
solution. By solving the second equation for y and substituting it into the first equation we can solve for z in terms of x.
x + 2y − z = 1
y = 2z
x + 2(2z) − z = 1
x + 3z = 1
1 −x
z =
3
Now we substitute the expression for z into the second equation to solve for y in terms of x.
1 −x
z =
3
1 −x
y −2 ( ) =0
3
2 − 2x
y =
3
2 − 2x 1 −x
The generic solution is (x, , .
)
3 3
Exercise 11.6.5
2x + 5y + 8z = 1
5x + 3y − 3z = 1
Answer
(1, 1, 1)
Yes, a system of linear equations of any size can be solved by Gaussian elimination.
How to: Given a system of equations, solve with matrices using a calculator
1. Save the augmented matrix as a matrix variable [A], [B], [C ], … .
2. Use the ref( function in the calculator, calling up each matrix variable as needed.
−2x + 3y − z = −2
−x − 4y + 5z = 1
Solution
Write the augmented matrix for the system of equations.
⎡ 5 3 9 −1 ⎤
⎢ −2 3 −1 −2 ⎥
⎢ ⎥
⎣ −1 −4 5 1 ⎦
On the matrix page of the calculator, enter the augmented matrix above as the matrix variable [A].
⎡ 5 3 9 −1 ⎤
[A] = ⎢
⎢ −2 3 −1 −2 ⎥
⎥
⎣ −1 −4 5 1 ⎦
Use the ref( function in the calculator, calling up the matrix variable [A].
ref([A])
Evaluate
61 92 24
Using back-substitution, the solution is ( ,− ,− ) .
187 187 187
Carolyn invests a total of $12, 000 in two municipal bonds, one paying 10.5 interest and the other paying 12 interest. The
annual interest earned on the two investments last year was $1, 335. How much was invested at each rate?
Solution
We have a system of two equations in two variables. Let x = the amount invested at 10.5 interest, and y = the amount
invested at 12 interest.
x + y = 12, 000
As a matrix, we have
1 1 12, 000
[ ]
0.105 0.12 1, 335
1 1 12, 000
[ ]
0 0.015 75
Then,
0.015y = 75
y = 5, 000
x + y + z = 10, 000
2x − z = 0
As a matrix, we have
⎡ 1 1 1 10, 000 ⎤
−0.05 R1 + R2 = R2 → ⎢
⎢ 0 0.03 0.04 270 ⎥
⎥
⎣ 2 0 −1 0 ⎦
⎡ 1 1 1 10, 000 ⎤
−2 R1 + R3 = R3 → ⎢
⎢ 0 0.03 0.04 270 ⎥
⎥
⎣ 0 −2 −3 −20, 000 ⎦
⎡ 1 1 1 10, 000 ⎤
1 ⎢ 4 ⎥
R2 = R2 → ⎢ 0 1 9, 000 ⎥
⎢ ⎥
0.03 ⎢ 3 ⎥
⎣ ⎦
0 −2 −3 −20, 000
⎡ 1 1 1 10, 000 ⎤
⎢ 4 ⎥
⎢ 0 1 9, 000 ⎥
2 R2 + R3 = R3 → ⎢ ⎥
3
⎢ ⎥
⎢ 1 ⎥
0 0 − −2, 000
⎣ ⎦
3
1
The third row tells us − z = −2, 000 ; thus z = 6, 000.
3
4
The second row tells us y + z = 9, 000 . Substituting z = 6, 000,we get
3
4
y+ (6, 000) = 9, 000
3
y + 8, 000 = 9, 000
y = 1, 000
The first row tells us x + y + z = 10, 000 . Substituting y = 1, 000 and z = 6, 000,we get
x + 1, 000 + 6, 000 = 10, 000
x = 3, 000
The answer is $3, 000 invested at 5 interest, $1, 000 invested at 8, and $6, 000 invested at 9 interest.
Exercise 11.6.6
A small shoe company took out a loan of $1, 500, 000 to expand their inventory. Part of the money was borrowed at 7, part
was borrowed at 8, and part was borrowed at 10. The amount borrowed at 10 was four times the amount borrowed at 7, and
the annual interest on all three loans was $130, 500. Use matrices to find the amount borrowed at each rate.
Answer
$150, 000 at 7, $750, 000at 8, $600, 000at 10
Media
Access these online resources for additional instruction and practice with solving systems of linear equations using Gaussian
elimination.
Solve a System of Two Equations Using an Augmented Matrix
Solve a System of Three Equations Using an Augmented Matrix
Key Concepts
An augmented matrix is one that contains the coefficients and constants of a system of equations. See Example 11.6.1.
A matrix augmented with the constant column can be represented as the original system of equations. See Example 11.6.2.
Row operations include multiplying a row by a constant, adding one row to another row, and interchanging rows.
We can use Gaussian elimination to solve a system of equations. See Example 11.6.3, Example 11.6.4, and Example 11.6.5.
Row operations are performed on matrices to obtain row-echelon form. See Example 11.6.6.
To solve a system of equations, write it in augmented matrix form. Perform row operations to obtain row-echelon form. Back-
substitute to find the solutions. See Example 11.6.7 and Example 11.6.8.
A calculator can be used to solve systems of equations using matrices. See Example 11.6.9.
Many real-world problems can be solved using augmented matrices. See Example 11.6.10 and Example 11.6.11.
This page titled 11.6: Solving Systems with Gaussian Elimination is shared under a CC BY 4.0 license and was authored, remixed, and/or curated
by OpenStax via source content that was edited to the style and standards of the LibreTexts platform; a detailed edit history is available upon
request.
11.6: Solving Systems with Gaussian Elimination is licensed CC BY 4.0. Original source: https://openstax.org/details/books/precalculus.