Comparative study of finite element nodal ordering methods

摘要

Graph theoretical algorithms are presented for finite element nodal ordering to optimize the bandwidth of their stiffness matrices. Nine different graphs are defined for representing the connectivity of FE models and the problem of finite element nodal ordering is trans- formed into that of a graph nodal ordering. All the presented algor- ithms are analyzed and the efficiency of these methods are com- pared through examples of two- and three-dimensional finite element models.