Section 5.1

I remember working with problems that would stop iterating when a solution was good enough for CISC280 but even then the problems were relatively small and did not save much time though it would be nice to learn more about this process in practice. The problem in my CISC280 class dealt with finding square roots that were close enough to the exact answer. The example was very useful. Find was a new MatLab function that I never knew about before. It looks very useful. What I thought was interesting though was the way that MatLab could tell that S was a sparse matrix. The definition says that a sparse matrix is a matrix that has mostly zero elements but at what point can you decide that a matrix is sparse. When there is more then half of the elements that are zero?