Adaptive mesh refinement for arbitrary initial triangulations

DOI10.1007/S10208-025-09698-7MaRDI QIDQ7285619zbMATH OpenFDO

Authors Lars Diening, Lukas Gehring, Johannes Storn

Publication date 22 June 2026

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10208-025-09698-7

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

Cites work

• A Convergent Adaptive Algorithm for Poisson’s Equation
• A recursive approach to local mesh refinement in two and three dimensions
• A weak compatibility condition for newest vertex bisection in any dimension
• Adaptive finite element methods with convergence rates
• Adaptive refinement for arbitrary finite-element spaces with hierarchical bases
• An algorithm for adaptive mesh refinement in \(n\) dimensions
• Automated solution of differential equations by the finite element method. The FEniCS book
• Axioms of adaptivity
• Divergence of FEM: Babuška-Aziz triangulations revisited.
• Efficient algorithms for Petersen's matching theorem
• Generalization of the Zlamal condition for simplicial finite elements in \(\mathbb {R}^{d}\)
• scientific article; zbMATH DE number 3216147 (Why is no real title available?)
• Instance optimality of the adaptive maximum strategy
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• Local mesh refinement in 2 and 3 dimensions
• Local modification of meshes for adaptive and/or multigrid finite-element methods
• Locally Adapted Tetrahedral Meshes Using Bisection
• Mesh Refinement Processes Based on the Generalized Bisection of Simplices
• NETGEN: An advancing front 2D/3D-mesh generator based on abstract rules
• On 2D newest vertex bisection: optimality of mesh-closure and \(H ^{1}\)-stability of \(L _{2}\)-projection
• On the Angle Condition in the Finite Element Method
• On the equivalence of ball conditions for simplicial finite elements in R^d
• Optimality of a standard adaptive finite element method
• Scalable adaptive bisection algorithms on decomposed simplicial partitions for efficient discretizations of nonlinear partial differential equations
• The completion of locally refined simplicial partitions created by bisection

Cited in

(1)

• Global convergence of adaptive least-squares finite element methods for nonlinear PDEs

This page was built for publication: Adaptive mesh refinement for arbitrary initial triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285619)