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.

No abstract

No abstract

No abstract

Abstract. In this paper, we present a theory for bounding the minimum eigenvalues, maximum eigenvalues, and condition numbers of stiffness matrices arising from the p-version of finite element analysis. Bounds are derived for the eigenvalues and the condition numbers, which are valid for stiffness matrices based on a set of general basis functions that can be used in the p-version. For a set of hierarchical basis functions satisfying the usual local support condition that has been popularly used in the p-version, explicit bounds are derived for the minimum eigenvalues, maximum eigenvalues, and condition numbers of stiffness matrices. We prove that the condition numbers of the stiffness matrices grow like p 4(d−1) , where d is the number of dimensions. Our results disprove a conjecture of Olsen and Douglas in which the authors assert that "regardless of the choice of basis, the condition numbers grow like p 4d or faster". Numerical results are also presented which verify that our theoretical bounds are correct.

No abstract

Abstract. Solutions of the optimal control and H∞-control problems for nonlinear affine systems can be found by solving Hamilton-Jacobi equations. However, these first order nonlinear partial differential equations can, in general, not be solved analytically. This paper studies the rate of convergence of an iterative algorithm which solves these equations numerically for points near the origin. It is shown that the procedure converges to the stabilizing solution exponentially with respect to the iteration variable. Illustrative examples are presented which confirm the theoretical rate of convergence.

No abstract