forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfem2d_pack.html
816 lines (783 loc) · 25.6 KB
/
fem2d_pack.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
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
<html>
<head>
<title>
FEM2D_PACK - Finite Element Routines
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
FEM2D_PACK <br> Finite Element Routines
</h1>
<hr>
<p>
<b>FEM2D_PACK</b>
is a C++ library which
implements the finite element method.
</p>
<p>
The emphasis is on simplicity and clarity.
Only the 2D case is handled, with a choice
of low order triangular and quadrilateral elements.
</p>
<p>
A few routines are included for computing a "sphere grid",
that is, a finite element mesh on the surface of a sphere.
</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_PACK</b> is available in
<a href = "../../c_src/fem2d_pack/fem2d_pack.html">a C version</a> and
<a href = "../../cpp_src/fem2d_pack/fem2d_pack.html">a C++ version</a> and
<a href = "../../f77_src/fem2d_pack/fem2d_pack.html">a FORTRAN77 version</a> and
<a href = "../../f_src/fem2d_pack/fem2d_pack.html">a FORTRAN90 version</a> and
<a href = "../../m_src/fem2d_pack/fem2d_pack.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/fem1d_pack/fem1d_pack.html">
FEM1D_PACK</a>,
a C++ library which
contains utilities for 1D finite element calculations.
</p>
<p>
<a href = "../../data/fem2d/fem2d.html">
FEM2D</a>,
a data directory which
contains examples of 2D FEM files,
three text files that describe a 2D finite element geometry;
</p>
<p>
<a href = "../../cpp_src/fem2d_heat/fem2d_heat.html">
FEM2D_HEAT</a>,
a C++ program which
solves the
time dependent heat equation on the unit square.
</p>
<p>
<a href = "../../cpp_src/fem2d_poisson/fem2d_poisson.html">
FEM2D_POISSON</a>,
a C++ program which
solves Poisson's equation
on a square, using the finite element method.
</p>
<p>
<a href = "../../cpp_src/fem2d_poisson_rectangle_linear/fem2d_poisson_rectangle_linear.html">
FEM2D_POISSON_RECTANGLE_LINEAR</a>,
a C++ program which
solves the 2D Poisson equation on a rectangle, using the finite element method,
and piecewise linear triangular elements.
</p>
<p>
<a href = "../../cpp_src/fem2d_sample/fem2d_sample.html">
FEM2D_SAMPLE</a>,
a C++ library which
evaluates a finite element function defined on an order 3 or order 6 triangulation.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Milton Abramowitz, Irene Stegun,<br>
Handbook of Mathematical Functions,<br>
National Bureau of Standards, 1964,<br>
ISBN: 0-486-61272-4,<br>
LC: QA47.A34.
</li>
<li>
Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart,<br>
LINPACK User's Guide,<br>
SIAM, 1979,<br>
ISBN13: 978-0-898711-72-1.
</li>
<li>
Vladimir Krylov,<br>
Approximate Calculation of Integrals,<br>
Dover, 2006,<br>
ISBN: 0486445798.
</li>
<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>
Arthur Stroud,<br>
Approximate Calculation of Multiple Integrals,<br>
Prentice Hall, 1971,<br>
ISBN: 0130438936,<br>
LC: QA311.S85.
</li>
<li>
Arthur Stroud, Don Secrest,<br>
Gaussian Quadrature Formulas,<br>
Prentice Hall, 1966,<br>
LC: QA299.4G3S7.
</li>
<li>
Olgierd Zienkiewicz,<br>
The Finite Element Method,<br>
Sixth Edition,<br>
Butterworth-Heinemann, 2005,<br>
ISBN: 0750663200.
</li>
<li>
Daniel Zwillinger, editor,<br>
CRC Standard Mathematical Tables and Formulae,<br>
30th Edition,<br>
CRC Press, 1996,<br>
ISBN: 0-8493-2479-3.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "fem2d_pack.cpp">fem2d_pack.cpp</a>, the source code;
</li>
<li>
<a href = "fem2d_pack.hpp">fem2d_pack.hpp</a>, the include file;
</li>
<li>
<a href = "fem2d_pack.sh">fem2d_pack.sh</a>,
commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "fem2d_pack_prb.cpp">fem2d_pack_prb.cpp</a>, the calling program;
</li>
<li>
<a href = "fem2d_pack_prb.sh">fem2d_pack_prb.sh</a>,
commands to compile, link and run the calling program;
</li>
<li>
<a href = "fem2d_pack_prb_output.txt">fem2d_pack_prb_output.txt</a>, the sample output.
</li>
</ul>
</p>
<p>
A number of files are created by the program.
<ul>
<li>
<a href = "fem2d_pack_prb_q4.png">fem2d_pack_prb_q4.png</a>,
a PNG image of a Q4 mesh.
</li>
<li>
<a href = "fem2d_pack_prb_t3.png">fem2d_pack_prb_t3.png</a>,
a PNG image of
a T3 mesh.
</li>
<li>
<a href = "fem2d_pack_prb_t6.png">fem2d_pack_prb_t6.png</a>,
a PNG image of
a T6 mesh.
</li>
<li>
<a href = "sphere_q4_nodes.txt">sphere_q4_nodes.txt</a>,
a node file for a Q4 mesh, which is also a
polygonal surface,
that approximates a sphere.
</li>
<li>
<a href = "sphere_q4_elements.txt">sphere_q4_elements.txt</a>,
an element file for a Q4 mesh, which is also a
polygonal surface,
that approximates a sphere.
</li>
<li>
<a href = "sphere_q9_nodes.txt">sphere_q9_nodes.txt</a>,
a node file for a Q9 mesh
that approximates a sphere.
</li>
<li>
<a href = "sphere_q9_elements.txt">sphere_q9_elements.txt</a>,
an element file for a Q9 mesh
that approximates a sphere.
</li>
<li>
<a href = "sphere_q16_nodes.txt">sphere_q16_nodes.txt</a>,
a node file for a Q16 mesh
that approximates a sphere.
</li>
<li>
<a href = "sphere_q16_elements.txt">sphere_q16_elements.txt</a>,
an element file for a Q16 mesh
that approximates a sphere.
</li>
<li>
<a href = "sphere_t3_nodes.txt">sphere_t3_nodes.txt</a>,
a node file for a T3 mesh, which is also a
polygonal surface,
that approximates a sphere.
</li>
<li>
<a href = "sphere_t3_elements.txt">sphere_t3_elements.txt</a>,
an element file for a T3 mesh, which is also a
polygonal surface,
that approximates a sphere.
</li>
<li>
<a href = "sphere_t6_nodes.txt">sphere_t6_nodes.txt</a>,
a node file for a T6 mesh
that approximates a sphere.
</li>
<li>
<a href = "sphere_t6_elements.txt">sphere_t6_elements.txt</a>,
an element file for a T6 mesh
that approximates a sphere.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>BANDWIDTH_MESH</b> determines the bandwidth of the coefficient matrix.
</li>
<li>
<b>BANDWIDTH_VAR</b> determines the bandwidth for finite element variables.
</li>
<li>
<b>BASIS_11_T3:</b> one basis at one point for a T3 element.
</li>
<li>
<b>BASIS_11_T3_TEST</b> verifies BASIS_11_T3.
</li>
<li>
<b>BASIS_MN_T4:</b> one basis at one point for a T4 element.
</li>
<li>
<b>BASIS_11_T4_TEST</b> verifies BASIS_11_T4.
</li>
<li>
<b>BASIS_11_T6:</b> one basis at one point for the T6 element.
</li>
<li>
<b>BASIS_11_T6_TEST</b> verifies BASIS_11_T6.
</li>
<li>
<b>BASIS_MN_Q4:</b> all bases at N points for a Q4 element.
</li>
<li>
<b>BASIS_MN_Q4_TEST</b> verifies BASIS_MN_Q4.
</li>
<li>
<b>BASIS_MN_T3:</b> all bases at N points for a T3 element.
</li>
<li>
<b>BASIS_MN_T3_TEST</b> verifies BASIS_MN_T3.
</li>
<li>
<b>BASIS_MN_T4:</b> all bases at N points for a T4 element.
</li>
<li>
<b>BASIS_MN_T4_TEST</b> verifies BASIS_MN_T4.
</li>
<li>
<b>BASIS_MN_T6:</b> all bases at N points for a T6 element.
</li>
<li>
<b>BASIS_MN_T6_TEST</b> verifies BASIS_MN_T6.
</li>
<li>
<b>CH_CAP</b> capitalizes a single character.
</li>
<li>
<b>DEGREES_TO_RADIANS</b> converts an angle from degrees to radians.
</li>
<li>
<b>DERIVATIVE_AVERAGE_T3</b> averages derivatives at the nodes of a T3 mesh.
</li>
<li>
<b>DIV_Q4</b> estimates the divergence and vorticity of a discrete field.
</li>
<li>
<b>ELEMENT_CODE</b> returns the code for each element.
</li>
<li>
<b>ELEMENTS_EPS</b> creates an EPS file image of the elements of a grid.
</li>
<li>
<b>GRID_ELEMENT</b> returns the element grid associated with any available element.
</li>
<li>
<b>GRID_ELEMENT_NUM</b> returns the number of elements in a grid.
</li>
<li>
<b>GRID_NODE_NUM</b> returns the number of nodes in a grid.
</li>
<li>
<b>GRID_NODES_01</b> returns an equally spaced rectangular grid of nodes in the unit square.
</li>
<li>
<b>GRID_PRINT</b> prints the elements that form a grid.
</li>
<li>
<b>GRID_Q4_ELEMENT</b> produces a grid of 4 node quadrilaterals.
</li>
<li>
<b>GRID_Q4_ELEMENT_NUM</b> counts the elements in a grid of 4 node quadrilaterals.
</li>
<li>
<b>GRID_Q4_NODE_NUM</b> counts the nodes in a grid of 4 node quadrilaterals.
</li>
<li>
<b>GRID_Q8_ELEMENT</b> produces a grid of 8 node quadrilaterals.
</li>
<li>
<b>GRID_Q8_ELEMENT_NUM</b> counts the elements in a grid of 8 node quadrilaterals.
</li>
<li>
<b>GRID_Q8_NODE_NUM</b> counts the nodes in a grid of 8 node quadrilaterals.
</li>
<li>
<b>GRID_Q9_ELEMENT</b> produces a grid of 9 node quadrilaterals.
</li>
<li>
<b>GRID_Q9_ELEMENT_NUM</b> counts the elements in a grid of 9 node quadrilaterals.
</li>
<li>
<b>GRID_Q9_NODE_NUM</b> counts the nodes in a grid of 9 node quadrilaterals.
</li>
<li>
<b>GRID_Q12_ELEMENT</b> produces a grid of 12 node quadrilaterals.
</li>
<li>
<b>GRID_Q12_ELEMENT_NUM</b> counts the elements in a grid of 12 node quadrilaterals.
</li>
<li>
<b>GRID_Q12_NODE_NUM</b> counts the nodes in a grid of 12 node quadrilaterals.
</li>
<li>
<b>GRID_Q16_ELEMENT</b> produces a grid of 16 node quadrilaterals.
</li>
<li>
<b>GRID_Q16_ELEMENT_NUM</b> counts the elements in a grid of 16 node quadrilaterals.
</li>
<li>
<b>GRID_Q16_NODE_NUM</b> counts the nodes in a grid of 16 node quadrilaterals.
</li>
<li>
<b>GRID_QL_ELEMENT</b> produces a grid of 6 node quadratics/linears.
</li>
<li>
<b>GRID_QL_ELEMENT_NUM</b> counts the elements in a grid of quadratic/linear quadrilaterals.
</li>
<li>
<b>GRID_QL_NODE_NUM</b> counts the nodes in a grid of quadratic/linear quadrilaterals.
</li>
<li>
<b>GRID_SHAPE_2D</b> guesses the shape N1 by N2 of a vector of data.
</li>
<li>
<b>GRID_T3_ELEMENT</b> produces a grid of pairs of 3 node triangles.
</li>
<li>
<b>GRID_T3_ELEMENT_NUM</b> counts the elements in a grid of 3 node triangles.
</li>
<li>
<b>GRID_T3_NODE_NUM</b> counts the nodes in a grid of 3 node triangles.
</li>
<li>
<b>GRID_T4_ELEMENT</b> produces a grid of pairs of 4 node triangles.
</li>
<li>
<b>GRID_T4_ELEMENT_NUM</b> counts the elements in a grid of 4 node triangles.
</li>
<li>
<b>GRID_T4_NODE_NUM</b> counts the nodes in a grid of 4 node triangles.
</li>
<li>
<b>GRID_T6_ELEMENT</b> produces a grid of pairs of 6 node triangles.
</li>
<li>
<b>GRID_T6_ELEMENT_NUM</b> counts the elements in a grid of 6 node triangles.
</li>
<li>
<b>GRID_T6_NODE_NUM</b> counts the nodes in a grid of 6 node triangles.
</li>
<li>
<b>GRID_T10_ELEMENT</b> produces a grid of pairs of 10 node triangles.
</li>
<li>
<b>GRID_T10_ELEMENT_NUM</b> counts the elements in a grid of 10 node triangles.
</li>
<li>
<b>GRID_T10_NODE_NUM</b> counts the nodes in a grid of 10 node triangles.
</li>
<li>
<b>GRID_TEST</b> tests the grid routines.
</li>
<li>
<b>GRID_WIDTH</b> computes the width of a given grid.
</li>
<li>
<b>I4_MAX</b> returns the maximum of two I4's.
</li>
<li>
<b>I4_MIN</b> returns the smaller of two I4's.
</li>
<li>
<b>I4_MODP</b> returns the nonnegative remainder of I4 division.
</li>
<li>
<b>I4_WRAP</b> forces an I4 to lie between given limits by wrapping.
</li>
<li>
<b>I4MAT_TRANSPOSE_PRINT</b> prints an I4MAT, transposed.
</li>
<li>
<b>I4MAT_TRANSPOSE_PRINT_SOME</b> prints some of an I4MAT, transposed.
</li>
<li>
<b>I4MAT_WRITE</b> writes an I4MAT file with no header.
</li>
<li>
<b>I4VEC_PRINT</b> prints an I4VEC.
</li>
<li>
<b>INTERP</b> interpolates a quantity in an element from basis node values.
</li>
<li>
<b>INTERP_TEST</b> tests the interpolation property of an element.
</li>
<li>
<b>LEGENDRE_COM</b> computes abscissas and weights for Gauss-Legendre quadrature.
</li>
<li>
<b>LEGENDRE_SET</b> sets abscissas and weights for Gauss-Legendre quadrature.
</li>
<li>
<b>MAP</b> returns the interpolation matrix for any available element.
</li>
<li>
<b>MAP_TEST</b> tests the map routines.
</li>
<li>
<b>MASS_MATRIX_T6</b> computes the mass matrix, using 6-node triangles.
</li>
<li>
<b>NEXT_BOUNDARY_NODE</b> returns the next boundary node in any element.
</li>
<li>
<b>NEXT_BOUNDARY_NODE_Q4</b> returns the next boundary node in a Q4 element.
</li>
<li>
<b>NEXT_BOUNDARY_NODE_Q8</b> returns the next boundary node in a Q8 element.
</li>
<li>
<b>NEXT_BOUNDARY_NODE_Q9</b> returns the next boundary node in a Q9 element.
</li>
<li>
<b>NEXT_BOUNDARY_NODE_Q12</b> returns the next boundary node in a Q12 element.
</li>
<li>
<b>NEXT_BOUNDARY_NODE_Q16</b> returns the next boundary node in a Q16 element.
</li>
<li>
<b>NEXT_BOUNDARY_NODE_QL</b> returns the next boundary node in a QL element.
</li>
<li>
<b>NEXT_BOUNDARY_NODE_T3</b> returns the next boundary node in a T3 element.
</li>
<li>
<b>NEXT_BOUNDARY_NODE_T4</b> returns the next boundary node in a T4 element.
</li>
<li>
<b>NEXT_BOUNDARY_NODE_T6</b> returns the next boundary node in a T6 element.
</li>
<li>
<b>NEXT_BOUNDARY_NODE_T10</b> returns the next boundary node in a T10 element.
</li>
<li>
<b>NODE_REFERENCE</b> returns the basis nodes for any available element.
</li>
<li>
<b>NODE_REFERENCE_Q4</b> returns the basis nodes for a 4 node quadrilateral.
</li>
<li>
<b>NODE_REFERENCE_Q8</b> returns the basis nodes for an 8 node quadrilateral.
</li>
<li>
<b>NODE_REFERENCE_Q9</b> returns the basis nodes for a 9 node quadrilateral.
</li>
<li>
<b>NODE_REFERENCE_Q12</b> returns the basis nodes for a 12 node quadrilateral.
</li>
<li>
<b>NODE_REFERENCE_Q16</b> returns the basis nodes for a 16 node quadrilateral.
</li>
<li>
<b>NODE_REFERENCE_QL</b> returns the basis nodes for a quadratic/linear.
</li>
<li>
<b>NODE_REFERENCE_T3</b> returns the basis nodes for the 3 node triangle.
</li>
<li>
<b>NODE_REFERENCE_T4</b> returns the basis nodes for the 4 node triangle.
</li>
<li>
<b>NODE_REFERENCE_T6</b> returns the basis nodes for a 6 node triangle.
</li>
<li>
<b>NODE_REFERENCE_T10</b> returns the basis nodes for a 10 node triangle.
</li>
<li>
<b>NS_T6_VAR_COUNT</b> counts the Navier Stokes variables on a T6 grid.
</li>
<li>
<b>NS_T6_VAR_SET</b> sets the Navier Stokes variables on a T6 grid.
</li>
<li>
<b>ORDER_CODE</b> returns the order for each element.
</li>
<li>
<b>PHYSICAL_TO_REFERENCE_T3</b> maps physical points to reference points.
</li>
<li>
<b>POINTS_PLOT</b> plots a pointset.
</li>
<li>
<b>POLY</b> returns the polynomial terms associated with any available element.
</li>
<li>
<b>POLY_Q4</b> returns the monomials associated with a 4 node quadrilateral.
</li>
<li>
<b>POLY_Q8</b> returns the monomials associated with an 8 node quadrilateral.
</li>
<li>
<b>POLY_Q9</b> returns the monomials associated with a 9 node quadrilateral.
</li>
<li>
<b>POLY_Q12</b> returns the monomials associated with a 12 node quadrilateral.
</li>
<li>
<b>POLY_Q16</b> returns the monomials associated with a 16 node quadrilateral.
</li>
<li>
<b>POLY_QL</b> returns the monomials for a quadratic/linear quadrilateral.
</li>
<li>
<b>POLY_T3</b> returns the monomials associated with a 3 node triangle.
</li>
<li>
<b>POLY_T6</b> returns the monomials associated with a 6 node triangle.
</li>
<li>
<b>POLY_T10</b> returns the monomials associated with a 10 node triangle.
</li>
<li>
<b>R8_ABS</b> returns the absolute value of an R8.
</li>
<li>
<b>R8_EPSILON</b> returns the roundoff unit for R8's.
</li>
<li>
<b>R8_HUGE</b> returns a "huge" double precision value.
</li>
<li>
<b>R8_NINT</b> returns the nearest integer to an R8.
</li>
<li>
<b>R8_POWER</b> computes the P-th power of R.
</li>
<li>
<b>R8_UNIFORM_01</b> returns a unit pseudorandom R8.
</li>
<li>
<b>R8GE_FA</b> performs a LINPACK-style PLU factorization of a R8GE matrix.
</li>
<li>
<b>R8GE_INVERSE</b> computes the inverse of a R8GE matrix factored by R8GE_FA.
</li>
<li>
<b>R8MAT_MM</b> multiplies two matrices.
</li>
<li>
<b>R8MAT_PRINT</b> prints an R8MAT, with an optional title.
</li>
<li>
<b>R8MAT_PRINT_SOME</b> prints some of an R8MAT.
</li>
<li>
<b>R8MAT_WRITE</b> writes an R8MAT file with no header.
</li>
<li>
<b>REFERENCE_SAMPLE</b> samples a reference element.
</li>
<li>
<b>REFERENCE_TO_PHYSICAL_Q4</b> maps Q4 reference points to physical points.
</li>
<li>
<b>REFERENCE_TO_PHYSICAL_T3</b> maps T3 reference points to physical points.
</li>
<li>
<b>REFERENCE_TO_PHYSICAL_T6</b> maps T6 reference points to physical points.
</li>
<li>
<b>S_EQI</b> reports whether two strings are equal, ignoring case.
</li>
<li>
<b>S_LEN_TRIM</b> returns the length of a string to the last nonblank.
</li>
<li>
<b>SERENE</b> interpolates data using a Q8 element.
</li>
<li>
<b>SHAPE</b> evaluates shape functions for any available element.
</li>
<li>
<b>SHAPE_Q4</b> evaluates shape functions for a 4 node quadrilateral.
</li>
<li>
<b>SHAPE_Q8</b> evaluates shape functions for an 8 node quadrilateral.
</li>
<li>
<b>SHAPE_Q9</b> evaluates shape functions for a 9 node quadrilateral.
</li>
<li>
<b>SHAPE_Q12</b> evaluates shape functions for a 12 node quadrilateral.
</li>
<li>
<b>SHAPE_Q16</b> evaluates shape functions for a 16 node quadrilateral.
</li>
<li>
<b>SHAPE_QL</b> evaluates shape functions for a 6 node quadratic/linear.
</li>
<li>
<b>SHAPE_T3</b> evaluates shape functions for a 3 node triangle.
</li>
<li>
<b>SHAPE_T4</b> evaluates shape functions for a T4 triangle.
</li>
<li>
<b>SHAPE_T6</b> evaluates shape functions for a 6 node triangle.
</li>
<li>
<b>SHAPE_T10</b> evaluates shape functions for a 10 node triangle.
</li>
<li>
<b>SHAPE_TEST</b> verifies the shape function values at the basis nodes.
</li>
<li>
<b>SPHERE_GRID_ELEMENT_NUM</b> returns the number of elements in a sphere grid.
</li>
<li>
<b>SPHERE_GRID_NODE_NUM</b> returns the number of nodes in a sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q4_ELEMENT</b> produces a Q4 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q4_ELEMENT_NUM</b> counts the elements in a Q4 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q4_NODE_NUM</b> counts nodes in a Q4 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q4_NODE_XYZ</b> produces node coordinates for a Q4 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q9_ELEMENT</b> produces a Q9 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q9_ELEMENT_NUM</b> counts the elements in a Q9 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q9_NODE_NUM</b> counts nodes in a Q9 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q9_NODE_XYZ</b> produces node coordinates for a Q9 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q16_ELEMENT</b> produces a Q16 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q16_ELEMENT_NUM</b> counts the elements in a Q16 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q16_NODE_NUM</b> counts nodes in a Q16 sphere grid.
</li>
<li>
<b>SPHERE_GRID_Q16_NODE_XYZ</b> produces node coordinates for a Q16 sphere grid.
</li>
<li>
<b>SPHERE_GRID_T3_ELEMENT</b> produces a T3 sphere grid.
</li>
<li>
<b>SPHERE_GRID_T3_ELEMENT_NUM</b> counts the elements in a T3 sphere grid.
</li>
<li>
<b>SPHERE_GRID_T3_NODE_NUM</b> counts nodes in a T3 sphere grid.
</li>
<li>
<b>SPHERE_GRID_T3_NODE_XYZ</b> produces node coordinates for a T3 sphere grid.
</li>
<li>
<b>SPHERE_GRID_T6_ELEMENT</b> produces a T6 sphere grid.
</li>
<li>
<b>SPHERE_GRID_T6_ELEMENT_NUM</b> counts the elements in a T6 sphere grid.
</li>
<li>
<b>SPHERE_GRID_T6_NODE_NUM</b> counts nodes in a T6 sphere grid.
</li>
<li>
<b>SPHERE_GRID_T6_NODE_XYZ</b> produces node coordinates for a T6 sphere grid.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
<li>
<b>TRIANGLE_UNIT_SET</b> sets a quadrature rule in a unit triangle.
</li>
<li>
<b>TRIANGLE_UNIT_SIZE</b> returns the "size" of a unit triangle quadrature rule.
</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 16 August 2009.
</i>
<!-- John Burkardt -->
</body>
</html>