A posteriori error estimates in quantities of interest for the finite element heterogeneous multiscale method

We present an “a posteriori” error analysis in quantities of interest for elliptic homogenization problems discretized by the finite element heterogeneous multiscale method. The multiscale method is based on a macro‐to‐micro formulation, where the macroscopic physical problem is discretized in a macroscopic finite element space, and the missing macroscopic data are recovered on‐the‐fly using the solutions of corresponding microscopic problems. We propose a new framework that allows to follow the concept of the (single‐scale) dual‐weighted residual method at the macroscopic level in order to derive a posteriori error estimates in quantities of interests for multiscale problems. Local error indicators, derived in the macroscopic domain, can be used for adaptive goal‐oriented mesh refinement. These error indicators rely only on available macroscopic and microscopic solutions. We further provide a detailed analysis of the data approximation error, including the quadrature errors. Numerical experiments confirm the efficiency of the adaptive method and the effectivity of our error estimates in the quantities of interest. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Sensitivities for topological graph changes in finite element meshes and application to adaptive refinement

We propose a novel approach to adaptivity in FEM based on local sensitivities for topological mesh changes. To this end, we consider refinement as a continuous operation on the edge graph of the finite element discretization, for instance by splitting nodes along edges and expanding edges to elements. Thereby, we introduce the concept of a topological mesh derivative for a given objective function that depends on the discrete solution of the underlying PDE. These sensitivities may in turn be used as refinement indicators within an adaptive algorithm. For their calculation, we rely on the first-order asymptotic expansion of the Galerkin solution with respect to the topological mesh change. As a proof of concept, we consider the total potential energy of a linear symmetric second-order elliptic PDE, minimization of which is known to decrease the approximation error in the energy norm. In this case, our approach yields local sensitivities that are closely related to the reduction of the energy error upon refinement and may therefore be used as refinement indicators in an adaptive algorithm. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A Sequential Least Squares Method for Elliptic Equations in Non-Divergence Form

We develop a new least squares method for solving the second-order elliptic equations in non-divergence form. Two least-squares-type functionals are proposed for solving the equation in two sequential steps. We first obtain a numerical approximation to the gradient in a piecewise irrotational polynomial space. Then together with the numerical gradient, we seek a numerical solution of the primitive variable in the continuous Lagrange finite element space. The variational setting naturally provides an a posteriori error which can be used in an adaptive refinement algorithm. The error estimates under the $L^2$ norm and the energy norm for both two unknowns are derived. By a series of numerical experiments, we verify the convergence rates and show the efficiency of the adaptive algorithm.     

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     

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     

On the h-adaptive coupling of FE and BE for viscoplastic and elasto-plastic interface problems

This paper presents a posteriori error estimates for the symmetric finite element and boundary element coupling for a nonlinear interface problem: A bounded body with a viscoplastic or plastic material behaviour is surrounded by an elastic body. The nonlinearity is treated by the finite element method while large parts of the linear elastic body are approximated using the boundary element method. Based on the a posteriori error estimates we derive an algorithm for the adaptive mesh refinement of the boundary elements and the finite elements. Its implementation is documented and numerical examples are included.     

Adaptive computation of smallest eigenvalues of self‐adjoint elliptic partial differential equations

We consider a new adaptive finite element (AFEM) algorithm for self‐adjoint elliptic PDE eigenvalue problems. In contrast to other approaches we incorporate the inexact solutions of the resulting finite‐dimensional algebraic eigenvalue problems into the adaptation process. In this way we can balance the costs of the adaptive refinement of the mesh with the costs for the iterative eigenvalue method. We present error estimates that incorporate the discretization errors, approximation errors in the eigenvalue solver and roundoff errors, and use these for the adaptation process. We show that it is also possible to restrict to very few iterations of a Krylov subspace solver for the eigenvalue problem on coarse meshes. Several examples are presented to show that this new approach achieves much better complexity than the previous AFEM approaches which assume that the algebraic eigenvalue problem is solved to full accuracy. Copyright © 2010 John Wiley & Sons, Ltd.     

A posteriori error estimation and adaptivity for elliptic optimal control problems with state constraints

In this paper optimal control problems governed by elliptic semilinear equations and subject to pointwise state constraints are considered. These problems are discretized using finite element methods and a posteriori error estimates are derived assessing the error with respect to the cost functional. These estimates are used to obtain quantitative information on the discretization error as well as for guiding an adaptive algorithm for local mesh refinement. Numerical examples illustrate the behavior of the method.     

Convergence analysis of an adaptive edge element method for Maxwell's equations

An efficient and reliable a posteriori error estimate is derived for solving three-dimensional static Maxwell's equations by using the edge elements of first family. Based on the a posteriori error estimates, an adaptive finite element method is constructed and its convergence is established. Compared with the existing results, an important advantage of the new theory lies in its feature that the usual marking of elements based on the oscillation is not needed in our adaptive algorithm, while the linear convergence of the algorithm can be still demonstrated in terms of the reduction of the energy-norm error and the oscillation. Numerical examples are provided which demonstrate the effectiveness and robustness of the adaptive methods.     

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

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使得     

Adaptive FEM and a posteriori error control for stationary coupled bulk-surface PDEs

We consider a system of two coupled elliptic equations, one defined on a bulk domain and the other one on the boundary surface. The numerical error of the finite element solution can be controlled by a residual a posteriori error estimator which takes into account the approximation errors due to the discretisation in space as well as the polyhedral approximation of the surface. The estimators naturally lead to refinement indicators for an adaptive algorithm to control the overall error. Numerical experiments illustrate the performance of the a posteriori error estimator and the adaptive algorithm. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

An Adaptive Hybrid Spectral Method for Stochastic Helmholtz Problems

The implementation of an adaptive hybrid spectral method for Helmholtz equations with random parameters is addressed in this work. New error indicators for generalized polynomial chaos for stochastic approximations and spectral element methods for physical approximations are developed, and systematic adaptive strategies are proposed associated with these error indicators. Numerical results show that these error indicators provide effective estimates for the approximation errors, and the overall adaptive procedure results in efficient approximation method for the stochastic Helmholtz equations.     

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.     

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     

Adaptive characteristic finite element approximation of convection–diffusion optimal control problems

In this article, a characteristic finite element approximation of quadratic optimal control problems governed by linear convection–diffusion equations is given. We derive some a posteriori error estimates for both the control and the state approximations, where the control variable is constrained by pointwise inequality. The derived error estimators are then used as an error indicator to guide the mesh refinement. In this sense, they are very important in developing adaptive finite element algorithm for the optimal control problems. Finally, a numerical example is given to validate the efficiency and reliability of the theoretical results. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

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 posteriori error estimation for elliptic eigenproblems

An a posteriori error estimator is presented for a subspace implementation of preconditioned inverse iteration, which derives from the well‐known inverse iteration in such a way that the associated system of linear equations is solved approximately by using a preconditioner. The error estimator is integrated in an adaptive multigrid algorithm to compute approximations of a modest number of the smallest eigenvalues together with the eigenfunctions of an elliptic differential operator. Error estimation is applied both within the actual finite element space (in order to estimate the iteration error) as well as in its hierarchical refinement of higher‐order elements (to estimate the discretization error) which gives rise to a balanced reduction of the iteration error and of the discretization error in the adaptive multigrid algorithm. Copyright © 2002 John Wiley & Sons, Ltd.     

High-order adaptive finite element-singly implicit Runge-Kutta methods for parabolic differential equations

We describe an adaptive mesh refinement finite element method-of-lines procedure for solving one-dimensional parabolic partial differential equations. Solutions are calculated using Galerkin's method with a piecewise hierarchical polynomial basis in space and singly implicit Runge-Kutta (SIRK) methods in time. A modified SIRK formulation eliminates a linear systems solution that is required by the traditional SIRK formulation and leads to a new reduced-order interpolation formula. Stability and temporal error estimation techniques allow acceptance of approximate solutions at intermediate stages, yielding increased efficiency when solving partial differential equations. A priori energy estimates of the local discretization error are obtained for a nonlinear scalar problem. A posteriori estimates of local spatial discretization errors, obtained by order variation, are used with the a priori error estimates to control the adaptive mesh refinement strategy. Computational results suggest convergence of the a posteriori error estimate to the exact discretization error and verify the utility of the adaptive technique.This research was partially supported by the U.S. Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR-90-0194; the U.S. Army Research Office under Contract Number DAAL 03-91-G-0215; by the National Science Foundation under Grant Number CDA-8805910; and by a grant from the Committee on Research, Tulane University.     

A posteriori error estimates of edge residual type of finite element method for nonmonotone quasi‐linear elliptic problems

In this article, we study the edge residual‐based a posteriori error estimates of conforming linear finite element method for nonmonotone quasi‐linear elliptic problems. It is proven that edge residuals dominate a posteriori error estimates. Up to higher order perturbations, edge residuals can act as a posteriori error estimators. The global reliability and local efficiency bounds are established both in H ¹‐norm and L ²‐norm. Numerical experiments are provided to illustrate the performance of the proposed error estimators. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 813–837, 2014     

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