Finite element approximation of a semilinear elliptic problem with a singular nonlinearity

Given , we consider the following problem: find , such that where or 3, and in . We prove and error bounds for the standard continuous piecewise linear Galerkin finite element approximation with a (weakly) acute triangulation. Our bounds are nearly optimal. In addition, for d = 1 and 2 and we analyze a more practical scheme involving numerical integration on the nonlinear term. We obtain nearly optimal and error bounds for d = 1. For this case we also present some numerical results. Received July 4, 1996 / Revised version received December 18, 1997     

A posteriori error estimators for nonconforming finite element methods of the linear elasticity problem

In this work we derive and analyze a posteriori error estimators for low-order nonconforming finite element methods of the linear elasticity problem on both triangular and quadrilateral meshes, with hanging nodes allowed for local mesh refinement. First, it is shown that equilibrated Neumann data on interelement boundaries are simply given by the local weak residuals of the numerical solution. The first error estimator is then obtained by applying the equilibrated residual method with this set of Neumann data. From this implicit estimator we also derive two explicit error estimators, one of which is similar to the one proposed by Dörfler and Ainsworth (2005) [24] for the Stokes problem. It is established that all these error estimators are reliable and efficient in a robust way with respect to the Lamé constants. The main advantage of our error estimators is that they yield guaranteed, i.e., constant-free upper bounds for the energy-like error (up to higher order terms due to data oscillation) when a good estimate for the inf-sup constant is available, which is confirmed by some numerical results.     

A posteriori error estimations of residual type for Signorini's problem

This paper presents an a posteriori error analysis for the linear finite element approximation of the Signorini problem in two space dimensions. A posteriori estimations of residual type are defined and upper and lower bounds of the discretization error are obtained. We perform several numerical experiments in order to compare the convergence of the terms in the error estimator with the discretization error.     

A combined mixed and discontinuous Galerkin method for compressible miscible displacement problem in porous media

In this paper, we present a numerical scheme for solving the coupled system of compressible miscible displacement problem in porous media. The flow equation is solved by the mixed finite element method, and the transport equation is approximated by a discontinuous Galerkin method. The scheme is continuous in time and a priori hp error estimates is presented.     

A priori and a posteriori error analyses in the study of viscoelastic problems

In this work, the numerical approximation of a viscoelastic problem is studied. A fully discrete scheme is introduced by using the finite element method to approximate the spatial variable and an Euler scheme to discretize time derivatives. Then, two numerical analyses are presented. First, a priori estimates are proved from which the linear convergence of the algorithm is derived under suitable regularity conditions. Secondly, an a posteriori error analysis is provided extending some preliminary results obtained in the study of the heat equation. Upper and lower error bounds are obtained.     

NUMERICAL ANALYSIS OF A CONTACT PROBLEM IN RATE-TYPE VISCOPLASTICITY

In this paper, we consider numerical approximations of a contact problem in rate-type viscoplasticity. The contact conditions are described in term of a subdifferential and include as special cases some classical frictionless boundary conditions. The contact problem consists of an evolution equation coupled with a time-dependent variational inequality. Error estimates for both spatially semi-discrete and fully discrete solutions are derived and some convergence results are shown. Under appropriate regularity assumptions on the exact solution, error estimates are obtained.     

A posteriori error estimation for fully discrete hierarchic models of elliptic boundary value problems on thin domains

Summary. A posteriori error estimators for fully discrete hierarchic modelling on thin domains are derived and are shown to provide computable upper bounds on the discretization error and on the total error. The estimators are shown to be robust and do not degenerate as the thickness of the domain tends to zero. If the discretization part of the error is negligible, the estimator for the modelling error reduces to the one recently obtained for semi-discrete hierarchical modelling by Babuska and Schwab. Received July 25, 1996 / Revised version received July 31, 1997     

Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems

Summary A forward error analysis is presented for the Björck-Pereyra algorithms used for solving Vandermonde systems of equations. This analysis applies to the case where the points defining the Vandermonde matrix are nonnegative and are arranged in increasing order. It is shown that for a particular class of Vandermonde problems the error bound obtained depends on the dimensionn and on the machine precision only, being independent of the condition number of the coefficient matrix. By comparing appropriate condition numbers for the Vandermonde problem with the forward error bounds it is shown that the Björck-Pereyra algorithms introduce no more uncertainty into the numerical solution than is caused simply by storing the right-hand side vector on the computer. A technique for computing running a posteriori error bounds is derived. Several numerical experiments are presented, and it is observed that the ordering of the points can greatly affect the solution accuracy.     

A normal compliance contact problem in viscoelasticity: An a posteriori error analysis and computational experiments

In this work, the numerical approximation of a viscoelastic contact problem is studied. The classical Kelvin-Voigt constitutive law is employed, and contact is assumed with a deformable obstacle and modelled using the normal compliance condition. The variational formulation leads to a nonlinear parabolic variational equation. An existence and uniqueness result is recalled. Then, a fully discrete scheme is introduced, by using the finite element method to approximate the spatial variable and the implicit Euler scheme to discretize time derivatives. A priori error estimates recently proved for this problem are recalled. Then, an a posteriori error analysis is provided, extending some preliminary results obtained in the study of the heat equation and other parabolic equations. Upper and lower error bounds are proved. Finally, some numerical experiments are presented to demonstrate the accuracy and the numerical behaviour of the error estimates.     

On a decoupled algorithm for solving a finite element problem for the approximation of viscoelastic fluid flow

Summary. The aim of this work is to study a decoupled algorithm of a fixed point for solving a finite element (FE) problem for the approximation of viscoelastic fluid flow obeying an Oldroyd B differential model. The interest for this algorithm lies in its applications to numerical simulation and in the cost of computing. Furthermore it is easy to bring this algorithm into play. The unknowns are the viscoelastic part of the extra stress tensor, the velocity and the pressure. We suppose that the solution is sufficiently smooth and small. The approximation of stress, velocity and pressure are resp. discontinuous, continuous, continuous FE. Upwinding needed for convection of , is made by discontinuous FE. The method consists to solve alternatively a transport equation for the stress, and a Stokes like problem for velocity and pressure. Previously, results of existence of the solution for the approximate problem and error bounds have been obtained using fixed point techniques with coupled algorithm. In this paper we show that the mapping of the decoupled fixed point algorithm is locally (in a neighbourhood of ) contracting and we obtain existence, unicity (locally) of the solution of the approximate problem and error bounds. Received July 29, 1994 / Revised version received March 13, 1995     

Efficient computable error bounds for discontinuous Galerkin approximations of elliptic problems

We present guaranteed and computable both sided error bounds for the discontinuous Galerkin (DG) approximations of elliptic problems. These estimates are derived in the full DG-norm on purely functional grounds by the analysis of the respective differential problem, and thus, are applicable to any qualified DG approximation. Based on the triangle inequality, the underlying approach has the following steps for a given DG approximation: (1) computing a conforming approximation in the energy space using the Oswald interpolation operator, and (2) application of the existing functional a posteriori error estimates to the conforming approximation. Various numerical examples with varying difficulty in computing the error bounds, from simple problems of polynomial-type analytic solution to problems with analytic solution having sharp peaks, or problems with jumps in the coefficients of the partial differential equation operator, are presented which confirm the efficiency and the robustness of the estimates.     

An analysis of finite element locking in a parameter dependent model problem

Summary. We consider the bilinear finite element approximation of smooth solutions to a simple parameter dependent elliptic model problem, the problem of highly anisotropic heat conduction. We show that under favorable circumstances that depend on both the finite element mesh and on the type of boundary conditions, the effect of parametric locking of the standard FEM can be reduced by a simple variational crime. In our analysis we split the error in two orthogonal components, the approximation error and the consistency error, and obtain different bounds for these separate components. Also some numerical results are shown. Received September 6, 1999 / Revised version received March 28, 2000 / Published online April 5, 2001     

Effect of numerical integration for elliptic obstacle problems

Summary. An elliptic obstacle problem is approximated by piecewise linear finite elements with numerical integration on the penalty and forcing terms. This leads to diagonal nonlinearities and thereby to a practical scheme. Optimal error estimates in the maximum norm are derived. The proof is based on constructing suitable super and subsolutions that exploit the special structure of the penalization, and using quite precise pointwise error estimates for an associated linear elliptic problem with quadrature via the discrete maximum principle. Received March 19, 1993     

A unified approach to a posteriori error estimation using element residual methods

Summary This paper deals with the problem of obtaining numerical estimates of the accuracy of approximations to solutions of elliptic partial differential equations. It is shown that, by solving appropriate local residual type problems, one can obtain upper bounds on the error in the energy norm. Moreover, in the special case of adaptiveh-p finite element analysis, the estimator will also give a realistic estimate of the error. A key feature of this is the development of a systematic approach to the determination of boundary conditions for the local problems. The work extends and combines several existing methods to the case of fullh-p finite element approximation on possibly irregular meshes with, elements of non-uniform degree. As a special case, the analysis proves a conjecture made by Bank and Weiser [Some A Posteriori Error Estimators for Elliptic Partial Differential Equations, Math. Comput.44, 283–301 (1985)].     

A posteriori error estimates for elliptic problems with Dirac delta source terms

The aim of this paper is to introduce residual type a posteriori error estimators for a Poisson problem with a Dirac delta source term, in L ^p norm and W^1,p seminorm. The estimators are proved to yield global upper and local lower bounds for the corresponding norms of the error. They are used to guide adaptive procedures, which are experimentally shown to lead to optimal orders of convergence.     

Guaranteed and robust discontinuous Galerkin a posteriori error estimates for convection-diffusion-reaction problems

We propose and study a posteriori error estimates for convection-diffusion-reaction problems with inhomogeneous and anisotropic diffusion approximated by weighted interior-penalty discontinuous Galerkin methods. Our twofold objective is to derive estimates without undetermined constants and to analyze carefully the robustness of the estimates in singularly perturbed regimes due to dominant convection or reaction. We first derive locally computable estimates for the error measured in the energy (semi)norm. These estimates are evaluated using -conforming diffusive and convective flux reconstructions, thereby extending the previous work on pure diffusion problems. The resulting estimates are semi-robust in the sense that local lower error bounds can be derived using suitable cutoff functions of the local Péclet and Damköhler numbers. Fully robust estimates are obtained for the error measured in an augmented norm consisting of the energy (semi)norm, a dual norm of the skew-symmetric part of the differential operator, and a suitable contribution of the interelement jumps of the discrete solution. Numerical experiments are presented to illustrate the theoretical results.     

Finite element simulations of window Josephson junctions

This paper deals with the numerical simulation of the steady state two dimensional window Josephson junctions by finite element method. The model is represented by a sine-Gordon type composite PDE problem. Convergence and error analysis of the finite element approximation for this semilinear problem are presented. An efficient and reliable Newton-preconditioned conjugate gradient algorithm is proposed to solve the resulting nonlinear discrete system. Regular solution branches are computed using a simple continuation scheme. Numerical results associated with interesting physical phenomena are reported. Interface relaxation methods, which by taking advantage of special properties of the composite PDE, can further reduce the overall computational cost are proposed. The implementation and the associated numerical experiments of a particular interface relaxation scheme are also presented and discussed.     

Quadratic spline collocation methods for elliptic partial differential equations

We consider Quadratic Spline Collocation (QSC) methods for linear second order elliptic Partial Differential Equations (PDEs). The standard formulation of these methods leads to non-optimal approximations. In order to derive optimal QSC approximations, high order perturbations of the PDE problem are generated. These perturbations can be applied either to the PDE problem operators or to the right sides, thus leading to two different formulations of optimal QSC methods. The convergence properties of the QSC methods are studied. OptimalO(h ^3–j ) global error estimates for thejth partial derivative are obtained for a certain class of problems. Moreover,O(h ^4–j ) error bounds for thejth partial derivative are obtained at certain sets of points. Results from numerical experiments verify the theoretical behaviour of the QSC methods. Performance results also show that the QSC methods are very effective from the computational point of view. They have been implemented efficiently on parallel machines.This research was supported in part by David Ross Foundation (U.S.A) and NSERC (Natural Sciences and Engineering Research Council of Canada).     

An adaptive stabilized finite element method for the generalized Stokes problem

In this work we present an adaptive strategy (based on an a posteriori error estimator) for a stabilized finite element method for the Stokes problem, with and without a reaction term. The hierarchical type estimator is based on the solution of local problems posed on appropriate finite dimensional spaces of bubble-like functions. An equivalence result between the norm of the finite element error and the estimator is given, where the dependence of the constants on the physics of the problem is explicited. Several numerical results confirming both the theoretical results and the good performance of the estimator are given.     

A reduced finite difference scheme based on singular value decomposition and proper orthogonal decomposition for Burgers equation

In this article, a reduced optimizing finite difference scheme (FDS) based on singular value decomposition (SVD) and proper orthogonal decomposition (POD) for Burgers equation is presented. Also the error estimates between the usual finite difference solution and the POD solution of reduced optimizing FDS are analyzed. It is shown by considering the results obtained for numerical simulations of cavity flows that the error between the POD solution of reduced optimizing FDS and the solution of the usual FDS is consistent with theoretical results. Moreover, it is also shown that the reduced optimizing FDS is feasible and efficient.