# Inverse of a Matrix using Gauss-Jordan Elimination

by M. Bourne

In this section we see how Gauss-Jordan Elimination works using examples.

You can re-load this page as many times as you like and get a new set of numbers each time. You can also choose a different size matrix (at the bottom of the page).

(If you need some background first, go back to the Introduction to Matrices).

Choose the matrix size you are interested in and then click the button.

Matrix A:

The randomly-generated example appears below.

### Phone users

**NOTE:** If you're on a phone, you can scroll any **wide matrices** on this page to the right or left to see the whole expression.

## Example (3 × 3)

Find the inverse of the matrix *A* using Gauss-Jordan elimination.

A = |
5 | 8 | 7 | ||

3 | 6 | 9 | |||

10 | 11 | 4 |

### Our Procedure

We write matrix *A* on the left and the Identity matrix *I* on its right separated with a dotted line, as follows.
The result is called an **augmented** matrix.

We include row numbers to make it clearer.

5 | 8 | 7 | |

3 | 6 | 9 | |

10 | 11 | 4 |

1 | 0 | 0 | Row[1] | |

0 | 1 | 0 | Row[2] | |

0 | 0 | 1 | Row[3] |

Next we do several **row operations** on the 2 matrices and our aim is to end up with the identity matrix on the **left**, like this:

1 | 0 | 0 | |

0 | 1 | 0 | |

0 | 0 | 1 |

? | ? | ? | Row[1] | |

? | ? | ? | Row[2] | |

? | ? | ? | Row[3] |

(Technically, we are reducing matrix *A* to **reduced row echelon form**, also called **row canonical form**).

The resulting matrix on the right will be the **inverse matrix** of *A*.

Our row operations procedure is as follows:

- We get a "1" in the top left corner by dividing the first row
- Then we get "0" in the rest of the first column
- Then we need to get "1" in the second row, second column
- Then we make all the other entries in the second column "0".

We keep going like this until we are left with the identity matrix on the left.

Let's now go ahead and find the inverse.

### Solution

We start with:

5 | 8 | 7 | |

3 | 6 | 9 | |

10 | 11 | 4 |

1 | 0 | 0 | Row[1] | |

0 | 1 | 0 | Row[2] | |

0 | 0 | 1 | Row[3] |

### New Row [1]

**Divide Row [1] by 5** (to give us a "1" in the desired position):

This gives us:

1 | 1.6 | 1.4 | |

3 | 6 | 9 | |

10 | 11 | 4 |

0.2 | 0 | 0 | Row[1] | |

0 | 1 | 0 | Row[2] | |

0 | 0 | 1 | Row[3] |

### New Row [2]

**Row[2] − 3 × Row[1]** (to give us 0 in the desired position):

3 − 3 × 1 = 0

6 − 3 × 1.6 = 1.2

9 − 3 × 1.4 = 4.8

0 − 3 × 0.2 = -0.6

1 − 3 × 0 = 1

0 − 3 × 0 = 0

This gives us our new Row [2]:

1 | 1.6 | 1.4 | |

0 | 1.2 | 4.8 | |

10 | 11 | 4 |

0.2 | 0 | 0 | Row[1] | |

-0.6 | 1 | 0 | Row[2] | |

0 | 0 | 1 | Row[3] |

### New Row [3]

**Row[3] − 10 × Row[1]** (to give us 0 in the desired position):

10 − 10 × 1 = 0

11 − 10 × 1.6 = -5

4 − 10 × 1.4 = -10

0 − 10 × 0.2 = -2

0 − 10 × 0 = 0

1 − 10 × 0 = 1

This gives us our new Row [3]:

1 | 1.6 | 1.4 | |

0 | 1.2 | 4.8 | |

0 | -5 | -10 |

0.2 | 0 | 0 | Row[1] | |

-0.6 | 1 | 0 | Row[2] | |

-2 | 0 | 1 | Row[3] |

### New Row [2]

**Divide Row [2] by 1.2** (to give us a "1" in the desired position):

This gives us:

1 | 1.6 | 1.4 | |

0 | 1 | 4 | |

0 | -5 | -10 |

0.2 | 0 | 0 | Row[1] | |

-0.5 | 0.8333 | 0 | Row[2] | |

-2 | 0 | 1 | Row[3] |

### New Row [1]

**Row[1] − 1.6 × Row[2]** (to give us 0 in the desired position):

1 − 1.6 × 0 = 1

1.6 − 1.6 × 1 = 0

1.4 − 1.6 × 4 = -5

0.2 − 1.6 × -0.5 = 1

0 − 1.6 × 0.8333 = -1.3333

0 − 1.6 × 0 = 0

This gives us our new Row [1]:

1 | 0 | -5 | |

0 | 1 | 4 | |

0 | -5 | -10 |

1 | -1.3333 | 0 | Row[1] | |

-0.5 | 0.8333 | 0 | Row[2] | |

-2 | 0 | 1 | Row[3] |

### New Row [3]

**Row[3] − -5 × Row[2]** (to give us 0 in the desired position):

0 − -5 × 0 = 0

-5 − -5 × 1 = 0

-10 − -5 × 4 = 10

-2 − -5 × -0.5 = -4.5

0 − -5 × 0.8333 = 4.1667

1 − -5 × 0 = 1

This gives us our new Row [3]:

1 | 0 | -5 | |

0 | 1 | 4 | |

0 | 0 | 10 |

1 | -1.3333 | 0 | Row[1] | |

-0.5 | 0.8333 | 0 | Row[2] | |

-4.5 | 4.1667 | 1 | Row[3] |

### New Row [3]

**Divide Row [3] by 10** (to give us a "1" in the desired position):

This gives us:

1 | 0 | -5 | |

0 | 1 | 4 | |

0 | 0 | 1 |

1 | -1.3333 | 0 | Row[1] | |

-0.5 | 0.8333 | 0 | Row[2] | |

-0.45 | 0.4167 | 0.1 | Row[3] |

### New Row [1]

**Row[1] − -5 × Row[3]** (to give us 0 in the desired position):

1 − -5 × 0 = 1

0 − -5 × 0 = 0

-5 − -5 × 1 = 0

1 − -5 × -0.45 = -1.25

-1.3333 − -5 × 0.4167 = 0.75

0 − -5 × 0.1 = 0.5

This gives us our new Row [1]:

1 | 0 | 0 | |

0 | 1 | 4 | |

0 | 0 | 1 |

-1.25 | 0.75 | 0.5 | Row[1] | |

-0.5 | 0.8333 | 0 | Row[2] | |

-0.45 | 0.4167 | 0.1 | Row[3] |

### New Row [2]

**Row[2] − 4 × Row[3]** (to give us 0 in the desired position):

0 − 4 × 0 = 0

1 − 4 × 0 = 1

4 − 4 × 1 = 0

-0.5 − 4 × -0.45 = 1.3

0.8333 − 4 × 0.4167 = -0.8333

0 − 4 × 0.1 = -0.4

This gives us our new Row [2]:

1 | 0 | 0 | |

0 | 1 | 0 | |

0 | 0 | 1 |

-1.25 | 0.75 | 0.5 | Row[1] | |

1.3 | -0.8333 | -0.4 | Row[2] | |

-0.45 | 0.4167 | 0.1 | Row[3] |

We have achieved our goal of producing the Identity matrix on the left. So we can conclude the inverse of the matrix *A* is the right hand portion of the augmented matrix:

A^{−1} = |
-1.25 | 0.75 | 0.5 | ||

1.3 | -0.8333 | -0.4 | |||

-0.45 | 0.4167 | 0.1 |

### Things to Note

- The above explanation shows all steps. A human can usually take a few shortcuts. Also, sometimes there is already a "1" or a "0" in the correct position, and in those cases, we would not need to do anything for that step.
- Always write down what you are doing in each step - it is very easy to get lost!
- I have shown results correct to 4 decimal place, but
**best possible accuracy**was used throughout. Be aware that small errors from rounding will accumulate throughout the problem. Always use full calculator accuracy! (Make full use of your calculator's memory.) - Very occasionally there are strange results because of the computer's internal representation of numbers. That is, it may store "1" as 0.999999999872.

### See another?

You can go back up to the top of the page and choose another example.