Stability of the 8-tetrahedra shortest-interior-edge partitioning method
From MaRDI portal
Publication:929364
DOI10.1007/s00211-008-0148-8zbMath1151.65094OpenAlexW2078175289MaRDI QIDQ929364
Publication date: 17 June 2008
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-008-0148-8
Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (2)
Is the Multigrid Method Fault Tolerant? The Multilevel Case ⋮ Is the Multigrid Method Fault Tolerant? The Two-Grid Case
Uses Software
Cites Work
- Unnamed Item
- Relationship between tetrahedron shape measures
- Tetrahedral grid refinement
- Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
- The eight-tetrahedra longest-edge partition and Kuhn triangulations
- Non-degeneracy study of the 8-tetrahedra longest-edge partition
- Simplizialzerlegungen von beschränkter Flachheit
- Mesh Refinement Processes Based on the Generalized Bisection of Simplices
- A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
- A monotone finite element scheme for convection-diffusion equations
- On the Shape of Tetrahedra from Bisection
- A comparison of adaptive refinement techniques for elliptic problems
- Parallel Multilevel Tetrahedral Grid Refinement
This page was built for publication: Stability of the 8-tetrahedra shortest-interior-edge partitioning method