Task 5 is done!

2025.03.28/05Ex/solve.c

@@ -0,0 +1,112 @@
+#include "solve.h"
+#include "matrix.h"
+#include <math.h>
+
+
+void t5_solve(const double * restrict A, double * restrict x_0, const double * restrict b, double * restrict x, double * restrict r, int n, int m)
+{
+	for (int k = 0; k < m; ++k)
+	{
+		double *swap_temp = 0;
+		double t = 0;
+		double dot_Dr_r = 0, dot_ADr_Dr = 0;
+		
+		#pragma omp parallel for
+		for (int i = 0; i < n; ++i)
+		{
+			double sum = 0;
+			#pragma omp simd reduction(+:sum)
+			for (int j = 0; j < n; ++j)
+				sum += A[i*n + j] * x_0[j];
+			r[i] = sum - b[i];
+		}
+
+		#pragma omp parallel for reduction(+:dot_Dr_r)
+		for (int i = 0; i < n; ++i)
+		{
+			double d_ri = r[i] / A[i*n +i];
+			dot_Dr_r += d_ri * r[i];
+			r[i] = d_ri;
+		}
+
+		#pragma omp parallel for reduction(+:dot_ADr_Dr)
+		for (int i = 0; i < n; ++i)
+		{
+			double sum = 0;
+
+			#pragma omp simd reduction(+:sum)
+			for (int j = 0; j < n; ++j)
+				sum += A[i*n + j] * r[j];
+			
+			dot_ADr_Dr += sum * r[i];
+		}
+		
+		t = dot_Dr_r / dot_ADr_Dr;
+		
+		#pragma omp simd
+		for (int i = 0; i < n; ++i)
+			x[i] = x_0[i] - r[i]*t;
+		
+		swap_temp = x;
+		x = x_0;
+		x_0 = swap_temp;
+	}
+
+	if (m % 2 == 0) // Проверил 100 раз	
+		#pragma omp simd
+		for (int i = 0; i < n; i++)
+		{
+			double temp = x[i];
+			x[i] = x_0[i];
+			x_0[i] = temp;
+		}
+	else
+	{
+		double * swap_temp = x;
+		x = x_0;
+		x_0 = swap_temp;
+	}
+}
+
+double get_r1(const double * restrict A, const double * restrict x_k, const double * restrict b, int n)
+{
+	double norm_r1x_1 = 0;
+	double residual_norm_1 = 0;
+	double r1 = 0;
+
+	#pragma omp parallel for reduction(+:residual_norm_1, norm_r1x_1)
+	for (int i = 0; i < n; ++i)
+	{
+		double bi = b[i];
+		double sum = 0;
+		
+		#pragma omp simd reduction(+:sum)
+		for (int j = 0; j < n; ++j)
+			sum += A[i*n + j] * x_k[j];
+		
+		residual_norm_1 += fabs(sum - bi);
+		norm_r1x_1 += fabs(bi);
+	}
+
+	r1 = residual_norm_1 / norm_r1x_1;
+
+	return r1;
+}
+
+double get_r2_value(const double * restrict x_k, int n)
+{
+	double relative_error = 0;
+	double total_diff = 0;
+	double template_sum = 0;
+
+	#pragma omp parallel for reduction(+:total_diff, template_sum)
+	for (int i = 0; i < n; ++i)
+	{
+		short int modi = i ^ 1;
+		total_diff += fabs(x_k[i] - modi);
+		template_sum += modi;
+	}
+
+	relative_error = total_diff / template_sum;
+	return relative_error;
+}