Another algorithm for reducing bandwidth and profile of a sparse matrix

Authors:
W. F. Smyth;Ilona Arany
Affiliations:
International Labor Office, Geneva, Switzerland;Computing Center of the Ministry of Labor, Budapest, Hungary
Venue:
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Year:
1976

Citing 2
Cited 0

A Survey of Indexing Techniques for Sparse Matrices

ACM Computing Surveys (CSUR)
Reducing the bandwidth of sparse symmetric matrices

ACM '69 Proceedings of the 1969 24th national conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

The paper describes a new bandwidth reduction method for sparse matrices which promises to be both fast and effective in comparison with known methods. The algorithm operates on the undirected graph corresponding to the incidence matrix induced by the original sparse matrix, and separates into three distinct phases: (1) determination of a spanning tree of maximum length, (2) modification of the spanning tree into a free level structure of small width, (3) level-by-level numbering of the level structure. The final numbering produced corresponds to a renumbering of the rows and columns of a sparse matrix so as to concentrate non-zero elements of the matrix in a band about the main diagonal.