# Gauß-Jordan-Algorithm

← Back: Matrix inversion |
Overview: Matrix inversion |
Next: Adjugate Formula → |

The Gauß-Jordan-Algorithm was developed to solve systems of linear equations. But it can also be used to determine the inverse of an n-by-n square matrix.

The algorithm is based on the formula . First the block matrix is build. On this matrix the Gauß-Jordan-Algorithm is applied. By using various conversion steps like interchanging of rows and addtition of factorized rows to other rows the block matrix is converted so that the left block equals the identity matrix . The right block then corresponds to the inverse of .

Example: Gauß-Jordan-Algorithm for a 2-by-2 matrix
This example describes the application of the Gauß-Jordan-Algorithm to compute the inverse of , which is already used for the example in the main article of matrix inversion. For a proof please have a look at the example in the main article of matrix inversion. |

Example: Gauß-Jordan-Algorithm for a 4-by-4 matrix
This example describes the computation of the inverse of the transform matrix that is introduced in the script on page 3-37 and used on the following pages.
For a proof please have a look at the example in the main article of matrix inversion. |