On a Data Structure for Adaptive Finite Element Mesh Refinements

A general labeled tree structure is introduced for a class of nonuniform two-dimensmnal fimte element meshes After defimtmn of the bamc structure, the fundamental access algomthms on the tree are presented m detail. Then the principal algorithms needed for the fimte element computatmns are discussed, including the refinement of the mesh, the computatmn of the elemental stiffness matrices, and the assembly and decomposltmn of the global stiffness matrices based on nested dlssectmn techniques Various possible extensmns of the structure are also given.