Result
Enter a system of equations
Solve with 6 methods. Step-by-step solutions, interactive graph, Python code.
Interactive Graph
Solve a system to see its graph. 2D for 2 variables, 3D for 3 variables.
No recently used tools
Loading categories...
Free system of equations solver with step-by-step solutions. Solve using Gaussian elimination, Gauss-Jordan RREF, LU decomposition, Cramer's rule, matrix inverse, and least squares. Shows every row operation. Enter as text, matrix grid, or polynomial equations. Interactive 2D/3D graphs and built-in Python compiler.
Solve with 6 methods. Step-by-step solutions, interactive graph, Python code.
Solve a system to see its graph. 2D for 2 variables, 3D for 3 variables.
A system of linear equations is a set of equations where each unknown variable appears only to the first power (no xยฒ, no xy products). The goal: find values that make every equation true at the same time. We write the entire system compactly as Ax = b.
Every method follows the same core idea: systematically eliminate variables until you can read the answer directly.
Row operations transform the augmented matrix without changing the solution. Here's one step of Gaussian elimination โ hover to see the row being eliminated:
In 2D, each linear equation is a line. Solving means finding where the lines meet. In 3D, each equation is a plane. There are exactly three possible outcomes:
A chemist needs to mix two acid solutions. Solution A is 30% acid, Solution B is 70% acid. She needs 200 mL of a 45% acid mixture. How much of each solution should she use?
Let x = mL of Solution A, y = mL of Solution B.
Total volume: x + y = 200
Acid balance: 0.3x + 0.7y = 90
(90 = 200 ร 0.45, the total acid needed)
All methods find the same answer โ they differ in how they get there and when each is most efficient.
| Method | Best For | Complexity | Key Idea |
|---|---|---|---|
| Gaussian Elimination | General systems | O(nยณ) | Create zeros below pivots, then back-substitute |
| Gauss-Jordan (RREF) | Finding all solutions | O(nยณ) | Create zeros above and below โ read solution directly |
| LU Decomposition | Multiple right-hand sides | O(nยณ) | Factor A = LU once, solve Ly = b then Ux = y |
| Cramer's Rule | Small systems (n โค 3) | O(n! ยท n) | xแตข = det(Aแตข) / det(A) using determinants |
| Matrix Inverse | Square systems | O(nยณ) | Compute A&supmin;ยน, then x = A&supmin;ยนb |
| Least Squares | Overdetermined (m > n) | O(mnยฒ) | Minimize ||Ax - b||ยฒ via normal equations AแตAx = Aแตb |
Exactly one set of values satisfies all equations. Happens when det(A) โ 0 (the rows are linearly independent). The row echelon form has a pivot in every column.
The equations contradict each other. In row echelon form, you get a row [0 0 โฆ 0 | c] where c โ 0 โ this says "0 = c", which is impossible.
Free variables exist because rank(A) < n. The solution is parametric: some variables are expressed in terms of free parameters (t, s, โฆ).
When there are more equations than unknowns (overdetermined), no exact solution exists. Least squares finds the x that minimizes the total error ||Ax - b||ยฒ.
Kirchhoff's voltage and current laws at each node create a linear system. Solve for branch currents and node voltages.
Least squares regression fits a line or curve to noisy data by solving the normal equations AแตAx = Aแตb.
Force and moment equilibrium in trusses and frames produces systems of equations for member forces.
3D rotation, projection, ray-plane intersection, and mesh deformation all involve solving linear systems.
Linear regression, PCA, and neural network weight updates rely on solving or approximating linear systems.
Balancing chemical equations (conservation of atoms for each element) is a system of linear equations.