The Jacobi method is very similar to Gauss-Seidel method. The only difference is that Jacobi method doesn’t use the latest evaluated xi s in the equation. This method employs a set of old xi s to determine a set of new xi s. It means: The algorithm of this method can be written in the following form:
Step 1: Choose X0 = [x01,x02,…,x0n] as a starting point Step 2: Let Step 3: : If ||x-x0||<e then let X is solution else X0=X; go to step 2. Step 5: End.
e: Acceptable approximated error. (Source Code in C++)
o Gauss Elimination Method
|