Advertisement

Computing

, Volume 11, Issue 2, pp 103–110 | Cite as

Minimizing the bandwidth of sparse symmetric matrices

  • K. Y. Cheng
Article

Abstract

The problem of finding symmetric rowcolumn permutations for a given sparse symmetric matrix, such that the resulting matrix has minimum bandwidth, is discussed. An algorithm, which yields a proper choice for an initial ordering and a reordering scheme, is given. An example is given to show how the algorithm works.

Keywords

Computational Mathematic Symmetric Matrix Proper Choice Symmetric Matrice Minimum Bandwidth 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Minimizierung der Bandbreite schwach besetzter symmetrischer Matrizen

Zusammenfassung

Es wird das Problem diskutiert, symmetrische Zeilen- und Spaltenpermutationen einer gegebenen schwach besetzten, symmetrischen Matrix so ausfindig zu machen, daß die sich ergebende Matrix minimale Bandbreite hat. Es wird ein Algorithmus angegeben, der die anfängliche Numerierung und die Umnumerierung richtig auswählt. Ein Beispiel erläutert den Algorithmus.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Cuthill, E., andJ. McKee: Reducing the Bandwidth of Sparse Symmetric Matrices. Proceedings 24 th National Conference of ACM 1969, pp. 157–172.Google Scholar
  2. [2]
    Harary, F.: Sparse Matrices and Graph Theory. In: Large Sparse Sets of Linear Equations (J. K. Reid, ed.), pp. 139–150. London: Academic Press. 1970.Google Scholar
  3. [3]
    Harary, F.: Graph Theory. Reading, Mass.: Addison-Wesley. 1969.Google Scholar

Copyright information

© Springer-Verlag 1973

Authors and Affiliations

  • K. Y. Cheng
    • 1
  1. 1.Department of Applied Mathematics and StatisticsState University of New York at Stony BrookStony BrookU.S.A.

Personalised recommendations