Stagnation in the p-version of the finite element method

A special feature of the p-version of the finite element method for solving a differential boundary value problem stated in the form of minimizing a quadratic functional on a certain set is studied. This special feature results in approximate solutions remaining unchanged on finite numbers of increasing finite-dimensional subsets of increasing dimension, in which solutions are sought. Necessary and sufficient conditions for the existence of this feature are found, and the stagnation effect is interpreted for a specially constructed example. For the adaptive p-version of the finite element approach, a modified strategy is proposed that takes this feature into account and thus improves the reliability of the method.     

Least-squares finite element methods for the elasticity problem

A new first-order system formulation for the linear elasticity problem in displacement-stress form is proposed. The formulation is derived by introducing additional variables of derivatives of the displacements, whose combinations represent the usual stresses. Standard and weighted least-squares finite element methods are then applied to this extended system. These methods offer certain advantages such as that they need not satisfy the inf-sup condition which is required in the mixed finite element formulation, that a single continuous piecewise polynomial space can be used for the approximation of all the unknowns, that the resulting algebraic systems are symmetric and positive definite, and that accurate approximations of the displacements and the stresses can be obtained simultaneously. With displacement boundary conditions, it is shown that both methods achieve optimal rates of convergence in the H¹-norm and in the L²-norm for all the unknowns. Numerical experiments with various Poisson ratios are given to demonstrate the theoretical error estimates.     

Adaptive Numerical Treatment of Elliptic Systems on Manifolds

Adaptive multilevel finite element methods are developed and analyzed for certain elliptic systems arising in geometric analysis and general relativity. This class of nonlinear elliptic systems of tensor equations on manifolds is first reviewed, and then adaptive multilevel finite element methods for approximating solutions to this class of problems are considered in some detail. Two a posteriori error indicators are derived, based on local residuals and on global linearized adjoint or dual problems. The design of Manifold Code (MC) is then discussed; MC is an adaptive multilevel finite element software package for 2- and 3-manifolds developed over several years at Caltech and UC San Diego. It employs a posteriori error estimation, adaptive simplex subdivision, unstructured algebraic multilevel methods, global inexact Newton methods, and numerical continuation methods for the numerical solution of nonlinear covariant elliptic systems on 2- and 3-manifolds. Some of the more interesting features of MC are described in detail, including some new ideas for topology and geometry representation in simplex meshes, and an unusual partition of unity-based method for exploiting parallel computers. A short example is then given which involves the Hamiltonian and momentum constraints in the Einstein equations, a representative nonlinear 4-component covariant elliptic system on a Riemannian 3-manifold which arises in general relativity. A number of operator properties and solvability results recently established in [55] are first summarized, making possible two quasi-optimal a priori error estimates for Galerkin approximations which are then derived. These two results complete the theoretical framework for effective use of adaptive multilevel finite element methods. A sample calculation using the MC software is then presented; more detailed examples using MC for this application may be found in [26].     

Convergence and optimal complexity of adaptive finite element eigenvalue computations

In this paper, an adaptive finite element method for elliptic eigenvalue problems is studied. Both uniform convergence and optimal complexity of the adaptive finite element eigenvalue approximation are proved. The analysis is based on a certain relationship between the finite element eigenvalue approximation and the associated finite element boundary value approximation which is also established in the paper. This work was partially supported by the National Science Foundation of China under grant 10425105 and the National Basic Research Program under grant 2005CB321704.     

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 p-version of the finite element method for solving boundary value problems for ordinary second-order differential equations

We suggest an adaptive strategy for constructing a hierarchical basis for a p-version of the finite element method used to solve boundary value problems for second-order ordinary differential equations. The choice of the order of an element on each grid interval is based on estimates of the change, in the norm of C, of the approximate solution or the value of the functional to be minimized when increasing the degree of the basis function added on this interval. The results of numerical experiments estimating the method efficiency are given for sample problems whose solutions have singularities of the boundary layer type. We make a comparison with the p-version of the finite element method, which uses a uniform growth of the degree of the basis functions, and with the h-version, which uses uniform grid refinement along with an adaptive grid refinement and coarsening strategy.     

Local a-posteriori error indicators for the Galerkin discretization of boundary integral equations

In this paper we present local a-posteriori error indicators for the Galerkin discretization of boundary integral equations. These error indicators are introduced and investigated by Babuška-Rheinboldt [3] for finite element methods. We transfer them from finite element methods onto boundary element methods and show that they are reliable and efficient for a wide class of integral operators under relatively weak assumptions. These local error indicators are based on the computable residual and can be used for controlling the adaptive mesh refinement. Received March 4, 1996 / Revised version received September 25, 1996     

A fast and robust numerical scheme for solving models of charge carrier transport and ion vacancy motion in perovskite solar cells

Drift-diffusion models that account for the motion of ion vacancies and electronic charge carriers are important tools for explaining the behaviour, and guiding the development, of metal halide perovskite solar cells. Computing numerical solutions to such models in realistic parameter regimes, where the short Debye lengths give rise to boundary layers in which the solution varies extremely rapidly, is challenging. Two suitable numerical methods, that can effectively cope with the spatial stiffness inherent to such problems, are presented and contrasted (a finite element scheme and a finite difference scheme). Both schemes are based on an appropriate choice of non-uniform spatial grid that allows the solution to be computed accurately in the boundary layers. An adaptive time step is employed in order to combat a second source of stiffness, due to the disparity in timescales between the motion of the ion vacancies and electronic charge carriers. It is found that the finite element scheme provides significantly higher accuracy, in a given compute time, than both the finite difference scheme and some previously used alternatives (Chebfun and pdepe). An example transient sweep of a current-voltage curve for realistic parameter values can be computed using this finite element scheme in only a few seconds on a standard desktop computer.     

Monotone iterative methods for the adaptive finite element solution of semiconductor equations

Picard, Gauss–Seidel, and Jacobi monotone iterative methods are presented and analyzed for the adaptive finite element solution of semiconductor equations in terms of the Slotboom variables. The adaptive meshes are generated by the 1-irregular mesh refinement scheme. Based on these unstructured meshes and a corresponding modification of the Scharfetter–Gummel discretization scheme, it is shown that the resulting finite element stiffness matrix is an M-matrix which together with the Shockley–Read–Hall model for the generation–recombination rate leads to an existence–uniqueness–comparison theorem with simple upper and lower solutions as initial iterates. Numerical results of simulations on a MOSFET device model are given to illustrate the accuracy and efficiency of the adaptive and monotone properties of the present methods.     

边界元方法的一些研究进展

本文旨在综述我们小组近二十年来在边界元方法这一领域的一些研究成果,在简要介绍边界元方法的基本思想后,主要介绍了一类非线性界面问题的有限元-边界元耦合方法、求解电磁散射问题的有限元-边界元耦合方法和超奇异积分的一类计算方法.     

Each averaging technique yields reliable a posteriori error control in FEM on unstructured grids. Part I: Low order conforming, nonconforming, and mixed FEM

Averaging techniques are popular tools in adaptive finite element methods for the numerical treatment of second order partial differential equations since they provide efficient a posteriori error estimates by a simple postprocessing. In this paper, their reliablility is shown for conforming, nonconforming, and mixed low order finite element methods in a model situation: the Laplace equation with mixed boundary conditions. Emphasis is on possibly unstructured grids, nonsmoothness of exact solutions, and a wide class of averaging techniques. Theoretical and numerical evidence supports that the reliability is up to the smoothness of given right-hand sides.

     

On the stability of the $L_2$ projection in fractional Sobolev spaces

Summary.   In this paper we prove the stability of the projection onto the finite element trial space of piecewise polynomial, in particular, piecewise linear basis functions in for . We formulate explicit and computable local mesh conditions to be satisfied which depend on the Sobolev index s. In conclusion we prove a stability condition needed in the numerical analysis of mixed and hybrid boundary element methods as well as in the construction of efficient preconditioners in adaptive boundary and finite element methods. Received October 14, 1999 / Revised version received March 24, 2000 / Published online October 16, 2000     

Two-level pressure projection finite element methods for Navier-Stokes equations with nonlinear slip boundary conditions

The two-level pressure projection stabilized finite element methods for Navier-Stokes equations with nonlinear slip boundary conditions are investigated in this paper, whose variational formulation is the Navier-Stokes type variational inequality problem of the second kind. Based on the P₁-P₁ triangular element and using the pressure projection stabilized finite element method, we solve a small Navier-Stokes type variational inequality problem on the coarse mesh with mesh size H and solve a large Stokes type variational inequality problem for simple iteration or a large Oseen type variational inequality problem for Oseen iteration on the fine mesh with mesh size h. The error analysis obtained in this paper shows that if h=O(H²), the two-level stabilized methods have the same convergence orders as the usual one-level stabilized finite element methods, which is only solving a large Navier-Stokes type variational inequality problem on the fine mesh. Finally, numerical results are given to verify the theoretical analysis.     

Local and Parallel Finite Element Algorithms Based on Two-Grid Discretizations for Nonlinear Problems

In this paper, some local and parallel discretizations and adaptive finite element algorithms are proposed and analyzed for nonlinear elliptic boundary value problems in both two and three dimensions. The main technique is to use a standard finite element discretization on a coarse grid to approximate low frequencies and then to apply some linearized discretization on a fine grid to correct the resulted residual (which contains mostly high frequencies) by some local/parallel procedures. The theoretical tools for analyzing these methods are some local a priori and a posteriori error estimates for finite element solutions on general shape-regular grids that are also obtained in this paper.     

The hp-MITC finite element method for the Reissner–Mindlin plate problem

The popular MITC finite elements used for the approximation of the Reissner–Mindlin plate are extended to the case where elements of non-uniform degree p distribution are used on locally refined meshes. Such an extension is of particular interest to the hp-version and hp-adaptive finite element methods. A priori error bounds are provided showing that the method is locking-free. The analysis is based on new approximation theoretic results for non-uniform Brezzi–Douglas–Fortin–Marini spaces, and extends the results obtained in the case of uniform order approximation on globally quasi-uniform meshes presented by Stenberg and Suri (SIAM J. Numer. Anal. 34 (1997) 544). Numerical examples illustrating the theoretical results and comparing the performance with alternative standard Galerkin approaches are presented for two new benchmark problems with known analytic solution, including the case where the shear stress exhibits a boundary layer. The new method is observed to be locking-free and able to provide exponential rates of convergence even in the presence of boundary layers.     

Adaptive FE analysis of plates by shear-flexible quadrilateral Reissner-Mindlin elements

h-version adaptive finite element analysis of plates using QUAD4 R-M elements is discussed. The necessity of using shear flexible formulations for plate elements in adaptive FEA is explained. Two shear flexible QUAD4 plate elements formulated by reconstituted shear strain fields are selected from literature and are used to solve both thin and thick plates with various geometries and boundary conditions. The effect of boundary layers in plates with soft or free boundaries is discussed and is shown in various examples. A powerful and versatile quadrilateral automatic mesh generator (MSD) is used for the discretization of the plate domain. The error norms are computed by the Z² as well as the superconvergence theory. The global convergence rates of the adaptive solutions with respect to the energy norms are demonstrated and it is seen that the theoretical rates of convergence are exceeded in several cases.     

Adaptive Wavelet BEM for Boundary Integral Equations: Theory and Numerical Experiments

We are concerned with the numerical treatment of boundary integral equations by the adaptive wavelet boundary element method. In particular, we consider the second kind Fredholm integral equation for the double layer potential operator on patchwise smooth manifolds contained in ?³. The corresponding operator equations are treated by adaptive implementations that are in complete accordance with the underlying theory. The numerical experiments demonstrate that adaptive methods really pay off in this setting. The observed convergence rates fit together very well with the theoretical predictions based on the Besov regularity of the exact solution.     

特征值问题的自适应反迭代有限元算法

1引言设Ω∈R~2为Lipschitz单连通的有界闭区域,X为定义在Ω的Sobolev空间,a(·,·)和b(·,·)为X×X→C的有界双线性或半双线性泛函,考虑变分特征值问题:求(λ,u≠0)∈C×X使得a(u,v)=λb(u,u),(?)u∈X,其中a(·,·)满足X上的"V-强制性"条件或者连续的inf-sup条件,设M_h为Q区域上的正则三角形剖分,X_h∈X为定义在M_h有限元子空间,上述变分问题对应的有限元离散问题为:求(λ_h,u_h)∈R×X,u_h≠0使得     

Low cost a posteriori error estimators for an augmented mixed FEM in linear elasticity

We consider an augmented mixed finite element method applied to the linear elasticity problem and derive a posteriori error estimators that are simpler and easier to implement than the ones available in the literature. In the case of homogeneous Dirichlet boundary conditions, the new a posteriori error estimator is reliable and locally efficient, whereas for non-homogeneous Dirichlet boundary conditions, we derive an a posteriori error estimator that is reliable and satisfies a quasi-efficiency bound. Numerical experiments illustrate the performance of the corresponding adaptive algorithms and support the theoretical results.     

Natural Boundary Integral Method and its New Development

In this paper, the natural boundary integral method, and some related methods, including coupling method of the natural boundary elements and finite elements, which is also called DtN method or the method with exact artificial boundary conditions, domain decomposition methods based on the natural boundary reduction, and the adaptive boundary element method with hyper-singular a posteriori error estimates, are discussed.