Geometric Separators for Finite-Element Meshes

DOI10.1137/S1064827594262613MaRDI QIDQ4389247zbMATH OpenOpenAlexFDO

Authors William P. Thurston, Gary L. Miller, Stephen A. Vavasis, Shang-Hua Teng

Publication date 12 May 1998

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1064827594262613

zbMATH Keywords

algorithmcomputational complexitydomain decompositionfinite elementsmesh partitioning

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Geometric finite elements
• Finite element methods for geometric problems
• scientific article; zbMATH DE number 640795
• Intégration géométrie-maillage appliquée aux méthodes numériques
• Geometric Mesh Partitioning: Implementation and Experiments
• Geometric evaluation of finite element surface meshes
• Geodesic finite elements on simplicial grids
• Geometric idealizations in finite element computations
• FINITE‐ELEMENT MESH GENERATION FROM GEOMETRIC MODELS
• scientific article; zbMATH DE number 822232

Cites work

• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• An Iterative Method for Elliptic Problems on Regions Partitioned into Substructures
• Automatic Domain Partitioning in Three Dimensions
• Coverings of Bipartite Graphs
• scientific article; zbMATH DE number 432835 (Why is no real title available?)
• scientific article; zbMATH DE number 437532 (Why is no real title available?)
• scientific article; zbMATH DE number 3648730 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 42145 (Why is no real title available?)
• scientific article; zbMATH DE number 3555381 (Why is no real title available?)
• scientific article; zbMATH DE number 1263247 (Why is no real title available?)
• scientific article; zbMATH DE number 554764 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 910879 (Why is no real title available?)
• scientific article; zbMATH DE number 3214278 (Why is no real title available?)
• scientific article; zbMATH DE number 3073200 (Why is no real title available?)
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Provably good mesh generation
• Separators for sphere-packings and nearest neighbor graphs
• Stable Finite Elements for Problems with Wild Coefficients

Cited in

(29)

• Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
• Edge integrity of nearest neighbor graphs and separator theorems
• Grad and classes with bounded expansion. II: Algorithmic aspects
• Vulnerability of nearest neighbor graphs
• The vertex separator problem: a polyhedral investigation
• Continuous quadratic programming formulations of optimization problems on graphs
• scientific article; zbMATH DE number 432835 (Why is no real title available?)
• A Glimpse into Thurston’s Work
• The Concept of Dividing Lines/Surfaces for the Finite Difference Element Method (FDEM)
• Algorithm 870
• scientific article; zbMATH DE number 640795 (Why is no real title available?)
• Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
• Network essence: PageRank completion and centrality-conforming Markov chains
• UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES
• Sublinear separators in intersection graphs of convex shapes
• Efficient mapping of high order basis sets for unbounded domains
• Min-max-boundary domain decomposition
• Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
• A note on the SDP relaxation of the minimum cut problem
• On weighted sublinear separators
• Non-existence of annular separators in geometric graphs
• Fast separator decomposition for finite element meshes
• Optimal cache-oblivious mesh layouts
• Metric uniformization and spectral bounds for graphs
• The MIN-cut and vertex separator problem
• A multilevel bilinear programming algorithm for the vertex separator problem
• Simple and optimal output-sensitive construction of contour trees using monotone paths
• Diamond-kite meshes: adaptive quadrilateral meshing and orthogonal circle packing
• Spectral partitioning works: planar graphs and finite element meshes

This page was built for publication: Geometric Separators for Finite-Element Meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389247)