Guaranteed and robust $L_2$-norm a posteriori error estimates for 1D linear advection problems

TL;DR

This paper introduces a stable, reconstruction-based a posteriori error estimator for 1D linear advection problems that guarantees upper bounds on the error and demonstrates robustness across mesh refinements, polynomial degrees, and advection velocities.

Contribution

It develops a novel, guaranteed, and robust $L_2$-norm error estimate for 1D advection problems using a dual graph norm approach and local reconstructions, applicable to various numerical methods.

Findings

Provides guaranteed upper bounds on the $L_2$ error.

Establishes local lower bounds independent of mesh and polynomial degree.

Demonstrates robustness through numerical experiments and extensions to 2D cases.

Abstract

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.