An adaptive hp-refinement strategy with computable guaranteed bound on the error reduction factor

DOI10.1016/J.CAMWA.2018.05.034zbMATH Open1427.65356arXiv1712.09821OpenAlexW2780989679MaRDI QIDQ2338342FDOQ2338342

Authors: Patrik Daniel, Alexandre Ern, Iain Smears, Martin Vohralík 

Publication date: 21 November 2019

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Abstract: We propose a new practical adaptive refinement strategy for $hp$-finite element approximations of elliptic problems. Following recent theoretical developments in polynomial-degree-robust a posteriori error analysis, we solve two types of discrete local problems on vertex-based patches. The first type involves the solution on each patch of a mixed finite element problem with homogeneous Neumann boundary conditions, which leads to an $mathbfH(mathrmdiv,Omega)$-conforming equilibrated flux. This, in turn, yields a guaranteed upper bound on the error and serves to mark mesh vertices for refinement via D"orfler's bulk-chasing criterion. The second type of local problems involves the solution, on patches associated with marked vertices only, of two separate primal finite element problems with homogeneous Dirichlet boundary conditions, which serve to decide between $h$-, $p$-, or $hp$-refinement. Altogether, we show that these ingredients lead to a computable guaranteed bound on the ratio of the errors between successive refinements (error reduction factor). In a series of numerical experiments featuring smooth and singular solutions, we study the performance of the proposed $hp$-adaptive strategy and observe exponential convergence rates. We also investigate the accuracy of our bound on the reduction factor by evaluating the ratio of the predicted reduction factor relative to the true error reduction, and we find that this ratio is in general quite close to the optimal value of one.

Full work available at URL: https://arxiv.org/abs/1712.09821

Recommendations

• An adaptive \(hp\)-refinement strategy with inexact solvers and computable guaranteed bound on the error reduction factor
• Guaranteed contraction of adaptive inexact hp-refinement strategies with realistic stopping criteria
• A fully automatic \(hp\)-adaptivity
• An adaptive refinement strategy for \(hp\)-finite element computations
• \(hp\)-adaptation driven by polynomial-degree-robust a posteriori error estimates for elliptic problems

zbMATH Keywords

finite element methoda posteriori error estimateerror reduction\(hp\)-refinementequilibrated fluxresidual lifting

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Error bounds for boundary value problems involving PDEs (65N15) 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)

Cites Work

• An adaptive strategy for \(hp\)-FEM based on testing for analyticity
• The h-p version of the finite element method. I. The basic approximation results
• A Convergent Adaptive Algorithm for Poisson’s Equation
• Optimality of a standard adaptive finite element method
• Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
• Convergence of Adaptive Finite Element Methods
• Theory of adaptive finite element methods: An introduction
• Explicit error bounds in a conforming finite element method
• Title not available (Why is that?)
• The h, p and h-p versions of the finite element method in 1 dimension. II. The error analysis of the h- and h-p versions
• Decay rates of adaptive finite elements with Dörfler marking
• Convergence of an adaptive \( hp\) finite element strategy in one space dimension
• Equilibrated residual error estimates are \(p\)-robust
• The h-p version of the finite element method. II. General results and applications
• A note on the design of \(hp\)-adaptive finite element methods for elliptic partial differential equations
• Quasioptimal cardinality of AFEM driven by nonresidual estimators
• Axioms of adaptivity
• Local problems on stars: A posteriori error estimators, convergence, and performance
• Convergence of an adaptive \(hp\) finite element strategy in higher space-dimensions
• The h, p and h-p versions of the finite element method in 1 dimension. III. The adaptive h-p version
• A survwey of \(hp\)-adaptive strategies for elliptic partial differential equations
• A comparison of \(hp\)-adaptive strategies for elliptic partial differential equations
• Polynomial-degree-robust a posteriori estimates in a unified setting for conforming, nonconforming, discontinuous Galerkin, and mixed discretizations
• Saturation estimates for \(hp\)-finite element methods
• Title not available (Why is that?)
• \(hp\)-adaptation driven by polynomial-degree-robust a posteriori error estimates for elliptic problems
• On \(p\)-robust saturation for \(hp\)-AFEM

Cited In (12)

• Adaptive poromechanics computations based on a posteriori error estimates for fully mixed formulations of Biot's consolidation model
• A posteriori error estimates for mixed finite element discretizations of the Neutron Diffusion equations
• Tree approximation for hp-adaptivity
• A posteriori-based, local multilevel mesh refinement for the Darcy porous media flow problem
• Deep reinforcement learning for adaptive mesh refinement
• An adaptive \(hp\)-refinement strategy with inexact solvers and computable guaranteed bound on the error reduction factor
• Title not available (Why is that?)
• An improved adaptive hp mesh refinement method in solving optimal control problems
• Guaranteed contraction of adaptive inexact hp-refinement strategies with realistic stopping criteria
• Polynomial-degree-robust \(\boldsymbol H(\mathbf{curl})\)-stability of discrete minimization in a tetrahedron
• Moving mesh method for simulating high-dimensional time dependent PDEs with fast propagating shock waves
• Stable broken \(\boldsymbol{H}(\mathbf{curl})\) polynomial extensions and \(p\)-robust a posteriori error estimates by broken patchwise equilibration for the curl-curl problem

This page was built for publication: An adaptive \(hp\)-refinement strategy with computable guaranteed bound on the error reduction factor

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