93
edits
Changes
→Idea 1 - Jacobi Method for 2D Poisson Problem
</source>
The hotspot seems to clearly be the triple double for-loop based on m and n in the Jacobi iterations code of the dojacobi() function. I believe these matrix calculations could be parallelized for improved performance. Note that the for-loop that the double loop is inside of is based on a constant numbers, iters, so it doesn't grow with the problem size. It would be O(iters * n^2) which is still O(n^2) not O(n^3).
==== Idea 2 - LZW Compression ====
-------------
<source>
// Compile with gcc 4.7.2 or later, using the following command line:
//
return 0;
}
</source>
-------------------------
