Skip to main content
SpringerLink
Log in

Note on minimizing the bandwidth of sparse, symmetric matrices

Bemerkung zu dem Problem der Minimisierung der Bandbreite schwach besetzter symmetrischer Matrizen

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The case where more than one initial numberings is possible when minimizing the bandwidth of a given sparse symmetric matrix by a directed method, is discussed. It is shown that for a little extra cost there is a significant reduction in the bandwidth.

Zusammenfassung

Es wird der Fall diskutiert, daß mehr als eine erste Numerierung im Problem der Minimisierung der Bandbreite einer gegebenen schwach besetzten symmetrischen Matrix mittels eines gerichteten Verfahrens möglich ist. Gezeigt wird, daß ohne große Vermehrung der Kosten die Bandbreite bedeutend verkleinert werden kann.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cuthill, E., andJ. McKee: Reducing the Bandwidth of Sparse Symmetric Matrices. Proceedings 24th National Conference ACM 1969, pp. 157–172.

  2. Cheng, K. Y.: Minimizing the Bandwidth of Sparse Symmetric Matrices. Computing forthcoming (1973).

  3. Arany, I., W. F. Smyth, andL. Szoda: An Improved Method for Reducing the Bandwidth of Sparse, Symmetric Matrices. IFIP Conference, Ljubljana, August, 1971.

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, 11790, Stony Brook, NY, U.S.A.

    K. Y. Cheng

Authors
  1. K. Y. Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, K.Y. Note on minimizing the bandwidth of sparse, symmetric matrices. Computing 11, 27–30 (1973). https://doi.org/10.1007/BF02239468

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02239468

Keywords

Search

Navigation