A weak compatibility condition for newest vertex bisection in any dimension
From MaRDI portal
Publication:4558236
Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) 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)
Abstract: We define a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that using this condition the iterative algorithm terminates successfully. Additionally we provide an O(n) algorithm that renumbers any simplex grid to fulfil this condition. Furthermore we conduct experiments to estimate the distance to the standard compatibility and also the geometric quality of the produced meshes.
Recommendations
- A remark on newest vertex bisection in any space dimension
- 30 years of newest vertex bisection
- A coarsening algorithm on adaptive grids by newest vertex bisection and its applications
- On 2D newest vertex bisection: optimality of mesh-closure and \(H ^{1}\)-stability of \(L _{2}\)-projection
- The completion of locally refined simplicial partitions created by bisection
Cites work
- 3D Benchmark on Discretization Schemes for Anisotropic Diffusion Problems on General Grids
- A recursive approach to local mesh refinement in two and three dimensions
- A remark on newest vertex bisection in any space dimension
- An algorithm for adaptive mesh refinement in \(n\) dimensions
- Efficient parallel simulation of atherosclerotic plaque formation using higher order discontinuous Galerkin schemes
- Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
- Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
- Locally Adapted Tetrahedral Meshes Using Bisection
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
- On 2D newest vertex bisection: optimality of mesh-closure and \(H ^{1}\)-stability of \(L _{2}\)-projection
- On generalized bisection of 𝑛-simplices
- On global and local mesh refinements by a generalized conforming bisection algorithm
- On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex
- Optimal grading of the newest vertex bisection and \(H^{1}\)-stability of the \(L_{2}\)-projection
- Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
- TetGen, a Delaunay-based quality tetrahedral mesh generator
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
- The completion of locally refined simplicial partitions created by bisection
- The law of sines for tetrahedra and \(n\)-simplices
Cited in
(4)
This page was built for publication: A weak compatibility condition for newest vertex bisection in any dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558236)
