Thep-Version of the Finite Element Method

Abstract

In the p-version of the finite element method, the triangulation is fixed and the degree p, of the piecewise polynomial approximation, is progressively increased until some desired level of precision is reached.In this paper, we first establish the basic approximation properties of some spaces of piecewise polynomials defined on a finite element triangulation. These properties lead to an a priori estimate of the asymptotic rate of convergence of the p-version. The estimate shows that the p-version gives results which are not worse than those obtained by the conventional finite element method (called the h-version, in which h represents the maximum diameter of the elements), when quasi-uniform triangulations are employed and the basis for comparison is the number of degrees of freedom. Furthermore, in the case of a singularity problem, we show (under conditions which are usually satisfied in practice) that the rate of convergence of the p-version is twice that of the h-version with quasi-uniform mesh. Inverse approximation theorems which determine the smoothness of a function based on the rate at which it is approximated by piecewise polynomials over a fixed triangulation are proved for both singular and nonsingular problems.We present numerical examples which illustrate the effectiveness of the p-version for a simple one-dimensional problem and for two problems in two-dimensional elasticity. We also discuss roundott error and computational costs associated with the p-version. Finally, we describe some important features, such as hierarchic basis functions, which have been utilized in COMET-X, an experimental computer implementation of the p-version.

Bounds for decoupled design and analysis discretizations in topology optimization

“…While the proposed condition needs to be satisfied at element level as well as system level, a possibility exists to increase the density resolution inside the element. One could choose to use higher order shape functions which introduce extra DOFs providing more flexibility for the state field representation [17,18]. However, this only shifts the upper bound on the order of density representation and going beyond this new threshold will bring back the issues of non-uniqueness.…”

A distortion measure to validate and generate curved high‐order meshes on CAD surfaces with independence of parameterization

“…One of the main features that attracted this attention is the ability of unstructured high-order methods to converge exponentially with the order of the approximating polynomial when the exact solution of the PDE is smooth and without singularities [1,6]. Accordingly, it has been possible to show that high-order methods provide higher accuracy with lower computational cost than low-order methods in a wide range of applications [7,8,9,10,11,12,13,14,15,16].…”

Computational error estimates and adaptive processes for some nonlinear structural problems

“…High order elements are used frequently, for instance, in the P-version of the finite element method, (see eq. [14], [15], [41]). …”