An optimally convergent adaptive mixed finite element method

We prove convergence and optimal complexity of an adaptive mixed finite element algorithm, based on the lowest-order Raviart–Thomas finite element space. In each step of the algorithm, the local refinement is either performed using simple edge residuals or a data oscillation term, depending on an adaptive marking strategy. The inexact solution of the discrete system is controlled by an adaptive stopping criterion related to the estimator.     

A convergent adaptive finite element method for an optimal design problem

The optimal design problem for maximal torsion stiffness of an infinite bar of given geometry and unknown distribution of two materials of prescribed amounts is one model example in topology optimisation. It eventually leads to a degenerate convex minimisation problem. The numerical analysis is therefore delicate for possibly multiple primal variables u but unique derivatives σ : = DW(D u). Even fine a posteriori error estimates still suffer from the reliability-efficiency gap. However, it motivates a simple edge-based adaptive mesh-refining algorithm (AFEM) that is not a priori guaranteed to refine everywhere. Its convergence proof is therefore based on energy estimates and some refined convexity control. Numerical experiments illustrate even nearly optimal convergence rates of the proposed AFEM. Supported by the DFG Research Center MATHEON “Mathematics for key technologies” in Berlin.     

A posteriori error estimates for mixed FEM in elasticity

A residue based reliable and efficient error estimator is established for finite element solutions of mixed boundary value problems in linear, planar elasticity. The proof of the reliability of the estimator is based on Helmholtz type decompositions of the error in the stress variable and a duality argument for the error in the displacements. The efficiency follows from inverse estimates. The constants in both estimates are independent of the Lamé constant , and so locking phenomena for are properly indicated. The analysis justifies a new adaptive algorithm for automatic mesh–refinement. Received July 17, 1997     

Numerical analysis of a frictional contact problem for viscoelastic materials with long-term memory

We consider a mathematical model which describes the bilateral contact between a deformable body and an obstacle. The process is quasistatic, the material is assumed to be viscoelastic with long memory and the friction is modeled with Tresca’s law. The problem has a unique weak solution. Here we study spatially semi-discrete and fully discrete schemes using finite differences and finite elements. We show the convergence of the schemes under the basic solution regularity and we derive order error estimates. Finally, we present an algorithm for the numerical realization and simulations for a two-dimensional test problem.     

Modified edge finite elements for photonic crystals

We consider Maxwell’s equations with periodic coefficients as it is usually done for the modeling of photonic crystals. Using Bloch/Floquet theory, the problem reduces in a standard way to a modification of the Maxwell cavity eigenproblem with periodic boundary conditions. Following [8], a modification of edge finite elements is considered for the approximation of the band gap. The method can be used with meshes of tetrahedrons or parallelepipeds. A rigorous analysis of convergence is presented, together with some preliminary numerical results in 2D, which fully confirm the robustness of the method. The analysis uses well established results on the discrete compactness for edge elements, together with new sharper interpolation estimates.     

Residual-based a posteriori error estimate for a mixed Reißner-Mindlin plate finite element method

Reliable and efficient residual-based a posteriori error estimates are established for the stabilised locking-free finite element methods for the Reissner-Mindlin plate model. The error is estimated by a computable error estimator from above and below up to multiplicative constants that do neither depend on the mesh-size nor on the plate's thickness and are uniform for a wide range of stabilisation parameter. The error is controlled in norms that are known to converge to zero in a quasi-optimal way. An adaptive algorithm is suggested and run for improving the convergence rates in three numerical examples for thicknesses 0.1, .001 and .001.     

A finite difference analysis of a streamline diffusion method on a Shishkin mesh

We consider streamline diffusion finite element methods applied to a singularly perturbed convection–diffusion two‐point boundary value problem whose solution has a single boundary layer. To analyse the convergence of these methods, we rewrite them as finite difference schemes. We first consider arbitrary meshes, then, in analysing the scheme on a Shishkin mesh, we consider two formulations on the fine part of the mesh: the usual streamline diffusion upwinding and the standard Galerkin method. The error estimates are given in the discrete L _∞ norm; in particular we give the first analysis that shows precisely how the error depends on the user-chosen parameter _τ0 specifying the mesh. When _τ0 is too small, the error becomes O(1), but for _τ0 above a certain threshold value, the error is small and increases either linearly or quadratically as a function of . Numerical tests support our theoretical results. This revised version was published online in August 2006 with corrections to the Cover Date.     

Adaptive finite elements for exterior domain problems

Summary. We present an adaptive finite element method for solving elliptic problems in exterior domains, that is for problems in the exterior of a bounded closed domain in , . We describe a procedure to generate a sequence of bounded computational domains , , more precisely, a sequence of successively finer and larger grids, until the desired accuracy of the solution is reached. To this end we prove an a posteriori error estimate for the error on the unbounded domain in the energy norm by means of a residual based error estimator. Furthermore we prove convergence of the adaptive algorithm. Numerical examples show the optimal order of convergence. Received July 8, 1997 /Revised version received October 23, 1997     

Adaptive finite element for semi-linear convection–diffusion problems

In this article a strategy of adaptive finite element for semi-linear problems, based on minimizing a residual-type estimator, is reported. We get an a posteriori error estimate which is asymptotically exact when the mesh size h tends to zero. By considering a model problem, the quality of this estimator is checked. It is numerically shown that without constraint on the mesh size h, the efficiency of the a posteriori error estimate can fail dramatically. This phenomenon is analysed and an algorithm which equidistributes the local estimators under the constraint h ⩽ h _max is proposed. This algorithm allows to improve the computed solution for semi-linear convection–diffusion problems, and can be used for stabilizing the Lagrange finite element method for linear convection–diffusion problems. This revised version was published online in June 2006 with corrections to the Cover Date.     

A posteriori dual-mixed adaptive finite element error control for Lamé and Stokes equations

A unified and robust mathematical model for compressible and incompressible linear elasticity can be obtained by rephrasing the Herrmann formulation within the Hellinger-Reissner principle. This quasi-optimally converging extension of PEERS (Plane Elasticity Element with Reduced Symmetry) is called Dual-Mixed Hybrid formulation (DMH). Explicit residual-based a posteriori error estimates for DMH are introduced and are mathematically shown to be locking-free, reliable, and efficient. The estimator serves as a refinement indicator in an adaptive algorithm for effective automatic mesh generation. Numerical evidence supports that the adaptive scheme leads to optimal convergence for Lamé and Stokes benchmark problems with singularities.     

A posteriori error estimates for a finite element approximation of transmission problems with sign changing coefficients

We perform the a posteriori error analysis of residual type of transmission problem with sign changing coefficients. According to Bonnet-BenDhia et al. (2010) [9], if the contrast is large enough, the continuous problem can be transformed into a coercive one. We further show that a similar property holds for the discrete problem for any regular meshes, extending the framework from Bonnet-BenDhia et al. [9]. The reliability and efficiency of the proposed estimator are confirmed by some numerical tests.     

A p-version finite element method for nonlinear elliptic variational inequalities in 2D

This article introduces and analyzes a p-version FEM for variational inequalities resulting from obstacle problems for some quasi-linear elliptic partial differential operators. We approximate the solution by controlling the obstacle condition in images of the Gauss–Lobatto points. We show existence and uniqueness for the discrete solution u _p from the p-version for the obstacle problem. We prove the convergence of u _p towards the solution with respect to the energy norm, and assuming some additional regularity for the solution we derive an a priori error estimate. In numerical experiments the p-version turns out to be superior to the h-version concerning the convergence rate and the number of unknowns needed to achieve a certain exactness of the approximation.     

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)].     

Convergence of adaptive FEM for elliptic obstacle problems

We treat the convergence of adaptive lowest-order FEM for some elliptic obstacle problem with affine obstacle. For error estimation, we use a residual error estimator which is an extended version of the estimator from [2] and additionally controls the data oscillations. The main result states that an appropriately weighted sum of energy error, edge residuals, and data oscillations satisfies a contraction property that leads to convergence. In addition, we discuss the generalization to the case of inhomogeneous Dirichlet data and non-affine obstacles χ ∈ H²(Ω) for which similar results are obtained. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

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.     

Convergence of adaptive FEM for some elliptic obstacle problem

In this work, we treat the convergence of adaptive lowest-order FEM for some elliptic obstacle problem with affine obstacle. For error estimation, we use a residual error estimator from [D. Braess, C. Carstensen, and R. Hoppe, Convergence analysis of a conforming adaptive finite element method for an obstacle problem, Numer. Math. 107 (2007), pp. 455–471]. We extend recent ideas from [J. Cascon, C. Kreuzer, R. Nochetto, and K. Siebert, Quasi-optimal convergence rate for an adaptive finite element method, SIAM J. Numer. Anal. 46 (2008), pp. 2524–2550] for the unrestricted variational problem to overcome the lack of Galerkin orthogonality. The main result states that an appropriately weighted sum of energy error, edge residuals and data oscillations satisfies a contraction property within each step of the adaptive feedback loop. This result is superior to a prior result from Braess et al. (2007) in two ways: first, it is unnecessary to control the decay of the data oscillations explicitly; second, our analysis avoids the use of some discrete local efficiency estimate so that the local mesh-refinement is fairly arbitrary.     

Upper and lower error bounds for plate-bending finite elements

Summary. We compare the robustness of three different low-order mixed methods that have been proposed for plate-bending problems: the so-called MITC, Arnold-Falk and Arnold-Brezzi elements. We show that for free plates, the asymptotic rate of convergence in the presence of quasiuniform meshes approaches the optimal O(h) for MITC elements as the thickness approaches 0, but only approaches for the latter two. We accomplish this by establishing lower bounds for the error in the rotation. The deterioration occurs due to a consistency error associated with the boundary layer – we show how a modification of the elements at the boundary can fix the problem. Finally, we show that the Arnold-Brezzi element requires extra regularity for the convergence of the limiting (discrete Kirchhoff) case, and show that it fails to converge in the presence of point loads. Received June 9, 1998 / Published online December 6, 1999     

An a posteriori error estimator for anisotropic refinement

Summary. Besides an algorithm for local refinement, an a posteriori error estimator is the basic tool of every adaptive finite element method. Using information generated by such an error estimator the refinement of the grid is controlled. For 2nd order elliptic problems we present an error estimator for anisotropically refined grids, like -d cuboidal and 3-d prismatic grids, that gives correct information about the size of the error; additionally it generates information about the direction into which some element has to be refined to reduce the error in a proper way. Numerical examples are presented for 2-d rectangular and 3-d prismatic grids. Received March 15, 1994 / Revised version received June 3, 1994     

A trapping principle and convergence result for finite element approximate solutions of steady reaction/diffusion systems

We consider nonlinear elliptic systems, with mixed boundary conditions, on a convex polyhedral domain Ω ⊂ R ^N . These are nonlinear divergence form generalizations of Δu = f(·, u), where f is outward pointing on the trapping region boundary. The motivation is that of applications to steady-state reaction/diffusion systems. Also included are reaction/diffusion/convection systems which satisfy the Einstein relations, for which the Cole-Hopf transformation is possible. For maximum generality, the theory is not tied to any specific application. We are able to demonstrate a trapping principle for the piecewise linear Galerkin approximation, defined via a lumped integration hypothesis on integrals involving f, by use of variational inequalities. Results of this type have previously been obtained for parabolic systems by Estep, Larson, and Williams, and for nonlinear elliptic equations by Karátson and Korotov. Recent minimum and maximum principles have been obtained by Jüngel and Unterreiter for nonlinear elliptic equations. We make use of special properties of the element stiffness matrices, induced by a geometric constraint upon the simplicial decomposition. This constraint is known as the non-obtuseness condition. It states that the inward normals, associated with an arbitrary pair of an element’s faces, determine an angle with nonpositive cosine. Drăgănescu, Dupont, and Scott have constructed an example for which the discrete maximum principle fails if this condition is omitted. We also assume vertex communication in each element in the form of an irreducibility hypothesis on the off-diagonal elements of the stiffness matrix. There is a companion convergence result, which yields an existence theorem for the solution. This entails a consistency hypothesis for interpolation on the boundary, and depends on the Tabata construction of simple function approximation, based on barycentric regions. This work was supported by the National Science Foundation under grant DMS-0311263.     

On the adaptive coupling of FEM and BEM in 2–d–elasticity

Summary. This paper concerns the combination of the finite element method (FEM) and the boundary element method (BEM) using the symmetric coupling. As a model problem in two dimensions we consider the Hencky material (a certain nonlinear elastic material) in a bounded domain with Navier–Lamé differential equation in the unbounded complementary domain. Using some boundary integral operators the problem is rewritten such that the Galerkin procedure leads to a FEM/BEM coupling and quasi–optimally convergent discrete solutions. Beside this a priori information we derive an a posteriori error estimate which allows (up to a constant factor) the error control in the energy norm. Since information about the singularities of the solution is not available a priori in many situation and having in mind the goal of an automatic mesh–refinement we state adaptive algorithms for the –version of the FEM/BEM–coupling. Illustrating numerical results are included. Received April 15, 1994 / Revised version received January 8, 1996