An Improved Nodal Ordering for Reducing the Bandwidth in FEM
 
A. Mohseni, H. Moslemi, M.R. Seddighian (DOI: 10.24874/jsscm.2018.12.01.09)
 
Abstract
 
In finite element method, reducing the bandwidth of sparse symmetric matrices plays a keyIn finite element method, reducing the bandwidth of sparse symmetric matrices plays a keyrole to have an efficient solution. This problem can be simulated as a vertex numbering problemon a graph, where each edge represents two connected nodes in finite element mesh. In this paper,a new algorithm is proposed for a nodal ordering of the standard and randomly structured graphsto reduce the bandwidth of sparse symmetric matrices. A fast search algorithm for the location ofpseudo-peripheral nodes is presented. This algorithm results in a bandwidth smaller than or equalto some existing algorithms such as the Cuthill–Mckee (CM) and the modified Gibbs–Poole–Stockmeyer (MGPS). With this approach, the bandwidth is reduced in more than 50% ofinstances of benchmark tests compared with the outcomes of the existing algorithms.