forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
fem2d_poisson_cg.html
485 lines (442 loc) · 14.3 KB
/
fem2d_poisson_cg.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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
<html>
<head>
<title>
FEM2D_POISSON_CG - Finite Element 2D, Poisson Equation, Conjugate Gradient Solver
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
FEM2D_POISSON_CG <br>
Finite Element 2D, <br>
Poisson Equation, <br>
Conjugate Gradient Solver
</h1>
<hr>
<p>
<b>FEM2D_POISSON_CG</b>
is a C++ program which
applies the finite element method to solve
a form of Poisson's equation over an arbitrary triangulated region,
using sparse matrix storage and a conjugate gradient solver.
</p>
<p>
The storage format chosen is known as <b>DSP</b> or "sparse triplet" format,
which essentially simply saves in three vectors A, IA, JA, which record the value,
row and column of every nonzero entry.
</p>
<p>
To solve the linear system, the <b>CG_RC</b> routine is used, which uses
reverse communication to carry out a conjugate gradient procedure.
</p>
<h3 align = "center">
The Triangulated Region:
</h3>
<p>
The computational region is unknown by the program. The user
specifies it by preparing a file containing the coordinates of
the nodes, and a file containing the indices of nodes that make
up triangles that form a triangulation of the region.
</p>
<p>
Normally, the user does not type in this information by hand, but has
a program fill in the nodes, and perhaps another program that
constructs the triangulation. However, in the simplest case,
the user might construct a very crude triangulation by hand, and
have <a href = "../../f_src/triangulation_refine/triangulation_refine.html">
TRIANGULATION_REFINE</a> refine it to something more reasonable.
</p>
<p>
For the following ridiculously small example:
<pre>
4----5
|\ |\
| \ | \
| \ | \
| \| \
1----2----3
</pre>
the node file would be:
<pre>
0.0 0.0
1.0 0.0
2.0 0.0
0.0 1.0
1.0 1.0
</pre>
and the triangle file would be
<pre>
1 2 4
5 4 2
2 3 5
</pre>
</p>
<h3 align = "center">
The Poisson Equation:
</h3>
<p>
The program is set up to handle the linear Poisson
equation with a right hand side function, and nonhomogeneous
Dirichlet boundary conditions. The state variable
U(X,Y) is then constrained by:
<pre>
- Del H(x,y) Del U(x,y) + K(x,y) * U(x,y) = F(x,y) inside the region;
U(x,y) = G(x,y) on the boundary.
</pre>
</p>
<h3 align = "center">
User Interface:
</h3>
<p>
To specify the right hand side function F(x,y), the linear
coefficients H(x,y) and K(x,y) and the boundary condition function G(x,y),
the user has to modify a file containing three routines,
<ul>
<li>
<b>void rhs ( int node_num, double node_xy[], double node_rhs[] )</b>
evaluates the right hand side of function F(x,y) at a list of
nodes.
</li>
<li>
<b>void h_coef ( int node_num, double node_xy[], double node_h[] )</b>
evaluates the coefficient function H(x,y) at a list of nodes.
</li>
<li>
<b>void k_coef ( int node_num, double node_xy[], double node_k[] )</b>
evaluates the coefficient function K(x,y) at a list of nodes.
</li>
<li>
<b>void dirichlet_condition ( int node_num, double node_xy[], double node_g[] )</b>
evaluates the Dirichlet boundary condition G(X,Y) at a list of nodes.
</li>
</ul>
</p>
<p>
To run the program, the user compiles the user routines,
links them with <b>FEM2D_POISSON_CG</b>, and runs the executable.
</p>
<p>
The program writes out a file containing an Encapsulated
PostScript image of the nodes and elements, with numbers.
If there are too many nodes, the plot may be too cluttered
to read. For lower values, however, it is
a valuable map of what is going on in the geometry.
</p>
<p>
The program is also able to write out a file containing the
solution value at every node. This file may be used to create
contour plots of the solution.
</p>
<h3 align = "center">
Usage:
</h3>
<p>
Assuming the executable program is called "my_problem", then
the program is executed by
<blockquote>
<b>my_problem</b> <i>prefix</i>
</blockquote>
where prefix is the common filename prefix, so that:
<ul>
<li>
<i>prefix</i><b>_nodes.txt</b> contains the X, Y coordinates of nodes;
</li>
<li>
<i>prefix</i><b>_elements.txt</b> contains triples of node indices that form triangles.
</li>
</ul>
</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_POISSON_CG</b> is available in
<a href = "../../cpp_src/fem2d_poisson_cg/fem2d_poisson_cg.html">a C++ version</a> and
<a href = "../../f_src/fem2d_poisson_cg/fem2d_poisson_cg.html">a FORTRAN90 version</a> and
<a href = "../../m_src/fem2d_poisson_cg/fem2d_poisson_cg.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/cg_rc/cg_rc.html">
CG_RC</a>,
a C++ library which
implements the conjugate gradient method for solving
a positive definite sparse linear system A*x=b, using reverse communication.
</p>
<p>
<a href = "../../cpp_src/fem2d_poisson/fem2d_poisson.html">
FEM2D_POISSON</a>,
a C++ program which
solves Poisson's equation on a triangulated region,
using the finite element method and a banded solver.
</p>
<p>
<a href = "../../cpp_src/fem2d_poisson_sparse/fem2d_poisson_sparse.html">
FEM2D_POISSON_SPARSE</a>,
a C++ program which
solves the steady (time independent) Poisson equation on an arbitrary
2D triangulated region using a version of GMRES for a sparse solver.
</p>
<p>
<a href = "../../cpp_src/fem2d_poisson_cg_baffle/fem2d_poisson_cg_baffle.html">
FEM2D_POISSON_CG_BAFFLE</a>,
a C++ library which
defines the geometry of a channel with 13 hexagonal baffles, as well as boundary
conditions for a given Poisson problem, and is called by
fem2d_poisson_cg as part of a solution procedure.
</p>
<p>
<a href = "../../cpp_src/fem2d_poisson_cg_ell/fem2d_poisson_cg_ell.html">
FEM2D_POISSON_CG_ELL</a>,
a C++ library which
defines the geometry of an L-shaped region, as well as boundary
conditions for a given Poisson problem, and is called by
fem2d_poisson_cg as part of a solution procedure.
</p>
<p>
<a href = "../../cpp_src/fem2d_poisson_cg_lake/fem2d_poisson_cg_lake.html">
FEM2D_POISSON_CG_LAKE</a>,
a C++ library which
defines the geometry of a lake-shaped region, as well as boundary
conditions for a given Poisson problem, and is called by
fem2d_poisson_cg as part of a solution procedure.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Hans Rudolf Schwarz,<br>
Finite Element Methods,<br>
Academic Press, 1988,<br>
ISBN: 0126330107,<br>
LC: TA347.F5.S3313.
</li>
<li>
Gilbert Strang, George Fix,<br>
An Analysis of the Finite Element Method,<br>
Cambridge, 1973,<br>
ISBN: 096140888X,<br>
LC: TA335.S77.
</li>
<li>
Olgierd Zienkiewicz,<br>
The Finite Element Method,<br>
Sixth Edition,<br>
Butterworth-Heinemann, 2005,<br>
ISBN: 0750663200,<br>
LC: TA640.2.Z54
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "fem2d_poisson_cg.cpp">fem2d_poisson_cg.cpp</a>,
the source code;
</li>
<li>
<a href = "fem2d_poisson_cg.sh">fem2d_poisson_cg.sh</a>,
commands to compile the partial program;
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>MAIN</b> is the main program for FEM2D_POISSON_CG.
</li>
<li>
<b>ASSEMBLE_POISSON_DSP</b> assembles the system for the Poisson equation.
</li>
<li>
<b>BASIS_ONE_T3</b> evaluates basis functions for a linear triangular element.
</li>
<li>
<b>CG_RC</b> is a reverse communication conjugate gradient routine.
</li>
<li>
<b>CH_CAP</b> capitalizes a single character.
</li>
<li>
<b>CH_EQI</b> is true if two characters are equal, disregarding case.
</li>
<li>
<b>CH_TO_DIGIT</b> returns the integer value of a base 10 digit.
</li>
<li>
<b>DIAG_INDEX</b> determines where the diagonal matrix entries are stored.
</li>
<li>
<b>DIRICHLET_APPLY_DSP</b> accounts for Dirichlet boundary conditions.
</li>
<li>
<b>DSP_IJ_TO_K</b> seeks the compressed index of the (I,J) entry of A.
</li>
<li>
<b>DSP_PRINT_SOME</b> prints some of a DSP matrix.
</li>
<li>
<b>FILE_COLUMN_COUNT</b> counts the columns in the first line of a file.
</li>
<li>
<b>FILE_ROW_COUNT</b> counts the number of row records in a file.
</li>
<li>
<b>I4_MAX</b> returns the maximum of two I4's.
</li>
<li>
<b>I4_MIN</b> returns the minimum of two I4's.
</li>
<li>
<b>I4_MODP</b> returns the nonnegative remainder of integer division.
</li>
<li>
<b>I4_WRAP</b> forces an integer to lie between given limits by wrapping.
</li>
<li>
<b>I4COL_COMPARE</b> compares columns I and J of an I4COL.
</li>
<li>
<b>I4COL_SORT_A</b> ascending sorts the columns of an I4COL.
</li>
<li>
<b>I4COL_SWAP</b> swaps two columns of an I4COL.
</li>
<li>
<b>I4MAT_DATA_READ</b> reads data from an I4MAT file.
</li>
<li>
<b>I4MAT_HEADER_READ</b> reads the header from an I4MAT file.
</li>
<li>
<b>I4MAT_TRANSPOSE_PRINT_SOME</b> prints some of an I4MAt, transposed.
</li>
<li>
<b>I4VEC_PRINT</b> prints an I4VEC.
</li>
<li>
<b>I4VEC2_COMPARE</b> compares pairs of integers stored in two vectors.
</li>
<li>
<b>I4VEC2_PRINT</b> prints an I4VEC2.
</li>
<li>
<b>I4VEC2_SORT_A</b> ascending sorts a vector of pairs of integers.
</li>
<li>
<b>QUAD_RULE</b> sets the quadrature rule for assembly.
</li>
<li>
<b>R8_ABS</b> returns the absolute value of an R8.
</li>
<li>
<b>R8_HUGE</b> returns a "huge" R8.
</li>
<li>
<b>R8_NINT</b> returns the nearest integer to an R8.
</li>
<li>
<b>R8MAT_DATA_READ</b> reads the data from an R8MAT file.
</li>
<li>
<b>R8MAT_HEADER_READ</b> reads the header from an R8MAT file.
</li>
<li>
<b>R8MAT_TRANSPOSE_PRINT_SOME</b> prints some of an R8MAT, transposed.
</li>
<li>
<b>R8MAT_WRITE</b> writes an R8MAT file.
</li>
<li>
<b>R8VEC_AMAX</b> returns the maximum absolute value in an R8VEC.
</li>
<li>
<b>R8VEC_DOT</b> computes the dot product of a pair of R8VEC's.
</li>
<li>
<b>R8VEC_PRINT_SOME</b> prints "some" of an R8VEC.
</li>
<li>
<b>R8VEC_UNIFORM_01</b> returns a unit pseudorandom R8VEC.
</li>
<li>
<b>REFERENCE_TO_PHYSICAL_T3</b> maps reference points to physical points.
</li>
<li>
<b>S_LEN_TRIM</b> returns the length of a string to the last nonblank.
</li>
<li>
<b>S_TO_I4</b> reads an I4 from a string.
</li>
<li>
<b>S_TO_L</b> reads an L from a string.
</li>
<li>
<b>S_TO_I4VEC</b> reads an I4VEC from a string.
</li>
<li>
<b>S_TO_R8</b> reads an R8 from a string.
</li>
<li>
<b>S_TO_R8VEC</b> reads an R8VEC from a string.
</li>
<li>
<b>S_WORD_COUNT</b> counts the number of "words" in a string.
</li>
<li>
<b>SOLUTION_EVALUATE</b> evaluates the solution at a point in a triangle.
</li>
<li>
<b>SOLVE_CG</b> solves a linear system using the conjugate gradient method.
</li>
<li>
<b>SORT_HEAP_EXTERNAL</b> externally sorts a list of items into ascending order.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
<li>
<b>TRIANGLE_AREA_2D</b> computes the area of a triangle in 2D.
</li>
<li>
<b>TRIANGULATION_ORDER3_ADJ_COUNT</b> counts adjacencies in a triangulation.
</li>
<li>
<b>TRIANGULATION_ORDER3_ADJ_SET2</b> sets adjacencies in a triangulation.
</li>
<li>
<b>TRIANGULATION_ORDER3_BOUNDARY_NODE</b> indicates nodes on the boundary.
</li>
<li>
<b>TRIANGULATION_ORDER3_NEIGHBOR_TRIANGLES</b> determines triangle neighbors.
</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 25 January 2013.
</i>
<!-- John Burkardt -->
</body>
</html>