Geometric Mesh Partitioning: Implementation and Experiments
From MaRDI portal
Publication:4210399
DOI10.1137/S1064827594275339zbMath0913.65107OpenAlexW2106978190MaRDI QIDQ4210399
John R. Gilbert, Shang-Hua Teng, Gary Lee Miller
Publication date: 21 September 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827594275339
conformal mappingparallel processingMatlabmoment of inertiaseparatorsmesh partitioninggeometric samplingcenterpointsgraph and geometric algorithms
Computational methods for sparse matrices (65F50) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items
An overview of graph covering and partitioning, Two improved algorithms for envelope and wavefront reduction, An approximation algorithm for graph partitioning via deterministic annealing neural network, Agglomeration of polygonal grids using graph neural networks with applications to multigrid solvers, An exact algorithm for graph partitioning, Network Essence: PageRank Completion and Centrality-Conforming Markov Chains, A massively parallel explicit solver for elasto-dynamic problems exploiting octree meshes, Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation, A survey of direct methods for sparse linear systems, Min-max-boundary domain decomposition, 2D and 3D finite element meshing and remeshing, A Matrix Partitioning Interface to PaToH in MATLAB, Approximate centerpoints with proofs, Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation, A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries, Airspace sectorization with constraints
Uses Software
