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 Lx=b

Let Lx=b be a given 12.1 The Square Linear-Systems Problem problem with 8.7 Lower-Triangular Matrix LRn×n and bRn. If diagonal values uii0 for all i{1,2,,n}, then our linear-system problem has a unique solution. This solution can be found using the forward substitution algorithm:

x1=b1u11xi=1uii(bij=1i1uijxj)

where i=2,3,,n.

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.

Ly=b


\begin{proof}[Informal Proof.]
Let's look at a system of 4 linear equations in 4 unknowns with a lower-triangular coefficient matrix L. Suppose

[l11000l21l2200l31l32l330l41l42l43l44][y1y2y3y4]=[b1b2b3b4]

Let's look at the individual row entries of the left and right hand side.

l11y1+0+0+0=b1l21y1+l22y2+0+0=b2l31y1+l32y2+l33y3+0=b3l41y1+l42y2+l43y3+l44y4=b4

Notice that the first equation has only one unknown. Furthermore, if uii0 for all i, we solve for the unknown

y1=1l11(b1)

Because we know y1, we can continue and solve for y2 and so on.

l21y1+l22y2=b2y2=1l22(b4l21y1)

We continue with row 3 for y3.

l31y1+l32y2+l33y3=b3y3=1l33(b3l31y1l32y2)y3=1l33(b3j=12l3jyj)

Finally, we can find y4.

l41y1+l42y2+l43y3+l44y4y4=1l44(b4l41y1l42y2l43y3)y4=1l44(b4j=13u4jyj)

We have now solved our linear systems problem for unknowns yi using forward substitution.
\end{proof}