On general summability factor theorem of infinite series

A lower triangular matrix with nonzero principal diagonal entries is called a triangle. In this paper we obtain the sufficient conditions for ∑a_nλ_n to be summable ∣A∣_k whenever ∑a_n is summable ∣T∣_k for a triangle T.     

Convergence on layer-adapted meshes and anisotropic interpolation error estimates of non-standard higher order finite elements

For a general class of finite element spaces based on local polynomial spaces E with Pp⊂E⊂Qp we construct a vertex-edge-cell and point-value oriented interpolation operators that fulfil anisotropic interpolation error estimates.Using these estimates we prove ε-uniform convergence of order p for the Galerkin FEM and the LPSFEM for a singularly perturbed convection-diffusion problem with characteristic boundary layers.     

Hybrid mesh adaptation applied to industrial numerical combustion

This paper presents an anisotropic mesh adaptation method applied to industrial combustion problems. The method is based on a measure of the distance between two Riemannian metrics called metric non‐conformity. This measure, which can be used to build a cost function to adapt meshes comprising several types of mesh elements, provides the basis for a generic mesh adaptation approach applicable to various types of physical problems governed by partial differential equations. The approach is shown to be applicable to industrial combustion problems, through the specification of a target metric computed as the intersection of several Hessian matrices reconstructed from the main variables of the governing equations. Numerical results show that the approach is cost effective in that it can drastically improve the prediction of temperature and species distributions in the flame region of a combustor while reducing computational cost. The results can be used as a basis for pollutant prediction models. Copyright © 2011 John Wiley & Sons, Ltd.     

三角模糊数互补判断矩阵的一种排序方法

给出三角模糊数互补判断矩阵的概念及三角模糊数相互比较的可能度公式 ,提出一种基于可能度的三角模糊数互补判断矩阵排序方法 ,通过算例说明该方法的可行性和有效性。     

On the adjacencies of triangular meshes based on skeleton-regular partitions

For any 2D triangulation τ, the 1-skeleton mesh of τ is the wireframe mesh defined by the edges of τ, while that for any 3D triangulation τ, the 1-skeleton and the 2-skeleton meshes, respectively, correspond to the wireframe mesh formed by the edges of τ and the “surface” mesh defined by the triangular faces of τ. A skeleton-regular partition of a triangle or a tetrahedra, is a partition that globally applied over each element of a conforming mesh (where the intersection of adjacent elements is a vertex or a common face, or a common edge) produce both a refined conforming mesh and refined and conforming skeleton meshes. Such a partition divides all the edges (and all the faces) of an individual element in the same number of edges (faces). We prove that sequences of meshes constructed by applying a skeleton-regular partition over each element of the preceding mesh have an associated set of difference equations which relate the number of elements, faces, edges and vertices of the nth and (n−1)th meshes. By using these constitutive difference equations we prove that asymptotically the average number of adjacencies over these meshes (number of triangles by node and number of tetrahedra by vertex) is constant when n goes to infinity. We relate these results with the non-degeneracy properties of longest-edge based partitions in 2D and include empirical results which support the conjecture that analogous results hold in 3D.     

Triangular finite elements of HCT type and classC ρ

Let τ be some triangulation of a planar polygonal domain Ω. Given a smooth functionu, we construct piecewise polynomial functionsv∈C ^ρ(Ω) of degreen=3 ρ for ρ odd, andn=3ρ+1 for ρ even on a subtriangulation τ₃ of τ. The latter is obtained by subdividing eachT∈ρ into three triangles, andv/T is a composite triangular finite element, generalizing the classicalC ¹ cubic Hsieh-Clough-Tocher (HCT) triangular scheme. The functionv interpolates the derivatives ofu up to order ρ at the vertices of τ. Polynomial degrees obtained in this way are minimal in the family of interpolation schemes based on finite elements of this type.     

Domain decomposition preconditioners of Neumann-Neumann type for hp-approximations on boundary layer meshes in three dimensions

We develop and analyse Neumann–Neumann methods for hpfinite-element approximations of scalar elliptic problems ongeometrically refined boundary layer meshes in three dimensions.These are meshes that are highly anisotropic where the aspectratio typically grows exponentially with the polynomial degree.The condition number of our preconditioners is shown to be independentof the aspect ratio of the mesh and of potentially large jumpsof the coefficients. In addition, it only grows polylogarithmicallywith the polynomial degree, as in the case of p approximationson shape-regular meshes. This work generalizes our previousone on two-dimensional problems in Toselli & Vasseur (2003a,submitted to Numerische Mathematik, 2003c to appear in Comput.Methods Appl. Mech. Engng.) and the estimates derived here canbe employed to prove condition number bounds for certain typesof FETI methods.     

Locking-free DGFEM for elasticity problems in polygons

The h-version of the discontinuous Galerkin finite element method(h-DGFEM) for nearly incompressible linear elasticity problemsin polygons is analysed. It is proved that the scheme is robust(locking-free) with respect to volume locking, even in the absenceof H²-regularity of the solution. Furthermore, it is shown thatan appropriate choice of the finite element meshes leads torobust and optimal algebraic convergence rates of the DGFEMeven if the exact solutions do not belong to H².     

Superconvergence of a Nonconforming Finite Element Approximation to Viscoelasticity Type Equations on Anisotropic Meshes

The main aim of this paper is to study the approximation to viscoelasticity type equations with a Crouzeix-Raviart type nonconforming finite element on the anisotropic meshes. The superclose property of the exact solution and the optimal error estimate of its derivative with respect to time are derived by using some novel techniques. Moreover, employing a postprocessing technique, the global superconvergence property for the discretization error of the postprocessed discrete solution to the solution itself is studied.