Gaussian Elimination
Definition
Gaussian elimination is a systematic procedure for solving systems of linear equations by transforming the augmented matrix into row-reduced echelon form (RREF).
General Strategy
The general strategy to transform a matrix into its Row-Reduced Echelon Form (RREF) follows these steps:
Step 1
Go to the first row and turn the first non-zero entry into 1 (by dividing the entire row by that value). Then use this pivot to eliminate all other entries in that column by subtracting appropriate multiples of the first row from all other rows.
Step 2
Move to the second row and turn the first non-zero entry into 1. Then eliminate all other entries in that column by subtracting appropriate multiples of the second row from all other rows.
Step 3
Repeat this process for the remaining rows, working from left to right and top to bottom.
Step 4
If necessary, swap rows to achieve the "staircase pattern" where each pivot (leading 1) appears to the right of the pivot in the row above it.
Example
Consider the following system of linear equations:
The augmented matrix is:
Applying Gaussian elimination:
- Make the first pivot 1:
- Eliminate entries below the first pivot:
- Make the second pivot 1:
- Continue the process until RREF is achieved:
The solution is .
Applications
Gaussian elimination is fundamental in:
- Solving systems of linear equations
- Finding the inverse of a matrix
- Computing determinants
- Finding the rank of a matrix
- Determining the basis of a vector space
For more information on the final form achieved through Gaussian elimination, see Row-Reduced Echelon Form (RREF).