Modification of the minimum-degree algorithm by multiple elimination

ACM Transactions on Mathematical Software (TOMS)

Volumn 11, Issue 2, 1985, Pages 141-153

  Liu, Joseph W H ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

elimination; minimum degree; ordering; sparse ordering

Indexed keywords

MATHEMATICAL TECHNIQUES - MATRIX ALGEBRA;

MINIMUM-DEGREE ALGORITHM; MULTIPLE ELIMINATION;

COMPUTER PROGRAMMING;

EID: 0022077450     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/214392.214398     Document Type: Article

References (12)

1. DUFF, I.S. A sparse future. In Sparse Matrices and Their Uses, I.S. Duff, Ed. Academic Press, New York, 1982, pp. 1-29.]
2. DUFF, I.S., GRIMES, R., LEWIS, J., AND POOLE, B. Sparse matrix test problems. SIGNUM Newsletter (June 1982), 22.]
3. DUFF, I.S., AND REID, J.K. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math Softw. 9, 3 (Sept. 1983), 302-325.]
4. EISENSTAT, S.C., GURSKY, M.C., SCHULTZ, M.H., SHERMAN, A.H. The Yale Sparse Matrix Package, I. The symmetric code. Res. Rep. 112, Dept. of Computer Science, Yale Univ., New Haven, Conn., 1977.]
5. EISENSTAT, S.C., SCHULTZ, M.H., AND SHERMAN, A.H. Applications of an element model for Gaussian elimination. In Sparse Matrix Computations, J.R. Bunch and D.J. Rose, Eds. Academic Press, New York, 1976 pp. 85-96.]
6. GEORGE, A., and L{u, J. W.H. A fast implementation of the minimum degree algorithm using quotient graphs. ACM Trans. Math So{tw. 6, 3 (Sept. 1980), 337-358.]
7. GEORGE, J.A., AND LIU, J.W.H. Computer Solution o{ Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, N.J., 1981.]
8. GEORGE, J.A., L{u, J.W.H., and NG, E. User guide for SPARSPAK, Waterloo Sparse Linear Equations Package. Res. Rep. CS 78-30 (revised 1980), Dept. of Computer Science, Univ. of Waterloo, Waterloo, Ont., Can., 1980.]
9. PETERS, F.J. Parallel pivoting algorithms for sparse symmetric matrices. Tech. Rep., Dept. of Mathematics and Computer Science, Eindhoven Univ. of Technology, Eindhoven, Neth., 1982.]
10. RosE, D.J. A graph-theoretic study o. RosE, D.J. A graph-theoretic study o study o ond Computing, R.C. Read, Ed. Academic Press, New York, 1973, pp. 183-217.]
11. TINNEY, W.F., AND WALKER, J.W. Direct solution of sparse network equations by optimally ordered triangular factorization. Proc. IEEE 55 (1967), 1801-1809.]
12. YANNAKAKIS, M. Computing the minimum fill-in is NP-complete. SIAM J. Alg. Disc. Meth. 1 (1981), 77-79.]