Gauss’s Elimination

Definition

Gauss’s Elimination is a systematic numerical method used to solve a system of linear equations. It involves transforming the system's augmented matrix into an "Upper Triangular Form" (also known as Row Echelon Form) using elementary row operations, followed by back-substitution to find the values of the unknowns.

Main Content

1. The Augmented Matrix

• A system of linear equations is represented by a matrix containing the coefficients of the variables and the constants from the right-hand side.
• For a system $Ax = B$, the augmented matrix is written as $[A|B]$.

2. Elementary Row Operations

• Swapping two rows: Changing the order of equations does not change the solution.
• Scaling rows: Multiplying an entire row by a non-zero constant.
• Row addition/subtraction: Adding or subtracting a multiple of one row from another to create zeros in specific positions.

3. Upper Triangular Form

• The goal is to reach a state where all elements below the main diagonal of the coefficient matrix are zeros.
• This creates a structure where the last equation has one variable, the second-to-last has two, and so on.

[ a11  a12  a13 | b1 ]
[  0   a22  a23 | b2 ]
[  0    0   a33 | b3 ]

(Visual representation of a 3x3 Upper Triangular Matrix)

Working / Process

1. Forward Elimination

• Start with the first column and use the pivot (the diagonal element) to eliminate all values below it by performing row operations ($R_n = R_n - (multiplier) \times R_p$).
• Move to the next diagonal element and repeat the process for all columns until an upper triangular matrix is formed.

2. Back-Substitution

• Once the matrix is in upper triangular form, the bottom row directly gives the value of the last variable (e.g., $a_{33}z = b_3$).
• Substitute this known value into the equation above it to solve for the next variable, continuing upwards until all unknowns are found.

3. Handling Special Cases

• If a diagonal element (pivot) is zero, perform a row swap with a row below it to proceed with the calculation.
• If all elements in a row become zero, the system may have infinitely many solutions or no solution.

Advantages / Applications

• Efficiency: It is much faster for a computer to solve systems using this method compared to Cramer’s Rule or matrix inversion.
• Versatility: It works for any square system of equations that has a unique solution.
• Real-world use: Widely used in structural engineering, circuit analysis in electrical engineering, and data analysis in computer science.

Summary

• Gauss’s Elimination is an algorithmic approach to solving linear systems by converting them into upper triangular form.
• The process relies on row operations to eliminate variables, followed by back-substitution to isolate the solutions.
• It is the foundation of many computational solvers used in engineering and scientific research.
• Important terms: Augmented Matrix, Pivot, Row Echelon Form, Back-substitution.