-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
113 lines (92 loc) · 2.25 KB
/
main.cpp
File metadata and controls
113 lines (92 loc) · 2.25 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <iostream>
#include <fstream>
#include <iomanip>
bool readFile(std::ifstream& file, double** matrix, double* b, int N) {
while (!file.eof()) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
file >> matrix[i][j];
}
file >> b[i];
}
}
return true;
}
void printMatrix(double** matrix, double* b, int N) {
std::cout.setf(std::ios::fixed);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
std::cout << std::setprecision(3) << matrix[i][j] << '\t';
}
std::cout << std::setprecision(3) << b[i] << '\n';
}
std::cout << '\n';
}
void printArray(double* arr, int N) {
std::cout.setf(std::ios::fixed);
for (int i = 0; i < N; i++) {
std::cout << "x" << i + 1 << " = " << std::setprecision(3) << arr[i] << '\n';
}
}
double* TridiagonalMatrixAlgorithm(double** matrix, double* d, int N) {
double* a = new double[N];
double* b = new double[N];
double* x = new double[N];
double tmp, max;
int idx;
for (int i = 0; i < N; i++) {
a[i] = 0;
b[i] = 0;
}
// Êîýôôèöèåíòû äëÿ ïåðâîé ñòðîêè
a[0] = -matrix[0][1] / matrix[0][0];
b[0] = d[0] / matrix[0][0];
// Ïðÿìîé õîä
for (int i = 1; i < N - 1; i++) {
tmp = matrix[i][i - 1] * a[i - 1] + matrix[i][i];
a[i] = -matrix[i][i + 1] / tmp;
b[i] = (d[i] - matrix[i][i - 1] * b[i - 1]) / tmp;
}
// Êîýôôèöèåíòû äëÿ ïîñëåäíåé ñòðîêè
a[N - 1] = 0;
b[N - 1] = (d[N - 1] - matrix[N - 1][N - 2] * b[N - 2]) / (matrix[N - 1][N - 2] * a[N - 2] + matrix[N - 1][N - 1]);
// Îáðàòíûé õîä
for (int i = N - 1; i >= 0; i--) {
x[i] = a[i] * x[i + 1] + b[i];
}
delete[] a;
delete[] b;
return x;
}
int main() {
std::ifstream file("input.txt");
if (!file) {
std::cout << "File input.txt not found";
return -1;
}
int N;
file >> N;
if (N < 1) {
std::cout << "Error while reading input.txt. Invalid matrix dimension.";
return -2;
}
double** matrix = new double* [N];
for (int i = 0; i < N; i++) {
matrix[i] = new double[N];
}
double* b = new double[N];
double* x;
readFile(file, matrix, b, N);
std::cout << "Init matrix:\n";
printMatrix(matrix, b, N);
x = TridiagonalMatrixAlgorithm(matrix, b, N);
std::cout << "Solve:\n";
printArray(x, N);
for (int i = 0; i < N; i++) {
delete[] matrix[i];
}
delete[] matrix;
delete[] b;
delete[] x;
return 0;
}