An automatic node relabelling scheme for minimizing a matrix or network bandwidth
- 1 January 1976
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 10 (4) , 787-797
- https://doi.org/10.1002/nme.1620100406
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.Keywords
This publication has 11 references indexed in Scilit:
- Algorithm for Matrix Bandwidth ReductionJournal of the Structural Division, 1972
- An automatic reordering scheme for simultaneous equations derived from network systemsInternational Journal for Numerical Methods in Engineering, 1970
- Efficient Solutions for Linear Matrix EquationsJournal of the Structural Division, 1970
- Reply by Author to J. Barlow and C.G. MarplesAIAA Journal, 1969
- Comment on "An Automatic Node-Relabeling Scheme for Bandwidth Minimization of Stiffness Matrices"AIAA Journal, 1969
- Techniques for Analysis of Large StructuresJournal of the Structural Division, 1968
- An automatic node-relabeling scheme for bandwidth minimization of stiffness matrices.AIAA Journal, 1968
- Matrix bandwidth minimizationPublished by Association for Computing Machinery (ACM) ,1968
- Row-column permutation of sparse matricesThe Computer Journal, 1967
- An algorithm for reducing the bandwidth of a matrix of symmetrical configurationThe Computer Journal, 1965