Enter an Augmented Matrix
Enter the coefficients of your equations and their right-hand-side constants. The final column is automatically treated as the constants column.
Calculation Results
Final Matrix
Solution Classification
Solution
Step-by-Step Row Operations
Each step shows the elementary row operation and the resulting matrix. The original system and every transformed system are row-equivalent.
Pivot and Rank Analysis
Reduced Row Echelon Form
The RREF is calculated separately for analysis, even when the selected display method is ordinary Gaussian elimination.
What Is Gaussian Elimination?
Gaussian elimination is a systematic method for solving systems of linear equations. It transforms an augmented matrix into row echelon form using elementary row operations. Once the matrix has been simplified, the unknown variables can be determined through back-substitution.
[ A | b ] → Row Echelon Form → Back-Substitution
Here, A is the coefficient matrix, x is the vector of unknown variables, and b is the vector of constants. The augmented matrix combines A and b into a single matrix.
The Three Elementary Row Operations
1. Row swapping
Exchange two rows. This is useful when a pivot is zero or when a better pivot is available in a lower row.
2. Row scaling
Multiply a row by a nonzero number. In Gauss-Jordan elimination, this can make a pivot equal to 1.
3. Row replacement
Add a multiple of one row to another row to eliminate an entry in a pivot column.
Gaussian Elimination vs. Gauss-Jordan Elimination
| Feature | Gaussian elimination | Gauss-Jordan elimination |
|---|---|---|
| Final form | Row echelon form (REF) | Reduced row echelon form (RREF) |
| Entries below pivots | Zero | Zero |
| Entries above pivots | May be nonzero | Zero |
| Pivot values | Need not equal 1 | Equal 1 |
| Solution method | Back-substitution | Read solutions from RREF |
How to Identify the Number of Solutions
The ranks of the coefficient matrix and augmented matrix determine whether a system is consistent. The rank of a matrix is the number of pivot positions in its row-reduced form.
rank(A) = rank([A | b]) = n → Unique solution
rank(A) = rank([A | b]) < n → Infinitely many solutions
Here, n is the number of unknown variables. When the system is consistent but the coefficient matrix has fewer pivots than variables, at least one variable is free.
What Are Pivot and Free Variables?
A pivot variable corresponds to a column containing a leading entry in the reduced matrix. A free variable corresponds to a non-pivot column. Free variables can be assigned arbitrary parameter values in a consistent system, allowing the calculator to express infinitely many solutions.
Why Is Partial Pivoting Useful?
In numerical calculations, dividing by a very small pivot can amplify rounding errors. Partial pivoting selects the largest absolute candidate in the current pivot column and swaps its row into the pivot position. This improves numerical robustness, although floating-point calculations can still have limitations for ill-conditioned systems.
Applications of Gaussian Elimination
Engineering
Solving systems of equations in circuit analysis, structural mechanics, and engineering models.
Computer Science
Linear algebra calculations in computer graphics, scientific computing, and numerical algorithms.
Economics and Finance
Analyzing linear models, balancing equations, and solving systems of simultaneous relationships.
Mathematics and Statistics
Studying matrix rank, linear independence, vector spaces, and systems of linear equations.
Frequently Asked Questions
What is Gaussian elimination?
Gaussian elimination is a method for solving systems of linear equations. It uses elementary row operations to transform an augmented matrix into row echelon form. The resulting triangular system can then be solved using back-substitution.
What is the difference between Gaussian elimination and Gauss-Jordan elimination?
Gaussian elimination transforms a matrix into row echelon form and normally uses back-substitution to obtain the solution. Gauss-Jordan elimination continues the row operations until the matrix reaches reduced row echelon form, where solutions can be read directly.
What are the three elementary row operations?
The three elementary row operations are swapping two rows, multiplying a row by a nonzero scalar, and adding a multiple of one row to another row. These operations preserve the solution set of a linear system.
What is an augmented matrix?
An augmented matrix combines the coefficient matrix of a linear system with its constant terms. The vertical divider separates the coefficients of the variables from the right-hand side of the equations.
What is reduced row echelon form?
Reduced row echelon form, or RREF, is a matrix form in which each nonzero row has a leading 1, each leading 1 is the only nonzero entry in its column, leading entries move to the right in successive rows, and zero rows appear at the bottom.
How can I tell whether a system has one solution, infinitely many solutions, or no solution?
Compare the rank of the coefficient matrix with the rank of the augmented matrix. If the ranks differ, there is no solution. If the ranks are equal and equal to the number of variables, there is a unique solution. If the ranks are equal but smaller than the number of variables, there are infinitely many solutions.
What is a pivot in Gaussian elimination?
A pivot is the leading nonzero entry selected in a row during elimination. Pivot positions help identify the rank of a matrix and determine which variables are basic variables and which are free variables.
Can Gaussian elimination solve a system with more equations than variables?
Yes. Gaussian elimination can be applied to rectangular augmented matrices, including systems with more equations than unknowns or more unknowns than equations. The resulting row-reduced matrix helps determine consistency and the solution set.
Can Gaussian elimination be used for an inconsistent system?
Yes. Elimination can identify an inconsistent system. A row containing zero coefficients but a nonzero constant, such as 0 = 5, indicates that the system has no solution.
Does this calculator use pivoting?
Yes. The automatic solver uses partial pivoting when choosing pivots. It selects the largest absolute candidate in the current pivot column to reduce the risk of numerical instability.
Related Matrix Calculators
Explore more matrix tools and interactive calculators.