-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgaussJordan.c
98 lines (75 loc) · 1.76 KB
/
gaussJordan.c
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
#include "matrix.h"
#include <math.h>
void gaussJordan(matrix *A, matrix *x, matrix *b, int n) {
int i, j, k;
double soma, alfa;
printf("\nEntrada - Eliminação de Gauss-Jordan\n");
printf("\nA =\n");
printMatrix(A);
printf("\nx =\n");
printMatrix(x);
printf("\nb =\n");
printMatrix(b);
for(k=1; k<=n; k++){
// escolha do pivô
double max = 0;
int kk = 0;
for(i=k; i<=n; i++){
//printf("%d,%d\n",i,k);
double a_ik;
getElement(A, i, k, &a_ik);
if (fabs(a_ik) > max){
max = fabs(a_ik);
kk = i;
}
}
//printf("max = %f\n", max);
//printf("kk = %d\n", kk);
if(kk == 0){
printf("O sistema não tem solução única.\n");
}
matrixSwapLines(A, n, k, kk); // swap lines k and k from matrix A of order n
matrixSwapLines(b, 1, k, kk); // swap lines k and k from vector b of n lines
/*
printf("\nPasso %d - inicio:\n \nA =\n",k);
printMatrix(A);
printf("\nx =\n");
printMatrix(x);
printf("\nb =\n");
printMatrix(b);
*/
double a_kk;
getElement(A, k, k, &a_kk);
for(j=k; j<=n; j++){
double a_kj;
getElement(A, k, j, &a_kj);
setElement(A, k, j, a_kj / a_kk);
}
double b_k;
getElement(b, k, 1, &b_k);
setElement(b, k, 1, b_k / a_kk);
for(i=1; i<=n; i++){
if(i != k){
double a_ik;
getElement(A, i, k, &a_ik);
for(j=k; j<=n; j++){
double a_ij, a_kj;
getElement(A, i, j, &a_ij);
getElement(A, k, j, &a_kj);
setElement(A, i, j, a_ij - a_kj * a_ik);
}
double b_i, b_k;
getElement(b, i, 1, &b_i);
getElement(b, k, 1, &b_k);
setElement(b, i, 1, b_i - b_k * a_ik);
}
}
}
printf("\nSaída - Eliminação de Gauss-Jordan\n");
printf("\nA =\n");
printMatrix(A);
printf("\nx =\n");
printMatrix(x);
printf("\nb =\n");
printMatrix(b);
}