An iterative adaptive finite element method for elliptic eigenvalue problems

We consider the task of resolving accurately the n$n$th eigenpair of a generalized eigenproblem rooted in some elliptic partial differential equation (PDE), using an adaptive finite element method (FEM). Conventional adaptive FEM algorithms call a generalized eigensolver after each mesh refinement step. This is not practical in our situation since the generalized eigensolver needs to calculate n$n$ eigenpairs after each mesh refinement step, it can switch the order of eigenpairs, and for repeated eigenvalues it can return an arbitrary linear combination of eigenfunctions from the corresponding eigenspace. In order to circumvent these problems, we propose a novel adaptive algorithm that only calls a generalized eigensolver once at the beginning of the computation, and then employs an iterative method to pursue a selected eigenvalue–eigenfunction pair on a sequence of locally refined meshes. Both Picard’s and Newton’s variants of the iterative method are presented. The underlying partial differential equation (PDE) is discretized with higher-order finite elements (hp$hp$-FEM) but the algorithm also works for standard low-order FEM. The method is described and accompanied with theoretical analysis and numerical examples. Instructions on how to reproduce the results are provided.     

Two-grid finite volume element method for linear and nonlinear elliptic problems

Two-grid finite volume element discretization techniques, based on two linear conforming finite element spaces on one coarse and one fine grid, are presented for the two-dimensional second-order non-selfadjoint and indefinite linear elliptic problems and the two-dimensional second-order nonlinear elliptic problems. With the proposed techniques, solving the non-selfadjoint and indefinite elliptic problem on the fine space is reduced into solving a symmetric and positive definite elliptic problem on the fine space and solving the non-selfadjoint and indefinite elliptic problem on a much smaller space; solving a nonlinear elliptic problem on the fine space is reduced into solving a linear problem on the fine space and solving the nonlinear elliptic problem on a much smaller space. Convergence estimates are derived to justify the efficiency of the proposed two-grid algorithms. A set of numerical examples are presented to confirm the estimates. The work is supported by the National Natural Science Foundation of China (Grant No: 10601045).     

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.     

Efficient computable error bounds for discontinuous Galerkin approximations of elliptic problems

We present guaranteed and computable both sided error bounds for the discontinuous Galerkin (DG) approximations of elliptic problems. These estimates are derived in the full DG-norm on purely functional grounds by the analysis of the respective differential problem, and thus, are applicable to any qualified DG approximation. Based on the triangle inequality, the underlying approach has the following steps for a given DG approximation: (1) computing a conforming approximation in the energy space using the Oswald interpolation operator, and (2) application of the existing functional a posteriori error estimates to the conforming approximation. Various numerical examples with varying difficulty in computing the error bounds, from simple problems of polynomial-type analytic solution to problems with analytic solution having sharp peaks, or problems with jumps in the coefficients of the partial differential equation operator, are presented which confirm the efficiency and the robustness of the estimates.     

A finite volume method for solving Navier-Stokes problems

We develop a finite volume method for solving the Navier-Stokes equations on a triangular mesh. We prove that the unique solution of the finite volume method converges to the true solution with optimal order for velocity and for pressure in discrete H¹ norm and L² norm respectively.     

A posteriori error estimates for elliptic problems with Dirac delta source terms

The aim of this paper is to introduce residual type a posteriori error estimators for a Poisson problem with a Dirac delta source term, in L ^p norm and W^1,p seminorm. The estimators are proved to yield global upper and local lower bounds for the corresponding norms of the error. They are used to guide adaptive procedures, which are experimentally shown to lead to optimal orders of convergence.     

Streamline diffusion finite element method for quasilinear elliptic problems

Summary We extend the analysis of the streamline diffusion finite element method to quasilinear elliptic problems of second order. An existence theorem and error estimates are given in the case of branches of nonsingular solutions following a recent abstract approach in [12, 13, 26].     

A posteriori error estimates for mixed finite element approximations of elliptic problems

We derive residual based a posteriori error estimates of the flux in L ²-norm for a general class of mixed methods for elliptic problems. The estimate is applicable to standard mixed methods such as the Raviart–Thomas–Nedelec and Brezzi–Douglas–Marini elements, as well as stabilized methods such as the Galerkin-Least squares method. The element residual in the estimate employs an elementwise computable postprocessed approximation of the displacement which gives optimal order.     

Superconvergence of mixed covolume method for elliptic problems on triangular grids

In this paper, we consider the superconvergence of a mixed covolume method on the quasi-uniform triangular grids for the variable coefficient-matrix Poisson equations. The superconvergence estimates between the solution of the mixed covolume method and that of the mixed finite element method have been obtained. With these superconvergence estimates, we establish the superconvergence estimates and the L^∞$L^{\infty }$-error estimates for the mixed covolume method for the elliptic problems. Based on the superconvergence of the mixed covolume method, under the condition that the triangulation is uniform, we construct a post-processing method for the approximate velocity which improves the order of approximation of the approximate velocity.     

Convergence analysis of a conforming adaptive finite element method for an obstacle problem

The adaptive algorithm for the obstacle problem presented in this paper relies on the jump residual contributions of a standard explicit residual-based a posteriori error estimator. Each cycle of the adaptive loop consists of the steps ‘SOLVE’, ‘ESTIMATE’, ‘MARK’, and ‘REFINE’. The techniques from the unrestricted variational problem are modified for the convergence analysis to overcome the lack of Galerkin orthogonality. We establish R-linear convergence of the part of the energy above its minimal value, if there is appropriate control of the data oscillations. Surprisingly, the adaptive mesh-refinement algorithm is the same as in the unconstrained case of a linear PDE—in fact, there is no modification near the discrete free boundary necessary for R-linear convergence. The arguments are presented for a model obstacle problem with an affine obstacle χ and homogeneous Dirichlet boundary conditions. The proof of the discrete local efficiency is more involved than in the unconstrained case. Numerical results are given to illustrate the performance of the error estimator.     

Additive Schwarz methods for the Crouzeix-Raviart mortar finite element for elliptic problems with discontinuous coefficients

In this paper, we propose two variants of the additive Schwarz method for the approximation of second order elliptic boundary value problems with discontinuous coefficients, on nonmatching grids using the lowest order Crouzeix-Raviart element for the discretization in each subdomain. The overall discretization is based on the mortar technique for coupling nonmatching grids. The convergence behavior of the proposed methods is similar to that of their closely related methods for conforming elements. The condition number bound for the preconditioned systems is independent of the jumps of the coefficient, and depend linearly on the ratio between the subdomain size and the mesh size. The performance of the methods is illustrated by some numerical results. This work has been supported by the Alexander von Humboldt Foundation and the special funds for major state basic research projects (973) under 2005CB321701 and the National Science Foundation (NSF) of China (No.10471144) This work has been supported in part by the Bergen Center for Computational Science, University of Bergen     

An optimal adaptive wavelet method for nonsymmetric and indefinite elliptic problems

In this paper, we modify the adaptive wavelet algorithm from Gantumur et al. [An optimal adaptive wavelet method without coarsening of the iterands, Technical Report 1325, Department of Mathematics, Utrecht University, March 2005, Math. Comp., to appear] so that it applies directly, i.e., without forming the normal equation, not only to self-adjoint elliptic operators but also to operators of the form L=A+B$L=A+B$, where A is self-adjoint elliptic and B is compact, assuming that the resulting operator equation is well posed. We show that the algorithm has optimal computational complexity.     

Error estimates for a mixed finite volume method for the p-Laplacian problem

In this work we propose and analyze a mixed finite volume method for the p-Laplacian problem which is based on the lowest order Raviart–Thomas element for the vector variable and the P1 nonconforming element for the scalar variable. It is shown that this method can be reduced to a P1 nonconforming finite element method for the scalar variable only. One can then recover the vector approximation from the computed scalar approximation in a virtually cost-free manner. Optimal a priori error estimates are proved for both approximations by the quasi-norm techniques. We also derive an implicit error estimator of Bank–Weiser type which is based on the local Neumann problems.This work was supported by the Post-doctoral Fellowship Program of Korea Science & Engineering Foundation (KOSEF).     

Adaptive multilevel finite element approximations of semilinear elliptic boundary value problems

Summary. In this paper we consider two aspects of the problem of designing efficient numerical methods for the approximation of semilinear boundary value problems. First we consider the use of two and multilevel algorithms for approximating the discrete solution. Secondly we consider adaptive mesh refinement based on feedback information from coarse level approximations. The algorithms are based on an a posteriori error estimate, where the error is estimated in terms of computable quantities only. The a posteriori error estimate is used for choosing appropriate spaces in the multilevel algorithms, mesh refinements, as a stopping criterion and finally it gives an estimate of the total error. Received April 8, 1997 / Revised version received July 27, 1998 / Published online September 24, 1999     

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

Continuous-discontinuous finite element method for convection-diffusion problems with characteristic layers

We study convergence properties of a numerical method for convection-diffusion problems with characteristic layers on a layer-adapted mesh. The method couples standard Galerkin with an h-version of the nonsymmetric discontinuous Galerkin finite element method with bilinear elements. In an associated norm, we derive the error estimate as well as the supercloseness result that are uniform in the perturbation parameter. Applying a post-processing operator for the discontinuous Galerkin method, we construct a new numerical solution with enhanced convergence properties.     

An augmented mixed finite element method for 3D linear elasticity problems

In this paper we introduce and analyze a new augmented mixed finite element method for linear elasticity problems in 3D. Our approach is an extension of a technique developed recently for plane elasticity, which is based on the introduction of consistent terms of Galerkin least-squares type. We consider non-homogeneous and homogeneous Dirichlet boundary conditions and prove that the resulting augmented variational formulations lead to strongly coercive bilinear forms. In this way, the associated Galerkin schemes become well posed for arbitrary choices of the corresponding finite element subspaces. In particular, Raviart-Thomas spaces of order 0 for the stress tensor, continuous piecewise linear elements for the displacement, and piecewise constants for the rotation can be utilized. Moreover, we show that in this case the number of unknowns behaves approximately as 9.5 times the number of elements (tetrahedrons) of the triangulation, which is cheaper, by a factor of 3, than the classical PEERS in 3D. Several numerical results illustrating the good performance of the augmented schemes are provided.     

Error estimates of the lumped mass finite element method for semilinear elliptic problems

We are concerned with the semilinear elliptic problems. We first investigate the L²-error estimate for the lumped mass finite element method. We then use the cascadic multigrid method to solve the corresponding discrete problem. On the basis of the finite element error estimates, we prove the optimality of the proposed multigrid method. We also report some numerical results to support the theory.