Displaying similar documents to “Two-sided bounds of the discretization error for finite elements”

Two-sided bounds of the discretization error for finite elements

Michal Křížek, Hans-Goerg Roos, Wei Chen (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We derive an optimal lower bound of the interpolation error for linear finite elements on a bounded two-dimensional domain. Using the supercloseness between the linear interpolant of the true solution of an elliptic problem and its finite element solution on uniform partitions, we further obtain two-sided bounds of the discretization error by means of the interpolation error. Two-sided bounds for bilinear finite elements are given as well. Numerical tests illustrate our theoretical analysis. ...

Quasi-Interpolation and A Posteriori Error Analysis in Finite Element Methods

Carsten Carstensen (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

One of the main tools in the proof of residual-based error estimates is a quasi-interpolation operator due to Clément. We modify this operator in the setting of a partition of unity with the effect that the approximation error has a local average zero. This results in a new residual-based error estimate with a volume contribution which is smaller than in the standard estimate. For an elliptic model problem, we discuss applications to conforming, nonconforming and mixed finite...

Accurate and online-efficient evaluation of the a posteriori error bound in the reduced basis method

Fabien Casenave, Alexandre Ern, Tony Lelièvre (2014)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

The reduced basis method is a model reduction technique yielding substantial savings of computational time when a solution to a parametrized equation has to be computed for many values of the parameter. Certification of the approximation is possible by means of an error bound. Under appropriate assumptions, this error bound is computed with an algorithm of complexity independent of the size of the full problem. In practice, the evaluation of the error bound can become very sensitive...