sd()

function out=sd(W,Nit)

Input:

• W: $\prod S \times N_s$ matrix containing initial guess for eigensolutions
• Nit: Number of iterations desired

Output:

• out: Result of Nit iterations of steepest descents
• DISPLAY: with each iteration, print the result of getE() on current solutions

Provide a function of the above prototype which performs Nit iterations of the steepest descents algorithm with a step size of $\alpha=3 \times 10^{-5}$. (You may wish to play with $\alpha$ later to see if you can find a better value.)