Linux part was done

2025.03.28/dist/Linux/Makefile

@@ -5,7 +5,7 @@ FLAGS = -fstack-protector-all -W -Wall -Wextra -Wunused -Wcast-align -Werror -pe
 %.o: %.c
 	 gcc -c $(FLAGS) $<
 
-all: a01.out a02.out a03.out a04.out a05.out a06.out a07.out a08.out
+all: a01.out a02.out a03.out a04.out a05.out a06.out a07.out a08.out a09.out a10.out
 
 solve.o: solve.c solve.h
 array_io.o: array_io.c array_io.h

2025.03.28/dist/Linux/solve.c

@@ -444,3 +444,118 @@ void t8_solve(const double * restrict A, double * restrict x_0, const double * r
 	}
 }
 
+void t9_solve(const double * restrict A, double * restrict x_0, const double * restrict b, double * restrict x, int n, int m, double t)
+{
+	for (int k = 0; k < m; ++k)
+	{
+		double * swap_temp;
+		
+		for (int i = n-1; i >= 0; --i)
+		{
+			double sum_x = 0;
+			double sum_r = 0;
+			double temp = 0;
+			double aii = A[i*n + i];
+
+			#pragma omp simd reduction(+:sum_x, sum_r)	
+			for (int j = n-1; j > i; --j)
+			{
+				double aij = A[i*n + j];
+				double rj = aij * x_0[j];
+			       	sum_x += rj - aij * x[j];
+				sum_r += rj;
+			}
+
+			temp = aii * x_0[i];	
+			sum_x += temp;
+			sum_r += temp;
+
+			#pragma omp simd reduction(+:sum_r)	
+			for (int j = i-1; j >= 0; --j)
+				sum_r += A[i*n + j] * x_0[j];
+
+			x[i] = (sum_x + (b[i] - sum_r) * t) / aii;
+		}
+	
+		swap_temp = x;
+		x = x_0;
+		x_0 = swap_temp;
+	}
+
+	if (m % 2 == 0) // Проверил 100 раз	
+		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;
+	}
+}
+
+void t10_solve(const double * restrict A, double * restrict x_0, const double * restrict b, double * restrict x, double * restrict r, double * restrict w, int n, int m, double t)
+{
+	for (int k = 0; k < m; ++k)
+	{
+		double *swap_temp = 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] = (b[i] - sum) * t;
+		}
+
+		for (int i = 0; i < n; ++i)
+		{
+			double sum = r[i];
+			double inai = 0;
+
+			#pragma omp simd reduction(+:sum)
+			for (int j = 0; j < i; ++j)
+				sum -= A[i*n + j] * r[j];
+			
+			inai = 1./A[i*n + i];
+			w[i] = inai;
+			r[i] = sum * inai;
+		}
+
+		#pragma omp simd
+		for (int i = 0; i < n; ++i)
+			r[i] *= A[i*n + i];
+
+		for (int i = n-1; i >= 0; --i)
+		{
+			double sum = r[i];
+			
+			#pragma omp simd reduction(+:sum)
+			for (int j = n-1; j > i; --j)
+				sum -= A[i*n + j] * r[j];
+
+			r[i] = sum * w[i];
+		}
+
+		#pragma omp simd
+		for (int i = 0; i < n; i++)
+			x[i] = x_0[i] + r[i];
+		
+		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; }
+}

2025.03.28/dist/Linux/solve.h

@@ -11,6 +11,8 @@ void t5_solve(const double * restrict A, double * restrict x_0, const double * r
 void t6_solve(const double * restrict A, double * restrict x_0, const double * restrict b, double * restrict x, double * restrict r, int n, int m);
 void t7_solve(const double * restrict A, double * restrict x_0, const double * restrict b, double * restrict x, double * restrict r, int n, int m, double t);
 void t8_solve(const double * restrict A, double * restrict x_0, const double * restrict b, double * restrict x, double * restrict r, double * restrict w, int n, int m, double t);
+void t9_solve(const double * restrict A, double * restrict x_0, const double * restrict b, double * restrict x, int n, int m, double t);
+void t10_solve(const double * restrict A, double * restrict x_0, const double * restrict b, double * restrict x, double * restrict r, double * restrict w, int n, int m, double t);
 
 #endif