The Degree Of Polynomial Approximation And Interpolation Of Analytic Functions

The rate of best polynomial approximation of an analytic function on a compact Faber set K is characterized in terms of the rate of growth of its Faber coefficients and compared with the rate of approximation by the partial sums of the Faber series. Also the convergence of sequences of interpolating polynomials constructed for various systems of nodes is studied by considering the growth of the interpolated function. Under appropriate assumptions on K the approximation by interpolating polynomials can be incorporated in the characterization theorem. Emphasis is laid on high precision in describing the rate of approximation and on admitting a large class of functions.     

Nonexistence of Isochronous Centers in Planar Polynomial Hamiltonian Systems of Degree Four

In this paper we study centers of planar polynomial Hamiltonian systems and we are interested in the isochronous ones. We prove that every center of a polynomial Hamiltonian system of degree four (that is, with its homogeneous part of degree four not identically zero) is nonisochronous. The proof uses the geometric properties of the period annulus and it requires the study of the Hamiltonian systems associated to a Hamiltonian function of the form H(x, y)=A(x)+B(x) y+C(x) y²+D(x) y³.     

奇次Legendre多项式零点上的(0,1,3)插值的正则性

主要讨论了奇次Legendre多项式零点上的(0,1,3)插值的正则性,得出它是奇异的,但当对插值的条件作适当的改变后也得到正则的结论.     

新组合型的三角插值多项式

将被插函数进行组合平均,构造一个新组合型的三角插值多项式Cn(f;t,x),使得它在全轴上一致收敛到每个以2π为周期的连续函数,且对Cj2π连续函数类的逼近阶达到最佳,这里0jt,t为任给的奇自然数.     

多项式插值与Rolle定理

本文利用多项式插值 ,对微分学和积分学中的一些典型题目 ,给出了统一的处理方法 .这种方法易于模仿 ,有一定的适用性 .     

Polynomial Interpolation of the Discrete Logarithm

Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field by polynomials modulo p and modulo p-1, respectively. In this paper most of these results are extended to arbitrary .     

一类含三角形图的伴随多项式的根

We denote h(G,x) as the adjoint polynomial of graph G. In [5], Ma obtained the interpolation properties of the roots of adjoint polynomial of graphs containing triangles. By the properties, we prove the non-zero root of adjoint polynomial of Dn and Fn are single multiple.     

The General Problem of Polynomial Spline Interpolation

We study the general problem of interpolation by polynomial splines and consider the construction of such splines using the coefficients of expansion of a certain derivative in B-splines. We analyze the properties of the obtained systems of equations and estimate the interpolation error.     

一类插值多项式的导数逼近(英文)

本文给出了以雅可比多项式的零点作为插值节点的一类插值多项式 Bn( f ;x)的导数逼近具有一阶连续导数的函数的收敛阶 .并且指出 limn→∞ Bn′( f;-1 )≠f′( -1 ) .     

以线性代数观点看常用多项式插值方法

数学各分支之间存在很多共同的思想和方法.本文结合线性代数中关于线性空间的相关理论及观点来看数值分析中常用的多项式插值方法.一方面借助线性空间的基与坐标理论将常用多项式插值方法统一起来,并借助过渡矩阵给出了不同插值方法之间的通用转换公式.另一方面还可以通过构造特殊基函数组来产生新的多项式插值方法.     

Lines Tangent to Four Triangles in Three-Dimensional Space

We investigate the lines tangent to four triangles in R³. By a construction, there can be as many as 62 tangents. We show that there are at most 162 connected components of tangents, and at most 156 if the triangles are disjoint. In addition, if the triangles are in (algebraic) general position, then the number of tangents is finite and it is always even.     

Degree of Simultaneous Coconvex Polynomial Approximation

$ {\rm Let}\ f\ \epsilon\ {C^{1}}[-1,1] $ change its convexity finitely many times in the interval, say s times, at ${\rm at}\ {Y_{s}}\:\ -1\ <\ y_{s}\ <\ \dots\ < y_{1}\ < 1 $ . We estimate the degree of simultaneous approximation of ? and its derivative by polynomials of degree n, which change convexity exactly at the points Y _s, and their derivatives. We show that provided n is sufficiently large, depending on the location of the points Y _s, the rate of approximation can be estimated by C(s)/n times the second Ditzian-Totik modulus of smoothness of ?′. This should be compared to a recent paper by the authors together with I. A. Shevchuk where ? is merely assumed to be continuous and estimates of coconvex approximation are given by means of the third Ditzian-Totik modulus of smoothness. However, no simultaneous approximation is given there.     

Polynomial functions and the Riesz Interpolation Property

Building on a proof by D. Handelman of a generalisation of an example due to L. Fuchs, we show that the space of real-valued polynomials on a non-empty set X$X$ of reals has the Riesz Interpolation Property if and only if X$X$ is bounded.     

Transfinite Diameter with Generalized Polynomial Degree

Potential Analysis - We prove a Chebyshev transform formula for a notion of (weighted) transfinite diameter that is defined using a generalized notion of polynomial degree. We also generalize Leja...     

Bivariate Polynomial Natural Spline Interpolation to Scattered Data

By means of the theory of spline interpolation in Hilbert spaces, the bivariate polynomial natural spline interpolation to scattered data is constructed. The method can easily be carried out on a computer, and parallelly generalized to high dimensional cases as well. The results can be used for numerical integration in higher dimensions and numerical solution of partial differential equations, and so on.     

Application of Polynomial Interpolation in the Chinese Remainder Problem

This paper presents an application of polynomial interpolation in the solution of the Chinese Remainder Problem for bother integers and polynomials.     

函数逼近中的Newton和Lagrange插值多项式

讨论了Newton及Lagrange插值多项式在函数逼近中的联系和区别.     

Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three

. Our main result is as follows: For any integer , if G is a claw-free graph of order at least and with minimum degree at least 3, then G contains k vertex-disjoint triangles unless G is of order and G belongs to a known class of graphs. We also construct a claw-free graph with minimum degree 3 on n vertices for each such that it does not contain k vertex-disjoint triangles. We put forward a conjecture on vertex-disjoint triangles in -free graphs. Received: November 21, 1996/Revised: Revised February 19, 1998