Types: N/A
Examples: N/A
Constructions: N/A
Generalizations: N/A
Properties: N/A
Sufficiencies: N/A
Questions: N/A
Forward Substitution: Lower-Triangular
Let be a given 12.1 The Square Linear-Systems Problem problem with 8.7 Lower-Triangular Matrix and . If diagonal values for all , then our linear-system problem has a unique solution. This solution can be found using the forward substitution algorithm:
where .
Remark. In addition to solving problems involving 8.9 Upper-Triangular Matrix, we also use 8.7 Lower-Triangular Matrix for the 12.1 The Square Linear-Systems Problem.
\begin{proof}[Informal Proof.]
Let's look at a system of 4 linear equations in 4 unknowns with a lower-triangular coefficient matrix . Suppose
Let's look at the individual row entries of the left and right hand side.
Notice that the first equation has only one unknown. Furthermore, if for all , we solve for the unknown
Because we know , we can continue and solve for and so on.
We continue with row 3 for .
Finally, we can find .
We have now solved our linear systems problem for unknowns using forward substitution.
\end{proof}