This problem shows how shifts help when computing eigenvalues. Create functions that are simple modifications of eigsymqr and eigsymb as follows: In the functions eigsymqr0 and eigsymb0, perform the...

This problem shows how shifts help when computing eigenvalues. Create functions that are simple modifications of eigsymqr and eigsymb as follows:

In the functions eigsymqr0 and eigsymb0, perform the following code replacement so termination occurs the first time the iteration does not converge to an eigenvalue within the allotted iterations.

       Replace

      Generate a random
symmetric matrix (A = randn(400,400),A=A+A’). Time the use of the original functions eigsymqr and eigsymb to compute the eigenvalues and eigenvectors of
 Now do the same for each of the modified functions, and discuss the results. For the methods that converge, compute

^T

₂