Premium
A new mode renumbering algorithm for bandwidth reduction
Author(s) -
Burgess I. W.,
Lai P. K. F.
Publication year - 1986
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.1620230909
Subject(s) - algorithm , bandwidth (computing) , computer science , matrix (chemical analysis) , reduction (mathematics) , mathematics , telecommunications , materials science , geometry , composite material
A new algorithm is presented for automatic renumbering of systems of interconnected nodes so as to minimize the bandwidth of the connectivity matrix. This is necessary to reduce storage requirements for banded matrix solution techniques. The method is based on those due to Cuthill and McKee 1 and Gibbs, Poole and Stockmeyer. 2 Under test against several other algorithms on a range of 20 examples of various types it always performed at least as well as, and in most cases better than, the best of the other methods. Seven examples are given in the paper, comparing final bandwidths with those produced by seven other algorithms.