The problem is writing a serial code for the jacobi algorithm this is the pseudo code for the algorithm described below.

This is the serial algorithm

2. Description* Let Ax = b be a square system of n linear equations, where: [211 221 212 222 ... ... ain] azn 1X= 142 --0753-010 A - = Lani anz ... Ann] (xn] Then A can be decomposed into a diagonal component D, and the remainder R: [a11 0 ... 01 0 212 ... ain] 10 022 .. A = D + R where D=1 0 0 ... Ann] Lan ana ... 0] 0 ... a and R=1421 The solution is then obtained iteratively via X(k+1) = D-1(b RX(k)), where X(k) is the kth approximation or iteration of x and x(k+1) is the next or k+1 iteration of X. The element-based formula is thus: x: (k+1) = b - ) aix,k) | i = 1,2, ...,n. aji The computation of x,(k+1) requires each element in x(k) except itself. Unlike the Gauss-Seidel method, we can't overwrite x;(k) with x;(k+1), as that value will be needed by the rest of the computation. The minimum amount of storage is two vectors of size n. Choose an initial guess x(0) to the solution k = 0 while convergence not reached do for i=1...n do O = 0 for j=1...n do if j 7 i then o= 0 + ax: (k) end if end (j-loop) x;(k+1) = bi-0) dii end (i-loop) check if convergence is reached k = k + 1 2. Description* Let Ax = b be a square system of n linear equations, where: [211 221 212 222 ... ... ain] azn 1X= 142 --0753-010 A - = Lani anz ... Ann] (xn] Then A can be decomposed into a diagonal component D, and the remainder R: [a11 0 ... 01 0 212 ... ain] 10 022 .. A = D + R where D=1 0 0 ... Ann] Lan ana ... 0] 0 ... a and R=1421 The solution is then obtained iteratively via X(k+1) = D-1(b RX(k)), where X(k) is the kth approximation or iteration of x and x(k+1) is the next or k+1 iteration of X. The element-based formula is thus: x: (k+1) = b - ) aix,k) | i = 1,2, ...,n. aji The computation of x,(k+1) requires each element in x(k) except itself. Unlike the Gauss-Seidel method, we can't overwrite x;(k) with x;(k+1), as that value will be needed by the rest of the computation. The minimum amount of storage is two vectors of size n. Choose an initial guess x(0) to the solution k = 0 while convergence not reached do for i=1...n do O = 0 for j=1...n do if j 7 i then o= 0 + ax: (k) end if end (j-loop) x;(k+1) = bi-0) dii end (i-loop) check if convergence is reached k = k + 1