30DayProject/1dFEM_dir_neu.cpp at master · vipulramk/30DayProject · 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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#include <iostream>
#include <vector>

using namespace std;

int main()
{
	cout << "program start" << endl;

		// Inputs
		/* meshing inputs */
		double  length= 0.1 /*[m]*/, element_size_of_first_element ;
		int no_of_elements=10 ;
		float scaling_factor=1 ;
		double Force= 1e+11 /*[N(m^-4)]*/;
		/*propetries of the fluid*/
		double E= 1e+11 /*[Pa]*/, A= 1e-4 /*[m^2]*/ ;
		/*boundary conditions*/
		double field_value_at_x0= 0;
		double flux_at_n= 10e+11;
		double dx;

		vector<double> element_size(no_of_elements);

		dx=length/no_of_elements;

		cout << dx << endl;

		if (scaling_factor = 1)
		{
			for (int i = 0; i < no_of_elements; ++i)
			{
				element_size[i] = dx;
            	cout << "size od element" << i<<" 	"<<element_size[i] << endl;

			}
		}

		if (scaling_factor != 1)
		{
			element_size[1]= dx;
			for (int i=2; i <= no_of_elements; i = i+1)	{
				element_size[i] = scaling_factor * (element_size[i-1]);

			}
		}

		vector<double> middle(no_of_elements);
		vector<double> up(no_of_elements-1), down(no_of_elements-1,0.);


		for (int i=0; i < no_of_elements ; i=i+1)
		{
			middle[i] = (E*A) * ( (1/element_size[i]) + (1/element_size[i+1]) );
		}
		middle[no_of_elements-1]=(E*A)/element_size[no_of_elements-1];


		for (int i = 0; i < no_of_elements; i++)
		{
			cout << "middle matrix  " << i << "\t" << middle [i] << endl;
		}


		for (int i=0; i < no_of_elements ; i=i+1)
		{
			up[i] = -1* ( (E*A)/element_size[i+1] );
			down[i+1]=up[i];
            cout << "down matrix  " << i << "\t" << down[i] << endl;
		}


		//RHS(right hand side) = Force terms + Boundary Conditions
		/*Force terms*/

		vector<double> f(no_of_elements);


		for (int i = 0; i < no_of_elements ; i=i+1)
		{
			f[i]=( (Force*(element_size[i]+element_size[i+1])*A) / 2 );
			cout << "force  " << i << "\t" <<  f[i] << endl;
		}

		/*Boundary Conditions*/
		vector<double> Boundary(no_of_elements,0.);
		Boundary[0]=field_value_at_x0;

		std::vector<double> flux(no_of_elements,0.);
		flux[no_of_elements]= flux_at_n;
		cout << "t=		" <<flux[no_of_elements] << endl;

		/*total RHS*/
		vector<double> RHS(no_of_elements);
		for (int i = 0; i < no_of_elements; i++)
		{
			RHS[i] =f[i] + (E*A*Boundary[i]/element_size[i]) + flux[i];
			cout << "rhs values  "  << i << "\t" << RHS[i] << "      b  "  << Boundary[i] << "       f "  << f[i] << endl;
		}


		//LU Decomposition-- Thomas Algorithm
		vector<double> up_new(no_of_elements-2);
		vector<double> Force_new(no_of_elements-1);

    	//FORWARD DECOMPOSITION
		up_new[0]= up[0]/middle[0];
		Force_new[0] = RHS[0]/middle[0];

		cout << "changed up  " << up_new[0] << endl;

		for (int i=1; i < no_of_elements-1 ; i=i+1)
		{
			up_new[i]=up[i]/((middle[i])-(down[i]*up_new[i-1]));
			cout << "changed up  " << i << "\t" << up_new[i] << endl;
		}
		cout << "CHANGED RHS  "  << Force_new[0] << endl;

		for (int i=1; i < no_of_elements ; i=i+1)
		{
			Force_new[i]= ((RHS[i])-(Force_new[i-1]*down[i])) / ((middle[i])-(down[i]*up_new[i-1]));
			cout << "CHANGED RHS  "  << i << "\t" << Force_new[i] << endl;
		}

    	//BACKWORD SUBSTITUTION.
		vector<double> field_value(no_of_elements);

		field_value[no_of_elements-1] = Force_new[no_of_elements-1];

		for (int i=no_of_elements-2; i>=0; i=i-1){
			field_value[i] = Force_new[i]-( up_new[i]*field_value[i+1] );
			cout << "field  " << i << "\t" << field_value[i] << endl;
		}


		for (int i = 0; i < no_of_elements; ++i)
		{
			cout <<"field" << field_value[i] << endl;
		}

		return 0;


return 0;
}