-
Notifications
You must be signed in to change notification settings - Fork 0
/
lab7b.cpp
83 lines (62 loc) · 1.47 KB
/
lab7b.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
#include <iostream>
#include<conio.h>
#include<cstdlib>
#include <cmath>
using namespace std;
int main(int argc , char *argv[])
{
int n= atoi(argv[1]);
printf("%d",n);
double A[n][n+1] ;
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
if(i==j){
A[i][j]=(double)n/10;}
else{
A[i][j]=(double)rand() / (RAND_MAX + 1.0);
}
}
}
//elimination
for (int i=0; i<n; i++) {
A[i][n]=1;
}
for (int k=0; k<n; k++)
{
for (int i=k+1; i<n; i++)
{
double f = A[i][k]/A[k][k];
for (int j=k+1; j<=n; j++)
A[i][j] -= A[k][j]*f;
A[i][k] = 0;
}
}
//back substitution
double x[n];
for (int i = n-1; i >= 0; i--)
{
x[i] = A[i][n];
for (int j=i+1; j<n; j++)
{
x[i] -= A[i][j]*x[j];
}
x[i] = x[i]/A[i][i];
}
printf("Solution :\n");
double arr[n];
double max = arr[0];
for (int i=0; i<n; i++)
{
printf("%e\n", x[i]);
arr[i]=abs(x[i]-1);
printf("err : %f\n.......", arr[i]);
}
for(int i = 1; i<n; i++)
{
if(arr[i] > max)
max = arr[i];
}
printf("Max error %e\n",max);
getch();
return 0;
}