Pages that link to "Item:Q4210399"
From MaRDI portal
The following pages link to Geometric Mesh Partitioning: Implementation and Experiments (Q4210399):
Displaying 19 items.
- A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries (Q728770) (← links)
- A Matrix Partitioning Interface to PaToH in MATLAB (Q991106) (← links)
- Approximate centerpoints with proofs (Q991175) (← links)
- Two improved algorithms for envelope and wavefront reduction (Q1371664) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Geometric partitioning schemes to reduce modeling bias in statistical volume elements smaller than the scale of isotropic and homogeneous size limits (Q2138797) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- An approximation algorithm for graph partitioning via deterministic annealing neural network (Q2185605) (← links)
- A massively parallel explicit solver for elasto-dynamic problems exploiting octree meshes (Q2236942) (← links)
- Mesh based construction of flat-top partition of unity functions (Q2453247) (← links)
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001) (Q2777710) (← links)
- Geometric Separators for Finite-Element Meshes (Q4389247) (← links)
- Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation (Q4389263) (← links)
- Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) (← links)
- Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation (Q5446877) (← links)
- Airspace sectorization with constraints (Q5479855) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- Min-max-boundary domain decomposition (Q5941438) (← links)
- Agglomeration of polygonal grids using graph neural networks with applications to multigrid solvers (Q6144203) (← links)
