Answer to Question #257465 in Math for ahuhsjkdjhhf

Question

1. What is the algorithm to solve [L][Z] = [C] given the set of n equations [A][X ] = [C ], where [A] = [L][U ] involves solving [L][Z ] = [C] by forward substitution.

2. Solve the 3^rd iteration values of [ x1 , x2 , x3 ] in the Gauss-Seidel method Using [ x1 , x2 , x3 ] = [1,3,5] as the initial guess.