Geometric mesh partitioning: Implementation and experiments

SIAM Journal on Scientific Computing

Volumn 19, Issue 6, 1998, Pages 2091-2110

  Gilbert, John R ^a   Miller, Gary L ^b   Teng, Shang Hua ^c  

^a PALO ALTO RESEARCH CENTER   (United States)

^b Carnegie Mellon University   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Centerpoints; Conformal mapping; Geometric sampling; Graph and geometric algorithms; MATLAB; Mesh partitioning; Moment of inertia; Parallel processing; Separators

Indexed keywords

CENTERPOINTS; GEOMETRIC MESH PARTITIONING; GEOMETRIC SAMPLING; MOMENT OF INERTIA;

ALGORITHMS; CONFORMAL MAPPING; GEOMETRY; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

FINITE ELEMENT METHOD;

EID: 0032204161     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827594275339     Document Type: Article

References (47)

1. A. AGRAWAL AND P. KLEIN, Cutting down on fill using nested dissection: Provably good elimination orderings, in Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. H. Liu, eds., Springer-Verlag, Berlin, New York, 1993.
2. N. ALON, P. SEYMOUR, AND R. THOMAS, A separator theorem for graphs with an excluded minor and applications, in Proc. 22nd Symp. on Theory of Computing, ACM, New York, 1990.
3. S. T. BARNARD AND H. D. SIMON, A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience, 6 (1994), pp. 101-117.
4. E. R. BARNES, An algorithm for partitioning the nodes of a graph, SIAM J. Matrix Anal. Appl., 3 (1982), pp. 541-550.
5. T. J. BARTH AND D. C. JESPERSEN, The design and application of upwind schemes on unstructured meshes, in Proc. of the 27th Aerospace Sciences Meeting, AIAA, New York, 1989.
6. M. BERN, S. MITCHELL, AND J. RUPPERT, Linear-size nonobtuse triangulation of polygons, Discrete Comput. Geom., 14 (1995), pp. 411-428.
7. G. E. BLELLOCH, Vector Models for Data-Parallel Computing, MIT Press, Cambridge, MA, 1990.
8. T. F. CHAN, P. CIARLET JR., AND W. K. SZETO, On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method, Tech. Report CAM 93-14, University California at Los Angeles, 1993.
9. T. F. CHAN, J. R. GILBERT, AND S.-H. TENG, Geometric Spectral Partitioning, Tech. Report CSL 94-15, Xerox Palo Alto Research Center, 1994.
10. T. F. CHAN AND W. K. SZETO, A sign cut version of the recursive spectral bisection graph partitioning algorithm, in Proc. Fifth SIAM Symp. on Applied Linear Algebra, Snowbird, UT, June 1994, pp. 562-566.
11. P. CIARLET JR. AND F. LAMOUR, On the Validity of a Front-oriented Approach to Partitioning Large Sparse Graphs with a Connectivity Constraint, Tech. Report CAM 94-37, University California at Los Angeles, 1994.
12. P. CIARLET JR. AND F. LAMOUR, Recursive Partitioning Methods and Greedy Partitioning Methods: A Comparison on Finite Element Graphs, Tech. Report CAM 94-9, University California at Los Angeles, 1994.
13. K. L. CLARKSON, D. EPPSTEIN, G. L. MILLER, C. STURTIVANT, AND S.-H. TENG, Approximating center points with iterated Radon points, Internat. J. Comput. Geom. Appl., 6 (1996), pp. 357-377.
14. L. DANZER, J. FONLUPT, AND V. KLEE, Helly's theorem and its relatives, in Proc. Sympos. Pure Math. 7, AMS, Providence, RI, 1963, pp. 101-180.
15. A. L. DULMAGE AND N. S. MENDELSOHN, Coverings of bipartite graphs, Canad. J. Math., 10 (1958), pp. 517-534.
16. H. EDELSBRUNNER, Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987.
17. C. FARHAT AND M. LESOINNE, Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics, Internat. J. Numer. Methods Engrg., 36 (1993), pp. 745-764.
18. C. FARHAT AND H. SIMON, TOP/DOMDEC - A Software Tool for Mesh Partitioning and Parallel Processing, Tech. report, NASA Ames Research Center, Moffett Field, CA, 1993.
19. C. M. FIDUCCIA AND R. M. MATTHEYSES, A Linear-Time Heuristic for Improving Network Partitions, Tech. report 82CRD130, Corporate Research and Development Center, General Electric Co., Schenectady, NY, 1982.
20. M. FIEDLER, Algebraic connectivity of graphs, Czechoslovak. Math. J., 23 (1973), pp. 298-305.
21. R. W. FLOYD AND R. L. RIVEST, Expected time bounds for selection, Comm. ACM, 18 (1975), pp. 165-172.
22. A. GEORGE AND J. W. H. LIU, An automatic nested dissection algorithm for irregular finite element problems, SIAM J. Numer. Anal., 15 (1978), pp. 1053-1069.
23. J. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
24. J. R. GILBERT, J. P. HUTCHINSON, AND R. E. TARJAN, A separator theorem for graphs of bounded genus, J. Algorithms, 5 (1984), pp. 391-407.
25. 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.
26. K. D. GREMBAN, G. L. MILLER, AND S.-H. TENG, Moments of inertia and graph separators, in Proc. Fifth ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1994, pp. 452-461.
27. M. T. HEATH AND P. RAGHAVAN, A Cartesian nested dissection algorithm, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 235-253.
28. B. HENDRICKSON AND R. LELAND, The Chaco User's Guide, Version 1.0, Tech. report SAND93-2339, Sandia National Laboratories, Albuquerque, NM, 1993.
29. B. HENDRICKSON AND R. LELAND, A multilevel algorithm for partitioning graphs, in Proc. Supercomputing '95, ACM, San Diego, 1995.
30. B. HENDRICKSON AND R. LELAND, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput., 16 (1995), pp. 452-469.
31. C. A. R. HOARE, Algorithm 63 (PARTITION) and Algorithm 65 (FIND), Comm. ACM, 4 (1961), p. 321.
32. B. W. KERNIGHAN AND S. LIN, An effective heuristic procedure for partitioning graphs, The Bell System Tech. J., 49 (1970), pp. 291-308.
33. D. E. KNUTH, The Art of Computer Programming, 2nd ed., Computer Science and Information Processing 3, Addison-Wesley, Reading, MA, 1981.
34. F. T. LEIGHTON AND S. RAO, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in 29th IEEE Symp. on Foundations of Computer Sci., White Plains, NY, 1988, pp. 422-431.
35. R. J. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
36. G. L. MILLER, Finding small simple cycle separators for 2-connected planar graphs, J. Comput. System Sci., 32 (1986), pp. 265-279.
37. G. L. MILLER, S.-H. TENG, W. THURSTON, AND S. A. VAVASIS, Automatic mesh partitioning, in Sparse Matrix Computations: Graph Theory Issues and Algorithms, A. George, J. Gilbert, and J. Liu, eds., IMA Vol. Math. Appl., Springer-Verlag, New York, 1993.
38. G. L. MILLER, S.-H. TENG, W. THURSTON, AND S. A. VAVASIS, Geometric separators for finite-element meshes, SIAM J. Sci. Comput., 19 (1998), pp. 364-386.
39. A. POTHEN, H. D. SIMON, AND K.-P. LIOU, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430-452.
40. A. POTHEN, H. D. SIMON, AND L. WANG, Spectral Nested Dissection, Tech. report CS-92-01, Department of Computer Science, Pennsylvania State University, State College, PA, 1992.
41. E. PRAMONO, J. RUPPERT, AND S.-H. TENG, Partitioning Weighted Meshes for Parallel Adaptive Computations, NASA Ames Research Center, Moffett Field, CA, 1993, manuscript. Can be obtained from steng@cs.uiuc.edu.
42. F. RENDL AND H. WOLKOWICZ, A Projection Technique for Partitioning the Nodes of a Graph, Tech. report CORR 90-20, University of Waterloo, 1990.
43. H. D. SIMON, Partitioning of unstructured problems for parallel processing, Comput. Syst. Engrg., 2 (1991), pp. 135-148.
44. G. STRANG AND G. J. FIX, An Analysis of the Finite Element Method, Prentice-Hall, Englewood Cliffs, NJ, 1973.
45. S.-H. TENG, Points, Spheres, and Separators: A Unified Geometric Approach to Graph Partitioning, Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, PA, 1991.
46. D. VANDERSTRAETEN, O. ZONE, R. KEUNINGS, AND L. A. WOSLEY, Non-deterministic heuristics for automatic domain decomposition in direct parallel finite element calculations, in Parallel Processing for Scientific Computing, R. F. Sincovec et al., ed., SIAM, Philadelphia, 1993, pp. 929-932.
47. R. D. WILLIAMS, Performance of dynamic load balancing algorithms for unstructured mesh calculations, Concurrency: Practice and Experience, 3 (1991), pp. 457-481.