A remark on newest vertex bisection in any space dimension

DOI10.1515/cmam-2014-0013zbMath1297.65189OpenAlexW1968656190MaRDI QIDQ400745

Dietmar Gallistl, Rob P. Stevenson, Mira Schedensack

Publication date: 25 August 2014

Published in: Computational Methods in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/cmam-2014-0013

zbMATH Keywords

\(n\)-simplicesadaptive mesh-refinementnewest-vertex bisection

Mathematics Subject Classification ID

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) Complexity and performance of numerical algorithms (65Y20)

Related Items (11)

A Weak Compatibility Condition for Newest Vertex Bisection in Any Dimension ⋮ Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver ⋮ Axioms of Adaptivity with Separate Marking for Data Resolution ⋮ Adaptive IGAFEM with optimal convergence rates: T-splines ⋮ Adaptive guaranteed lower eigenvalue bounds with optimal convergence rates ⋮ Constants in discrete Poincaré and Friedrichs inequalities and discrete quasi-interpolation ⋮ Adaptive Uzawa algorithm for the Stokes equation ⋮ The saturation assumption yields optimal convergence of two-level adaptive BEM ⋮ Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems ⋮ Rate optimality of adaptive finite element methods with respect to overall computational costs ⋮ Multilevel decompositions and norms for negative order Sobolev spaces

This page was built for publication: A remark on newest vertex bisection in any space dimension