An optimal nonlinear Galerkin method with mixed finite elements for the steady Navier‐Stokes equations

An optimal nonlinear Galerkin method with mixed finite elements is developed for solving the two‐dimensional steady incompressible Navier‐Stokes equations. This method is based on two finite element spaces X_H and X_h for the approximation of velocity, defined on a coarse grid with grid size H and a fine grid with grid size h ? H, respectively, and a finite element space M_h for the approximation of pressure. We prove that the difference in appropriate norms between the solutions of the nonlinear Galerkin method and a classical Galerkin method is of the order of H⁵. If we choose H = O(h^2/5), these two methods have a convergence rate of the same order. We numerically demonstrate that the optimal nonlinear Galerkin method is efficient and can save a large amount of computational time. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 762–775, 2003.     

Two-scale sparse finite element approximations

To reduce computational cost,we study some two-scale finite element approximations on sparse grids for elliptic partial differential equations of second order in a general setting.Over any tensor product domain ?R~d with d = 2,3,we construct the two-scale finite element approximations for both boundary value and eigenvalue problems by using a Boolean sum of some existing finite element approximations on a coarse grid and some univariate fine grids and hence they are cheaper approximations.As applications,we obtain some new efficient finite element discretizations for the two classes of problem:The new two-scale finite element approximation on a sparse grid not only has the less degrees of freedom but also achieves a good accuracy of approximation.     

A Priori Error Estimates of Crank–Nicolson Finite Volume Element Method for a Hyperbolic Optimal Control Problem

In this article, a Crank–Nicolson linear finite volume element scheme is developed to solve a hyperbolic optimal control problem. We use the variational discretization technique for the approximation of the control variable. The optimal convergent order O(h² + k²) is proved for the numerical solution of the control, state and adjoint‐state in a discrete L²‐norm. To derive this result, we also get the error estimate (convergent order O(h² + k²)) of Crank–Nicolson finite volume element approximation for the second‐order hyperbolic initial boundary value problem. Numerical experiments are presented to verify the theoretical results.© 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1331–1356, 2016     

A high order finite volume method for one dimensional nonlocal reactive flows of parabolic type

In this paper, we consider a high order finite volume approximation of one‐dimensional nonlocal reactive flows of parabolic type. The method is obtained by discretizing in space by arbitrary order vertex‐centered finite volumes, followed by a modified Simpson quadrature scheme for the time stepping. Compared to the existed finite volume methods, this new finite volume scheme could achieve the desired accuracy with less data storage by employing higher‐order trial spaces. The finite volume approximations are proved to possess optimal order convergence rates in the H¹‐norm and L²‐norm, which are also confirmed by numerical tests. Copyright © 2015 John Wiley & Sons, Ltd.     

A two‐grid characteristic finite volume element method for semilinear advection‐dominated diffusion equations

A two‐grid finite volume element method, combined with the modified method of characteristics, is presented and analyzed for semilinear time‐dependent advection‐dominated diffusion equations in two space dimensions. The solution of a nonlinear system on the fine‐grid space (with grid size h) is reduced to the solution of two small (one linear and one nonlinear) systems on the coarse‐grid space (with grid size H) and a linear system on the fine‐grid space. An optimal error estimate in H¹ ‐norm is obtained for the two‐grid method. It shows that the two‐grid method achieves asymptotically optimal approximation, as long as the mesh sizes satisfy h = O(H²). Numerical example is presented to validate the usefulness and efficiency of the method. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

On saturation effects in the Neumann boundary control of elliptic optimal control problems

A Neumann boundary control problem for a linear-quadratic elliptic optimal control problem in a polygonal domain is investigated. The main goal is to show an optimal approximation order for discretized problems after a postprocessing process. It turns out that two saturation processes occur: The regularity of the boundary data of the adjoint is limited if the largest angle of the polygon is at least 2π/3. Moreover, piecewise linear finite elements cannot guarantee the optimal order, if the largest angle of the polygon is greater than π/2. We will derive error estimates of order h ^α with α∈[1,2] depending on the largest angle and properties of the finite elements. Finally, numerical test illustrates the theoretical results.     

On saturation effects in the Neumann boundary control of elliptic optimal control problems

A Neumann boundary control problem for a linear-quadratic elliptic optimal control problem in a polygonal domain is investigated. The main goal is to show an optimal approximation order for discretized problems after a postprocessing process. It turns out that two saturation processes occur: The regularity of the boundary data of the adjoint state is limited if the largest angle of the polygon is at least 2π /3. Moreover, piecewise linear finite elements cannot guarantee the optimal order, if the largest angle of the polygon is greater than π /2. We will derive error estimates of order h^σ with σ ∈ [3/2, 2] depending on the largest angle and properties of the finite elements. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A posteriori error estimates of mixed DG finite element methods for linear parabolic equations

In this article, we analyse a posteriori error estimates of mixed finite element discretizations for linear parabolic equations. The space discretization is done using the order λ?≥?1 Raviart–Thomas mixed finite elements, whereas the time discretization is based on discontinuous Galerkin (DG) methods (r?≥?1). Using the duality argument, we derive a posteriori l ^∞(L ²) error estimates for the scalar function, assuming that only the underlying mesh is static.     

A Priori Error Estimates for Finite Element Methods for H (2,1)-Elliptic Equations

The convergence of finite element methods for linear elliptic boundary value problems of second and forth order is well understood. In this article, we introduce finite element approximations of some linear semi-elliptic boundary value problem of mixed order on a two-dimensional rectangular domain Q. The equation is of second order in one direction and forth order in the other and appears in the optimal control of parabolic partial differential equations if one eliminates the control and the state (or the adjoint state) in the first order optimality conditions. We establish a regularity result and estimate for the finite element error of conforming approximations of this equation. The finite elements in use have a tensor product structure, in one dimension we use linear, quadratic or cubic Lagrange elements in the other dimension cubic Hermite elements. For these elements, we prove the error bound O(h ² + τ ^k ) in the energy norm and O((h ² + τ ^k )(h ² + τ)) in the L ²(Q)-norm.     

A posteriori error estimates for finite element approximations to the wave equation with discontinuous coefficients

We derive residual‐based a posteriori error estimates of finite element method for linear wave equation with discontinuous coefficients in a two‐dimensional convex polygonal domain. A posteriori error estimates for both the space‐discrete case and for implicit fully discrete scheme are discussed in L^∞(L²) norm. The main ingredients used in deriving a posteriori estimates are new Clément type interpolation estimates in conjunction with appropriate adaption of the elliptic reconstruction technique of continuous and discrete solutions. We use only an energy argument to establish a posteriori error estimates with optimal order convergence in the L^∞(L²) norm.     

Analysis of space–time discontinuous Galerkin method for nonlinear convection–diffusion problems

The paper presents the theory of the discontinuous Galerkin finite element method for the space–time discretization of a nonstationary convection–diffusion initial-boundary value problem with nonlinear convection and linear diffusion. The problem is not singularly perturbed with dominating convection. The discontinuous Galerkin method is applied separately in space and time using, in general, different space grids on different time levels and different polynomial degrees p and q in space and time dicretization. In the space discretization the nonsymmetric, symmetric and incomplete interior and boundary penalty (NIPG, SIPG, IIPG) approximation of diffusion terms is used. The paper is concerned with the proof of error estimates in “L ²(L ²)”- and “DG”-norm formed by the “L ²(H ¹)”-seminorm and penalty terms. A special technique based on the use of the Gauss–Radau interpolation and numerical integration has been used for the derivation of an abstract error estimate. In the “DG”-norm the error estimates are optimal with respect to the size of the space grid. They are optimal with respect to the time step, if the Dirichlet boundary condition has behaviour in time as a polynomial of degree ≤ q.     

<Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-error estimates for Dirichlet and Neumann problems on anisotropic finite element meshes

An L ²-estimate of the finite element error is proved for a Dirichlet and a Neumann boundary value problem on a three-dimensional, prismatic and non-convex domain that is discretized by an anisotropic tetrahedral mesh. To this end, an approximation error estimate for an interpolation operator that is preserving the Dirichlet boundary conditions is given. The challenge for the Neumann problem is the proof of a local interpolation error estimate for functions from a weighted Sobolev space.     

Local mesh refinement for the discretization of Neumann boundary control problems on polyhedra

This paper deals with optimal control problems constrained by linear elliptic partial differential equations. The case where the right‐hand side of the Neumann boundary is controlled, is studied. The variational discretization concept for these problems is applied, and discretization error estimates are derived. On polyhedral domains, one has to deal with edge and corner singularities, which reduce the convergence rate of the discrete solutions, that is, one cannot expect convergence order two for linear finite elements on quasi‐uniform meshes in general. As a remedy, a local mesh refinement strategy is presented, and a priori bounds for the refinement parameters are derived such that convergence with optimal rate is guaranteed. As a by‐product, finite element error estimates in the H¹(Ω)‐norm, L²(Ω)‐norm and L²(Γ)‐norm for the boundary value problem are obtained, where the latter one turned out to be the main challenge. Copyright © 2015 John Wiley & Sons, Ltd.     

A new alternating‐direction finite element method for hyperbolic equation

A modified backward difference time discretization is presented for Galerkin approximations for nonlinear hyperbolic equation in two space variables. This procedure uses a local approximation of the coefficients based on patches of finite elements with these procedures, a multidimensional problem can be solved as a series of one‐dimensional problems. Optimal order H₀¹ and L² error estimates are derived. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Lagrange interpolation and finite element superconvergence

We consider the finite element approximation of the Laplacian operator with the homogeneous Dirichlet boundary condition, and study the corresponding Lagrange interpolation in the context of finite element superconvergence. For d‐dimensional Q_k‐type elements with d ≥ 1 and k ≥ 1, we prove that the interpolation points must be the Lobatto points if the Lagrange interpolation and the finite element solution are superclose in H¹ norm. For d‐dimensional P_k‐type elements, we consider the standard Lagrange interpolation—the Lagrange interpolation with interpolation points being the principle lattice points of simplicial elements. We prove for d ≥ 2 and k ≥ d + 1 that such interpolation and the finite element solution are not superclose in both H¹ and L² norms and that not all such interpolation points are superconvergence points for the finite element approximation. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 33–59, 2004.     

Interior maximum norm estimates for finite element discretizations of the Stokes equations

Interior estimates are proved in the L ^∞ norm for stable finite element discretizations of the Stokes equations on translation invariant meshes. These estimates yield information about the quality of the finite element solution in subdomains a positive distance from the boundary. While they have been established for second-order elliptic problems, these interior, or local, maximum norm estimates for the Stokes equations are new. By applying finite differenciation methods on a translation invariant mesh, we obtain optimal convergence rates in the mesh size h in the maximum norm. These results can be used for analyzing superconvergence in finite element methods for the Stokes equations.     

Guaranteed velocity error control for the pseudostress approximation of the Stokes equations

The pseudostress approximation of the Stokes equations rewrites the stationary Stokes equations with pure (but possibly inhomogeneous) Dirichlet boundary conditions as another (equivalent) mixed scheme based on a stress in H(div) and the velocity in L². Any standard mixed finite element function space can be utilized for this mixed formulation, e.g., the Raviart‐Thomas discretization which is related to the Crouzeix‐Raviart nonconforming finite element scheme in the lowest‐order case. The effective and guaranteed a posteriori error control for this nonconforming velocity‐oriented discretization can be generalized to the error control of some piecewise quadratic velocity approximation that is related to the discrete pseudostress. The analysis allows for local inf‐sup constants which can be chosen in a global partition to improve the estimation. Numerical examples provide strong evidence for an effective and guaranteed error control with very small overestimation factors even for domains with large anisotropy.© 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1411–1432, 2016     

Adaptive finite element solution of the porous medium equation in pressure formulation

The pressure formulation of the porous medium equation has been commonly used in theoretical studies due to its much better regularities than the original formulation. The goal here is to study its use in the adaptive moving mesh finite element solution. The free boundary is traced explicitly through Darcy's law. The method is shown numerically second‐order in space and first‐order in time in the pressure variable. Moreover, the convergence order of the error in the location of the free boundary is almost second‐order in the maximum norm. However, numerical results also show that the convergence order in the original variable stays between first‐order and second‐order in L¹ norm or between 0.5th‐order and first‐order in L² norm. Nevertheless, the current method can offer some advantages over numerical methods based on the original formulation for situations with large exponents or when a more accurate location of the free boundary is desired.     

On a quadrature algorithm for the piecewise linear wavelet collocation applied to boundary integral equations

In this paper, we consider a piecewise linear collocation method for the solution of a pseudo‐differential equation of order r=0, ?1 over a closed and smooth boundary manifold. The trial space is the space of all continuous and piecewise linear functions defined over a uniform triangular grid and the collocation points are the grid points. For the wavelet basis in the trial space we choose the three‐point hierarchical basis together with a slight modification near the boundary points of the global patches of parametrization. We choose linear combinations of Dirac delta functionals as wavelet basis in the space of test functionals. For the corresponding wavelet algorithm, we show that the parametrization can be approximated by low‐order piecewise polynomial interpolation and that the integrals in the stiffness matrix can be computed by quadrature, where the quadrature rules are composite rules of simple low‐order quadratures. The whole algorithm for the assembling of the matrix requires no more than O(N [logN]³) arithmetic operations, and the error of the collocation approximation, including the compression, the approximative parametrization, and the quadratures, is less than O(N^?(2?r)/2). Note that, in contrast to well‐known algorithms by Petersdorff, Schwab, and Schneider, only a finite degree of smoothness is required. In contrast to an algorithm of Ehrich and Rathsfeld, no multiplicative splitting of the kernel function is required. Beside the usual mapping properties of the integral operator in low order Sobolev spaces, estimates of Calderón–Zygmund type are the only assumptions on the kernel function. Copyright © 2003 John Wiley & Sons, Ltd.     

<Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript> error estimate of the finite volume element methods on quadrilateral meshes

In this paper the optimal L ² error estimates of the finite volume element methods (FVEM) for Poisson equation are discussed on quadrilateral meshes. The trial function space is taken as isoparametric bilinear finite element space on quadrilateral partition, and the test function space is defined as piecewise constant space on dual partition. Under the assumption that all elements on quadrilateral meshes are O(h ²) quasi-parallel quadrilateral elements, we prove convergence rate to be O(h ²) in L ² norm.