Run your new code. When your steepest descents is working properly,
you will find that (after a few initial steps) the fourth column of
the output is generally small, something on the order of 1e-2. Also,
you will find that, as you approach the minimum, the above expansion
for 
gets better and better, so that the fourth column
should continue getting closer to zero as the algorithm converges.