Stability of the 8-tetrahedra shortest-interior-edge partitioning method
type: Item
instance of: scholarly article
title: Stability of the 8-tetrahedra shortest-interior-edge partitioning method
zbMATH Open document ID: 1151.65094
author: Tim Kröger
author: Tobias Preusser
published in: Numerische Mathematik
publication date: 2008-06-17T00:00:00Z
review text: The authors prove the stability of a refinement process (referred to in the title) applied to tetrahedra according to the shape quality measure of \textit{A. Liu} and \textit{B. Joe} [BIT 34, No.~2, 268--287 (1994; Zbl 0806.65104)]. For the proof, the problem is reformulated in terms of linear algebra and algebraic tools are aplied. They also show the sharpness of their stability estimate and illustrate the results by numerical experiments.
reviewed by: Gisbert Stoyan
Mathematics Subject Classification ID: 65N50
Mathematics Subject Classification ID: 65N12
zbMATH DE Number: 5288753
zbMATH Keywords: grid refinement
zbMATH Keywords: tetrahedra
zbMATH Keywords: shape quality measure
zbMATH Keywords: stability
describes a project that uses: libMesh
MaRDI profile type: Publication
full work available at URL: s00211-008-0148-8
OpenAlex ID: W2078175289
cites work: Tetrahedral grid refinement
cites work: Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
cites work: Simplizialzerlegungen von beschränkter Flachheit
cites work: Parallel Multilevel Tetrahedral Grid Refinement
cites work: On the Shape of Tetrahedra from Bisection
cites work: Relationship between tetrahedron shape measures
cites work: A comparison of adaptive refinement techniques for elliptic problems
cites work: The eight-tetrahedra longest-edge partition and Kuhn triangulations
cites work: Non-degeneracy study of the 8-tetrahedra longest-edge partition
cites work: Mesh Refinement Processes Based on the Generalized Bisection of Simplices
cites work: A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
cites work: A monotone finite element scheme for convection-diffusion equations
cites work: Q4867284
DOI: 10.1007/S00211-008-0148-8
Recommended article: Non-degeneracy study of the 8-tetrahedra longest-edge partition
Recommended article: The eight-tetrahedra longest-edge partition and Kuhn triangulations
Recommended article: Q3807893
Recommended article: Stability of a partitioning algorithm for bidiagonal systems
Recommended article: A decision procedure for optimal polyhedron partitioning
Recommended article: On the Stability of a Partitioning Algorithm for Tridiagonal Systems
Recommended article: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
Recommended article: Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
Recommended article: Approximation algorithms for decomposing octilinear polygons
Recommended article: Mesh quality improvement and other properties in the four-triangles longest-edge partition
description: scientific article; zbMATH DE number 5288753