-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGaussPivoting.cpp
93 lines (84 loc) · 2.03 KB
/
GaussPivoting.cpp
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
#include <bits/stdc++.h>
using namespace std;
#define N 3
int forwardElim(double mat[N][N + 1]);
void backSub(double mat[N][N + 1]);
void gaussianElimination(double mat[N][N + 1])
{
int singular_flag = forwardElim(mat);
if (singular_flag != -1)
{
printf("Singular Matrix.\n");
if (mat[singular_flag][N])
printf("Inconsistent System.");
else
printf("May have infinitely many "
"solutions.");
return;
}
backSub(mat);
}
void swap_row(double mat[N][N + 1], int i, int j)
{
for (int k = 0; k <= N; k++)
{
double temp = mat[i][k];
mat[i][k] = mat[j][k];
mat[j][k] = temp;
}
}
void print(double mat[N][N + 1])
{
for (int i = 0; i < N; i++, printf("\n"))
for (int j = 0; j <= N; j++)
printf("%lf ", mat[i][j]);
printf("\n");
}
int forwardElim(double mat[N][N + 1])
{
for (int k = 0; k < N; k++)
{
int i_max = k;
int v_max = mat[i_max][k];
for (int i = k + 1; i < N; i++)
if (abs(mat[i][k]) > v_max)
v_max = mat[i][k], i_max = i;
if (!mat[k][i_max])
return k;
if (i_max != k)
swap_row(mat, k, i_max);
for (int i = k + 1; i < N; i++)
{
double f = mat[i][k] / mat[k][k];
for (int j = k + 1; j <= N; j++)
mat[i][j] -= mat[k][j] * f;
mat[i][k] = 0;
}
}
return -1;
}
void backSub(double mat[N][N + 1])
{
double x[N];
for (int i = N - 1; i >= 0; i--)
{
x[i] = mat[i][N];
for (int j = i + 1; j < N; j++)
{
x[i] -= mat[i][j] * x[j];
}
x[i] = x[i] / mat[i][i];
}
printf("\nSolution for the system:\n");
for (int i = 0; i < N; i++)
printf("%lf\n", x[i]);
}
int main()
{
/* input matrix */
double mat[N][N + 1] = {{2, 2, 1, 6},
{4, 2, 3, 4},
{1, 1, 1, 0}};
gaussianElimination(mat);
return 0;
}