Related papers: Linearization Errors in Discrete Goal-Oriented Err…
In this article, a posteriori error analysis is developed for mixed finite element Galerkin approximations to a second order linear hyperbolic equation. Based on mixed elliptic reconstructions and an integration tool, which is a variation…
A posteriori error estimates are an important tool to bound discretization errors in terms of computable quantities avoiding regularity conditions that are often difficult to establish. For non-linear and non-differentiable problems,…
We study a posteriori error analysis of linear-quadratic boundary control problems under bilateral box constraints on the control which acts through a Neumann type boundary condition. We adopt the hybridizable discontinuous Galerkin method…
Critical points of energy functionals, which are of broad interest, for instance, in physics and chemistry, in solid and quantum mechanics, in material science, or in general diffusion-reaction models arise as solutions to the associated…
Strong approximation errors of both finite element semi-discretization and spatio-temporal full discretization are analyzed for the stochastic Allen-Cahn equation driven by additive noise in space dimension $d \leq 3$. The full…
We present a priori error estimates for a multirate time-stepping scheme for coupled differential equations. The discretization is based on Galerkin methods in time using two different time meshes for two parts of the problem. We aim at…
We consider elliptic problems with complicated, discontinuous diffusion tensor $A_{\scriptscriptstyle 0} $. One of the standard approaches to numerically treat such problems is to simplify the coefficient by some approximation, say…
We derive efficient and reliable goal-oriented error estimations, and devise adaptive mesh procedures for the finite element method that are based on the localization of a posteriori estimates. In our previous work [SIAM J. Sci. Comput.,…
We deal with the numerical solution of the compressible Euler equations with the aid of the discontinuous Galerkin (DG) method with focus on the goal-oriented error estimates and adaptivity. We analyze the adjoint consistency of the DG…
In this article, we develop goal-oriented error indicators to drive adaptive refinement algorithms for the Poisson-Boltzmann equation. Empirical results for the solvation free energy linear functional demonstrate that goal-oriented…
An adaptive algorithm, based on residual type a posteriori indicators of errors measured in $L^{\infty}(L^2)$ and $L^2(L^2)$ norms, for a numerical scheme consisting of implicit Euler method in time and discontinuous Galerkin method in…
We consider initial value problems where we are interested in a quantity of interest (QoI) that is the integral in time of a functional of the solution of the IVP. For these, we look into local error based time adaptivity. We derive a goal…
In this paper we investigate adaptive discretization of the iteratively regularized Gauss- Newton method IRGNM. All-at-once formulations considering the PDE and the measurement equation simultaneously allow to avoid (approximate) solution…
We consider a class of stochastic gradient optimization schemes. Assuming that the objective function is strongly convex, we prove weak error estimates which are uniform in time for the error between the solution of the numerical scheme,…
The paper focuses on unconditionally optimal error analysis of the fully discrete Galerkin finite element methods for a general nonlinear parabolic system in $\R^d$ with $d=2,3$. In terms of a corresponding time-discrete system of PDEs as…
For the first time we introduce an error estimator for the numerical approximation of the equations describing the dynamics of sea ice. The idea of the estimator is to identify different error contributions coming from spatial and temporal…
This work is concerned with the development of a space-time adaptive numerical method, based on a rigorous a posteriori error bound, for a semilinear convection-diffusion problem which may exhibit blow-up in finite time. More specifically,…
Numerical methods for random parametric PDEs can greatly benefit from adaptive refinement schemes, in particular when functional approximations are computed as in stochastic Galerkin and stochastic collocations methods. This work is…
Defeaturing, the process of simplifying computational geometries, is a critical step in industrial simulation pipelines for reducing computational cost. Rigorous a posteriori estimators exist for the global energy-norm error introduced by…
We formulate and analyze a goal-oriented adaptive finite element method (GOAFEM) for a semilinear elliptic PDE and a linear goal functional. The strategy involves the finite element solution of a linearized dual problem, where the…