Data Structures

ITNODE Array Definitions

ITNODE for triangulation
array entry	definition
ITNODE(1,I)	first vertex number
ITNODE(2,I)	second vertex number
ITNODE(3,I)	third vertex number
ITNODE(4,I)	reserved for parallel processing
ITNODE(5,I)	element label
ITNODE for skeleton
array entry	definition
ITNODE(1,I)	first vertex number
ITNODE(2,I)	first edge number
ITNODE(3,I)	congruent region number
ITNODE(4,I)	reserved for parallel processing
ITNODE(5,I)	region label

IBNDRY Array Definitions

IBNDRY Array Definition
array entry	definition
IBNDRY(1,I)	first endpoint number
IBNDRY(2,I)	second endpoint number
IBNDRY(3,I)	curved edge switch
IBNDRY(4,I)	edge type
IBNDRY(5,I)	reserved for parallel processing
IBNDRY(6,I)	reserved for parallel processing
IBNDRY(7,I)	edge label
Edge Type Definitions
IBNDRY(3,I)	curved edge type
0	Straight edge
1	Curved edge - circular arc
$-K$	Curved edge - parametric
Curverd Edge Types
IBNDRY(4,I)	edge type
2	Dirichlet boundary
1	natural boundary
0	internal
$-$K	linked with edge K
3, 4, 5	reserved for parallel processing

SF Array Definitions

SF for circular arc
array entry	definition
SF(1,I)	center coordinate $x_c$
SF(2,I)	center coordinate $y_c$
SF for parametric curve
array entry	definition
SF(1,I)	parametric coordinate $s_1$
SF(2,I)	parametric coordinate $s_2$

ITDOF Array Definitions

array entry	definition
ITDOF(1,I)	degree of freedom for vertex $\nu_1$
ITDOF(2,I)	degree of freedom for vertex $\nu_2$
ITDOF(3,I)	degree of freedom for vertex $\nu_3$
ITDOF(4,I)	$\pm$ first degree of freedom for edge $\epsilon_1$
ITDOF(5,I)	$\pm$ first degree of freedom for edge $\epsilon_2$
ITDOF(6,I)	$\pm$ first degree of freedom for edge $\epsilon_3$
ITDOF(7,I)	first interior degree of freedom for element $t_I$
ITDOF(8,I)	polynomial degrees for element $t_I$

GF Array Definitions

problem	1	2	3	4	5	6	7
simple pde	$u$	($u_d$ )	($\omega$ )
obstacle problem	$u$	($\omega$ )
continuation problem	$u$	$u_0$	$\dot{u}$	$\dot{u}_0$	$\psi_r$	$\psi_{\ell}$	($\omega$ )
parameter identification	$u$	$v$	$u_{\lambda}$	($\omega$ )
distributed control	$u$	$v$	$\lambda$	($\omega$ )

IPATH Array Definitions

array entry	root	root/leaf	internal	leaf
IPATH(1,I)	neighbor	neighbor	neighbor	neighbor
IPATH(2,I)	child	-edge	child	-edge
IPATH(3,I)		vertex 1		vertex 1
IPATH(4,I)		vertex 2		vertex 2
IPATH(5,I)		$\pm$ edge		$\pm$ edge
IPATH(6,I)		degree		degree