| Abstract: | A two-step approach to finite element ordering is introduced. The scheme involves ordering of the finite elements first, based on their adjacency, followed by a local numbering of the nodal variables. The ordering of the elements is performed by the Cuthill-McKee algorithm. This approach takes into consideration the underlying structure of the finite element mesh, and may be regarded as a ‘natural’ finite element ordering scheme. The experimental results show that this two-step scheme is more efficient than the reverse Cuthill-McKee algorithm applied directly to the nodes, in terms of both execution time and the number of fill-in entries, particularly when higher order finite elements are used. In addition to its efficiency, the two-step approach increases modularity and flexibility in finite element programs, and possesses potential application to a number of finite element solution methods. |
