Local coarsening of simplicial finite element meshes generated by bisections

DOI10.1007/S10543-012-0378-0zbMath1255.65221OpenAlexW2018107428MaRDI QIDQ1759589

Patrick Schreier, Sören Bartels

Publication date: 21 November 2012

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-012-0378-0

zbMATH Keywords

triangulationfinite elementsnumerical experimentsadaptive mesh refinementadaptivitycoarseningbisection

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)

Related Items (2)

Error control and adaptivity for a variational model problem defined on functions of bounded variation ⋮ A coarsening algorithm on adaptive red-green-blue refined meshes

Cites Work

• An algorithm for adaptive mesh refinement in \(n\) dimensions
• Adaptive finite element methods with convergence rates
• A recursive approach to local mesh refinement in two and three dimensions
• Optimality of a standard adaptive finite element method
• A Coarsening Algorithm on Adaptive Grids by Newest Vertex Bisection and Its Applications
• Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• The completion of locally refined simplicial partitions created by bisection

This page was built for publication: Local coarsening of simplicial finite element meshes generated by bisections