An hp‐adaptive refinement strategy for hypersingular operators on surfaces

An adaptive refinement strategy for the hp‐version of the boundary element method with hypersingular operators on surfaces is presented. The error indicators are based on local projections provided by two‐level decompositions of ansatz spaces with additional bubble functions. Assuming a saturation property and locally quasi‐uniform meshes, efficiency and reliability of the resulting error estimator is proved. A second error estimator based on mesh refinement and overlapping decompositions that better fulfills the saturation property is presented. The performance of the algorithm and the estimators is demonstrated for a model problem. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 396–419, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/num.10011     

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.

     

A posteriori error estimate and h-adaptive algorithm on surfaces for Symm's integral equation

Summary. A residual-based a posteriori error estimate for boundary integral equations on surfaces is derived in this paper. A localisation argument involves a Lipschitz partition of unity such as nodal basis functions known from finite element methods. The abstract estimate does not use any property of the discrete solution, but simplifies for the Galerkin discretisation of Symm's integral equation if piecewise constants belong to the test space. The estimate suggests an isotropic adaptive algorithm for automatic mesh-refinement. An alternative motivation from a two-level error estimate is possible but then requires a saturation assumption. The efficiency of an anisotropic version is discussed and supported by numerical experiments. Received November 29, 1999 / Revised version received August 10, 2000 / Published online May 30, 2001     

Decay rates of adaptive finite elements with Dörfler marking

We investigate the decay rate for an adaptive finite element discretization of a second order linear, symmetric, elliptic PDE. We allow for any kind of estimator that is locally equivalent to the standard residual estimator. This includes in particular hierarchical estimators, estimators based on the solution of local problems, estimators based on local averaging, equilibrated residual estimators, the ZZ-estimator, etc. The adaptive method selects elements for refinement with Dörfler marking and performs a minimal refinement in that no interior node property is needed. Based on the local equivalence to the residual estimator we prove an error reduction property. In combination with minimal Dörfler marking this yields an optimal decay rate in terms of degrees of freedom.     

自适应有限元和后验误差估计——渐近准确估计

在[7]中,作者讨论了有限元误差的1-模等价估计.本文是[7]的继续,给出一种自适应有限元计算中误差的1-模渐近准确估计,即对于误差的1-模||e||_1,Ω给出可计算的估计量?,当||e||_1,Ω→0时,成立?/||e||_1,Ω→1. 本文将沿用[7]中的定义及符号.     

Local problems on stars: A posteriori error estimators, convergence, and performance

A new computable a posteriori error estimator is introduced, which relies on the solution of small discrete problems on stars. It exhibits built-in flux equilibration and is equivalent to the energy error up to data oscillation without any saturation assumption. A simple adaptive strategy is designed, which simultaneously reduces error and data oscillation, and is shown to converge without mesh pre-adaptation nor explicit knowledge of constants. Numerical experiments reveal a competitive performance, show extremely good effectivity indices, and yield quasi-optimal meshes.

     

Convergence and quasi-optimality of an adaptive finite element method for controlling <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript> errors

In this paper, a contraction property is proved for an adaptive finite element method for controlling the global L ₂ error on convex polyhedral domains. Furthermore, it is shown that the method converges in L ₂ with the best possible rate. The method that is analyzed is the standard adaptive method except that, if necessary, additional refinements are made to keep the meshes sufficiently mildly graded. This modification does not compromise the quasi-optimality of the resulting algorithm.     

An adaptive boundary element method for the exterior Stokes problem in three dimensions

^** Email: vjervin{at}clemson.edu^*** Email: norbert.heuer{at}brunel.ac.uk We present an adaptive refinement strategy for the h-versionof the boundary element method with weakly singular operatorson surfaces. The model problem deals with the exterior Stokesproblem, and thus considers vector functions. Our error indicatorsare computed by local projections onto 1D subspaces definedby mesh refinement. These indicators measure the error separatelyfor the vector components and allow for component-independentadaption. Assuming a saturation condition, the indicators giverise to an efficient and reliable error estimator. Also we describehow to deal with meshes containing quadrilaterals which arenot shape regular. The theoretical results are underlined bynumerical experiments. To justify the saturation assumption,in the Appendix we prove optimal lower a priori error estimatesfor edge singularities on uniform and graded meshes.     

An adaptive edge element method and its convergence for a Saddle‐Point problem from magnetostatics

Reliable and efficient a posteriori error estimates are derived for the edge element discretization of a saddle‐point Maxwell's system. By means of the error estimates, an adaptive edge element method is proposed and its convergence is rigorously demonstrated. The algorithm uses a marking strategy based only on the error indicators, without the commonly used information on local oscillations and the refinement to meet the standard interior node property. Some new ingredients in the analysis include a novel quasi‐orthogonality and a new inf‐sup inequality associated with an appropriately chosen norm. It is shown that the algorithm is a contraction for the sum of the energy error plus the error indicators after each refinement step. Numerical experiments are presented to show the robustness and effectiveness of the proposed adaptive algorithm. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2012     

Convergence and optimality of the adaptive Morley element method

This paper is devoted to the convergence and optimality analysis of the adaptive Morley element method for the fourth order elliptic problem. A new technique is developed to establish a quasi-orthogonality which is crucial for the convergence analysis of the adaptive nonconforming method. By introducing a new parameter-dependent error estimator and further establishing a discrete reliability property, sharp convergence and optimality estimates are then fully proved for the fourth order elliptic problem.     

A posteriori error analysis for a boundary element method with nonconforming domain decomposition

We present and analyze an a posteriori error estimator based on mesh refinement for the solution of the hypersingular boundary integral equation governing the Laplacian in three dimensions. The discretization under consideration is a nonconforming domain decomposition method based on the Nitsche technique. Assuming a saturation property, we establish quasireliability and efficiency of the error estimator in comparison with the error in a natural (nonconforming) norm. Numerical experiments with uniform and adaptively refined meshes confirm our theoretical results. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 947–963, 2014     

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.     

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 minimax test of independence

The paper is concerned with the adaptive minimax problem of testing the independence of the components of a d-dimensional random vector. The functions under alternatives consist of smooth densities supported on [0, 1]d and separated away from the product of their marginals in L2-norm. We are interested in finding the adaptive minimax rate of testing and a test that attains this rate. We focus mainly on the tests for which the error of the first kind an can decrease to zero as the number of observations increases. We show also how this property of the test affects its error of the second kind.     

Convergence and quasi-optimality of adaptive nonconforming finite element methods for some nonsymmetric and indefinite problems

Recently an adaptive nonconforming finite element method (ANFEM) has been developed by Carstensen and Hoppe (in Numer Math 103:251–266, 2006). In this paper, we extend the result to some nonsymmetric and indefinite problems. The main tools in our analysis are a posteriori error estimators and a quasi-orthogonality property. In this case, we need to overcome two main difficulties: one stems from the nonconformity of the finite element space, the other is how to handle the effect of a nonsymmetric and indefinite bilinear form. An appropriate adaptive nonconforming finite element method featuring a marking strategy based on the comparison of the a posteriori error estimator and a volume term is proposed for the lowest order Crouzeix–Raviart element. It is shown that the ANFEM is a contraction for the sum of the energy error and a scaled volume term between two consecutive adaptive loops. Moreover, quasi-optimality in the sense of quasi-optimal algorithmic complexity can be shown for the ANFEM. The results of numerical experiments confirm the theoretical findings.     

A posteriori error control in low-order finite element discretisations of incompressible stationary flow problems

Computable a posteriori error bounds and related adaptive mesh-refining algorithms are provided for the numerical treatment of monotone stationary flow problems with a quite general class of conforming and nonconforming finite element methods. A refined residual-based error estimate generalises the works of Verfürth; Dari, Duran and Padra; Bao and Barrett. As a consequence, reliable and efficient averaging estimates can be established on unstructured grids. The symmetric formulation of the incompressible flow problem models certain nonNewtonian flow problems and the Stokes problem with mixed boundary conditions. A Helmholtz decomposition avoids any regularity or saturation assumption in the mathematical error analysis. Numerical experiments for the partly nonconforming method analysed by Kouhia and Stenberg indicate efficiency of related adaptive mesh-refining algorithms.

     

Adaptive meshless Galerkin boundary node methods for hypersingular integral equations

Adaptive refinement techniques are developed in this paper for the meshless Galerkin boundary node method for hypersingular boundary integral equations. Two types of error estimators are derived. One is a perturbation error estimator that is formulated based on the difference between numerical solutions obtained using two consecutive nodal arrangements. The other is a projection error estimator that is formulated based on the difference between the numerical solution itself and its projection. These error estimators are proven to have an upper and a lower bound by the constant multiples of the exact error in the energy norm. A localization scheme is presented to accomodate the non-local property of hypersingular integral operators for the needed computable local error indicators. The convergence of the adaptive meshless techniques is verified theoretically. To confirm the theoretical results and to show the efficiency of the adaptive techniques, numerical examples in 2D and 3D with high singularities are provided.     

Stepsize selection for tolerance proportionality in explicit Runge–Kutta codes

The potential for adaptive explicit Runge–Kutta (ERK) codes to produce global errors that decrease linearly as a function of the error tolerance is studied. It is shown that this desirable property may not hold, in general, if the leading term of the locally computed error estimate passes through zero. However, it is also shown that certain methods are insensitive to a vanishing leading term. Moreover, a new stepchanging policy is introduced that, at negligible extra cost, ensures a robust global error behaviour. The results are supported by theoretical and numerical analysis on widely used formulas and test problems. Overall, the modified stepchanging strategy allows a strong guarantee to be attached to the complete numerical process. This revised version was published online in June 2006 with corrections to the Cover Date.     

一类Kirchhoff 板弯问题自适应高阶混合元方法及理论分析

本文针对Kirchhoff 板弯问题提出了一个基于高阶Hellan-Herrmann-Johnson (简记为H-H-J)方法的自适应有限元算法, 分析了它的收敛性和计算复杂度. 证明了算法在执行过程中, 相应的拟能量误差会以几何级数单调衰减, 从而得到收敛性. 利用此单调下降性质, 进一步给出了算法的计算复杂度. 推导过程中的一个关键步骤是建立基于平衡方程的单元误差表示(error indicator) 与平衡方程右端载荷震荡项(data oscillation) 的局部等价关系.     

Convergence of adaptive 3D BEM for weakly singular integral equations based on isotropic mesh‐refinement

We consider the adaptive lowest‐order boundary element method based on isotropic mesh refinement for the weakly‐singular integral equation for the three‐dimensional Laplacian. The proposed scheme resolves both, possible singularities of the solution as well as of the given data. The implementation thus only deals with discrete integral operators, that is, matrices. We prove that the usual adaptive mesh‐refining algorithm drives the corresponding error estimator to zero. Under an appropriate saturation assumption which is observed empirically, the sequence of discrete solutions thus tends to the exact solution within the energy norm. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013