A new element bisection algorithm for unstructured adaptive tetrahedral mesh generation (Q4241289)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1291573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new element bisection algorithm for unstructured adaptive tetrahedral mesh generation |
scientific article; zbMATH DE number 1291573 |
Statements
A new element bisection algorithm for unstructured adaptive tetrahedral mesh generation (English)
0 references
3 April 2000
0 references
bisection algorithm
0 references
finite element method
0 references
error bounds
0 references
tetrahedral elements
0 references
numerical examples
0 references
adaptive mesh geneation
0 references
0 references
0 references
0.832530677318573
0 references
0.813046395778656
0 references
0.8050698637962341
0 references
A new \(h\)-refinement adaptive mesh generation algorithm is presented. Three-dimensional domains are discretised by a mesh of tetrahedral elements. A posteriori error estimation is carried out by using the Zienkiewicz-Zhu error indicator. Mesh refinement is carried out in the usual way by making use of the error indicator, and the shape quality of the current mesh is enhanced by the iterative application of nodal relaxation plus three topological transformations. Ten-noded linear tetrahedral elements are used, and four examples demonstrate the robustness and efficiency of the algorithm.
0 references
