| 199 | } |
| 200 | |
| 201 | void JacobiMethodCPU(float *A, double *b, float conv_threshold, int max_iter, int *num_iter, double *x) |
| 202 | { |
| 203 | double *x_new; |
| 204 | x_new = (double *)calloc(N_ROWS, sizeof(double)); |
| 205 | int k; |
| 206 | |
| 207 | for (k = 0; k < max_iter; k++) { |
| 208 | double sum = 0.0; |
| 209 | for (int i = 0; i < N_ROWS; i++) { |
| 210 | double temp_dx = b[i]; |
| 211 | for (int j = 0; j < N_ROWS; j++) |
| 212 | temp_dx -= A[i * N_ROWS + j] * x[j]; |
| 213 | temp_dx /= A[i * N_ROWS + i]; |
| 214 | x_new[i] += temp_dx; |
| 215 | sum += fabs(temp_dx); |
| 216 | } |
| 217 | |
| 218 | for (int i = 0; i < N_ROWS; i++) |
| 219 | x[i] = x_new[i]; |
| 220 | |
| 221 | if (sum <= conv_threshold) |
| 222 | break; |
| 223 | } |
| 224 | *num_iter = k + 1; |
| 225 | free(x_new); |
| 226 | } |