A Weak Compatibility Condition for Newest Vertex Bisection in Any Dimension
type: Item
instance of: scholarly article
title: A Weak Compatibility Condition for Newest Vertex Bisection in Any Dimension
zbMATH Open document ID: 1404.65247
DOI: 10.1137/17M1156137
author: Martin Alkämper
author: Fernando D. Gaspoz
author: R. Klöfkorn
published in: SIAM Journal on Scientific Computing
publication date: 2018-11-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1711.03141
Mathematics Subject Classification ID: 65N30
Mathematics Subject Classification ID: 65N50
Mathematics Subject Classification ID: 65N12
zbMATH DE Number: 6982454
zbMATH Keywords: adaptive method
zbMATH Keywords: mesh generation
zbMATH Keywords: mesh refinement
zbMATH Keywords: newest vertex bisection
describes a project that uses: Gmsh
describes a project that uses: DUNE-ALUGrid
describes a project that uses: TetGen
describes a project that uses: ALUGrid
MaRDI profile type: Publication
arXiv ID: 1711.03141
cites work: Q4639655
cites work: Locally Adapted Tetrahedral Meshes Using Bisection
cites work: Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
cites work: The law of sines for tetrahedra and \(n\)-simplices
cites work: 3D Benchmark on Discretization Schemes for Anisotropic Diffusion Problems on General Grids
cites work: A remark on newest vertex bisection in any space dimension
cites work: Optimal grading of the newest vertex bisection andH1-stability of theL2-projection
cites work: Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities
cites work: Efficient Parallel Simulation of Atherosclerotic Plaque Formation Using Higher Order Discontinuous Galerkin Schemes
cites work: On global and local mesh refinements by a generalized conforming bisection algorithm
cites work: On generalized bisection of 𝑛-simplices
cites work: On 2D newest vertex bisection: optimality of mesh-closure and \(H ^{1}\)-stability of \(L _{2}\)-projection
cites work: A recursive approach to local mesh refinement in two and three dimensions
cites work: Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
cites work: Mesh quality improvement and other properties in the four-triangles longest-edge partition
cites work: New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
cites work: The 4-triangles longest-side partition of triangles and linear refinement algorithms
cites work: TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
cites work: The completion of locally refined simplicial partitions created by bisection
cites work: An algorithm for adaptive mesh refinement in \(n\) dimensions
Wikidata QID: Q128907080
description: scientific article; zbMATH DE number 6982454