Question: The following pseudo code performs Gaussian elimination without partial pivoting on the tridiagonal system storing the multipliers over the elements of a, and the changed
The following pseudo code performs Gaussian elimination without partial pivoting on the tridiagonal system

storing the multipliers over the elements of a, and the changed diagonal elements over the elements of d.

(a) How much storage is used to store the matrix A of the system with this solver? What is the order of magnitude (as a power of n) of the number of oating point operations required to solve one tridiagonal system using this solver?
(b) Implement the algorithm given above as two Matlab functions, felim and triback. The function declarations should read

(Note that if the output of felim is assigned to the three vectors [e, f, c] and subsequently triback is called with the parameters e,f,c,b,n, then a and b will not actually be changed by the felim routine. This may be useful during debugging.)
di ci 2 02 b2 Cu- di ci 2 02 b2 Cu
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
