1. Define Your System
Enter coefficients for [A] and constants for [B]. Use arrow keys to navigate.
Enter one equation per line. Use standard variables (x, y, z, etc.).
2. Step-by-Step Solution
The solution process will appear here.
Enter coefficients for [A] and constants for [B]. Use arrow keys to navigate.
Enter one equation per line. Use standard variables (x, y, z, etc.).
The solution process will appear here.
Gaussian Elimination is a powerful and systematic algorithm used in linear algebra to solve systems of linear equations. The core idea is to simplify a complex system of equations into a much easier form (called row echelon form) from which the solutions can be found by simple substitution.
A) and the constants on the other side of the 'equals' sign form the final column (B). The matrix is written as [A|B].
Consider the system: x + 2y = 5 and 3x + 4y = 11. The augmented matrix is:
To eliminate the 3 in the second row, we perform the row operation R₂ → R₂ - 3*R₁. This gives us the row echelon form:
From the second row, we can now easily solve for y: -2y = -4, which means y = 2. Substituting this value back into the first equation (x + 2(2) = 5) gives us x + 4 = 5, so x = 1. The solution is (1, 2).