SUPERCONVERGENCE ANALYSIS OF THE POLYNOMIAL PRESERVING RECOVERY FOR ELLIPTIC PROBLEMS WITH ROBIN BOUNDARY CONDITIONS

We analyze the superconvergence property of the linear finite element method based on the polynomial preserving recovery(PPR)for Robin boundary elliptic problems on triangulartions.First,we improve the convergence rate between the finite element solution and the linear interpolation under the H1-norm by introducing a class of meshes satisfying the Condition(α,σ,μ).Then we prove the superconvergence of the recovered gradients post-processed by PPR and define an asymptotically exact a posteriori error estimator.Finally,numerical tests are provided to verify the theoretical findings.     

Research on application of polynomial fitting technique in rotary kiln infrared temperature measurement system

Aiming at the linear temperature compensation algorithm’s disadvantage of temperature measurement error in rotary kiln infrared scanning temperature measurement process, this paper proposes a precise nonlinear cubic polynomial fitting temperature compensation algorithm. The proposed algorithm compensates the temperature values of scanning points on rotary kiln surface by following steps: Calculating temperature difference between the real temperature value of rotary kiln and temperature value measured by infrared scanning temperature measurement system; Fitting the temperature difference data with cubic polynomial; Using the obtained function to compensate temperature. Experimental result shows that compared with the usual linear temperature compensation algorithm, the accuracy of proposed algorithm has raised about 2.25 times when cubic polynomial is used.     

On Growth of Polynomials with Restricted Zeros

Let P(z) be a polynomial of degree n which does not vanish in |z| k, k ≥ 1.It is known that for each 0 ≤ s n and 1 ≤ R ≤ k,M (P~(s), R )≤( 1/(R~s+ k~s))[{d~((s)/dx(s))(1+x~n)}_(x=1)]((R+k)/(1+k))~nM(P,1).In this paper, we obtain certain extensions and refinements of this inequality by involving binomial coefficients and some of the coefficients of the polynomial P(z).     

A construction of real weight functions for certain orthogonal polynomials in two variables

H.L. Krall and I.M. Sheffer considered the problem of classifying certain second-order partial differential equations having an algebraically complete, weak orthogonal bivariate polynomial system of solutions. Two of the equations that they considered are

(x²+y)uxx+2xyuxy+y²uyy+gxux+g(y−1)uy=λu,     

THE EIGENVALUE PROBLEM EQUIVALENT TO MULTIVARIATE POLYNOMIAL SYSTEM

In this paper, the authors proved that finding all solutions of a given multivariate polynomial system is equivalent to solving a relative joint eigenvalue problem(Theorem 1) and in some cases one can find all solutions of the given system from the eigenvalues and vectors of one matrix or matrix pencil (Theorem 2). Especially the situation that the ideal generated by the given system is 0-dimensional is discussed.     

Many associated primes of powers of primes

We construct families of prime ideals in polynomial rings for which the number of associated primes of the second power (or higher powers) is exponential in the number of variables in the ring.     

多元整系数多项式因式分解的一种理论和算法

本文将ｔ（ｔ是大于２的整数）元整系数多项式看成为系数为ｔ－２元整系数多项式的二元多项式，建立了多元整系数多项式因式分解的一种新理论，进而得到了分解多元整系数多项式的一个有力的算法。     

A note on the computational complexity of graph vertex partition

A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.     

On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming

This paper investigates the capabilities of several non-quadratic polynomial yield functions to model the plastic anisotropy of orthotropic sheet metal (plane stress). Fourth, sixth and eighth-order homogeneous polynomials are considered. For the computation of the coefficients of the fourth-order polynomial an improved set of analytic formulas is proposed. For sixth and eighth-order polynomials the identification uses optimization. Simple constraints on the optimization process are shown to lead to real-valued convex functions. A general method to extend the above plane stress criteria to full 3D stress states is also suggested. Besides their simplicity in formulation, it is found that polynomial yield functions are capable to model a wide range of anisotropic plastic properties (e.g., the Numisheet’93 mild steel, AA2008-T4, AA2090-T3). The yield functions have then been implemented into a commercial finite element code as constitutive subroutines. The deep drawing of square (Numisheet’93) and cylindrical (AA2090-T3) cups have been simulated. In both cases excellent agreement with experimental data is obtained. In particular, it is shown that non-quadratic polynomial yield functions can simulate cylindrical cups with six or eight ears. We close with a discussion on earing and further examples.     

On polynomial digraphs

Let Φ(x,y) be a bivariate polynomial with complex coefficients. The zeroes of Φ(x,y) are given a combinatorial structure by considering them as arcs of a directed graph G(Φ). This paper studies some relationship between the polynomial Φ(x,y) and the structure of G(Φ).