On a Data Structure for Adaptive Finite Element Mesh Refinements.
MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER
Pagination or Media Count:
A general labelled tree structure is introduced for a class of nonuniform two-dimensional finite element meshes. The theoretical basis of the structure and the fundamental access algorithms on the tree are presented in a manner which lends itself to extensions to higher dimensions. For use in finite element computations, the tree is truncated considerably and then the principal, relevant algorithms are discussed, including the refinement of the mesh, the computation of the elemental stiffness matrices, and the assembly and decomposition of the global stiffness matrices based on nested dissection techniques. An outlook to various possible extensions of the structure is also given. Author
- Theoretical Mathematics
- Computer Programming and Software