Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1586, Issue , 1999, Pages 986-995

  Pellegrini, François ^a   Roman, Jean ^a   Amestoy, Patrick ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX ALGEBRA;

FILL-IN REDUCTIONS; LOOSE COUPLINGS; MINIMUM DEGREE; NESTED DISSECTION; SPARSE MATRICES; SPARSE MATRIX ORDERING; STATE OF THE ART; TIGHT COUPLING;

DISSECTION;

EID: 84957670792     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0097983     Document Type: Conference Paper

References (19)

1. P. Amestoy, T. Davis, and I. Duff. An approximate minimum degree ordering algorithm. SIAM J. Matriz Anal. and Appl., 17:886-905, 1996.
2. P. Amestoy, I. Duff, and J.-Y. L’ExceUent. Multifrontal parallel distributed symmetric and unsymmetric solvers, to appear in special issue of Comput. Methods in Appl. Mech. Eng. on domain decomposition and parallel computing, 1998.
3. C. Ashcraft. Compressed graphs and the minimum degree algorithm. SIAM J. Sci. Comput., 16(6):1404-1411, 1995.
4. C. Ashcraft, S. Eisenstat, J. W.-H. Liu, and A. Sherman. A comparison of three column based distributed sparse factorization schemes. In Proc. Fifth SIAM Conf. on Parallel Processing for Scientific Computing, 1991.
5. P. Charrier and J. Roman. Algorithmique et calculs de complexit6 pour un solveur de type dissections emboit6es. Numerische Mathematik, 55:463-476, 1989.
6. G. A. Geist and E. G.-Y. Ng. Task scheduling for parallel sparse Cholesky factorization. International Journal o/Parallel Programming, 18(4):291-314, 1989.
7. A. George, M. T. Heath, J. W.-H. Liu, and E. G.-Y. Ng. Sparse Cholesky factorization on a local memory multiprocessor. SIAM Journal on Scientific and Statistical Computing, 9:327-340, 1988.
8. A. George and J. W.-H. Liu. Computer solution of large sparse positive definite systems. Prentice Hall, 1981.
9. A. George and J. W.-H. Liu. The evolution of the minimum degree ordering algorithm. SIAM Review, 31:1-19, 1989.
10. N. E. Gibbs, W. G. Poole, and P. K. Stockmeyer. A comparison of several bandwidth and profile reduction algorithms. ACM Trans. Math. Soft., 2:322-330, 1976.
11. A. Gupta, G. Karypis, and V. Kumar. Scalable parallel algorithms for sparse linear systems. In Proc. Stratagem’96, Sophia-Antipolis, pages 97-110, July 1996.
12. B. Hendrickson and E. Rothberg. Improving the runtime and quality of nested dissection ordering. SIAM J. Sci. Comput., 20(2):468-489, 1998.
13. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. TR 95-035, University of Minnesota, June 1995.
14. G. Karypis and V. Kumar. ME’I’IS-A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices-Version 4. O. University of Minnesota, September 1998.
15. R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM Journal of Numerical Analysis, 16(2):346-358, April 1979.
16. J. W.-H. Liu. Modification of the minimum-degree algorithm by multiple elimination. ACM Trans. Math. Software, 11(2):141-153, 1985.
17. F. Pellegrini and J. Roman. Sparse matrix ordering with SCOTCH. In Proceedings of HPCN’97, Vienna, LNCS 1225, pages 370-378, April 1997.
18. R. Schreiber. Scalability of sparse direct solvers. Technical Report TR 92.13, RIACS, NASA Ames Research Center, May 1992.
19. W. F. Tinney and J. W. Walker. Direct solutions of sparse network equations by optimally ordered triangular factorization. J. Proc. IEEE, 55:1801-1809, 1967.