Suppose procedure Tri_ Normal(n, (ai ), (di ), (ci ), (bi ), (xi )) performs t...

Suppose

procedure Tri_ Normal(n, (a_i ), (d_i ), (c_i ), (b_i ), (x_i ))

performs the normalized Gaussian elimination algorithm of Computer Exercise 2.3.12 and

procedure Tri_ 2n(n, (a_i ), (d_i ), (c_i ), (b_i ), (x_i ))

performs the algorithm outlined in Computer Exercise 2.3.13. Using a timing routine on your computer, compare Tri, Tri _Normal, and Tri_ 2n to determine which of them is fastest for the tridiagonal system

with a large even value of n.

Note: Mathematical algorithms may behave differently on parallel and vector computers. Generally speaking, parallel computations completely alter our conventional notions about what’s best or most efficient.