-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSLE-GJe.c
More file actions
58 lines (48 loc) · 1.04 KB
/
Copy pathSLE-GJe.c
File metadata and controls
58 lines (48 loc) · 1.04 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
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define MAXROW 3
#define MAXCOL 3
#define PI 3.14159
int main (void) {
int i, j, k;
double A[MAXROW][MAXCOL] = { {1,3,2}, {1,2,3}, {2,-1,4}};
double b[MAXROW] = {17,16,13};
double Ab[MAXROW][MAXCOL+1];
double M, L;
for (i=0; i< MAXROW; i++) {
for (j=0; j< MAXCOL; j++) {
Ab[i][j] = A[i][j];
}
Ab[i][j] = b[i];
}
printf("[ [A] [b] ] :\n");
for (i=0; i< MAXROW; i++) {
for (j=0; j< MAXCOL+1; j++) {
printf("%9.3lf", Ab[i][j] );
}
printf("\n");
}
for (i=0; i<MAXROW; i++) {
L = Ab[i][i];
for (j=i; j<MAXCOL+1; j++) {
Ab[i][j] = Ab[i][j]/L;
}
for (k=0; k<MAXROW; k++) {
if (k != i) {
M = -Ab[k][i];
for (j=i; j<MAXCOL+1; j++) {
Ab[k][j] = Ab[k][j] + M*Ab[i][j];
}
}
}
}
printf("[ [A'] [b'] ] :\n");
for (i=0; i< MAXROW; i++) {
for (j=0; j< MAXCOL+1; j++) {
printf("%9.3lf", Ab[i][j] );
}
printf("\n");
}
return EXIT_SUCCESS;
}