Geometric Separators for Finite-Element Meshes

We propose a class of graphs that would occur naturally in finite-element and finite-difference problems and we prove a bound on separators for this class of graphs. Graphs in this class are embedded in $d$-dimensional space in a certain manner. For d-dimensional graphs our separator bound is O(n(d-1)d), which is the best possible bound. We also propose a simple randomized algorithm to find this separator in O(n) time. This separator algorithm can be used to partition the mesh among processors of a parallel computer and can also be used for the nested dissection sparse elimination algorithm.

[1]  P. Ungar.  A Theorem on Planar Graphs , 1951 .

[2]  N. S. Mendelsohn,et al.  Coverings of Bipartite Graphs , 1958, Canadian Journal of Mathematics.

[3]  V. Klee,et al.  Helly's theorem and its relatives , 1963 .

[4]  I. Fried.  Condition of finite element matrices generated from nonuniform meshes. , 1972 .

[5]  A. George.  Nested Dissection of a Regular Finite Element Mesh , 1973 .

[6]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[7]  I. Babuska,et al.  ON THE ANGLE CONDITION IN THE FINITE ELEMENT METHOD , 1976 .

[8]  D. Rose,et al.  Generalized nested dissection , 1977 .

[9]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[10]  John R Gilbert,et al.  A Separator Theorem for Graphs of Bounded Genus , 1984, J. Algorithms.

[11]  Victor Y. Pan,et al.  Efficient parallel solution of linear systems , 1985, STOC '85.

[12]  J. Pasciak,et al.  An iterative method for elliptic problems on regions partitioned into substructures , 1986 .

[13]  Shahid H. Bokhari,et al.  A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.

[14]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[15]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[16]  Claes Johnson.  Numerical solution of partial differential equations by the finite element method , 1988 .

[17]  L. Paul Chew,et al.  Guaranteed-Quality Triangular Meshes , 1989 .

[18]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

[19]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[20]  Gary L. Miller,et al.  Separators in two and three dimensions , 1990, STOC '90.

[21]  Jirí Matousek,et al.  Approximations and optimal geometric divide-and-conquer , 1991, STOC '91.

[22]  Gary L. Miller,et al.  Density graphs and separators , 1991, SODA '91.

[23]  Stephen A. Vavasis,et al.  Automatic Domain Partitioning in Three Dimensions , 1991, SIAM J. Sci. Comput..

[24]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[25]  S. Teng.  Points, spheres, and separators: a unified geometric approach to graph partitioning , 1992 .

[26]  Scott A. Mitchell,et al.  Quality mesh generation in three dimensions , 1992, SCG '92.

[27]  Joseph W. H. Liu,et al.  The Multifrontal Method for Sparse Matrix Solution: Theory and Practice , 1992, SIAM Rev..

[28]  Gary L. Miller,et al.  Automatic Mesh Partitioning , 1992 .

[29]  Jim Ruppert,et al.  A new and simple algorithm for quality 2-dimensional mesh generation , 1993, SODA '93.

[30]  David Eppstein,et al.  Approximating center points with iterated radon points , 1993, SCG '93.

[31]  Gary L. Miller,et al.  On the performance of spectral graph partitioning methods , 1995, SODA '95.

[32]  Gary L. Miller,et al.  A Delaunay based numerical method for three dimensions: generation, formulation, and partition , 1995, STOC '95.

[33]  Bruce Hendrickson,et al.  An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations , 1995, SIAM J. Sci. Comput..

[34]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[35]  David Eppstein,et al.  A Deterministic Linear Time Algorithm for Geometric Separators and its Applications , 1995, Fundam. Informaticae.

[36]  S. Vavasis.  Stable finite elements for problems with wild coefficients , 1996 .

[37]  Herbert S. Wilf,et al.  Algorithms and Complexity , 1994, Lecture Notes in Computer Science.

[38]  Gary L. Miller,et al.  Separators for sphere-packings and nearest neighbor graphs , 1997, JACM.

[39]  Gary L. Miller,et al.  Geometric Mesh Partitioning: Implementation and Experiments , 1998, SIAM J. Sci. Comput..

[40]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .