Permuting sparse rectangular matrices into block-diagonal form

SIAM Journal on Scientific Computing

Volumn 25, Issue 6, 2004, Pages 1860-1879

  Aykanat, Cevdet ^a   Pinar, Ali ^b   Çatalyürek, Ümit V ^c  

^a BILKENT UNIVERSITY   (Turkey)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^c OHIO STATE UNIVERSITY   (United States)

Author keywords

Coarse grain parallelism; Doubly bordered block diagonal form; Graph partitioning by vertex separator; Hypergraph partitioning; Singly bordered block diagonal form; Sparse rectangular matrices

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING;

COARSE-GRAIN PARALLELISM; DOUBLY BORDERED BLOCK-DIAGNOL FORM; GRAPH PARTITIONING BY VERTEX SEPARATORS; HYPERGRAPH PARTITIONING; SINGLY BORDERED BLOCK DIAGNOL FORM; SPARSE RECTANGULAR MATRICES;

MATRIX ALGEBRA;

EID: 10244251766     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827502401953     Document Type: Article

References (43)

1. C. ASHCRAFT AND J. W. H. LIU, A Partition Improvement Algorithm for Generalized Nested Dissection, Tech. Report BCSTECH-94-020, Boeing Computer Services, Seattle, WA, 1994.
2. 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.
3. C. AYKANAT, A. PINAR, AND U. V. ÇATALYÜREK, Permuting Sparse Rectangular Matrices into Block-Diagonal Form, tech. report, Department of Computer Engineering, Bilkent University, Ankara, Turkey, 2002.
4. A. BJÖRCK, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
5. T. N. BUI AND C. JONES, Finding good approximate vertex and edge partitions is NP-hard, Inform. Process. Lett., 42 (1992), pp. 153-159.
6. T. N. BUI AND C. JONES, A heuristic for reducing fill-in in sparse matrix factorization, in Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1993, pp. 445-452.
7. U. V. CATALYÜREK AND C. AYKANAT, Decomposing irregularly sparse matrices for parallel matrix-vector multiplications, in Proceedings of the 3rd International Symposium on Solving Irregularly Structured Problems in Parallel, Irregular'96, Lecture Notes in Comput. Sci. 1117, Springer-Verlag, Berlin, 1996, pp. 75-86.
8. U. V. ÇATALYÜREK AND C. AYKANAT, Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication, IEEE Trans. Parallel Distrib. Systems, 10 (1999), pp. 673-693.
9. U. V. ÇATALYÜREK AND C. AYKANAT, PaToH: A Multilevel Hypergraph Partitioning Tool, Version 3.0, Department of Computer Engineering, Bilkent University, Ankara, Turkey, 1999.
10. I. O. CENTER, Linear Programming Problems, ftp://col.biz.uiowa.edu:pub/testprob/lp/gondzio.
11. G. DANTZIG AND P. WOLFE, Decomposition principle for linear programs, Oper. Res., 8 (1960), pp. 101-111.
12. M. C. FERRIS AND J. D. HORN, Partitioning mathematical programs for parallel solution, Math. Programming, 80 (1998), pp. 35-61.
13. C. M. FIDUCCIA AND R. M. MATTHEYSES, A linear-time heuristic for improving network partitions, in Proceedings of the 19th ACM/IEEE Design Automation Conference, IEEE Press, Piscataway, NJ, 1982, pp. 175-181.
14. A. GEORGE, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
15. S. K. GNANENDRAN AND J. K. Ho, Load balancing in the parallel optimization of block-angular linear programs, Math. Programming, 62 (1993), pp. 41-67.
16. A. GUPTA, Watson Graph Partitioning Package, Tech. Report RC 20453, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1996.
17. S. HAUCK AND G. BORIELLO, An evaluation of bipartitioning techniques, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 16 (1997), pp. 849-866.
18. B. HENDRICKSON, Graph partitioning and parallel solvers: Has the emperor no clothes?, in Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel, Irregular'98, Lecture Notes in Comput. Sci. 1457, Springer-Verlag, Berlin, 1998, pp. 218-225.
19. B. HENDRICKSON AND T. G. KOLDA, Graph partitioning models for parallel computing, Parallel Comput., 26 (2000), pp. 1519-1534.
20. B. HENDRICKSON AND R. LELAND, A Multilevel Algorithm for Partitioning Graphs, tech. report, Sandia National Laboratories, Albuquerque, NM, 1993.
21. B. HENDRICKSON AND R. LELAND, The Chaco User's Guide, Version 2.0, Sandia National Laboratories, Albuquerque, NM, 1995.
22. B. HENDRICKSON AND E. ROTHBERG, Improving the run time and quality of nested dissection ordering, SIAM J. Sci. Comput., 20 (1998), pp. 468-489.
23. J. K. HO, T. C. LEE, AND R. P. SUNDARRAJ, Decomposition of linear programs using parallel computation, Math. Programming, 42 (1988), pp. 391-405.
24. Y. F. HU, C. M. MAGUIRE, AND R. J. BLAKE, Ordering unsymmetric matrices into bordered block diagonal form for parallel processing, in Proceedings of Euro-Par '99 Parallel Processing: 5th International Euro-Par Conference, Toulouse, France, 1999, P. Amestoy, P. Berger, M. J. Daydé, I. S. Duff, V. Frayssé, L. Giraud, and D. Ruiz, eds., Lecture Notes in Comput. Sci. 1685, Springer-Verlag, Berlin, 1999, pp. 295-302.
25. Hungarian Academy of Sciences: Computer and Automation Research Institute, LP Test Sets, ftp://ftp.sztaki.hu/pub/oplab/LPTESTSET/.
26. IMSL User's Manual, Edition 9.2 (International Mathematical and Statistical Library), Houston, TX, 1984.
27. G. KARYPIS AND V. KUMAR, MeTiS. A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices Version 3.0, Department of Computer Science and Engineering/Army HPC Research Center, University of Minnesota, Minneapolis, MN, 1998.
28. G. KARYPIS AND V. KUMAR, Multilevel Algorithms for Multi-constraint Graph Partitioning, Tech. Report 98-019, Department of Computer Science/Army HPC Research Center, University of Minnesota, Minneapolis, MN, 1998.
29. G. KARYPIS, V. KUMAR, R. AGGARWAL, AND S. SHEKHAR, hMeTiS. A Hypergraph Partitioning Package Version 1.0.1, Department of Computer Science and Engineering/Army HPC Research Center, University of Minnesota, Minneapolis, MN, 1998.
30. B. W. KERNIGHAN AND S. LIN, An efficient heuristic procedure for partitioning graphs, Bell System Tech. J., 49 (1970), pp. 291-307.
31. C. LEMARECHAL, A. NEMIROVSKI, AND Y. NESTEROV, New variants of bundle methods, Math. Programming, 69 (1995), pp. 111-147.
32. T. LENGAUER, Combinatorial Algorithms for Integrated Circuit Layout, Wiley-Teubner, Chichester, UK, 199.
33. J. W. H. LIU, The minimum degree ordering with constraints, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 1136-1145.
34. D. MEDHI, Parallel bundle-based decomposition for large-scale structured mathematical programming problems, Ann. Oper. Res., 22 (1990), pp. 101-127.
35. D. MEDHI, Bundle-based decomposition for structured large-scale convex optimization: Error estimate and application to block-angular linear programs, Math. Programming, 66 (1994), pp. 79-101.
36. R. R. MEYER AND G. ZAKERI, Multicoordination methods for solving convex block-angular programs, SIAM J. Optim., 10 (1999), pp. 121-131.
37. J. M. MULVEY AND A. RUSZCYNSKI, A diagonal quadratic approximation method for large scale linear programs, Oper. Res. Lett., 12 (1992), pp. 205-215.
38. A. PINAR, U. V. CATALYÜREK, C. AYKANAT, AND M. PINAR, Decomposing linear programs for parallel solution, in Proceedings of the Second International Workshop on Applied Parallel Computing, PARA '95, Lyngby, Denmark, 1995, Lecture Notes in Comput. Sci. 1041, Springer-Verlag, Berlin, 1996, pp. 473-482.
39. A. PINAR AND C. AYKANAT, An effective model to decompose linear programs for parallel solution, in Proceedings of the Third International Workshop on Applied Parallel Computing, PARA'96, Lecture Notes in Comput. Sci. 1184, Springer-Verlag, Berlin, 1997, pp. 592-601.
40. A. PINAR AND B. HENDRICKSON, Partitioning for complex objectives, in Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS), San Francisco, CA, IEEE Computer Society Press, Los Alamitos, CA, 2001.
41. T. RASHID AND T. A. DAVIS, An approach for parallelizing any general unsymmetric sparse matrix algorithm, in Proceedings of the 7th SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1995, pp. 413-417.
42. J. M. STERN AND S. A. VAVASIS, Active set algorithms for problems in block angular form, Comput. Appl. Math., 12 (1994), pp. 199-226.
43. R. J. VANDERBEI, LOQO User's Manual, Version 4.01, Tech. Report SOR 97-08, Princeton University, Princeton, NJ, 1997.