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

Замедлил

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

6
2025.04.04/dist/Krivoruchenko_SK/Makefile vendored
View file

@ -10,17 +10,17 @@ WFLAGS = -fstack-protector-all -W -Wall -Wextra -Wunused \
CFLAGS = -mfpmath=sse -std=gnu99 -O3 CFLAGS = -mfpmath=sse -std=gnu99 -O3
TARGET = a.out TARGET = a.exe
OBJ = main.o solve.o array_io.o init_f.o matrix.o OBJ = main.o solve.o array_io.o init_f.o matrix.o
%.o: %.c %.o: %.c
gcc $(CFLAGS) $(WFLAGS) -c $< -o $@ gcc $(CFLAGS) $(WFLAGS) -c $< -o $@
$(TARGET): $(OBJ) $(TARGET): $(OBJ)
gcc $^ -o $@ -lm gcc $^ -o $@ -lm -lssp
gdb: CFLAGS = -mfpmath=sse -std=gnu99 -g gdb: CFLAGS = -mfpmath=sse -std=gnu99 -g
gdb: clean $(TARGET) gdb: clean $(TARGET)
clean: clean:
rm -f *.o *.out del -f *.o *.exe

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

@ -143,17 +143,15 @@ void gauss_inverse(const int n, const int k, double * restrict A, double * restr
const int kn = k*n; const int kn = k*n;
const int kk = kn + k; const int kk = kn + k;
const double inv_akk = 1./A[kk]; const double inv_akk = 1./A[kk];
A[kk] = 1.;
if (eps > DBL_EPSILON) if (eps > DBL_EPSILON)
eps = DBL_EPSILON; eps = DBL_EPSILON;
for (int ij = kk+1; ij < kn+n; ij++) // Делим на A[k][k]
A[ij] *= inv_akk; for (int kj = kk+1; kj < kn+n; kj++)
A[kj] *= inv_akk;
for (int ij = kn; ij < kn + n; ij++)
X[ij] *= inv_akk;
// Меняем обратную матрицу
for (int j = 0; j < n; ++j) for (int j = 0; j < n; ++j)
{ {
double xkj = X[kn + j]; double xkj = X[kn + j];
@ -189,7 +187,6 @@ void gauss_back_substitution(const int n, double * restrict A, double * restrict
{ {
const int in = i*n; const int in = i*n;
const double aik = A[in + k]; const double aik = A[in + k];
A[in + k] = 0;
for (int j = 0; j < n; ++j) for (int j = 0; j < n; ++j)
X[in + j] -= X[kn + j] * aik; X[in + j] -= X[kn + j] * aik;