A weak compatibility condition for newest vertex bisection in any dimension

DOI10.1137/17M1156137zbMATH Open1404.65247arXiv1711.03141WikidataQ128907080 ScholiaQ128907080MaRDI QIDQ4558236FDOQ4558236

Authors: Martin Alkämper, Fernando D. Gaspoz, R. Klöfkorn 

Publication date: 21 November 2018

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1711.03141

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

zbMATH Keywords

adaptive methodmesh refinementmesh generationnewest vertex bisection

Mathematics Subject Classification ID

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)

Cites Work

• Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
• TetGen, a Delaunay-based quality tetrahedral mesh generator
• Locally Adapted Tetrahedral Meshes Using Bisection
• Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
• The completion of locally refined simplicial partitions created by bisection
• On 2D newest vertex bisection: optimality of mesh-closure and \(H ^{1}\)-stability of \(L _{2}\)-projection
• A recursive approach to local mesh refinement in two and three dimensions
• 3D Benchmark on Discretization Schemes for Anisotropic Diffusion Problems on General Grids
• An algorithm for adaptive mesh refinement in \(n\) dimensions
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• On global and local mesh refinements by a generalized conforming bisection algorithm
• Mesh quality improvement and other properties in the four-triangles longest-edge partition
• A remark on newest vertex bisection in any space dimension
• New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
• The law of sines for tetrahedra and \(n\)-simplices
• On generalized bisection of 𝑛-simplices
• The 4-triangles longest-side partition of triangles and linear refinement algorithms
• 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
• Efficient parallel simulation of atherosclerotic plaque formation using higher order discontinuous Galerkin schemes

Cited In (4)

• Efficient P1-FEM for any space dimension in \textsc{Matlab}
• A remark on newest vertex bisection in any space dimension
• The \textsc{Dune} framework: basic concepts and recent developments
• 30 years of newest vertex bisection

Uses Software

• Gmsh
• TetGen
• ALUGrid
• DUNE-ALUGrid

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)