Construction of 4D Simplex Space-Time Meshes for Local Bisection Schemes
From MaRDI portal
Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Abstract: Adaptive mesh refinement is a key component of efficient unstructured space-time finite element methods. Underlying any adaptive mesh refinement scheme is, of course, a method for local refinement of simplices. However, simplex bisection algorithms in dimension greater than three have strict mesh preconditions which can be hard to satisfy. We prove that certain four-dimensional simplex space-time meshes can be handled with a relaxed precondition. Namely, we prove that if a tetrahedral mesh is 4-colorable, then we can produce a 4D simplex mesh which always satisfies the bisection precondition. We also briefly discuss strategies to handle tetrahedral meshes which are not 4-colorable.
This page was built for publication: Construction of 4D Simplex Space-Time Meshes for Local Bisection Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375169)
