5.4: Solving Systems with Gaussian Elimination (2024)

  1. Last updated
  2. Save as PDF
  • Page ID
    64860
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}}}\) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    Learning Objectives
    • Write the augmented matrix of a system of equations.
    • Write the system of equations from an augmented matrix.
    • Perform row operations on a matrix.
    • Solve a system of linear equations using matrices.

    Carl Friedrich Gauss lived during the late \(18^{th}\) century and early \(19^{th}\) century, but he is still considered one of the most prolific 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.

    5.4: Solving Systems with Gaussian Elimination (2)

    We first encountered Gaussian elimination in Systems of Linear Equations: Two Variables. In this section, we will revisit this technique for solving systems, this time using matrices.

    Writing the Augmented Matrix of a System of Equations

    A matrix can serve as a device for representing and solving a system of equations. To express a system in matrix form, we extract the coefficients of the variables and the constants, and these become the entries of the matrix. We use a vertical line to separate the coefficient entries from the constants, essentially replacing the equal signs. When a system is written in this form, we call it an augmented matrix.

    For example, consider the following \(2 × 2\) system of equations.

    \[\begin{align*} 3x+4y&= 7\\ 4x-2y&= 5 \end{align*}\]

    We can write this system as an augmented matrix:

    \(\left[ \begin{array}{cc|c} 3&4&7\\4&-2&5\end{array} \right]\)

    We can also write a matrix containing just the coefficients. This is called the coefficient matrix.

    \(\begin{bmatrix}3&4\\4&−2\end{bmatrix}\)

    A three-by-three system of equations such as

    \[\begin{align*} 3x-y-z&= 0\\ x+y&= 5\\ 2x-3z&= 2 \end{align*}\]

    has a coefficient matrix

    \(\begin{bmatrix}3&−1&−1\\1&1&0\\2&0&−3\end{bmatrix}\)

    and is represented by the augmented matrix

    \(\left[ \begin{array}{ccc|c}3&−1&−1&0\\1&1&0&5\\2&0&−3&2\end{array} \right]\)

    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\).

    How to: Given a system of equations, write an augmented matrix
    1. Write the coefficients of the \(x\)-terms as the numbers down the first column.
    2. Write the coefficients of the \(y\)-terms as the numbers down the second column.
    3. If there are \(z\)-terms, write the coefficients as the numbers down the third column.
    4. Draw a vertical line and write the constants to the right of the line.
    Example \(\PageIndex{1}\): Writing the Augmented Matrix for a System of Equations

    Write the augmented matrix for the given system of equations.

    \[\begin{align*} x+2y-z&= 3\\ 2x-y+2z&= 6\\ x-3y+3z&= 4 \end{align*}\]

    Solution

    The augmented matrix displays the coefficients of the variables, and an additional column for the constants.

    \(\left[ \begin{array}{ccc|c}1&2&−1&3\\2&−1&2&6\\1&−3&3&4\end{array} \right]\)

    Exercise \(\PageIndex{1}\)

    Write the augmented matrix of the given system of equations.

    \[\begin{align*} 4x-3y&= 11\\ 3x+2y&= 4 \end{align*}\]

    Answer

    \(\left[ \begin{array}{cc|c} 4&−3&11\\3&2&4\end{array} \right]\)

    Writing a System of Equations from an Augmented Matrix

    We can use augmented matrices to help us solve systems of equations because they simplify operations when the systems are not encumbered by the variables. However, it is important to understand how to move back and forth between formats in order to make finding solutions smoother and more intuitive. Here, we will use the information in an augmented matrix to write the system of equations in standard form.

    Example \(\PageIndex{2}\): Writing a System of Equations from an Augmented Matrix Form

    Find the system of equations from the augmented matrix.

    \(\left[ \begin{array}{ccc|c}1&−3&−5&-2\\2&−5&−4&5\\−3&5&4&6 \end{array} \right]\)

    Solution

    When the columns represent the variables \(x\), \(y\), and \(z\),

    \[\left[ \begin{array}{ccc|c}1&-3&-5&-2\\2&-5&-4&5\\-3&5&4&6 \end{array} \right] \rightarrow \begin{align*} x-3y-5z&= -2\\ 2x-5y-4z&= 5\\ -3x+5y+4z&= 6 \end{align*}\]

    Exercise \(\PageIndex{2}\)

    Write the system of equations from the augmented matrix.

    \(\left[ \begin{array}{ccc|c}1&−1& 1&5\\2&−1&3&1\\0&1&1&-9\end{array}\right]\)

    Answer

    \(\begin{align*} x-y+z&= 5\\ 2x-y+3z&= 1\\ y+z&= -9 \end{align*}\)

    Performing Row Operations on a Matrix

    Now that we can write systems of equations in augmented matrix form, we will examine the various row operations that can be performed on a matrix, such as addition, multiplication by a constant, and interchanging rows.

    Performing row operations on a matrix is the method we use for solving a system of equations. In order to solve the system of equations, we want to convert the matrix to row-echelon form, in which there are ones down the main diagonal from the upper left corner to the lower right corner, and zeros in every position below the main diagonal as shown.

    Row-echelon form \(\begin{bmatrix}1&a&b\\0&1&d\\0&0&1\end{bmatrix}\)

    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_i ↔ R_j\))
    2. Multiply a row by a constant. (Notation: \(cR_i\))
    3. Add the product of a row multiplied by a constant to another row. (Notation: \(R_i+cR_j\))

    Each of the row operations corresponds to the operations we have already learned to solve systems of equations in three variables. With these operations, there are some key moves that will quickly achieve the goal of writing a matrix in row-echelon form. To obtain a matrix in row-echelon form for finding solutions, we use Gaussian elimination, a method that uses row operations to obtain a \(1\) as the first entry so that row \(1\) can be used to convert the remaining rows.

    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.

    \(A=\begin{bmatrix}a_{11}&a_{12}&a_{13}\\a_{21}&a_{22}&a_{23}\\a_{31}&a_{32}&a_{33}\end{bmatrix}\xrightarrow{After\space Gaussian\space elimination} A=\begin{bmatrix}1&b_{12}& b_{13}\\0&1&b_{23}\\0&0&1\end{bmatrix}\)

    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.
    Example \(\PageIndex{3}\): Solving a \(2×2\) System by Gaussian Elimination

    Solve the given system by Gaussian elimination.

    \[\begin{align*} 2x+3y&= 6\\ x-y&= \dfrac{1}{2} \end{align*}\]

    Solution

    First, we write this as an augmented matrix.

    \(\left[ \begin{array}{cc|c} 2&3&6\\1&−1&12\end{array} \right]\)

    We want a \(1\) in row 1, column 1. This can be accomplished by interchanging row 1 and row 2.

    \(R_1\leftrightarrow R_2\rightarrow \left[ \begin{array}{cc|c} 1&−1&12\\2&3&6\end{array} \right]\)

    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.

    \(-2R_1+R_2=R_2\rightarrow \left[ \begin{array}{cc|c} 1&−1&12\\0&5&5\end{array} \right]\)

    We only have one more step, to multiply row 2 by \(\dfrac{1}{5}\).

    \(\dfrac{1}{5}R_2=R_2\rightarrow \left[ \begin{array}{cc|c} 1&−1&12\\0&1&1\end{array} \right]\)

    Use back-substitution. The second row of the matrix represents \(y=1\). Back-substitute \(y=1\) into the first equation.

    \[\begin{align*} x-(1)&= \dfrac{1}{2}\\ x&= \dfrac{3}{2} \end{align*}\]

    The solution is the point \(\left(\dfrac{3}{2},1\right)\).

    Exercise \(\PageIndex{3}\)

    Solve the given system by Gaussian elimination.

    \[\begin{align*} 4x+3y&= 11\\ x-3y&= -1 \end{align*}\]

    Answer

    \((2, 1)\)

    Example \(\PageIndex{4}\): Using Gaussian Elimination to Solve a System of Equations

    Use Gaussian elimination to solve the given \(2 × 2\) system of equations.

    \[\begin{align*} 2x+y&= 1\\ 4x+2y&= 6 \end{align*}\]

    Solution

    Write the system as an augmented matrix.

    \(\left[ \begin{array}{cc|c} 2&1&1\\4&2&6\end{array} \right]\)

    Obtain a \(1\) in row 1, column 1. This can be accomplished by multiplying the first row by \(\dfrac{1}{2}\).

    \(\dfrac{1}{2} R_1=R_1\rightarrow \left[ \begin{array}{cc|c} 1&\dfrac{1}{2}&\dfrac{1}{2}\\4&2&6\end{array} \right]\)

    Next, we want a \(0\) in row 2, column 1. Multiply row 1 by \(−4\) and add row 1 to row 2.

    \(-4R_1+R_2=R_2\rightarrow \left[ \begin{array}{cc|c} 1&\dfrac{1}{2}&\dfrac{1}{2}\\0&0&4\end{array} \right]\)

    The second row represents the equation \(0=4\). Therefore, the system is inconsistent and has no solution.

    Example \(\PageIndex{5}\): Solving a Dependent System

    Solve the system of equations.

    \[\begin{align*} 3x+4y&= 12\\ 6x+8y&= 24 \end{align*}\]

    Solution

    Perform row operations on the augmented matrix to try and achieve row-echelon form.

    \(A=\left[ \begin{array}{cc|c} 3&4&12\\6&8&24\end{array} \right]\)

    \(-\dfrac{1}{2}R_2+R_1=R_1\rightarrow \left[ \begin{array}{cc|c} 0&0&0\\6&8&24\end{array} \right]\)

    \(R_1\leftrightarrow R_2=\left[ \begin{array}{cc|c} 6&8&24\\0&0&0\end{array} \right]\)

    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\).

    \[\begin{align*} 3x+4y&= 12\\ 4y&= 12-3x\\ y&= 3-\dfrac{3}{4}x \end{align*}\]

    So the solution to this system is \(\left(x,3−\dfrac{3}{4}x\right)\).

    Example \(\PageIndex{6}\): Performing Row Operations on a \(3×3\) Augmented Matrix to Obtain Row-Echelon Form

    Perform row operations on the given matrix to obtain row-echelon form.

    \(\left[ \begin{array}{ccc|c} 1&-3&4&3\\2&-5&6&6\\-3&3&4&6\end{array} \right]\)

    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.

    \(-2R_1+R_2=R_2 \left[ \begin{array}{ccc|c} 1&-3&4&3\\0&1&-2&0\\-3&3&4&6\end{array} \right]\)

    Next, obtain a zero in row 3, column 1.

    \(3R_1+R_3=R_3 \left[ \begin{array}{ccc|c} 1&-3&4&3\\0&1&-2&0\\0&-6&16&15\end{array} \right]\)

    Next, obtain a zero in row 3, column 2.

    \(6R_2+R_3=R_3 \left[ \begin{array}{ccc|c} 1&-3&4&3\\0&1&-2&0\\0&0&4&15\end{array} \right]\)

    The last step is to obtain a 1 in row 3, column 3.

    \(\dfrac{1}{3}R_3=R_3 \left[ \begin{array}{ccc|c} 1&-3&4&3\\0&1&-2&0\\0&0&1&\dfrac{21}{2}\end{array} \right]\)

    Exercise \(\PageIndex{4}\)

    Write the system of equations in row-echelon form.

    \[\begin{align*} x−2y+3z &= 9 \\ −x+3y &= −4 \\ 2x−5y+5z &= 17 \end{align*}\]

    Answer

    \(\left[ \begin{array}{ccc|c} 1&-\dfrac{5}{2}&\dfrac{5}{2}&\dfrac{17}{2}\\0&1&5&9\\0&0&1&2\end{array} \right]\)

    Solving a System of Linear Equations Using Matrices

    We have seen how to write a system of equations with an augmented matrix, and then how to use row operations and back-substitution to obtain row-echelon form. Now, we will take row-echelon form a step farther to solve a \(3\) by \(3\) system of linear equations. The general idea is to eliminate all but one variable using row operations and then back-substitute to solve for the other variables.

    Example \(\PageIndex{7}\): Solving a System of Linear Equations Using Matrices

    Solve the system of linear equations using matrices.

    \[\begin{align*} x-y+z&= 8\\ 2x+3y-z&= -2\\ 3x-2y-9z&= 9 \end{align*}\]

    Solution

    First, we write the augmented matrix.

    \(\left[ \begin{array}{ccc|c} 1&-1&1&8\\2&3&-1&-2\\3&-2&-9&9\end{array} \right]\)

    Next, we perform row operations to obtain row-echelon form.

    \(−2R_1+R_2=R_2\rightarrow \left[ \begin{array}{ccc|c} 1&-1&1&8\\0&5&-3&-18\\3&-2&-9&9\end{array} \right]\)

    \(−3R_1+R_3=R_3\rightarrow \left[ \begin{array}{ccc|c} 1&-1&1&8\\0&5&-3&-18\\0&1&-12&-15\end{array} \right]\)

    The easiest way to obtain a \(1\) in row 2 of column 1 is to interchange \(R_2\) and \(R_3\).

    \(Interchange\space R_2\space and\space R_3\rightarrow\left[ \begin{array}{ccc|c} 1&-1&1&8\\0&1&-12&-15\\0&5&-3&-18\end{array} \right]\)

    Then

    \(−5R_2+R_3=R_3\rightarrow\left[ \begin{array}{ccc|c} 1&-1&1&8\\0&1&-12&-15\\0&0&57&57\end{array} \right]\)

    \(−\dfrac{1}{57}R_3=R_3\rightarrow\left[ \begin{array}{ccc|c} 1&-1&1&8\\0&1&-12&-15\\0&0&1&1\end{array} \right]\)

    The last matrix represents the equivalent system.

    \[\begin{align*} x−y+z &= 8 \\ y−12z &= −15 \\ z &= 1 \end{align*}\]

    Using back-substitution, we obtain the solution as \((4,−3,1)\).

    Example \(\PageIndex{8}\): Solving a Dependent System of Linear Equations Using Matrices

    Solve the following system of linear equations using matrices.

    \[\begin{align*} −x−2y+z &= −1 \\ 2x+3y &= 2 \\ y−2z &= 0 \end{align*}\]

    Solution

    Write the augmented matrix.

    \(\left[ \begin{array}{ccc|c} -1&-2&1&-1\\2&3&0&2\\0&1&-2&0\end{array} \right]\)

    First, multiply row 1 by \(−1\) to get a \(1\) in row 1, column 1. Then, perform row operations to obtain row-echelon form.

    \(-R_1\rightarrow \left[ \begin{array}{ccc|c} 1&2&-1&1\\2&3&0&2\\0&1&-2&0\end{array} \right]\)

    \(R_2\leftrightarrow R_3\rightarrow \left[ \begin{array}{ccc|c} 1&2&-1&1\\0&1&-2&0\\2&3&0&2\end{array} \right]\)

    \(−2R_1+R_3=R_3\rightarrow \left[ \begin{array}{ccc|c} 1&2&-1&1\\0&1&-2&0\\0&-1&2&0\end{array} \right]\)

    \(R_2+R_3=R_3\rightarrow \left[ \begin{array}{ccc|c} 1&2&-1&1\\0&1&-2&0\\0&0&0&0\end{array} \right]\)

    The last matrix represents the following system.

    \[\begin{align*} x+2y−z &= 1 \\ y−2z &= 0 \\ 0 &= 0 \end{align*}\]

    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\).

    \[\begin{align*} x+2y−z &= 1 \\ y &= 2z \\ x+2(2z)−z &= 1 \\ x+3z &= 1 \\ z &=\dfrac{1−x}{3} \end{align*}\]

    Now we substitute the expression for \(z\) into the second equation to solve for \(y\) in terms of \(x\).

    \[\begin{align*} y−2z &= 0 \\ z &= \dfrac{1−x}{3} \\ y−2\left(\dfrac{1−x}{3}\right) &= 0 \\ y &= \dfrac{2−2x}{3} \end{align*}\]

    The generic solution is \(\left(x,\dfrac{2−2x}{3},\dfrac{1−x}{3}\right)\).

    Exercise \(\PageIndex{5}\)

    Solve the system using matrices.

    \[\begin{align*} x+4y-z&= 4\\ 2x+5y+8z&= 1\\ 5x+3y-3z&= 1 \end{align*}\]

    Answer

    \((1,1,1)\)

    Q&A: Can any system of linear equations be solved by Gaussian elimination?

    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.
    Example \(\PageIndex{9A}\): Solving Systems of Equations with Matrices Using a Calculator

    Solve the system of equations.

    \[\begin{align*} 5x+3y+9z&= -1\\ -2x+3y-z&= -2\\ -x-4y+5z&= 1 \end{align*}\]

    Solution

    Write the augmented matrix for the system of equations.

    \(\left[ \begin{array}{ccc|c} 5&3&9&-1\\-2&3&-1&-2\\-1&-4&5&1\end{array} \right]\)

    On the matrix page of the calculator, enter the augmented matrix above as the matrix variable \([A]\).

    \([A]=\left[ \begin{array}{ccc|c} 5&3&9&-1\\-2&3&-1&-2\\-1&-4&5&1\end{array} \right]\)

    Use the ref( function in the calculator, calling up the matrix variable \([A]\).

    ref([A])

    Evaluate

    \[\begin{array}{cc} {\left[ \begin{array}{ccc|c} 1&\dfrac{3}{5}&\dfrac{9}{5}&\dfrac{1}{5}\\0&1&\dfrac{13}{21}&-\dfrac{4}{7}\\0&0&1&-\dfrac{24}{187}\end{array} \right] \rightarrow} & {\begin{align*} x+\dfrac{3}{5}y+\dfrac{9}{5}z &= -\dfrac{1}{5} \\ y+\dfrac{13}{21}z &= -\dfrac{4}{7} \\ z &= -\dfrac{24}{187} \end{align*}} \end{array}\]

    Using back-substitution, the solution is \(\left(\dfrac{61}{187},−\dfrac{92}{187},−\dfrac{24}{187}\right)\).

    Example \(\PageIndex{9B}\): Applying \(2×2\) Matrices to Finance

    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.

    \[\begin{align*} x+y&= 12,000\\ 0.105x+0.12y&= 1,335 \end{align*}\]

    As a matrix, we have

    \(\left[ \begin{array}{cc|c} 1&1&12,000\\0.105&0.12&1,335\end{array} \right]\)

    Multiply row 1 by \(−0.105\) and add the result to row 2.

    \(\left[ \begin{array}{cc|c} 1&1&12,000\\0&0.015&75\end{array} \right]\)

    Then,

    \[\begin{align*} 0.015y &= 75 \\ y &= 5,000 \end{align*}\]

    So \(12,000−5,000=7,000\).

    Thus, \($5,000\) was invested at \(12%\) interest and \($7,000\) at \(10.5%\) interest.

    Example \(\PageIndex{10}\): Applying \(3×3\) Matrices to Finance

    Ava invests a total of \($10,000\) in three accounts, one paying \(5%\) interest, another paying \(8%\) interest, and the third paying \(9%\) interest. The annual interest earned on the three investments last year was \($770\). The amount invested at \(9%\) was twice the amount invested at \(5%\). How much was invested at each rate?

    Solution

    We have a system of three equations in three variables. Let \(x\) be the amount invested at \(5%\) interest, let \(y\) be the amount invested at \(8%\) interest, and let \(z\) be the amount invested at \(9%\) interest. Thus,

    \[\begin{align*} x+y+z &= 10,000 \\ 0.05x+0.08y+0.09z &= 770 \\ 2x−z &= 0 \end{align*}\]

    As a matrix, we have

    \(\left[ \begin{array}{ccc|c} 1&1&1&10,000\\0.05&0.08&0.09&770\\2&0&-1&0\end{array} \right]\)

    Now, we perform Gaussian elimination to achieve row-echelon form.

    \(−0.05R_1+R_2=R_2\rightarrow \left[ \begin{array}{ccc|c} 1&1&1&10,000\\0&0.03&0.04&270\\2&0&-1&0\end{array} \right]\)

    \(−2R_1+R_3=R_3\rightarrow \left[ \begin{array}{ccc|c} 1&1&1&10,000\\0&0.03&0.04&270\\0&-2&-3&-20,000\end{array} \right]\)

    \(\dfrac{1}{0.03}R_2=R_2\rightarrow \left[ \begin{array}{ccc|c} 1&1&1&10,000\\0&1&\dfrac{4}{3}&9,000\\0&-2&-3&-20,000\end{array} \right]\)

    \(2R_2+R_3=R_3\rightarrow \left[ \begin{array}{ccc|c} 1&1&1&10,000\\0&1&\dfrac{4}{3}&9,000\\0&0&-\dfrac{1}{3}&-2,000\end{array} \right]\)

    The third row tells us \(−\dfrac{1}{3}z=−2,000\); thus \(z=6,000\).

    The second row tells us \(y+\dfrac{4}{3}z=9,000\). Substituting \(z=6,000\),we get

    \[\begin{align*} y+\dfrac{4}{3}(6,000) &= 9,000 \\ y+8,000 &= 9,000 \\ y &= 1,000 \end{align*}\]

    The first row tells us \(x+y+z=10,000\). Substituting \(y=1,000\) and \(z=6,000\),we get

    \[\begin{align*} x+1,000+6,000 &= 10,000 \\ x &= 3,000 \end{align*}\]

    The answer is \($3,000\) invested at \(5%\) interest, \($1,000\) invested at \(8%\), and \($6,000\) invested at \(9%\) interest.

    Exercise \(\PageIndex{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,000\) at \(8%\), \($600,000\) at \(10%\)

    Media

    Access these online resources for additional instruction and practice with solving systems of linear equations using Gaussian elimination.

    Key Concepts

    • An augmented matrix is one that contains the coefficients and constants of a system of equations. See Example \(\PageIndex{1}\).
    • A matrix augmented with the constant column can be represented as the original system of equations. See Example \(\PageIndex{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 \(\PageIndex{3}\), Example \(\PageIndex{4}\), and Example \(\PageIndex{5}\).
    • Row operations are performed on matrices to obtain row-echelon form. See Example \(\PageIndex{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 \(\PageIndex{7}\) and Example \(\PageIndex{8}\).
    • A calculator can be used to solve systems of equations using matrices. See Example \(\PageIndex{9}\).
    • Many real-world problems can be solved using augmented matrices. See Example \(\PageIndex{10}\) and Example \(\PageIndex{11}\).
    5.4: Solving Systems with Gaussian Elimination (2024)

    FAQs

    How to solve system of equations using Gaussian elimination method? ›

    Example: Solving a 2 X 2 System by Gaussian Elimination

    This can be accomplished by interchanging row 1 and row 2. 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 − 2 and then adding the result to row 2.

    Does Gaussian elimination always work? ›

    Yes, Gaussian elimination always works for solving systems of linear equations, given that the system has a unique solution. However, if the system has no solution or an infinite number of solutions, Gaussian elimination will not provide a unique solution.

    When could the Gaussian elimination fail? ›

    Gaussian elimination, as described above, fails if any of the pivots is zero, it is worse yet if any pivot becomes close to zero. In this case, the method can be carried to completion, but the obtained results may be totally wrong. A = ( 0.0001 1 1 1 ) , using three decimal digit floating point arithmetic.

    What is the total number of calculations needed to perform the elimination step in Gaussian elimination? ›

    In Subsection 1.3. 3, we saw that the number of arithmetic operations needed to perform Gaussian elimination on an n×n matrix is about 23n3. This means that a 1000×1000 matrix, requires about two thirds of a billion operations. Suppose that we have two equations, Ax=b1 and Ax=b2, that we would like to solve.

    What are the rules for Gaussian elimination? ›

    Permitted actions There are only two actions you can do in standard Gaussian elimination: they are: • swap two rows; • add (or subtract) a multiple of one row to a row below it. We apply them to every element in a row including the “row-sum” number at the end.

    What is the Gaussian elimination strategy? ›

    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.

    How important is Gaussian elimination? ›

    Gaussian elimination provides a relatively efficient way of constructing the inverse to a matrix. 2. Exactly the same results hold with any number of variables and equations. Gaussian elimination is practical, under most circ*mstances, for finding the inverse to matrices involving thousands of equations and variables.

    Is Gaussian elimination optimal? ›

    Gaussian elimination is not optimal.

    Is Gaussian elimination slow? ›

    Gaussian elimination is a relatively slow algorithm. Developing a flop count will tell how much work is actually involved in computing L and U. We will count first for i = 1, then i = 2, and so forth until i = n − 1 and form the sum of the counts.

    Does order matter in Gaussian elimination? ›

    Gaussian elimination with back-substitution works well as an algorithmic method for solving systems of linear equations. For this algorithm, the order in which the elementary row operations are performed is important. Move from left to right by columns, changing all entries directly below the leading 1's to zeros.

    What is the real life application of Gaussian elimination? ›

    It involves using elementary row operations to transform a system of equations into an equivalent system that is easier to solve. In real life applications, Gaussian Elimination is used in fields such as engineering, physics, and economics to solve complex systems of equations.

    Is Gaussian elimination the same as row-echelon form? ›

    Using row operations to convert a matrix into reduced row echelon form is sometimes called Gauss–Jordan elimination. In this case, the term Gaussian elimination refers to the process until it has reached its upper triangular, or (unreduced) row echelon form.

    Can you swap rows in Gaussian elimination? ›

    Thus you can interchange the row in the trial position with a row below it under certain circ*mstances (i) if the element in the trial position and an element below it in the same column are both non-zero, you can interchange those rows if you wish (ii) if the element in the trial position is 0 and there is some non- ...

    Who invented Gaussian elimination? ›

    Carl Friedrich Gauss championed the use of row reduction, to the extent that it is commonly called Gaussian elimination. It was further popularized by Wilhelm Jordan, who attached his name to the process by which row reduction is used to compute matrix inverses, Gauss-Jordan elimination.

    What is Gaussian elimination with back substitution? ›

    Gaussian Elimination with back-substitution is an algorithm for solving systems of linear equations using matrices and row-echelon form. The order in which the elementary row operations are performed is important.

    What is the difference between Gauss elimination and Gauss Seidel method? ›

    Gauss elimination is a direct method, Gauss-Seidel is an iterative. Both can be applied to sparse matrices, so it's not necessary to store 0 values in the matrix with Gauss elimination either. It again suggests that the quoted sentence would need more context.

    References

    Top Articles
    Latest Posts
    Article information

    Author: Aracelis Kilback

    Last Updated:

    Views: 5636

    Rating: 4.3 / 5 (44 voted)

    Reviews: 83% of readers found this page helpful

    Author information

    Name: Aracelis Kilback

    Birthday: 1994-11-22

    Address: Apt. 895 30151 Green Plain, Lake Mariela, RI 98141

    Phone: +5992291857476

    Job: Legal Officer

    Hobby: LARPing, role-playing games, Slacklining, Reading, Inline skating, Brazilian jiu-jitsu, Dance

    Introduction: My name is Aracelis Kilback, I am a nice, gentle, agreeable, joyous, attractive, combative, gifted person who loves writing and wants to share my knowledge and understanding with you.