Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods

BIT Numerical Mathematics

Volumn 41, Issue 4, 2001, Pages 800-841

  Schulze, Jürgen ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Minimum degree algorithm; Nested dissection; Ordering algorithms

Indexed keywords

EID: 0042819709     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021908421589     Document Type: Article

References (61)

1. P. R. Amestoy, T. A. Davis, and I. S. Duff, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 886-905.
2. C. Ashcraft, Compressed graphs and the minimum degree algorithm, SIAM J. Sci. Comput., 16:6 (1995), pp. 1404-1411.
3. C. Ashcraft, Sparse Direct Methods, Volume 1: Orderings for Matrices with Symmetric Structure, Preprint, February, 2000.
4. C. Ashcraft and R. Grimes, SPOOLES: An object-oriented sparse matrix library, 9th SIAM Conference on Parallel Processing for Scientific Computing, March 1999, San Antonio, TX.
5. C. Ashcraft and J. W. H. Liu, A partition improvement algorithm for generalized nested dissection, Tech. Rep. BCSTECH-94-020, Boeing Computer Services, Seattle, WA, 1994.
6. C. Ashcraft and J.W.H. Liu, Generalized nested dissection: Some recent progress, Mini Symposium 5th SIAM Conference on Applied Linear Algebra, Snowbird, UT, 1994.
7. C. Ashcraft and J. W. H. Liu, Using domain decomposition to find graph bisectors, BIT, 37 (1997), pp. 506-534.
8. C. Ashcraft and J. W. H. Liu, Applications of the Dulmage-Mendelsohn decomposition and network flow to graph bisection improvement, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 325-354.
9. C. Ashcraft and J. W. H. Liu, Robust ordering of sparse matrices using multisection, SIAM J. Matrix Anal. Appl., 19:3 (1998), pp. 816-832.
10. C. Ashcraft, J. W. H. Liu, and S. C. Eisenstat, Practical extensions of the multisection ordering for sparse matrices, 6th SIAM Conference on Applied Linear Algebra, Snowbird, UT, October 29, 1997.
11. S. T. Barnard and H. D. Simon, A fast multilevel implementation of recursive spectral bisection, in Proc. of 6th SIAM Conf. Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1993, pp. 711-718.
12. Benoit, Note sur une méthode de résolution des équations normales etc. (Procédé du commandant Cholesky), Bull. Géodésique (Toulouse), 7:1 (1924), pp. 67-77.
13. P. Berman and G. Schnitger, On the performance of the minimum degree ordering for Gaussian elimination, SIAM J. Matrix Anal. Appl., 11:1 (1990), pp. 83-88.
14. M. V. Bhat, W. G. Habashi, J. W. H. Liu, V. N. Nguyen, and M. F. Peeters, A note on nested dissection for rectangular grids, SIAM J. Matrix Anal. Appl., 14:1 (1993), pp. 253-258.
15. T. Bui and C. Jones, A heuristic for reducing fill-in in sparse matrix factorization, in Proc. 6th SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1993, pp. 445-452.
16. A. C. Damhaug, Sparse Solution of Finite Element Equations, Ph. D. Thesis, Department of Structural Engeneering, The Norwegian Institute of Technology, Trondheim, Norway, 1992.
17. T. Davis, University of Florida Sparse Matrix Collection, Vol. 92, No. 42, October 16, 1994, NA Digest, Vol. 96, No. 28, July 23, 1996, and NA Digest, Vol. 97, No. 23, June 7, 1997.
18. T. Davis, University of Florida Sparse Matrix Collection, Vol. 92, No. 42, October 16, 1994, NA Digest, Vol. 96, No. 28, July 23, 1996, and NA Digest, Vol. 97, No. 23, June 7, 1997.
19. T. Davis, University of Florida Sparse Matrix Collection, Vol. 92, No. 42, October 16, 1994, NA Digest, Vol. 96, No. 28, July 23, 1996, and NA Digest, Vol. 97, No. 23, June 7, 1997.
20. I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, Oxford University Press, Oxford, 1987.
21. I. S. Duff, R. G. Grimes, and J. G. Lewis, Users' guide for the Harwell-Boeing sparse matrix collection, Tech. Report TR/PA/92/86, Res. and Tech. Division, Boeing Computer Services, Seattle, WA, 1992.
22. I. S. Duff and J. K. Reid, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, 3 (1983), pp. 302-325.
23. S. C. Eisenstat, M. H. Schultz, and A. H. Sherman, Applications of an element model for Gaussian elimination, in Sparse Matrix Computations, J. Bunch and D. Rose, eds., Academic Press, New York, 1976, pp. 85-96.
24. C. M. Fiduccia and R. M. Mattheyses, A linear-time heuristic for improving network partitions, 19th IEEE Design Automation Conference, 1982, pp. 175-181.
25. A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10:2 (1973), pp. 345-363.
26. A. George and J. W. H. Liu, An automatic nested dissection algorithm for irregular finite element problems, SIAM J. Numer. Anal., 15:5 (1978), pp. 1053-1069.
27. A. George and J. W. H. Liu, A fast implementation of the minimum degree algorithm using quotient graphs, ACM Trans. Math. Software, 6 (1980), pp. 337-358.
28. A. George and J. W. H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
29. A. George and J. W. H. Liu, The evolution of the minimum degree ordering algorithm, SIAM Review, 31:1 (1989), pp. 1-19.
30. A. George, J. W. Poole, and R. Voigt, Incomplete nested dissection for solving n by n grid problems, SIAM J. Numer. Anal., 15 (1978), pp. 663-673.
31. J. R. Gilbert, C. Moler, and R. Schreiber, Sparse matrices in MATLAB: Design and implementation, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 333-356.
32. A. Gupta, WGPP: Watson graph partitioning (and sparse matrix ordering) package, users manual, Research Report RC 20453, IBM T. J. Watson Research Center, New York, 1996.
33. A. Gupta, Fast and effective algorithms for graph partitioning and sparse matrix ordering, Research Report RC 20496, IBM T. J. Watson Research Center, New York, 1996.
34. B. Hendrickson and R. Leland, The CHACO user's guide, Tech. Rep. SAND94-2692, Sandia Nat. Lab., AZ, 1994.
35. B. Hendrickson and R. Leland, A multilevel algorithm for partitioning graphs, Proc. of Supercomputing'95, 1995.
36. B. Hendrickson and E. Rothberg, Effective sparse matrix ordering: Just around the BEND, in Proc. of 8th SIAM Conf. Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1997.
37. B. Hendrickson and E. Rothberg, Improving the runtime and quality of nested dissection ordering, SIAM J. Sci. Comput., 20:2 (1998), pp. 468-489.
38. A. J. Hoffman, M. S. Martin, and D. J. Rose, Complexity bounds for regular finite difference and finite element grids, SIAM J. Numer. Anal., 10:2 (1973), pp. 364-369.
39. G. Karypis and V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20:1 (1999), pp. 359-392.
40. G. Karypis and V. Kumar, METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices (Version 4-0), Dept. of Computer Science, Univ. of Minnesota, 1998.
41. B. W. Kernighan and S. Lin, An effective heuristic procedure for partitioning graphs, The Bell Systems Technical Journal, 1970, pp. 291-308.
42. D. König, Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Math. Ann., 77 (1916), pp. 453-465.
43. C. E. Leiserson and J. G. Lewis, Ordering for parallel sparse symmetric factorization, in Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1989, pp. 27-31.
44. J. W. H. Liu, Modification of the minimum-degree algorithm by multiple elimination, ACM Trans. Math. Software, 11:2 (1985), pp. 141-153.
45. J. W. H. Liu, The minimum degree ordering with constraints, SIAM J. Sci. Stat. Comput., 10:6 (1989), pp. 1136-1145.
46. J. W. H. Liu, A graph partitioning algorithm by node separators, ACM Trans. Math. Software, 15:3 (1989), pp. 198-219.
47. J. W. H. Liu, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., 11:1 (1990), pp. 134-172.
48. H. M. Markowitz, The elimination form of the inverse and its application to linear programming, Management Science, 3 (1957), pp. 255-269.
49. C. Meszaros, The inexact minimum local fill-in ordering algorithm, Tech. Report WP 95:7, Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, 1995.
50. E. Ng and P. Raghavan, Performance of greedy heuristics for sparse Cholesky factorization, SIAM J. Matrix Anal. Appl., 20 (1998), pp. 902-914.
51. S. V. Parter, The use of linear graphs in Gauss elimination, SIAM Review, 3 (1961), pp. 119-130.
52. F. Pellegrini and J. Roman, Sparse matrix ordering with SCOTCH, in Proc. HPCN'97, LNCS 1225, 1997, pp. 370-378.
53. F. Pellegrini, J. Roman, and P. Amestoy, Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering, in Proc. Irregular'99, LNCS 1586, 1999, pp. 986-995.
54. R. Preis and R. Diekmann, The PARTY partitioning library user guide - version 1.1, Tech. Rep., Dept. of Computer Science, Univ. of Paderborn, Germany 1996.
55. D. J. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in Graph-Theory and Computing, R. Read, ed., Academic Press, New York, 1972, pp. 183-217.
56. E. Rothberg, Robust ordering of sparse matrices: A minimum degree, nested dissection hybrid, manuscript, Silicon Graphics, 1995.
57. E. Rothberg, Exploring the tradeoff between imbalance and separator size in nested dissection ordering, manuscript, Silicon Graphics, 1996.
58. E. Rothberg and S. C. Eisenstat, Node selection strategies for bottom-up sparse matrix ordering, SIAM J. Matrix Anal. Appl., 19:3 (1998), pp. 682-695.
59. B. Speelpenning, The generalized element model, Tech. Rep. UIUCDCS-R-78-946, Dept. of Computer Science, Univ. of Illinois, 1978.
60. W. F. Tinney and J. W. Walker, Direct solutions of sparse network equations by optimally ordered triangular factorization, Proc. of the IEEE, 55 (1967), pp. 1801-1809.
61. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth., 2:1 (1981), pp. 77-79.