67 research outputs found
Improved ZZ A Posteriori Error Estimators for Diffusion Problems: Conforming Linear Elements
In \cite{CaZh:09}, we introduced and analyzed an improved Zienkiewicz-Zhu
(ZZ) estimator for the conforming linear finite element approximation to
elliptic interface problems. The estimator is based on the piecewise "constant"
flux recovery in the conforming finite element space. This
paper extends the results of \cite{CaZh:09} to diffusion problems with full
diffusion tensor and to the flux recovery both in piecewise constant and
piecewise linear space.Comment: arXiv admin note: substantial text overlap with arXiv:1407.437
Analysis of Recovery Type A Posteriori Error Estimators for Mildly Structured Grids
Some recovery type error estimators for linear finite element method are analyzed under O(h1+alpha) (alpha greater than 0) regular grids. Superconvergence is established for recovered gradients by three different methods when solving general non-self-adjoint second-order elliptic equations. As a consequence, a posteriori error estimators based on those recovery methods are asymptotically exact
Gradient Recovery and A Posteriori Estimate for Bilinear Element on Irregular Quadrilateral Meshes
A polynomial preserving gradient recovery method is proposed and analyzed for bilinear element under general quadrilateral meshes. It has been proven that the recovered gradient converges at a rate O(h1+rho) for rho = min(alpha, 1) when the mesh is distorted O(h1+alpha) (alpha \u3e 0) from a regular one. Consequently, the a posteriori error estimator based on the recovered gradient is asymptotically exact
Recommended from our members
Mini-Workshop: Adaptive Methods for Control Problems Constrained by Time-Dependent PDEs
Optimization problems constrained by time-dependent PDEs (Partial Differential Equations) are challenging from a computational point of view: even in the simplest case, one needs to solve a system of PDEs coupled globally in time and space for the unknown solutions (the state, the costate and the control of the system). Typical and practically relevant examples are the control of nonlinear heat equations as they appear in laser hardening or the thermic control of flow problems (Boussinesq equations). Specifically for PDEs with a long time horizon, conventional time-stepping methods require an enormous storage of the respective other variables. In contrast, adaptive methods aim at distributing the available degrees of freedom in an a-posteriori-fashion to capture singularities and are, therefore, most promising
A posteriori error estimator based on gradient recovery by averaging for discontinuous Galerkin methods
International audienceWe consider some (anisotropic and piecewise constant) diffusion problems in domains of R^2, approximated by a discontinuous Galerkin method with polynomials of any fixed degree. We propose an a posteriori error estimator based on gradient recovery by averaging. It is shown that this estimator gives rise to an upper bound where the constant is one up to some additional terms that guarantee reliability. The lower bound is also established. Moreover these additional terms are negligible when the recovered gradient is super convergent. The reliability and efficiency of the proposed estimator in confirmed by some numerical tests
Residual estimates for post-processors in elliptic problems
In this work we examine a posteriori error control for post-processed
approximations to elliptic boundary value problems. We introduce a class of
post-processing operator that `tweaks' a wide variety of existing
post-processing techniques to enable efficient and reliable a posteriori bounds
to be proven. This ultimately results in optimal error control for all manner
of reconstruction operators, including those that superconverge. We showcase
our results by applying them to two classes of very popular reconstruction
operators, the Smoothness-Increasing Accuracy-Enhancing filter and
Superconvergent Patch Recovery. Extensive numerical tests are conducted that
confirm our analytic findings.Comment: 25 pages, 17 figure
Recovery methods for evolution and nonlinear problems
Functions in finite dimensional spaces are, in general, not smooth enough to be differentiable in the classical sense and “recovered” versions of their first and second derivatives must be sought for certain applications. In this work we make use of recovered derivatives for applications in finite element schemes for two different purposes. We thus split this Thesis into two distinct parts.
In the first part we derive energy-norm aposteriori error bounds, using gradient recovery (ZZ) estimators to control the spatial error for fully discrete schemes of the linear heat equation. To our knowledge this is the first completely rigorous derivation of ZZ estimators for fully discrete schemes for evolution problems, without any restrictive assumption on the timestep size. An essential tool for the analysis is the elliptic reconstruction technique introduced as an aposteriori analog to the elliptic (Ritz) projection.
Our theoretical results are backed up with extensive numerical experimentation aimed at (1) testing the practical sharpness and asymptotic behaviour of the error estimator against the error, and (2) deriving an adaptive method based on our estimators.
An extra novelty is an implementation of a coarsening error “preindicator”, with a complete implementation guide in ALBERTA (versions 1.0–2.0).
In the second part of this Thesis we propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galërkin type using conforming finite elements and applied directly to the nonvariational(or nondivergence) form of a second order linear elliptic problem. The key tools are an
appropriate concept of the “finite element Hessian” based on a Hessian recovery and a Schur complement approach to solving the resulting linear algebra problem. The method
is illustrated with computational experiments on linear PDEs in nonvariational form.
We then use the nonvariational finite element method to build a numerical method for fully nonlinear elliptic equations. We linearise the problem via Newton’s method resulting in a sequence of nonvariational elliptic problems which are then approximated with the nonvariational finite element method. This method is applicable to general fully nonlinear PDEs who admit a unique solution without constraint.
We also study fully nonlinear PDEs when they are only uniformly elliptic on a certain class of functions. We construct a numerical method for the Monge–Ampère equation
based on using “finite element convexity” as a constraint for the aforementioned nonvariational finite element method. This method is backed up with numerical experimentation
- …