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

Concurrency Practice and Experience

Volumn 12, Issue 2, 2000, Pages 69-84

  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

ALGORITHMS; APPROXIMATION THEORY; CONCURRENCY CONTROL; MATRIX ALGEBRA; TREES (MATHEMATICS);

HYBRIDIZING NESTED DISSECTION; SPARSE MATRIX ORDERING;

PARALLEL PROCESSING SYSTEMS;

EID: 0033716826     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1096-9128(200002/03)12:2/3<69::AID-CPE472>3.0.CO;2-W     Document Type: Article

References (24)

1. Tinney WF, Walker JW. Direct solutions of sparse network equations by optimally ordered triangular factorization. J. Proc. IEEE 1967; 55:1801-1809.
2. George A, Liu JW-H. Computer Solution of Large Sparse Positive Definite Systems; Prentice Hall, 1981.
3. Amestoy P, Davis T, Duff I. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 1996; 17:886-905.
4. George A, Liu JW-H. The evolution of the minimum degree ordering algorithm. SIAM Review 1989; 31:1-19.
5. Liu JW-H. Modification of the minimum-degree algorithm by multiple elimination. ACM Trans. Math. Softw. 1985; 11(2):141-153.
6. Charrier P, Roman J. Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. Numer. Math. 1989; 55:463-476.
7. Lipton RJ, Rose DJ, Tarjan RE. Generalized nested dissection. SIAM J. Numer. Anal. 1979; 16(2):346-358.
8. Gupta A, Karypis G, Kumar V. Scalable parallel algorithms for sparse linear systems. Proceedings of Stratagem'96, Sophia-Antipolis, July 1996; pp. 97-110.
9. Karypis G, Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. TR 95-035, University of Minnesota. June 1995.
10. Pellegrini F, Roman J. Sparse matrix ordering with SCOTCH. Proceedings of HPCN'97, Vienna, LNCS 1225, April 1997; pp. 370-378.
11. Ashcraft C, Eisenstat S, Liu JW-H, Sherman A. A comparison of three column based distributed sparse factorization schemes. Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, 1991.
12. Geist GA, Ng EG-Y. Task scheduling for parallel sparse Cholesky factorization. Int. J. Parallel Program. 1989; 18(4):291-314.
13. George A, Heath MT, Liu JW-H, Ng EG-Y. Sparse Cholesky factorization on a local memory multiprocessor. SIAM J. Sci. Stat. Comput. 1988; 9:327-340.
14. Schreiber R. Scalability of sparse direct solvers. Technical Report TR 92.13, RIACS, NASA Ames Research Center, May 1992.
15. Ashcraft C, Liu JW-H. Robust ordering of sparse matrices using multisectors. SIAM J. Matrix Anal. Appl. 1998; 19:816-832.
16. Hendrickson B, Rothberg E. Improving the runtime and quality of nested dissection ordering. SIAM J. Sci. Comput. 1998; 20(2):468-489.
17. Karypis G, Kumar V. METIS - A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices -Version 4.0. University of Minnesota, September 1998.
18. Pellegrini F, Roman J, Amestoy P. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Proceedings of Irregular'99, San Juan, LNCS 1586, April 1999; pp. 986-995.
19. Liu JW-H. On the minimum degree ordering with constraints. SIAM J. Matrix Anal. Appl. 1989; 10:1136-1145.
20. Hénon P, Ramet P, Roman J. A mapping and scheduling algorithm for parallel sparse fan-in numerical factorization. Proceedings of Europar'99, Toulouse, LNCS 1685, August 1999; pp. 1059-1067.
21. Gibbs NE, Poole WG, Stockmeyer PK. A comparison of several bandwidth and profile reduction algorithms. ACM Trans. Math. Softw. 1976; 2:322-330.
22. Hendrickson B, Rothberg E. Effective sparse matrix ordering: Just around the BEND. Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1999.
23. Ashcraft C. Compressed graphs and the minimum degree algorithm. SIAM J. Sci. Comput. 1995; 16(6): 1404-1411.
24. Amestoy P, Duff I, L'Excellent J-Y. Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng. 1999. To appear in a special issue on domain decomposition and parallel computing.