Premium
Automatic element reordering for finite element analysis with frontal solution schemes
Author(s) -
Sloan S. W.,
Randolph M. F.
Publication year - 1983
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620190805
Subject(s) - numbering , element (criminal law) , fortran , algorithm , finite element method , computer science , node (physics) , vertex (graph theory) , sequence (biology) , polygon mesh , basis (linear algebra) , graph , mathematics , theoretical computer science , structural engineering , engineering , geometry , computer graphics (images) , biology , political science , law , genetics , operating system
This paper describes an element reordering algorithm which is suitable for use with a frontal solution package. The procedure is shown to generate efficient element numberings for a wide variety of test examples. In an effort to obtain an optimum elimination order, the algorithm first renumbers the nodes, and then uses this result to resequence the elements. This intermediate step is necessary because of the nature of the frontal solution procedure, which assembles variables on an element‐by‐element basis but eliminates them node by node. To renumber the nodes, a modified version of the King 1 algorithm is used. In order to minimize the number of nodal numbering schemes that need to be considered, the starting nodes are selected automatically by using some concepts from graph theory. Once the optimum numbering sequence has been ascertained, the elements are then reordered in an ascending sequence of their lowest‐numbered nodes. This ensures that the new elimination order is preserved as closely as possible. For meshes that are composed of a single type of high‐order element, it is only necessary to consider the vertex nodes in the renumbering process. This follows from the fact that mesh numberings which are optimal for low‐order elements are also optimal for high‐order elements. Significant economies in the reordering strategy may thus be achieved. A computer implementation of the algorithm, written in FORTRAN IV, is given.