Article

# A posteriori $L^\infty(L^2)$-error bounds in finite element approximation of the wave equation

03/2010;
Source: arXiv

ABSTRACT We address the error control of Galerkin discretization (in space) of linear
second order hyperbolic problems. More specifically, we derive a posteriori
error bounds in the L\infty(L2)-norm for finite element methods for the linear
wave equation, under minimal regularity assumptions. The theory is developed
for both the space-discrete case, as well as for an implicit fully discrete
scheme. The derivation of these bounds relies crucially on carefully
constructed space- and time-reconstructions of the discrete numerical
solutions, in conjunction with a technique introduced by Baker (1976, SIAM J.
Numer. Anal., 13) in the context of a priori error analysis of Galerkin
discretization of the wave problem in weaker-than-energy spatial norms.

0 0
·
0 Bookmarks
·
126 Views
• Source
##### Article: A posteriori finite element error estimation for second-order hyperbolic problems
[hide abstract]
ABSTRACT: We develop a posteriori finite element discretization error estimates for the wave equation. In one dimension, we show that the significant part of the spatial finite element error is proportional to a Lobatto polynomial and an error estimate is obtained by solving a set of either local elliptic or hyperbolic problems. In two dimensions, we show that the dichotomy principle of Babuška and Yu holds. For even-degree approximations error estimates are computed by solving a set of local elliptic or hyperbolic problems and for odd-degree approximations an error estimate is computed using jumps of solution gradients across element boundaries. This study also extends known superconvergence results for elliptic and parabolic problems [Superconvergence in Galerkin Finite Element Methods, Springer Verlag, New York, 1995] to second-order hyperbolic problems.
Computer Methods in Applied Mechanics and Engineering. 01/2002;
• Source
##### Article: A posteriori error estimates for the Crank-Nicolson method for parabolic equations.
[hide abstract]
ABSTRACT: We derive optimal order a posteriori error estimates for time dis- cretizations by both the Crank-Nicolson and the Crank-Nicolson-Galerkin methods for linear and nonlinear parabolic equations. We examine both smooth and rough initial data. Our basic tool for deriving a posteriori esti- mates are second-order Crank-Nicolson reconstructions of the piecewise linear approximate solutions. These functions satisfy two fundamental properties: (i) they are explicitly computable and thus their difference to the numerical solution is controlled a posteriori, and (ii) they lead to optimal order residuals as well as to appropriate pointwise representations of the error equation of the same form as the underlying evolution equation. The resulting estimators are shown to be of optimal order by deriving upper and lower bounds for them depending only on the discretization parameters and the data of our problem. As a consequence we provide alternative proofs for known a priori rates of convergence for the Crank-Nicolson method.
Mathematics of Computation 01/2006; 75:511-531. · 1.37 Impact Factor
• Source
##### Article: A posteriori analysis of the finite element discretization of some parabolic equations.
[hide abstract]
ABSTRACT: We are interested in the discretization of parabolic equations, ei- ther linear or semilinear, by an implicit Euler scheme with respect to the time variable and finite elements with respect to the space variables. The main result of this paper consists of building error indicators with respect to both time and space approximations and proving their equivalence with the error, in order to work with adaptive time steps and finite element meshes. Resume .N ous considerons la discretisation d'´ equations paraboliques, soit lineaires soit semi-lineaires, par un schema d'Euler implicite en temps et par ´ elements finis en espace. L'idee de cet article est de construire des indica- teurs d'erreur liesa l'approximation en temps et en espace et de prouver leur ´ equivalence avec l'erreur, dans le but de travailler avec des pas de temps adap- tatifs et des maillages d'´ elements finis adaptesa la solution.
Mathematics of Computation 01/2005; 74:1117-1138. · 1.37 Impact Factor