Martin Vohralík

Alexandre Ern, Iain Smears, Martin Vohralík

We consider the a posteriori error analysis of approximations of parabolic problems based on arbitrarily high-order conforming Galerkin spatial discretizations and arbitrarily high-order discontinuous Galerkin temporal discretizations. Using equilibrated flux reconstructions, we present a posteriori error estimates for a norm composed of the $L^2(H^1)\cap H^1(H^{-1})$-norm of the error and the temporal jumps of the numerical solution. The estimators provide guaranteed upper bounds for this norm, without unknown constants. Furthermore, the efficiency of the estimators with respect to this norm is local in both space and time, with constants that are robust with respect to the mesh-size, time-step size, and the spatial and temporal polynomial degrees. We further show that this norm, which is key for local space-time efficiency, is globally equivalent to the $L^2(H^1)\cap H^1(H^{-1})$-norm of the error, with polynomial-degree robust constants. The proposed estimators also have the practical advantage of allowing for very general refinement and coarsening between the timesteps.

Patrik Daniel, Alexandre Ern, Iain Smears et al.

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 ${\mathbf H}(\mathrm{div},Ω)$-conforming equilibrated flux. This, in turn, yields a guaranteed upper bound on the error and serves to mark mesh vertices for refinement via Dörfler'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.

Alexandre Ern, Iain Smears, Martin Vohralík

We establish the existence of liftings into discrete subspaces of $\mathbf{H}(\mathrm{div})$ of piecewise polynomial data on locally refined simplicial partitions of polygonal/polyhedral domains. Our liftings are robust with respect to the polynomial degree. This result has important applications in the a posteriori error analysis of parabolic problems, where it permits the removal of so-called transition conditions that link two consecutive meshes. It can also be used in a the posteriori error analysis of elliptic problems, where it allows the treatment of meshes with arbitrary numbers of hanging nodes between elements. We present a constructive proof based on the a posteriori error analysis of an auxiliary elliptic problem with $H^{-1}$ source terms, thereby yielding results of independent interest. In particular, for such problems, we obtain guaranteed upper bounds on the error along with polynomial-degree robust local efficiency of the estimators.

Iain Smears, Martin Vohralík

We consider energy norm a posteriori error analysis of conforming finite element approximations of singularly perturbed reaction-diffusion problems on simplicial meshes in arbitrary space dimension. Using an equilibrated flux reconstruction, the proposed estimator gives a guaranteed global upper bound on the error without unknown constants, and local efficiency robust with respect to the mesh size and singular perturbation parameters. Whereas previous works on equilibrated flux estimators only considered lowest-order finite element approximations and achieved robustness through the use of boundary-layer adapted submeshes or via combination with residual-based estimators, the present methodology applies in a simple way to arbitrary-order approximations and does not request any submesh or estimators combination. The equilibrated flux is obtained via local reaction-diffusion problems with suitable weights (cut-off factors), and the guaranteed upper bound features the same weights. We prove that the inclusion of these weights is not only sufficient but also necessary for robustness of any flux equilibration estimate that does not employ submeshes or estimators combination, which shows that some of the flux equilibrations proposed in the past cannot be robust. To achieve the fully computable upper bound, we derive explicit bounds for some inverse inequality constants on a simplex, which may be of independent interest.

Alexandre Ern, Martin Vohralík, Mohammad Zakerzadeh

We propose a reconstruction-based a posteriori error estimate for linear advection problems in one space dimension. In our framework, a stable variational ultra-weak formulation is adopted, and the equivalence of the $L_2$-norm of the error with the dual graph norm of the residual is established. This dual norm is showed to be localizable over vertex-based patch subdomains of the computational domain under the condition of the orthogonality of the residual to the piecewise affine hat functions. We show that this condition is valid for some well-known numerical methods including continuous/discontinuous Petrov--Galerkin and discontinuous Galerkin methods. Consequently, a well-posed local problem on each patch is identified, which leads to a global conforming reconstruction of the discrete solution. We prove that this reconstruction provides a guaranteed upper bound on the $L_2$ error. Moreover, up to a constant, it also gives local lower bounds on the $L_2$ error, where the generic constant is proven to be independent of mesh-refinement, polynomial degree of the approximation, and the advective velocity. This leads to robustness of our estimates with respect to the advection as well as the polynomial degree. All the above properties are verified in a series of numerical experiments, additionally leading to asymptotic exactness. Motivated by these results, we finally propose a heuristic extension of our methodology to any space dimension, achieved by solving local least-squares problems on vertex-based patches. Though not anymore guaranteed, the resulting error indicator is numerically robust with respect to both advection velocity and polynomial degree, for a collection of two-dimensional test cases including discontinuous solutions.