Next: Coefficient Functions Up: quick_ref Previous: quick_ref

# 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 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 SF(2,I) center coordinate SF for parametric curve array entry definition SF(1,I) parametric coordinate SF(2,I) parametric coordinate

ITDOF Array Definitions

 array entry definition ITDOF(1,I) degree of freedom for vertex ITDOF(2,I) degree of freedom for vertex ITDOF(3,I) degree of freedom for vertex ITDOF(4,I) first degree of freedom for edge ITDOF(5,I) first degree of freedom for edge ITDOF(6,I) first degree of freedom for edge ITDOF(7,I) first interior degree of freedom for element ITDOF(8,I) polynomial degrees for element

GF Array Definitions

 problem 1 2 3 4 5 6 7 simple pde ( ) ( ) obstacle problem ( ) continuation problem ( ) parameter identification ( ) distributed control ( )

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) edge edge IPATH(6,I) degree degree

Next: Coefficient Functions Up: quick_ref Previous: quick_ref
Randolph Bank 2012-05-17