forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfem2d_heat_square.html
228 lines (208 loc) · 6.11 KB
/
fem2d_heat_square.html
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
<html>
<head>
<title>
FEM2D_HEAT_SQUARE - A Problem in a Square Region for FEM2DHEAT
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
FEM2D_HEAT_SQUARE <br> A Problem in a Square Region for FEM2D_HEAT_
</h1>
<hr>
<p>
<b>FEM2D_HEAT_SQUARE</b> is a C++ library which
defines the data associated with a time-dependent heat equation
problem in a square region, to be linked and executed with the
<b>FEM2D_HEAT</b> program.
</p>
<p>
This mesh uses 81 nodes and forms 32 quadratic triangular elements.
</p>
<p>
We assume that the equation to be solved is
<blockquote><b>
dUdT - Laplacian U + K * U = F
</b></blockquote>
with
<blockquote><b>
K = 0,
</b></blockquote>
and
<blockquote><b>
F = (2*pi*pi-1)*sin(pi*x)*sin(pi*y)*exp(-t).
</b></blockquote>
The exact solution is:
<blockquote><b>
U = sin(pi*x) * sin(pi*y) * exp(-t).
</b></blockquote>
which is the formula we use to define our functions <b>G</b>
(for the boundary conditions) and <b>H</b> (for the initial
conditions).
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>FEM2D_HEAT_SQUARE</b> is available in
<a href = "../../cpp_src/fem2d_heat_square/fem2d_heat_square.html">a C++ version</a> and
<a href = "../../f_src/fem2d_heat_square/fem2d_heat_square.html">a FORTRAN90 version</a> and
<a href = "../../m_src/fem2d_heat_square/fem2d_heat_square.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "square.cpp">square.cpp</a>,
the user-supplied routines to evaluate the right hand side,
linear coefficient, initial and boundary conditions;
</li>
<li>
<a href = "square.sh">square.sh</a>,
commands to compile the user routines, link them with
the partial program, and run the program;
</li>
<li>
<a href = "square_output.txt">square_output.txt</a>,
output from a run of the program;
</li>
<li>
<a href = "square_nodes.png">square_nodes.png</a>,
a PNG image of
the nodes;
</li>
<li>
<a href = "square_nodes.txt">square_nodes.txt</a>,
a text file containing a list, for each node, of its X and Y
coordinates;
</li>
<li>
<a href = "square_elements.png">square_elements.png</a>,
a PNG image of
the elements;
</li>
<li>
<a href = "square_elements.txt">square_elements.txt</a>,
a text file containing a list, for each element, of the six
nodes that compose it;
</li>
<li>
<a href = "square_time.txt">square_time.txt</a>,
a text file containing the solution times;
</li>
<li>
<a href = "u0000.txt">u0000.txt</a>,
the solution U at time step 0;
</li>
<li>
<a href = "u0001.txt">u0001.txt</a>,
the solution U at time step 1;
</li>
<li>
<a href = "u0002.txt">u0002.txt</a>,
the solution U at time step 2;
</li>
<li>
<a href = "u0003.txt">u0003.txt</a>,
the solution U at time step 3;
</li>
<li>
<a href = "u0004.txt">u0004.txt</a>,
the solution U at time step 4;
</li>
<li>
<a href = "u0005.txt">u0005.txt</a>,
the solution U at time step 5;
</li>
<li>
<a href = "u0006.txt">u0006.txt</a>,
the solution U at time step 6;
</li>
<li>
<a href = "u0007.txt">u0007.txt</a>,
the solution U at time step 7;
</li>
<li>
<a href = "u0008.txt">u0008.txt</a>,
the solution U at time step 8;
</li>
<li>
<a href = "u0009.txt">u0009.txt</a>,
the solution U at time step 9;
</li>
<li>
<a href = "u0010.txt">u0010.txt</a>,
the solution U at time step 10;
</li>
</ul>
</p>
<p>
The MATLAB program <b>CONTOUR_SEQUENCE4</b> can make contour
plots from the sequence of solutions:
<ul>
<li>
<a href = "u0000.png">u0000.png</a>,
the solution U at time step 0;
</li>
<li>
<a href = "u0001.png">u0001.png</a>,
the solution U at time step 1;
</li>
<li>
<a href = "u0002.png">u0002.png</a>,
the solution U at time step 2;
</li>
<li>
<a href = "u0003.png">u0003.png</a>,
the solution U at time step 3;
</li>
<li>
<a href = "u0004.png">u0004.png</a>,
the solution U at time step 4;
</li>
<li>
<a href = "u0005.png">u0005.png</a>,
the solution U at time step 5;
</li>
<li>
<a href = "u0006.png">u0006.png</a>,
the solution U at time step 6;
</li>
<li>
<a href = "u0007.png">u0007.png</a>,
the solution U at time step 7;
</li>
<li>
<a href = "u0008.png">u0008.png</a>,
the solution U at time step 8;
</li>
<li>
<a href = "u0009.png">u0009.png</a>,
the solution U at time step 9;
</li>
<li>
<a href = "u0010.png">u0010.png</a>,
the solution U at time step 10;
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 30 August 2006.
</i>
<!-- John Burkardt -->
</body>
</html>