Key focus: Know the expressions to solve triangular matrix using forward and backward substituting techniques and the FLOPS required for solving it.
Forward Substitution:
Consider a set of equations in a matrix form , where A is a lower triangular matrix with non-zero diagonal elements. The equation is re-written in full matrix form as
![](https://i0.wp.com/www.gaussianwaves.com/gaussianwaves/wp-content/uploads/2013/05/Forward_Substitution_1.png?w=825&ssl=1)
It can be solved using the following expressions
![](https://i0.wp.com/www.gaussianwaves.com/gaussianwaves/wp-content/uploads/2013/05/Forward_substitution_2.png?w=825&ssl=1)
From the DSP implementation point of view, computation of requires one FLoating Point Operation per Second (FLOPS) – only one division. Computing
will require 3 FLOPS – 1 multiplication, 1 division and 1 subtraction,
will require 5 FLOPS – 2 multiplications, 1 division and two subtractions. Thus the computation of
will require
FLOPS.
Thus the overall FLOPS required for forward substitution is
FLOPS
Backward substitution:
Consider a set of equations in a matrix form , where A is a upper triangular matrix with non-zero diagonal elements. The equation is re-written in full matrix form as
![](https://i0.wp.com/www.gaussianwaves.com/gaussianwaves/wp-content/uploads/2013/05/backward_substitution_1.png?w=825&ssl=1)
Solved using the following algorithm
![](https://i0.wp.com/www.gaussianwaves.com/gaussianwaves/wp-content/uploads/2013/05/Backward_substitution_2.png?w=825&ssl=1)
This one also requires FLOPS.
Rate this article:
More on Estimation Theory:
Books by the author