An adaptive least squares mixed finite element method for the stress‐displacement formulation of linear elasticity

A least‐squares mixed finite element method for linear elasticity, based on a stress‐displacement formulation, is investigated in terms of computational efficiency. For the stress approximation quadratic Raviart‐Thomas elements are used and these are coupled with the quadratic nonconforming finite element spaces of Fortin and Soulie for approximating the displacement. The local evaluation of the least‐squares functional serves as an a posteriori error estimator to be used in an adaptive refinement algorithm. We present computational results for a benchmark test problem of planar elasticity including nearly incompressible material parameters in order to verify the effectiveness of our adaptive strategy. For comparison, conforming quadratic finite elements are also used for the displacement approximation showing convergence orders similar to the nonconforming case, which are, however, not independent of the Lamé parameters. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

A nonconforming mixed finite element for second-order elliptic problems

In a recent work, Hiptmair [Mathematisches Institut, M9404, 1994] has constructed and analyzed a family of nonconforming mixed finite elements for second-order elliptic problems. However, his analysis does not work on the lowest order elements. In this article, we show that it is possible to construct a nonconforming mixed finite element for the lowest order case. We prove the convergence and give estimates of optimal order for this finite element. Our proof is based on the use of the properties of the so-called nonconforming bubble function to control the consistency terms introduced by the nonconforming approximation. We further establish an equivalence between this mixed finite element and the nonconforming piecewise quadratic finite element of Fortin and Soulie [J. Numer. Methods Eng., 19, 505–520, 1983]. © 1997 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 13: 445–457, 1997     

A compact finite element method for elastic bodies

A nonconforming finite element method is described for treating linear equilibrium problems, and a convergence proof showing second order accuracy is given. The close relationship to a related compact finite difference scheme due to Phillips and Rose [1] is examined. A Condensation technique is shown to preserve the compactness property and suggests an approach to a certain type of homogenization.     

Optimal adaptive nonconforming FEM for the Stokes problem

This paper presents an optimal nonconforming adaptive finite element algorithm and proves its quasi-optimal complexity for the Stokes equations with respect to natural approximation classes. The proof does not explicitly involve the pressure variable and follows from a novel discrete Helmholtz decomposition of deviatoric functions.     

Error reduction of the adaptive conforming and nonconforming finite element methods with red–green refinement

In this paper, we analyze the convergence of the adaptive conforming and nonconforming $P_1$ finite element methods with red–green refinement based on standard Dörfler marking strategy. Since the mesh after refining is not nested into the one before, the usual Galerkin-orthogonality or quasi-orthogonality for newest vertex bisection does not hold for this case. To overcome such a difficulty, we develop some new quasi-orthogonality instead under certain condition on the initial mesh (Condition A). Consequently, we show convergence of the adaptive methods by establishing the reduction of some total errors. To weaken the condition on the initial mesh, we propose a modified red–green refinement and prove the convergence of the associated adaptive methods under a much weaker condition on the initial mesh (Condition B). Furthermore, we also develop an initial mesh generator which guarantee that all the interior triangles are equilateral triangles (satisfy Condition A) and the other triangles containing at least one vertex on the boundary satisfy Condition B.     

HOW TO PROVE THE DISCRETE RELIABILITY FOR NONCONFORMING FINITE ELEMENT METHODS

Optimal convergence rates of adaptive finite element methods are well understood in terms of the axioms of adaptivity.One key ingredient is the discrete reliability of a residualbased a posteriori error estimator,which controls the error of two discrete finite element solutions based on two nested triangulations.In the error analysis of nonconforming finite element methods,like the Crouzeix-Raviart or Morley finite element schemes,the difference of the piecewise derivatives of discontinuous approximations to the distributional gradients of global Sobolev functions plays a dominant role and is the object of this paper.The nonconforming interpolation operator,which comes natural with the definition of the aforementioned nonconforming finite element in the sense of Ciarlet,allows for stability and approximation properties that enable direct proofs of the reliability for the residual that monitors the equilibrium condition.The novel approach of this paper is the suggestion of a right-inverse of this interpolation operator in conforming piecewise polynomials to design a nonconforming approximation of a given coarse-grid approximation on a refined triangulation.The results of this paper allow for simple proofs of the discrete reliability in any space dimension and multiply connected domains on general shape-regular triangulations beyond newest-vertex bisection of simplices.Particular attention is on optimal constants in some standard discrete estimates listed in the appendices.     

New adaptive mixed finite element method (AMFEM)

The need to develop reliable and efficient adaptive algorithms using mixed finite element methods arises from various applications in fluid dynamics and computational continuum mechanics. In order to save degrees of freedom, not all but just some selected set of finite element domains are refined and hence the fundamental question of convergence requires a new mathematical argument as well as the question of optimality. We will present a new adaptive algorithm for mixed finite element methods to solve the model Poisson problem, for which optimal convergence can be proved. The a posteriori error control of mixed finite element methods dates back to Alonso (1996) Error estimators for a mixed method. and Carstensen (1997) A posteriori error estimate for the mixed finite element method. The error reduction and convergence for adaptive mixed finite element methods has already been proven by Carstensen and Hoppe (2006) Error Reduction and Convergence for an Adaptive Mixed Finite Element Method, Convergence analysis of an adaptive nonconforming finite element methods. Recently, Chen, Holst and Xu (2008) Convergence and Optimality of Adaptive Mixed Finite Element Methods. presented convergence and optimality for adaptive mixed finite element methods following arguments of Rob Stevenson for the conforming finite element method. Their algorithm reduces oscillations, before applying and a standard adaptive algorithm based on usual error estimation. The proposed algorithm does this in a natural way, by switching between the reduction of either the estimated error or oscillations. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A remark on the optimality of adaptive finite element methods

We show that the standard assumption on the smallness of the marking parameter θ in adaptive finite element methods can be avoided for the proof of the optimality of the algorithm. To this end we propose a new technique based on comparison of the solutions of different finite element spaces obtained by different refinements of a given mesh. We consider conforming and nonconforming low-order finite elements on triangular and tetrahedral meshes.     

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 Parallel Algorithm for Adaptive Local Refinement of Tetrahedral Meshes Using Bisection

Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid (http: //lsec. cc. ac. cn/phg/J, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simultaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the bisectioning refinement procedure.AMS subject classifications: 65Y05, 65N50     

Conforming and nonconforming harmonic finite elements

ABSTRACT

Instead of using the full polynomial space, a conforming and a nonconforming finite element methods are designed where only harmonic polynomials (a much smaller space) are employed in the computation. The conforming quadratic harmonic polynomial finite element is defined only on a special triangular grid. The nonconforming quadratic harmonic finite element is defined on general triangular grids. The optimal order of convergence is proved for both finite element methods, and confirmed by numerical computations. In addition, numerical comparisons with the standard conforming and nonconforming finite elements are presented.     

Error reduction and convergence for an adaptive mixed finite element method

An adaptive mixed finite element method (AMFEM) is designed to guarantee an error reduction, also known as saturation property: after each refinement step, the error for the fine mesh is strictly smaller than the error for the coarse mesh up to oscillation terms. This error reduction property is established here for the Raviart-Thomas finite element method with a reduction factor uniformly for the norm of the flux errors. Our result allows for linear convergence of a proper adaptive mixed finite element algorithm with respect to the number of refinement levels. The adaptive algorithm surprisingly does not require any particular mesh design, unlike the conforming finite element method. The new arguments are a discrete local efficiency and a quasi-orthogonality estimate. The proof does not rely on duality or on regularity.

     

轴对称问题的Wilson四边形单元

给出了一族轴对称问题的改进Ｗｉｌｓｏｎ元，利用强分片检验证明了其收敛性，讨论了单元函数结构·从而给出了一种构造收敛的轴对称非协调元方法·     

On the Convergence of Adaptive Finite Element Methods

State of the art simulations in computational mechanics aim reliability and efficiency via adaptive finite element methods (AFEMs) with a posteriori error control. The a priori convergence of finite element methods is justified by the density property of the sequence of finite element spaces which essentially assumes a quasi‐uniform mesh‐refining. The advantage is guaranteed convergence for a large class of data and solutions; the disadvantage is a global mesh refinement everywhere accompanied by large computational costs. AFEMs automatically refine exclusively wherever the refinement indication suggests to do so and so violate the density property on purpose. Then, the a priori convergence of AFEMs is not guaranteed automatically and, in fact, crucially depends on algorithmic details. The advantage of AFEMs is a more effective mesh accompanied by smaller computational costs in many practical examples; the disadvantage is that the desirable error reduction property is not always guaranteed a priori. Efficient error estimators can justify a numerical approximation a posteriori and so achieve reliability. But it is not clear from the start that the adaptive mesh‐refinement will generate an accurate solution at all. This paper discusses particular versions of an AFEMs and their analyses for error reduction, energy reduction, and convergence results for linear and nonlinear problems. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

基于非协调元的区域分解法──强重迭情形

基于非协调元的区域分解法──强重迭情形黄建国（上海交通大学应用数学系）ＡＤＯＭＡＩＮＤＥＣＯＭＰＯＳＩＴＩＯＮＭＥＴＨＯＤＦＯＲＮＯＮＣＯＮＦＯＲＭＩＮＧＦＩＮＩＴＥＥＬＥＭＥＮＴ──ＴＨＥＣＡＳＥＯＦＳＴＲＯＮＧＯＶＥＲＬＡＰ￥ＨｕａｎｇＪｉａｎ...     

定常Navier-Stokes方程的一个二阶非协调三角型混合元格式（英文）

In this paper, a nonconforming triangular mixed finite element scheme with second order convergence behavior is proposed for the stationary Navier-Stokes equations.The new nonconforming triangular element is taken as approximation space for the velocity and the linear element for the pressure. The convergence analysis is presented and optimal error estimates of both broken H~1-norm and L~2-norm for velocity as well as the L~2-norm for the pressure are derived.     

A Second Order Nonconforming Triangular Mixed Finite Element Scheme for the Stationary Navier-Stokes Equations

In this paper,a nonconforming triangular mixed finite element scheme with second order convergence behavior is proposed for the stationary Navier-Stokes equations.The new nonconforming triangular element is taken as approximation space for the velocity and the linear element for the pressure.The convergence analysis is presented and optimal error estimates of both broken H1-norm and L2-norm for velocity as well as the L2-norm for the pressure are derived.     

Local Multigrid in H（curl）

We consider H（curl, Ω）-elliptic variational problems on bounded Lipschitz polyhedra and their finite element Galerkin discretization by means of lowest order edge elements. We assume that the underlying tetrahedral mesh has been created by successive local mesh refinement, either by local uniform refinement with hanging nodes or bisection refinement. In this setting we develop a convergence theory for the the so-called local multigrid correction scheme with hybrid smoothing. We establish that its convergence rate is uniform with respect to the number of refinement steps. The proof relies on corresponding results for local multigrid in a H^1 （Ω）-context along with local discrete Helmholtz-type decompositions of the edge element space.     

Convergence of simple adaptive Galerkin schemes based on h − h/2 error estimators

We discuss several adaptive mesh-refinement strategies based on (h − h/2)-error estimation. This class of adaptive methods is particularly popular in practise since it is problem independent and requires virtually no implementational overhead. We prove that, under the saturation assumption, these adaptive algorithms are convergent. Our framework applies not only to finite element methods, but also yields a first convergence proof for adaptive boundary element schemes. For a finite element model problem, we extend the proposed adaptive scheme and prove convergence even if the saturation assumption fails to hold in general.     

Adaptive boundary element methods with convergence rates

This paper presents adaptive boundary element methods for positive, negative, as well as zero order operator equations, together with proofs that they converge at certain rates. The convergence rates are quasi-optimal in a certain sense under mild assumptions that are analogous to what is typically assumed in the theory of adaptive finite element methods. In particular, no saturation-type assumption is used. The main ingredients of the proof that constitute new findings are some results on a posteriori error estimates for boundary element methods, and an inverse-type inequality involving boundary integral operators on locally refined finite element spaces.