\
Decompose any square matrix into L, U, and P with guided steps. See elimination steps, pivots, and multipliers at every stage for full clarity. Solve systems using forward substitution and back substitution walkthroughs with explanations. Export CSV and PDF reports instantly for documentation needs.
This example is preloaded above. Modify any value to explore behavior.
| 4 | 3 | 0 |
| 3 | 4 | -1 |
| 0 | -1 | 4 |
| 24 |
| 30 |
| -24 |
We factor a square matrix A into lower and upper triangular matrices such that A = L·U (without pivoting) or P·A = L·U (with partial pivoting). Here, L is unit lower triangular (ones on the diagonal) and U is upper triangular.
To solve A·x = b, with pivoting compute P·b, then forward substitution L·y = P·b, followed by back substitution U·x = y.
At step k, we select a pivot in column k, form multipliers lik = Uik/Ukk, and apply row updates to zero entries below the pivot. The displayed “U after eliminating column k” shows the matrix after these operations.
Partial pivoting swaps the current row with the row having the largest absolute entry in the active column. This produces a permutation matrix P so that P·A = L·U, improving stability by avoiding tiny pivots.
det(P)=±1.After computing L, U (and P if pivoting), you can verify results with residual checks. This tool presents exact arithmetic snapshots, but you may still assess quality numerically.
Important Note: All the Calculators listed in this site are for educational purpose only and we do not guarentee the accuracy of results. Please do consult with other sources as well.