A Weak Compatibility Condition for Newest Vertex Bisection in Any Dimension
From MaRDI portal
Publication:4558236
DOI10.1137/17M1156137zbMath1404.65247arXiv1711.03141WikidataQ128907080 ScholiaQ128907080MaRDI QIDQ4558236
Robert Klöfkorn, Fernando D. Gaspoz, Martin Alkämper
Publication date: 21 November 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.03141
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)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On 2D newest vertex bisection: optimality of mesh-closure and \(H ^{1}\)-stability of \(L _{2}\)-projection
- A remark on newest vertex bisection in any space dimension
- The law of sines for tetrahedra and \(n\)-simplices
- An algorithm for adaptive mesh refinement in \(n\) dimensions
- A recursive approach to local mesh refinement in two and three dimensions
- 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
- 3D Benchmark on Discretization Schemes for Anisotropic Diffusion Problems on General Grids
- Efficient Parallel Simulation of Atherosclerotic Plaque Formation Using Higher Order Discontinuous Galerkin Schemes
- On generalized bisection of 𝑛-simplices
- Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
- 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
- Optimal grading of the newest vertex bisection andH1-stability of theL2-projection
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
- The completion of locally refined simplicial partitions created by bisection
