Skip Navigation

The Computer Journal 1965 8(3):264-272; doi:10.1093/comjnl/8.3.264
© 1965 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (29)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Alway, G. G.
Right arrow Articles by Martin, D. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An algorithm for reducing the bandwidth of a matrix of symmetrical configuration

G. G. Alway and D. W. Martin *

Mathematics Division, National Physical Laboratory, Teddington, Middx., UK

An algorithm is described which will reduce the bandwidth of a square matrix with symmetrically disposed coefficients, by permuting the row and columns. A computer program for the algorithm has been used successfully to find the minimum bandwidth of matrices of order 30 or so arising in electrical and hydraulic networks, and for reducing substantially the bandwidth of matrices of order up to 250.


* Mathematics Division, National Physical Laboratory, Teddington, Mddx.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.