Tetrahedral Grid Generators and the Eigenvalue Calculation with Edge Elements

Abstract

Abstract. In this work we investigate some computational aspects of the eigenvalue calculation with edge elements; those include: the importance of the grid generator and node-edge numbering. As the examples show, the sparse structure of the mass and stiffness matrices is highly influenced by the edge numbering. Tetrahedral grid generators are mainly designed for nodal based finite elements so an edge numbering is required. Two different edge numbering schemes are tested with six different grid generators. Significant bandwidth reduction can be obtained by the proper combination of the edge numbering scheme with the grid generator method. Moreover, an ordering algorithm such as the Reverse Cuthill McKee can improve the bandwidth reduction which is necessary to reduce storage requirements.