A new bandwidth reduction algorithm and a profile reduction algorithm are proposed for nodal numbering of the finite element models. A number of examples are presented to illustrate the efficiency and reliability of the algorithms.
The bandwidth reduction algorithm proposed is based on the graph theory of measuring the adjacency of nodes or elements. The concept of wavefront and goal bandwidth is incorporated in the algorithm. From the examples it is concluded that it is more reliable and effective than the Gibes-Poole-Stockmeyer algorithm which is a widely-used algorithm, though it requires slightly more CPU time.
The profile reduction algorithm also utilizes the adjacency between nodes. A simple and effective ordering scheme is proposed where nodes which do not introduce a new element are numbered first and then the most adjacent node to the numbered nodes are labelled. Examples show that profiles are reduced considerably comparing with the existing algorithms and this feature become more certain for large problems and for problems with higher order elements.
