In this paper, by use of affine biquadratic elements, we construct and analyze a finite volume element scheme for elliptic equations on quadrilateral meshes. The scheme is shown to be of second-order in -norm, provided that each quadrilateral in partition is almost a parallelogram. Numerical experiments are presented to confirm the usefulness and efficiency of the method.
In this paper, by use of affine biquadratic elements, we construct and analyze a finite volume element scheme for elliptic equations on quadrilateral meshes. The scheme is shown to be of second-order in H1-norm, provided that each quadrilateral in partition is almost a parallelogram. Numerical experiments are presented to confirm the usefulness and efficiency of the method.
The starting point of the analysis in this paper is the following situation: “In a bounded domain in , let a finite set of points be given. A triangulation of that domain has to be found, whose vertices are the given points and which is ‘suitable’ for the linear conforming Finite Element Method (FEM).” The result of this paper is that for the discrete Poisson equation and under some weak additional assumptions, only the use of Delaunay triangulations preserves the maximum principle.
We consider a general abstract framework of a continuous elliptic problem set on a Hilbert space V that is approximated by a family of (discrete) problems set on a finite-dimensional space of finite dimension not necessarily included into V. We give a series of realistic conditions on an error estimator that allows to conclude that the marking strategy of bulk type leads to the geometric convergence of the adaptive algorithm. These conditions are then verified for different concrete problems...
We present an a posteriori error analysis of adaptive finite element approximations of distributed control problems for second order elliptic boundary value problems under bound constraints on the control. The error analysis is based on a residual-type a posteriori error estimator that consists of edge and element residuals. Since we do not assume any regularity of the data of the problem, the error analysis further invokes data oscillations. We prove reliability and efficiency of the error estimator...
We present an a posteriori error analysis of adaptive finite element approximations of distributed control problems for second order elliptic boundary value problems under bound constraints on the control. The error analysis is based on a residual-type a posteriori error estimator that consists of edge and element residuals. Since we do not assume any regularity of the data of the problem, the error analysis further invokes data oscillations. We prove reliability and efficiency of the error estimator...
An nonlinear elliptic system for generating adaptive quadrilateral meshes in curved domains is presented. The presented technique has been implemented in the C++ language with the help of the standard template library. The software package writes the converged meshes in the GMV and the Matlab formats. Grid generation is the first very important step for numerically solving partial differential equations. Thus, the presented C++ grid generator is extremely important to the computational science community....
Singularly perturbed reaction-diffusion problems exhibit in general solutions with anisotropic features, e.g. strong boundary and/or interior layers. This anisotropy is reflected in a discretization by using meshes with anisotropic elements. The quality of the numerical solution rests on the robustness of the a posteriori error estimator with respect to both, the perturbation parameters of the problem and the anisotropy of the mesh. The equilibrated residual method has been shown to provide one...
So far optimal error estimates on Bakhvalov-type meshes are only known for finite difference and finite element methods solving linear convection-diffusion problems in the one-dimensional case. We prove (almost) optimal error estimates for problems with exponential boundary layers in two dimensions.
Patch substructuring methods are non-overlapping domain decomposition methods like classical substructuring methods, but they use information from geometric patches reaching into neighboring subdomains condensated, on the interfaces to enhance the performance of the method, while keeping it non-overlapping. These methods are very convenient to use in practice, but their convergence properties have not been studied yet. We analyze geometric patch substructuring methods for the special case of one...
We develop a new technique which, for the given smooth function, generates the anisotropic triangular grid and the corresponding polynomial approximation degrees based on the minimization of the interpolation error in the broken -seminorm. This technique can be employed for the numerical solution of boundary value problems with the aid of finite element methods. We present the theoretical background of this approach and show several numerical examples demonstrating the efficiency of the proposed...
In this communication we focus on goal-oriented anisotropic adaption techniques. Starting point has been the derivation of suitable anisotropic interpolation error estimates for piecewise linear finite elements, on triangular grids in . Then we have merged these interpolation estimates with the dual-based a posteriori error analysis proposed by R. Rannacher and R. Becker. As examples of this general anisotropic a posteriori analysis, elliptic, advection-diffusion-reaction and the Stokes problems...
The paper is concerned with the finite element solution of the Poisson equation with homogeneous Dirichlet boundary condition in a three-dimensional domain. Anisotropic, graded meshes from a former paper are reused for dealing with the singular behaviour of the solution in the vicinity of the non-smooth parts of the boundary. The discretization error is analyzed for the piecewise linear approximation in the H1(Ω)- and L2(Ω)-norms by using a new quasi-interpolation operator. This new interpolant...
An averaging method for the second-order approximation of the values of the gradient of an arbitrary smooth function u = u(x 1, x 2) at the vertices of a regular triangulation T h composed both of rectangles and triangles is presented. The method assumes that only the interpolant Πh[u] of u in the finite element space of the linear triangular and bilinear rectangular finite elements from T h is known. A complete analysis of this method is an extension of the complete analysis concerning the finite...