Premium
An automatic node relabelling scheme for minimizing a matrix or network bandwidth
Author(s) -
Akhras Georges,
Dhatt Gouri
Publication year - 1976
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.1620100406
Subject(s) - bandwidth (computing) , computer science , node (physics) , algorithm , sparse matrix , matrix (chemical analysis) , scheme (mathematics) , reliability (semiconductor) , computer network , mathematics , engineering , physics , mathematical analysis , power (physics) , materials science , structural engineering , quantum mechanics , composite material , gaussian
Abstract An automatic algorithm is presented for reducing the bandwidth of symmetric sparse connectivity matrices. The procedure takes an arbitrary input sequence and creates an optimal bandwidth for complex network systems by renumbering the node labels. Thus, considerable improvement for computer storage and time is achieved in the solution of the systems. A large number of examples is presented to demonstrate the reliability and the efficiency of the method.