(Normalized Tridiagonal Algorithm) Construct an algorithm for handling tridiagonal systems in which the normalized Gaussian elimination procedure without pivoting is used. In this process, each pivot row is divided by the diagonal element before a multiple of the row is subtracted from the successive rows. Write the equations involved in the forward elimination phase and store the upper diagonal entries back in array (ci ) and the right hand side entries back in array (bi ). Write the equations for the back substitution phase, storing the solution in array (bi ). Code and test this procedure. What are its advantages and disadvantages?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.