3 The inverse of a 3 × 3 matrix - Gauss elimination method

It is true, in general, that if the determinant of a matrix is zero then that matrix has no inverse. If the determinant is non-zero then the matrix has a (unique) inverse. In this Section and the next we look at two ways of finding the inverse of a 3 × 3 matrix; larger matrices can be inverted by the same methods - the process is more tedious and takes longer. The 2 × 2 case could be handled similarly but as we have seen we have a simple formula to use.

The method we now describe for finding the inverse of a matrix has many similarities to a technique used to obtain solutions of simultaneous equations. This method involves operating on the rows of a matrix in order to reduce it to a unit matrix.

The row operations we shall use are

  1. interchanging two rows
  2. multiplying a row by a constant factor
  3. adding a multiple of one row to another.

Note that in (ii) and (iii) the multiple could be negative or fractional, or both.

The Gauss elimination method is outlined in the following Key Point:

Key Point 9

Matrix Inverse Gauss Elimination Method

We use the result, quoted without proof, that:

if a sequence of row operations applied to a square matrix A reduces it to the identity matrix I of the same size then the same sequence of operations applied to I reduces it to A 1 .

Three points to note:

  • If it is impossible to reduce A to I then A 1 does not exist. This will become evident by the appearance of a row of zeros.
  • There is no unique procedure for reducing A to I and it is experience which leads to selection of the optimum route.
  • It is more efficient to do the two reductions, A to I and I to A 1 , simultaneously.

Suppose we wish to find the inverse of the matrix

A = 1 3 3 1 4 3 2 7 7

We first place A and I adjacent to each other.

1 3 3 1 4 3 2 7 7 1 0 0 0 1 0 0 0 1

Phase 1

We now proceed by changing the columns of A left to right to reduce A to the form 1 0 1 0 0 1 where can be any number. This form is called upper triangular .

First we subtract row 1 from row 2 and twice row 1 from row 3. ‘Row’ refers to both matrices.

1 3 3 1 4 3 2 7 7 1 0 0 0 1 0 0 0 1 R 2 R 1 R 3 2 R 1 1 3 3 0 1 0 0 1 1 1 0 0 1 1 0 2 0 1

Now we subtract row 2 from row 3

1 3 3 0 1 0 0 1 1 1 0 0 1 1 0 2 0 1 R 3 R 2 1 3 3 0 1 0 0 0 1 1 0 0 1 1 0 1 1 1

Phase 2

This consists of continuing the row operations to reduce the elements above the leading diagonal to zero.

We proceed right to left . We subtract 3 times row 3 from row 1 (the elements in row 2 column 3 is already zero.)

1 3 3 0 1 0 0 0 1 1 0 0 1 1 0 1 1 1 R 1 3 R 3 1 3 0 0 1 0 0 0 1 4 3 3 1 1 0 1 1 1

Finally we subtract 3 times row 2 from row 1.

1 3 0 0 1 0 0 0 1 4 3 3 1 1 0 1 1 1 R 1 3 R 2 1 0 0 0 1 0 0 0 1 7 0 3 1 1 0 1 1 1

Then we have A 1 = 7 0 3 1 1 0 1 1 1

(This can be verified by showing that A A 1 = I or A 1 A = I .)

Task!

Consider A = 0 1 1 2 3 1 1 2 1 , I = 1 0 0 0 1 0 0 0 1 .

Use the Gauss elimination method to obtain A 1 .

First interchange rows 1 and 2, then carry out the operation (row 3)+ 1 2 (row 1):

0 1 1 2 3 1 1 2 1 1 0 0 0 1 0 0 0 1 R 1 R 2 2 3 1 0 1 1 1 2 1 0 1 0 1 0 0 0 0 1 2 3 1 0 1 1 1 2 1 0 1 0 1 0 0 0 0 1 R 3 + 1 2 R 1 2 3 1 0 1 1 0 7 2 1 2 0 1 0 1 0 0 0 1 2 1

Now carry out the operation (row 3)- 7 2 (row 2) followed by (row 1)- 1 3 (row 3) and (row 2)+ 1 3 (row 3):

2 3 1 0 1 1 0 7 2 1 2 0 1 0 1 0 0 0 1 2 1 R 3 7 2 R 2 2 3 1 0 1 1 0 0 3 0 1 0 1 0 0 7 2 1 2 1 2 3 1 0 1 1 0 0 3 0 1 0 1 0 0 7 2 1 2 1 R 1 1 3 R 3 R 2 + 1 3 R 3 2 3 0 0 1 0 0 0 3 + 7 6 + 5 6 1 3 1 6 1 6 1 3 7 2 1 2 1

Next, subtract 3 times row 2 from row 1, then, divide row 1 by 2 and row 3 by ( 3 ) .

Finally identify A 1 :

2 3 0 0 1 0 0 0 3 7 6 5 6 1 3 1 6 1 6 1 3 7 2 1 2 1 R 1 3 R 2 2 0 0 0 1 0 0 0 3 10 6 2 6 4 3 1 6 1 6 1 3 7 2 1 2 1 2 0 0 0 1 0 0 0 3 10 6 2 6 4 3 1 6 1 6 1 3 7 2 1 2 1 R 1 ÷ 2 R 3 ÷ ( 3 ) 1 0 0 0 1 0 0 0 1 5 6 1 6 2 3 1 6 1 6 1 3 7 6 1 6 1 3

Hence A 1 = 5 6 1 6 2 3 1 6 1 6 1 3 7 6 1 6 1 3 = 1 6 5 1 4 1 1 2 7 1 2