Gaussian Elimination

From Conservapedia
Jump to: navigation, search

Gaussian Elimination, also called Gauss-Jordan elimination, is a simple method for solving a system of simultaneous linear equations by expressing them in matrix form and then subtracting rows from each other sequentially in order to create all ones on the main diagonal and all zeros below the diagonal, thereby facilitating identification of solutions or range of solutions.

The three types of elementary row operations used are:

  • swap rows
  • multiple a row by a constant
  • add or subtract rows from each other


Here, we work a simple example. Consider the two equations:


We represent this collection of equations in matrix form as:


Now, the technique of Gaussian elimination allows us to add and subtract rows from each other, as well as multiples of rows. The idea is to achieve 1s in the main diagonal, and 0s elsewhere. This will become clear as we work the example.

Since the row is a multiple of the second row ( ), we can add this row to the first row:

As you can see, we have already begun altering the matrix so that there will be 0s off of the main diagonal. In our next step, we will divide the top row by 7 and multiply the bottom row by 2 to put 1s in the main diagonal:

Finally, we subtract twice the top row from the bottom to put a zero off the main diagonal in the bottom:

This should yield a solution to the original equation: . To check, we insert these values into the original equations:

as expected.