Algorithm 508: Matrix Bandwidth and Profile Reduction [F1]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 508: Matrix Bandwidth and Profile Reduction [F1]

Full text

Pdf (185 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 2 , Issue 4 (December 1976) table of contents

Pages: 375 - 377

Year of Publication: 1976

ISSN:0098-3500

Authors

H. L. Crane, Jr.	Comptek Research, Inc, Hyattsville, MD
Norman E. Gibbs	Department of Mathematics, College of William and Mary, Williamsburg, VA
William G. Poole, Jr.	Department of Mathematics, College of William and Mary, Williamsburg, VA
Paul K. Stockmeyer	Department of Mathematics, College of William and Mary, Williamsburg, VA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 109, Citation Count: 7

Additional Information:

appendices and supplements references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355705.355712 What is a DOI?

APPENDICES and SUPPLEMENTS

REDUCE (508.gz) (6 KB)

reducing the bandwidth and profile of sparse symmetric matrices using row and column permutations
Gams: D2e

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	COLLINS, R.J. Bandwidth reduction by automatic renumbering. Int. J. Numer. Meth. Engrg. 6 (1973), 345-356.
	2	E. Cuthill , J. McKee, Reducing the bandwidth of sparse symmetric matrices, Proceedings of the 1969 24th national conference, p.157-172, August 26-28, 1969 [doi>10.1145/800195.805928]
	3	EVERSTINE, G.C. The BANDIT computer program for the reduction of matrix bandwidth for NASTRAN. Rep. 3827, Naval Ship Res. and Develop Center, Bethesda, Md., 1972.
	4	GIBBS, N.E., POOLE, W.G. JR., AND STOCKMEYER, P.K. An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Anal. 18, 2 (April 1976), 235-251.
	5	Norman E. Gibbs , William G. Poole, Jr. , Paul K. Stockmeyer, A Comparison of Several Bandwidth and Profile Reduction Algorithms, ACM Transactions on Mathematical Software (TOMS), v.2 n.4, p.322-330, Dec. 1976 [doi>10.1145/355705.355707]
	6	WAN(}, P.T.R. Bandwidth minimization, reducibility, decomposition, and triangularization of sparse matrices. Ph.D. Diss., Dep. Comptr. and Information Sci., Ohio State U., Columbus, Ohio, 1973.

CITED BY 7

	John G. Lewis, Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms, ACM Transactions on Mathematical Software (TOMS), v.8 n.2, p.180-189, June 1982
	John G. Lewis, Remark on “Algorithms 508 and 509: Matrix Bandwidth and Profile Reduction and A Hybrid Profile Reduction Algorith”, ACM Transactions on Mathematical Software (TOMS), v.8 n.2, p.221, June 1982
	John G. Lewis, Algorithm 582: The Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms for Reordering Sparse Matrices, ACM Transactions on Mathematical Software (TOMS), v.8 n.2, p.190-194, June 1982
	Yihua Bai , Wilfried N. Gansterer , Robert C. Ward, Block tridiagonalization of "effectively" sparse symmetric matrices, ACM Transactions on Mathematical Software (TOMS), v.30 n.3, p.326-352, September 2004
	Norman E. Gibbs, Algorithm 509: A Hybrid Profile Reduction Algorithm [F1], ACM Transactions on Mathematical Software (TOMS), v.2 n.4, p.378-387, Dec. 1976
	Alan George , Joseph W. H. Liu, An Implementation of a Pseudoperipheral Node Finder, ACM Transactions on Mathematical Software (TOMS), v.5 n.3, p.284-295, Sept. 1979
	Robert Haber , Mark Shephard , John Abel , Richard Gallagher , Donald Greenberg, A generalized graphic preprocessor for two-dimensional finite element analysis, ACM SIGGRAPH Computer Graphics, v.12 n.3, p.323-329, August 1978