CompetitiveProgramming/NumericalMethods_JacobiIterationMethod.cpp at master · Mohaymin/CompetitiveProgramming · GitHub

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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
/// JACOBI ITERATION METHOD
#include<bits/stdc++.h>
using namespace std;
#define ITERATION_TIMES 100

typedef double dd;


int main()
{
    //freopen("_in.txt", "r", stdin);
    int N;
    cout << "ENTER NUMBER OF EQUATIONS = ";
    cin >> N;

    dd matrix[N][N+1];
    dd root[N];

    cout << "ENTER COEFFICENTS OF EQUATIONS = ";
    puts("");
    for(int i=0; i<N; i++)
    {
        for(int j=0; j<=N; j++)
        {
            cin >> matrix[i][j];
        }
    }

    ////////////////////JACOBI-ITERATION METHOD
    dd oldRoot[N] = {0};
    dd sum;
    for(int k=0; k<ITERATION_TIMES; k++)
    {
        for(int i=0; i<N; i++)
        {
            sum = matrix[i][N]/matrix[i][i];
            //printf("Initial Sum: %lf\n", sum);
            for(int j=0; j<N; j++)
            {
                if(i!=j)
                {
                    //printf("x%d = %lf  coeff = %lf  denominator = %lf \n", j, oldRoot[j], matrix[i][j], matrix[i][i]);
                    sum = sum - matrix[i][j]*oldRoot[j]/matrix[i][i];
                }
            }
            root[i] = sum;
            //cout << "ROOT-" << i << ": " << root[i] << endl;
            //oldRoot[i] = root[i];
        }
        for(int i=0; i<N; i++)
        {
            oldRoot[i] = root[i];
        }
        //cout << endl;
    }
    int len = printf("SOLUTION OF THE GIVEN SYSTEM:");
    for(int i=0; i<N; i++)
    {
        cout << "x" << i+1 << " ";
        cout << root[i] << endl;
        for(int j=0; j<len; j++)
            cout << " ";
    }
    return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define ITERATION_TIMES 100

typedef double dd;


int main()
{
    //freopen("_in.txt", "r", stdin);
    int N;
    cout << "ENTER NUMBER OF EQUATIONS = ";
    cin >> N;

    dd matrix[N][N+1];
    dd root[N];

    cout << "ENTER COEFFICENTS OF EQUATIONS = ";
    puts("");
    for(int i=0; i<N; i++)
    {
        for(int j=0; j<=N; j++)
        {
            cin >> matrix[i][j];
        }
    }

    ////////////////////JACOBI-ITERATION METHOD
    dd oldRoot[N] = {0};
    dd sum;
    for(int k=0; k<ITERATION_TIMES; k++)
    {
        for(int i=0; i<N; i++)
        {
            sum = matrix[i][N]/matrix[i][i];
            //printf("Initial Sum: %lf\n", sum);
            for(int j=0; j<N; j++)
            {
                if(i!=j)
                {
                    //printf("x%d = %lf  coeff = %lf  denominator = %lf \n", j, oldRoot[j], matrix[i][j], matrix[i][i]);
                    sum = sum - matrix[i][j]*oldRoot[j]/matrix[i][i];
                }
            }
            root[i] = sum;
            //cout << "ROOT-" << i << ": " << root[i] << endl;
            //oldRoot[i] = root[i];
        }
        for(int i=0; i<N; i++)
        {
            oldRoot[i] = root[i];
        }
        //cout << endl;
    }
    int len = printf("SOLUTION OF THE GIVEN SYSTEM:");
    for(int i=0; i<N; i++)
    {
        cout << "x" << i+1 << " ";
        cout << root[i] << endl;
        for(int j=0; j<len; j++)
            cout << " ";
    }
    return 0;
}