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

Something changed

Browse source
This commit is contained in:
AZEN-SGG 2025-04-08 17:17:06 +03:00
parent ad50f453da
commit abef957004
2 changed files with 9 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

2
2025.04.04/dist/Krivoruchenko_SK/Makefile vendored
View file

@ -23,4 +23,4 @@ gdb: CFLAGS = -mfpmath=sse -std=gnu99 -g
gdb: clean $(TARGET)
clean:
del *.o *.out
rm -f *.o *.out

16
2025.04.04/dist/Krivoruchenko_SK/solve.c vendored
View file

@ -87,7 +87,7 @@ int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c)
// printf("Inverse matrix:\n");
// print_matrix(X, n, n);
gauss_inverse(n, k, A, X);
gauss_inverse(n, k, A, X, eps);
// printf("AFTER GAUSS\n");
// printf("Original matrix:\n");
@ -154,23 +154,23 @@ void gauss_inverse(const int n, const int k, double * restrict A, double * restr
for (int ij = kn; ij < kn + n; ij++)
X[ij] *= inv_akk;
for (int j = 0; j < k; ++j)
for (int j = 0; j < n; ++j)
{
const double xkj = X[kn + j];
double xkj = X[kn + j];
if (fabs(xkj) <= eps)
continue;
xkj *= inv_akk;
X[kn + j] = xkj;
for (int i = k+1; i < n; i++)
X[i*n + j] -= xkj * A[i*n + k];
}
for (int i = k+1; i < n; ++i)
{
const int in = i*n;
const double aik = A[in + k];
A[in + k] = 0;
for (int ij = in, kj = kn; kj < kn + n; ij++, kj++)
X[ij] -= X[kj] * aik;
for (int ij = in+k+1, kj = kk+1; ij < in+n; ij++, kj++)
A[ij] -= A[kj] * aik;