Write a LU Decomposition Algorithm

Hey,

1. Start
2. Read the elements of augmented matrix into arrays a and b
3. Calculate elements of L and U
4. Print elements of L and U
5. Find V by solving LV = B by forward substitution
6. Find X by solving UX = V by backward substitution
7. Print Array X as the solution
8. Stop

The principle difference between Doolittle’s and Crout’s LU decomposition method is the calculation sequence these methods follow. Both the methods exhibit similarity in terms of inner product accumulation.

In Doolittle’s method, calculations are sequenced to compute one row of L followed by the corresponding row of U until A is exhausted.

I hope this helps