二元多项式函数的一个定理及其应用

本文研究了二元多项式函数的插值问题.利用二元函数Langrange插值理论得到了一组关于二元多项式函数的等式,推广了一元多项式函数差商的相关结果.     

多项式平滑的误差分析及带模型噪声下的多项式平滑

本文对二阶多项式平滑中引进的模型误差进行误差分析,给出允许记忆长度的估计公式,当平滑记忆长度大于允许值,从而必须考虑模型误差的影响时,常用的多项式平滑不再是线性最小方差估计,此时应采用带模型噪声下的多项式平滑,它将给出这种情形下的线性最小方差估计,本文后半段介绍这一平滑方法,并给出模拟计算结果以作比较。     

关于Hermite插值的注记

设 H_n(x)是在节点 x_0,x_1,…,x_n 上插值 f(x)的 n 次 Hermite 插值多项式.最近[1]用函数 f 的差商给出了 H_n(x) 的表达式.这里指出:这一表达式实际已有 (例如参见[2]),函数 f 的 n 次 Hermite 插值多项式 H_n(x) 及其余项可用 f 的差商简单地表示为     

关于差商和Newton插值公式教学的一些体会

针对讲授Newton插值多项式之前,如何自然地引入差商概念,介绍了一些心得体会;同时对Newton插值公式给出了一种简便、学生易于理解的证明方法.     

从微积分的观点看高阶等差数列的求和

通过差分算子给出了高阶等差数列的定义,并以朱世杰恒等式和朱世杰招差公式为工具解决了高阶等差数列的求和,强调了这一问题与普通的无限微积分中Newton-Leibniz公式求定积分这个标准问题之间的类似.此外,应用朱世杰招差公式给出了整数值多项式的经典刻划.     

带有多项式非线性项的高维反应扩散方程有限差分格式的长时间行为

本文考虑了一类带有多项式非线性项的高维反应扩散方程．建立了一个全离散的有限差分格式,并证明了差分解的存在唯一性．分析了由差分格式生成的离散系统的动力性质,在对差分解先验估计的基础上得到了离散动力系统的整体吸引子的存在性．最后证明了差分格式的长时间稳定性和收敛性．     

平方差公式的应用

<正>平方差公式是多项式乘法运算中一个重要的公式,这个公式的特征是公式的一边为两个数的和与差的积,另一边为两个数的平方差.公式中的a、b可以是数,也可以是代数式,有些式子表面上看不能用公式,但通过适当变形就能用公式.可见,平方差公式的应用是很灵活的.因此,同学们要准确把握它的结构特征,大胆地去应用它.一、平方差公式在多项式计算中的应用在多项式计算中,我们遇到的式子往往不是平方差公式的形式,不能够直接应用平方差     

一类广义Gauss型求积公式

基于被积函数在n次第一类和第二类Chebyshev多项式的零点处的差商,该本构造了两种Gauss型求积公式. 这些求积公式包含了某些已知结果作为特例.更重要的是这些新结果与Gauss-Turan求积公式有密切的联系.     

条状功能梯度材料中偏心裂纹对反平面简谐波的散射问题

利用Schmidt方法研究了条状功能梯度材料中偏心裂纹对反平面简谐波的散射问题,裂纹垂直于条状功能梯度材料的边界．通过Fourier变换,问题可以转换为对一对未知变量是裂纹表面位移差的对偶积分方程求解．为了求解对偶积分方程,把裂纹表面的位移差展开为Jacobi多项式级数形式,进而得到了功能梯度参数、裂纹位置以及入射波频率对应力强度因子影响的规律．     

渐近于Hermite多项式的双正交系统

本文利用渐近于Gauss函数的函数类?,给出渐近于Hermite正交多项式的一类Appell多项式的构造方法,使得该序列与?的n阶导数之间构成了一组双正交系统.利用此结果,本文得到多种正交多项式和组合多项式的渐近性质.特别地,由N阶B样条所生成的Appell多项式序列恰为N阶Bernoulli多项式.从而,Bernoulli多项式与B样条的导函数之间构成了一组双正交系统,且标准化之后的Bernoulli多项式的渐近形式为Hermite多项式.由二项分布所生成的Appell序列为Euler多项式,从而,Euler多项式与二项分布的导函数之间构成一组双正交系统,且标准化之后的Euler多项式渐近于Hermite多项式.本文给出Appell序列的生成函数满足的尺度方程的充要条件,给出渐近于Hermite多项式的函数列的判定定理.应用该定理,验证广义Buchholz多项式、广义Laguerre多项式和广义Ultraspherical(Gegenbauer)多项式渐近于Hermite多项式的性质,从而验证超几何多项式的Askey格式的成立.     

Interpolation and Combinatorial Functions

Using some basic results about polynomial interpolation, divided differences, and Newton polynomial sequences we develop a theory of generalized binomial coefficients that permits the unified study of the usual binomial coefficients, the Stirling numbers of the second kind, the q-Gaussian coefficients, and other combinatorial functions. We obtain a large number of combinatorial identities as special cases of general formulas. For example, Leibniz's rule for divided differences becomes a Chu-Vandermonde convolution formula for each particular family of generalized binomial coefficients.     

A newton form for trigonometric Hermite interpolation

Trigonometric divided differences are used to derive a trigonometric analog of the Newton form of the Hermite interpolation polynomial.     

Divided Differences and Linearly Recursive Sequences

We show that the theory of divided differences is a natural tool for the study of linearly recurrent sequences. The divided differences functional associated with a monic polynomial w on degree n + 1 yields a vector space isomorphism between the space of polynomials of degree at most equal to n and the space of linearly recurrent sequences f that satisfy the difference equation w(E)f=0 where E is the usual shift operator. Using such isomorphisms, we can translate problems about recurrent sequences into simple problems about polynomials. We present here a new approach to the theory of divided differences, using only generating functions and elementary linear algebra, which clarifies the connections of divided differences with rational functions, polynomial interpolation, residues, and partial fractions decompositions.     

On the divided differences of the remainder in polynomial interpolation

We present formulas for the divided differences of the remainder of the interpolation polynomial that include some recent interesting formulas as special cases.     

COMPUTATION OF VECTOR VALUED BLENDING RATIONAL INTERPOLANTS

As we know, Newton's interpolation polynomial is based on divided differences which can be calculated recursively by the divided-difference scheme while Thiele 's interpolating continued fractions are geared towards determining a rational function which can also be calculated recursively by so-called inverse differences. In this paper, both Newton's interpolation polynomial and Thiele's interpolating continued fractions are incorporated to yield a kind of bivariate vector valued blending rational interpolants by means of the Samelson inverse. Blending differences are introduced to calculate the blending rational interpolants recursively, algorithm and matrix-valued case are discussed and a numerical example is given to illustrate the efficiency of the algorithm.     

关于Newton—Thiele型二元有理插值的存在性问题

基于均差的牛顿插值多项式可以递归地实现对待插值函数的多项式逼近,而Thiele型插值连分式可以构造给定节点上的有理函数。将两者结合可以得到Newton-Thiele型二元有理插值（NTRI）算法,本文解决了NTRI算法的存在性问题,并有数值例子加以说明。     

Aitken–Neville sets, principal lattices and divided differences

In this paper we study multivariate polynomial interpolation on Aitken–Neville sets by relating them to generalized principal lattices. We express their associated divided differences in terms of spline integrals.     

Newton-Thiele's rational interpolants

It is well known that Newton's interpolation polynomial is based on divided differences which produce useful intermediate results and allow one to compute the polynomial recursively. Thiele's interpolating continued fraction is aimed at building a rational function which interpolates the given support points. It is interesting to notice that Newton's interpolation polynomials and Thiele's interpolating continued fractions can be incorporated in tensor‐product‐like manner to yield four kinds of bivariate interpolation schemes. Among them are classical bivariate Newton's interpolation polynomials which are purely linear interpolants, branched continued fractions which are purely nonlinear interpolants and have been studied by Chaffy, Cuyt and Verdonk, Kuchminska, Siemaszko and many other authors, and Thiele-Newton's bivariate interpolating continued fractions which are investigated in another paper by one of the authors. In this paper, emphasis is put on the study of Newton-Thiele's bivariate rational interpolants. By introducing so‐called blending differences which look partially like divided differences and partially like inverse differences, we give a recursive algorithm accompanied with a numerical example. Moreover, we bring out the error estimation and discuss the limiting case. This revised version was published online in June 2006 with corrections to the Cover Date.     

关于Gauss-Turán求积公式的注记

1.引言 设w(x)是区间[-1,1]上的权函数,N是自然数集,X1,…,Xn(n∈N)是对应于权函数w(x)的n次正交多项式的零点,则具有最高代数精度2n-1,其中Πn表示所有次数≤n的多项式空间. 1950年,Turan[1]将上述经典的Gauss求积公式予以推广,证明了,若