Loading…
A posteriori estimates distinguishing the error components and adaptive stopping criteria for numerical approximations of parabolic variational inequalities
We consider in this paper a model parabolic variational inequality. This problem is discretized with conforming Lagrange finite elements of order p≥1 in space and with the backward Euler scheme in time. The nonlinearity coming from the complementarity constraints is treated with any semismooth Newto...
Saved in:
Published in: | Computer methods in applied mechanics and engineering 2020-08, Vol.367, p.113105, Article 113105 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We consider in this paper a model parabolic variational inequality. This problem is discretized with conforming Lagrange finite elements of order p≥1 in space and with the backward Euler scheme in time. The nonlinearity coming from the complementarity constraints is treated with any semismooth Newton algorithm and we take into account in our analysis an arbitrary iterative algebraic solver. In the case p=1, when the system of nonlinear algebraic equations is solved exactly, we derive an a posteriori error estimate on both the energy error norm and a norm approximating the time derivative error. When p≥1, we provide a fully computable and guaranteed a posteriori estimate in the energy error norm which is valid at each step of the linearization and algebraic solvers. Our estimate, based on equilibrated flux reconstructions, also distinguishes the discretization, linearization, and algebraic error components. We build an adaptive inexact semismooth Newton algorithm based on stopping the iterations of both solvers when the estimators of the corresponding error components do not affect significantly the overall estimate. Numerical experiments are performed with the semismooth Newton-min algorithm and the semismooth Newton–Fischer–Burmeister algorithm in combination with the GMRES iterative algebraic solver to illustrate the strengths of our approach. |
---|---|
ISSN: | 0045-7825 1879-2138 |
DOI: | 10.1016/j.cma.2020.113105 |