A new element bisection algorithm for unstructured adaptive tetrahedral mesh generation
adaptive mesh geneationbisection algorithmerror boundsfinite element methodnumerical examplestetrahedral elements
Boundary value problems for second-order elliptic equations (35J25) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
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.
- A simple error estimator and adaptive procedure for practical engineerng analysis
- A study of adaptively remeshed finite element problems using higher order tetrahedra
- An approach to refining three‐dimensional tetrahedral meshes based on Delaunay transformations
- Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
- Error estimates and adaptive finite element methods. A bibliography (1990--2000)
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- Locally Adapted Tetrahedral Meshes Using Bisection
- Locally refined tetrahedral mesh generation based on advancing front technique with optimization and smoothing scheme
- scientific article; zbMATH DE number 822233 (Why is no real title available?)
- scientific article; zbMATH DE number 926631 (Why is no real title available?)
- Tetrahedral bisection and adaptive finite elements
- Adaptive tetrahedral mesh generation by constrained centroidal Voronoi-Delaunay tessellations for finite element methods
- New aspects of the CISAMR algorithm for meshing domain geometries with sharp edges and corners
This page was built for publication: A new element bisection algorithm for unstructured adaptive tetrahedral mesh generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4241289)