AZEN-SGG/2nd_Sem_Bogachev
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Task 14 doesn't work correctly

Browse source
This commit is contained in:
AZEN-SGG 2025-04-02 00:14:36 +03:00
parent f21c2aaf05
commit b4c7f2d872
8 changed files with 165 additions and 76 deletions
Download patch file Download diff file Expand all files Collapse all files

98
2025.04.04/14Ex/solve.c
View file

@ -1,80 +1,114 @@
#include "solve.h"
#include "io_status.h"
#include <float.h>
#include <math.h>
// c - changes in rows
int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c)
{
for (int k = 0; k < n; ++k) {
max_t max = { .val = -1.0 };
#pragma omp parallel for reduction(+:max)
double maximum = -1.;
int max_i = 0, max_j = 0;
#pragma omp parallel for collapse(2) reduction(max:maximum)
for (int i = k; i < n; ++i)
for (int j = k; j < n; ++j)
{
double aij = fabs(A[i * n + j]);
if (aij > max.val) {
max.val = aij;
max.i = i;
max.j = j;
#pragma omp critical
{
if (aij > maximum) {
maximum = aij;
max_i = i;
max_j = j;
}
}
}
if (fabs(max.val) < DBL_EPSILON)
if (fabs(maximum) < DBL_EPSILON)
return SINGULAR;
if (max.i != k)
if (max_i != k)
{
int kn = k*n;
int in = max_i*n;
#pragma omp simd
for (int kn = k*n, in = max.i*n; kn < k*(n+1); ++kn, ++in)
for (int i = 0; i < k; ++i)
{
double swap = X[kn];
X[kn] = X[in];
X[in] = swap;
}
int kni = kn+i, ini = in+i;
double swap = X[kni];
X[kni] = X[ini];
X[ini] = swap;
}
#pragma omp parallel for simd
for (int kn = k*n+k, in = max.i*n+k; kn < (k+1)*n; ++kn, ++in)
for (int i = k; i < n; ++i)
{
double swap = X[kn];
X[kn] = X[in];
X[in] = swap;
int kni = kn+i, ini = in+i;
double swap = X[kni];
X[kni] = X[ini];
X[ini] = swap;
swap = A[kn];
A[kn] = A[in];
A[in] = swap;
swap = A[kni];
A[kni] = A[ini];
A[ini] = swap;
}
}
if (max.j != j)
if (max_j != k)
{
int swap_temp = c[max.j];
c[max.j] = k;
int swap_temp = c[max_j];
c[max_j] = k;
c[k] = swap_temp;
#pragma omp simd
for (int in = k * n; in < n; in+=n)
{
double swap = A[in + k];
A[in + k] = A[in + max.j];
A[in + max.j] = swap;
A[in + k] = A[in + max_j];
A[in + max_j] = swap;
}
}
gauss_inverse(n, k, A, X);
gauss_back_substitution(n, A, X);
}
for (int k = 0; k < n; ++k)
gauss_back_substitution(n, A, X);
for (int k = 0; k < n; ++k)
{
int str_k = k;
int str_i = c[k];
if (str_i != k)
{
int str
while (
#pragma omp parallel for
for (int j = 0; j < n; ++j)
{
double elem = X[k*n + j];
do {
X[str_i*n + j] = elem;
elem = X[str_i*n + j];
str_k = str_i;
str_i = c[str_i];
c[str_k] = str_k;
} while (str_i != k);
X[k*n + j] = elem;
}
}
}
return 0;
}
void gauss_inverse(const int n, const int k, double * restrict A, double * restrict X)
{
const int kn = k*n, const int kk = kn + k;
const int kn = k*n;
const int kk = kn + k;
const double inv_akk = 1./A[kn + k];
A[kn + k] = 1.;
@ -119,7 +153,7 @@ void gauss_back_substitution(const int n, double * restrict A, double * restrict
const int kn = k * n;
#pragma omp parallel for
for (int i = 0; i < j; ++i)
for (int i = 0; i < k; ++i)
{
const int in = i*n;
const double aik = A[in + k];