93
edits
Changes
→Idea 1 - Jacobi Method for 2D Poisson Problem
"In numerical linear algebra, the Jacobi method (or Jacobi iterative method[1]) is an algorithm for determining the solutions of a diagonally dominant system of linear equations. Each diagonal element is solved for, and an approximate value is plugged in. The process is then iterated until it converges."
<nowiki>**************************</nowiki>
CODE - Based on PDF
<nowiki>**************************</nowiki>
The following code is based on the jacobi.cc and common.cc code at the bottom of the source PDF, but there are some changes for these tests. The files use .cpp extensions instead of .cc, the code in common.cc was added to jacobi.cpp so it's a single file, and code for carrying out the Jacobi iterations in the main were placed into a seperate function called dojacobi() for gprof profiling.
</source>
<nowiki>************************</nowiki>
Inputs / Performance
<nowiki>************************</nowiki>
In a 2D PDE such as the 2D Poisson problem, the matrix will have m * n gridpoints.
