Approximation by quadrilateral finite elements

Mathematics of Computation (Impact Factor: 1.41). 06/2000; DOI: 10.1090/S0025-5718-02-01439-4
Source: arXiv

ABSTRACT We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space of functions on a square reference element, which is then transformed to a space of functions on each convex quadrilateral element via a bilinear isomorphism of the square onto the element. It is known that for affine isomorphisms, a necessary and sufficient condition for approximation of order r+1 in L2 and order r in H1 is that the given space of functions on the reference element contain all polynomial functions of total degree at most r. In the case of bilinear isomorphisms, it is known that the same estimates hold if the function space contains all polynomial functions of separate degree r. We show, by means of a counterexample, that this latter condition is also necessary. As applications we demonstrate degradation of the convergence order on quadrilateral meshes as compared to rectangular meshes for serendipity finite elements and for various mixed and nonconforming finite elements.

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Superconvergence and a posteriori error estimators of recovery type are analyzed for the 4-node hybrid stress quadrilateral finite element method proposed by Pian and Sumihara (Int. J. Numer. Meth. Engrg., 1984, 20: 1685-1695) for linear elasticity problems. Uniform superconvergence of order $O(h^{1+\min\{\alpha,1\}})$ with respect to the Lam\'{e} constant $\lambda$ is established for both the recovered gradients of the displacement vector and the stress tensor under a mesh assumption, where $\alpha>0$ is a parameter characterizing the distortion of meshes from parallelograms to quadrilaterals. A posteriori error estimators based on the recovered quantities are shown to be asymptotically exact. Numerical experiments confirm the theoretical results.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The integration and application of a new multi-objective tabu search optimization algorithm for Fluid Structure Interaction (FSI) problems are presented. The aim is to enhance the computational design process for real world applications and to achieve higher performance of the whole system for the four considered objectives. The described system combines the optimizer with a well established FSI solver which is based on the fully implicit, monolithic formulation of the problem in the Arbitrary Lagrangian-Eulerian FEM approach. The proposed solver resolves the proposed fluid-structure interaction benchmark which describes the self-induced elastic deformation of a beam attached to a cylinder in laminar channel flow. The optimized flow characteristics of the aforementioned geometrical arrangement illustrate the performance of the system in two dimensions. Special emphasis is given to the analysis of the simulation package, which is of high accuracy and is the core of application. The design process identifies the best combination of flow features for optimal system behavior and the most important objectives. In addition, the presented methodology has the potential to run in parallel, which will significantly speed-up the elapsed time.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this work we consider agglomeration-based physical frame discontinuous Galerkin (dG) discretization as an effective way to increase the flexibility of high-order finite element methods. The mesh free concept is pursued in the following (broad) sense: the computational domain is still discretized using a mesh but the computational grid should not be a constraint for the finite element discretization. In particular the discrete space choice, its convergence properties, and even the complexity of solving the global system of equations resulting from the dG discretization should not be influenced by the grid choice. Physical frame dG discretization allows to obtain mesh-independent h-convergence rates. Thanks to mesh agglomeration, high-order accurate discretizations can be performed on arbitrarily coarse grids, without resorting to very high-order approximations of domain boundaries. Agglomeration-based h-multigrid techniques are the obvious choice to obtain fast and grid-independent solvers. These features (attractive for any mesh free discretization) are demonstrated in practice with numerical test cases.
    Mathematical Models and Methods in Applied Sciences 07/2014; 24(8). DOI:10.1142/S0218202514400028 · 2.35 Impact Factor

Full-text (2 Sources)

Available from
May 31, 2014