Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms

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	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]
	2	DUFF, I.S. A survey of sparse matrix research. Proc. IEEE 65, 4 (April 1977), 500-535.
	3	EISENSTAT, S.C., SCHULTZ, M.A., AND SHERMAN, A.W. Efficient implementation of sparse symmetric Gaussian elimination. In Proc. AICA Int. Syrup. on Computer Methods for PDE's (Bethlehem, Pa., 1975), 33-39.
	4	EVERSTINE, G.C. A comparison of three resequencmg algorithms for the reduction of matrix profile and wavefront. Int J. Numer. Methods ~n Eng. 14 (1979), 837-853.
	5	GEORGE, A. Solution of linear systems of equations. Dtrect methods for finite element problems. In Sparse Matrix Techniques, Copenhagen 1976, A. Dold and B. Eckman (Eds), Springer-Verlag, New York, 1977.
	6	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 [doi>10.1145/355841.355845]
	7	GEORGE, A, AND LIU, J W.H Algorithms for matrix partitioning and the numerical solution of fimte element systems. SIAM J Numer. Anal. 15, 2 (April 1978), 297-327.
	8	GEORGE, A., LIu, J., AND NG, E. User Guide for Sparspak" Waterloo Sparse Linear Equations Package, Dep. Computer Science, Univ. of Waterloo, Waterloo, Ont., Canada, 1979.
	9	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 [doi>10.1145/355705.355713]
	10	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]
	11	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 13, 2 (April 1976), 236-250.
	12	JENNINGS, A. Matrix Computations for Engineers and Scwnt~sts. Wiley, New York, 1977.
	13	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	14	Robert Sedgewick, Implementing Quicksort programs, Communications of the ACM, v.21 n.10, p.847-857, Oct. 1978 [doi>10.1145/359619.359631]
	15	THIERER, A A Comparison of Ordermg Schemes for Profde Minimization of Sparse Symmetric Matrwes. Center for Numerical Analysis, Rep CNA-146, Univ. of Texas, Austin, 1978.