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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Cuthill, E., andJ. McKee: Reducing the Bandwidth of Sparse Symmetric Matrices. Proceedings 24th National Conference ACM 1969, pp. 157–172.
Cheng, K. Y.: Minimizing the Bandwidth of Sparse Symmetric Matrices. Computing forthcoming (1973).
Arany, I., W. F. Smyth, andL. Szoda: An Improved Method for Reducing the Bandwidth of Sparse, Symmetric Matrices. IFIP Conference, Ljubljana, August, 1971.
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02239468