Linear and multilinear algebra; matrix theory Concept
Back substitution
Summary
Back substitution is a method to solve a system , where is an upper triangular matrix with nonzero diagonal entries. The last equation gives . Then, for in this order, equation gives which uses only the unknowns that are already known.
Remarks
Back substitution uses on the order of arithmetic operations. Forward substitution solves for a lower triangular matrix in the same way, from the first equation down. After Gaussian elimination, back substitution completes the solution of the system. With an LU decomposition , the system is solved by forward substitution for and then back substitution for .
Where this leads
2 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Triangular_matrix, Forward and back substitution
About this page
| Tag | 0ATFVE08MW |
|---|---|
| URI | m2://0ATFVE08MW |
| Kind | concept |
| Writing | W0 stub |
| MSC | 15A06, 65F05 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.