Changes

This is the function that takes most of the time. As you can see it it a single nested for loop that calculates a value from Matrix ui and stores it in Matrix u. Because the first matrix is never changed in each step, the result can therefore be calculated in independent threads safely. this means that this code should be relatively simple to parallelize and should see large speed increases.

==== Chadd's Example ====

I choose one of the most common application of data decomposition :File Search. I created a program that accepts a file and searches it for a specific word entered by

=== Assignment 2 ===

=== Assignment 3 ===