\(2x + 3y = 7\)
\(4x - y = 1\)
Gaussian elimination: A systematic method for solving systems of linear equations by transforming the augmented matrix into row echelon form using elementary row operations
- Create the augmented matrix from the system of equations
- Perform elementary row operations to achieve row echelon form
- Use back-substitution to find the solution
System: \(\begin{cases} 2x + 3y = 7 \\ 4x - y = 1 \end{cases}\)
Augmented matrix: \(\begin{bmatrix} 2 & 3 & | & 7 \\ 4 & -1 & | & 1 \end{bmatrix}\)
Divide row 1 by 2: \(R_1 \leftarrow \frac{1}{2}R_1\)
New matrix: \(\begin{bmatrix} 1 & \frac{3}{2} & | & \frac{7}{2} \\ 4 & -1 & | & 1 \end{bmatrix}\)
Subtract 4 times row 1 from row 2: \(R_2 \leftarrow R_2 - 4R_1\)
\(R_2 = [4, -1, 1] - 4[1, \frac{3}{2}, \frac{7}{2}] = [4, -1, 1] - [4, 6, 14] = [0, -7, -13]\)
New matrix: \(\begin{bmatrix} 1 & \frac{3}{2} & | & \frac{7}{2} \\ 0 & -7 & | & -13 \end{bmatrix}\)
Divide row 2 by -7: \(R_2 \leftarrow \frac{-1}{7}R_2\)
New matrix: \(\begin{bmatrix} 1 & \frac{3}{2} & | & \frac{7}{2} \\ 0 & 1 & | & \frac{13}{7} \end{bmatrix}\)
From row 2: \(y = \frac{13}{7}\)
Substitute into row 1: \(x + \frac{3}{2} \cdot \frac{13}{7} = \frac{7}{2}\)
\(x + \frac{39}{14} = \frac{49}{14}\)
\(x = \frac{49}{14} - \frac{39}{14} = \frac{10}{14} = \frac{5}{7}\)
The solution to the system is \(x = \frac{5}{7}\) and \(y = \frac{13}{7}\)
• Elementary row operations: Interchange, multiply by non-zero constant, add multiple of one row to another
• Row echelon form: Leading coefficients move right as we go down rows
• Back-substitution: Solve from bottom row upward
\(x + 2y + z = 4\)
\(2x - y + 3z = 7\)
\(3x + y - z = 1\)
Row echelon form: A matrix form where all nonzero rows are above rows of all zeros, and the leading coefficient of a row is to the right of the leading coefficient of the row above it
\(\begin{bmatrix} 1 & 2 & 1 & | & 4 \\ 2 & -1 & 3 & | & 7 \\ 3 & 1 & -1 & | & 1 \end{bmatrix}\)
Operation 1: \(R_2 \leftarrow R_2 - 2R_1\)
New row 2: \([2, -1, 3, 7] - 2[1, 2, 1, 4] = [0, -5, 1, -1]\)
Operation 2: \(R_3 \leftarrow R_3 - 3R_1\)
New row 3: \([3, 1, -1, 1] - 3[1, 2, 1, 4] = [0, -5, -4, -11]\)
Now matrix is: \(\begin{bmatrix} 1 & 2 & 1 & | & 4 \\ 0 & -5 & 1 & | & -1 \\ 0 & -5 & -4 & | & -11 \end{bmatrix}\)
Operation: \(R_3 \leftarrow R_3 - R_2\)
New row 3: \([0, -5, -4, -11] - [0, -5, 1, -1] = [0, 0, -5, -10]\)
Divide row 2 by -5: \(R_2 \leftarrow \frac{-1}{5}R_2\)
Divide row 3 by -5: \(R_3 \leftarrow \frac{-1}{5}R_3\)
Result: \(\begin{bmatrix} 1 & 2 & 1 & | & 4 \\ 0 & 1 & -\frac{1}{5} & | & \frac{1}{5} \\ 0 & 0 & 1 & | & 2 \end{bmatrix}\)
From row 3: \(z = 2\)
Substitute into row 2: \(y - \frac{1}{5}(2) = \frac{1}{5}\), so \(y = \frac{1}{5} + \frac{2}{5} = \frac{3}{5}\)
Substitute into row 1: \(x + 2(\frac{3}{5}) + 2 = 4\), so \(x = 4 - \frac{6}{5} - 2 = \frac{4}{5}\)
The solution is \(x = \frac{4}{5}\), \(y = \frac{3}{5}\), and \(z = 2\)
• Pivot selection: Choose leading coefficients to eliminate below
• Triangularization: Create zeros below pivots to form upper triangular matrix
• Back-substitution: Solve from bottom row upward
\(\begin{bmatrix} 2 & 1 & 3 & | & 8 \\ 4 & 3 & 5 & | & 18 \\ 6 & 2 & 7 & | & 22 \end{bmatrix}\)
Reduced row echelon form: A matrix form where each leading coefficient is 1, and all other entries in the column of a leading coefficient are zero
Divide row 1 by 2: \(R_1 \leftarrow \frac{1}{2}R_1\)
New matrix: \(\begin{bmatrix} 1 & \frac{1}{2} & \frac{3}{2} & | & 4 \\ 4 & 3 & 5 & | & 18 \\ 6 & 2 & 7 & | & 22 \end{bmatrix}\)
Operation 1: \(R_2 \leftarrow R_2 - 4R_1\)
New row 2: \([4, 3, 5, 18] - 4[1, \frac{1}{2}, \frac{3}{2}, 4] = [0, 1, -1, 2]\)
Operation 2: \(R_3 \leftarrow R_3 - 6R_1\)
New row 3: \([6, 2, 7, 22] - 6[1, \frac{1}{2}, \frac{3}{2}, 4] = [0, -1, -2, -2]\)
Current matrix: \(\begin{bmatrix} 1 & \frac{1}{2} & \frac{3}{2} & | & 4 \\ 0 & 1 & -1 & | & 2 \\ 0 & -1 & -2 & | & -2 \end{bmatrix}\)
Operation: \(R_3 \leftarrow R_3 + R_2\)
New row 3: \([0, -1, -2, -2] + [0, 1, -1, 2] = [0, 0, -3, 0]\)
Divide row 3 by -3: \(R_3 \leftarrow \frac{-1}{3}R_3\)
Current matrix: \(\begin{bmatrix} 1 & \frac{1}{2} & \frac{3}{2} & | & 4 \\ 0 & 1 & -1 & | & 2 \\ 0 & 0 & 1 & | & 0 \end{bmatrix}\)
From row 3: \(z = 0\)
Substitute into row 2: \(y - 0 = 2\), so \(y = 2\)
Substitute into row 1: \(x + \frac{1}{2}(2) + \frac{3}{2}(0) = 4\), so \(x = 4 - 1 = 3\)
The solution is \(x = 3\), \(y = 2\), and \(z = 0\)
• Systematic elimination: Work column by column from left to right
• Pivot normalization: Make leading coefficients equal to 1
• Zero creation: Eliminate entries below each pivot
Augmented matrix: A matrix formed by appending the constant column to the coefficient matrix
Elementary row operations: Operations that preserve the solution set of the system
Row echelon form: A matrix form where leading coefficients move right as we go down rows
Reduced row echelon form: A matrix form where each leading coefficient is 1 and all other entries in its column are zero
- Form augmented matrix: Combine coefficient matrix with constant vector
- Forward elimination: Create zeros below each pivot
- Back-substitution: Solve from bottom row upward
- Verification: Check that solution satisfies original equations
\(x + 2y = 3\)
\(2x + 4y = 7\)
Inconsistent system: A system of equations that has no solution, indicated by a row of the form [0 0 ... 0 | c] where c ≠ 0
\(\begin{bmatrix} 1 & 2 & | & 3 \\ 2 & 4 & | & 7 \end{bmatrix}\)
Operation: \(R_2 \leftarrow R_2 - 2R_1\)
New row 2: \([2, 4, 7] - 2[1, 2, 3] = [0, 0, 1]\)
The transformed matrix is: \(\begin{bmatrix} 1 & 2 & | & 3 \\ 0 & 0 & | & 1 \end{bmatrix}\)
The second row corresponds to the equation: \(0x + 0y = 1\), which is impossible.
The system is inconsistent and has no solution
• Inconsistency detection: Row of form [0 0 ... 0 | c] where c ≠ 0 indicates no solution
• Parallel lines: The equations represent parallel lines with no intersection
• Verification: The second equation is twice the first but with different constant
\(x + 2y - z = 1\)
\(2x + 4y - 2z = 2\)
\(3x + 6y - 3z = 3\)
Dependent system: A system with infinitely many solutions, indicated by a row of all zeros in the coefficient portion
\(\begin{bmatrix} 1 & 2 & -1 & | & 1 \\ 2 & 4 & -2 & | & 2 \\ 3 & 6 & -3 & | & 3 \end{bmatrix}\)
Operation 1: \(R_2 \leftarrow R_2 - 2R_1\)
New row 2: \([2, 4, -2, 2] - 2[1, 2, -1, 1] = [0, 0, 0, 0]\)
Operation 2: \(R_3 \leftarrow R_3 - 3R_1\)
New row 3: \([3, 6, -3, 3] - 3[1, 2, -1, 1] = [0, 0, 0, 0]\)
The transformed matrix is: \(\begin{bmatrix} 1 & 2 & -1 & | & 1 \\ 0 & 0 & 0 & | & 0 \\ 0 & 0 & 0 & | & 0 \end{bmatrix}\)
Rows 2 and 3 are all zeros, indicating that the equations are dependent.
From row 1: \(x + 2y - z = 1\)
Solve for x: \(x = 1 - 2y + z\)
Let \(y = s\) and \(z = t\) where s and t are free parameters
General solution: \(x = 1 - 2s + t\), \(y = s\), \(z = t\)
The system has infinitely many solutions: \(x = 1 - 2s + t\), \(y = s\), \(z = t\) where s and t are any real numbers
• Dependence detection: Rows of all zeros indicate dependent equations
• Parameterization: Express free variables as parameters
• General solution: Represent infinite solutions using parameters
Gaussian elimination: A systematic method for solving linear systems by transforming the augmented matrix to row echelon form using elementary row operations
Elementary row operations: Three fundamental operations that preserve the solution set of a linear system
Row echelon form: A matrix form where leading coefficients move strictly right as we go down rows, and all entries below each leading coefficient are zero
Reduced row echelon form: A matrix form where each leading coefficient is 1 and all other entries in its column are zero
- Initialization: Form the augmented matrix [A|b] from the system Ax = b
- Forward phase: For each column, make the leading coefficient 1 and eliminate below it
- Backward phase: Continue to reduced row echelon form (optional)
- Solution extraction: Read off the solution or express in parametric form
- Verification: Check that the solution satisfies the original system
• Preservation of solutions: Elementary row operations don't change the solution set
• Computational complexity: O(n³) for an n×n system
• Matrix rank: Number of non-zero rows in row echelon form
• Existence and uniqueness: Determined by comparing rank of coefficient matrix with augmented matrix
1. Row operations and their effects
2. Transformation to echelon form
3. Back-substitution process
4. Solution types (unique, none, infinite)
Analysis: The visualization shows how Gaussian elimination systematically transforms a matrix.
- Row operations preserve solution set
- Zeros are created below pivots
- Leading coefficients move right
- Back-substitution solves the system