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

G. G. Alway

The Computer Journal · 1965 · 51 citations · 0 references

DOIFull text

Open access

Concepts

Abstract

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.