An Implementation of a Pseudoperipheral Node Finder

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Implementation of a Pseudoperipheral Node Finder

Full text

Pdf (673 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 5 , Issue 3 (September 1979) table of contents

Pages: 284 - 295

Year of Publication: 1979

ISSN:0098-3500

Authors

Alan George	Department of Computer Science, University of Waterloo, Waterloo, Ont., Canada
Joseph W. H. Liu	Department of Computer Science, University of Waterloo, Waterloo, Ont., Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 36, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

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/355841.355845 What is a DOI?

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	ARANY, I, SMYTH, W.F., AND SZODA, L. An improved method for reducing the bandwidth of sparse symmetric matrices. In Information Processing 71, North-Holland Pub. Co., Amsterdam, 1972
	2	BERGE, C. The Theory of Graphs and its Apphcat~ons. Wiley, New York, 1962.
	3	H. L. Crane, Jr. , Norman E. Gibbs , William G. Poole, Jr. , Paul K. Stockmeyer, Algorithm 508: Matrix Bandwidth and Profile Reduction [F1], ACM Transactions on Mathematical Software (TOMS), v.2 n.4, p.375-377, Dec. 1976 [doi>10.1145/355705.355712]
	4	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]
	5	EVERSTINE, G.C. The BANDIT computer program for the reduction of matrix bandwidth for NASTRAN. NSRDC Rep. 3827, 1972.
	6	GEORGE, A., AND LIU, J.W.H. Algorithms for matrix partitioning and the numerical solution of fimte element systems. SIAM J. Numer. Anal. 15 (1978), 297-327.
	7	GEORGE, A., AND LIU, J.W.H. An automatic nested dissection algorithm for irregular finite element problems. SIAM J. Numer. Anal. 15 (1978), 1053-1069.
	8	GIBBS, N.E., POOLE, W.G., AND STOCKMEYER, P.K. An algorithm for reducing the bandwidth and profile of a sparse matrix. SlAM J. Numer. Anal. 13 (1976), 236-250.
	9	LIu, J.W.H. On reducing the profile of sparse symmetric matrices. Rep. CS.76.07, Dept. of Comptr Sci., U. of Waterloo, Waterloo, Ont., Canada, 1976.
	10	LIu, J W.H., AND SHERMAN, A.H. Comparative analysis of the Cuthill-McKee and the reverse Cuthfll-McKee ordering algorithms for sparse matrices. SIAM J. Numer. Anal. 12 (1975), 198- 213.
	11	SMYTH, W.F., AND ARANY, I. Another algorithm for reducing bandwidth and profile of a sparse matrix. Proc. AFIPS 1976 NCC, AFIPS Press, Montvale, N.J., pp. 987-994.
	12	SMYTH, W.F., AND BENZl, W.M.L. An algorithm for finding the diameter of a graph. In IFIP Congress 74, Vol. 3 North-Holland Pub. Co., Amsterdam, 1974, pp. 500-503.

CITED BY 4

	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
	H. A. Rahimi Bondarabady , A. Kaveh, Nodal ordering using graph theory and a genetic algorithm, Finite Elements in Analysis and Design, v.40 n.9-10, p.1271-1280, June 2004
	E. Flórez , M. D. García , L. González , G. Montero, The effect of orderings on sparse approximate inverse preconditioners for non-symmetric problems, Advances in Engineering Software, v.33 n.7-10, p.611-619, 29 November 2002
	Guy Antoine Atenekeng Kahou , Laura Grigori , Masha Sosonkina, A partitioning algorithm for block-diagonal matrices with overlap, Parallel Computing, v.34 n.6-8, p.332-344, July, 2008