Lagrange插值和Hermite-Fejér插值在Wiener空间下的平均误差

在Lq-范数逼近的意义下，确定了基于Chebyshev多项式零点的Lagrange插值多项式列和Hermite-Fejér插值多项式列在Wiener空间下的p-平均误差的弱渐近阶．从我们的结果可以看出，当2≤q〈∞，1≤p〈∞时，基于第一类Chebyshev多项式零点的Lagrange插值多项式列和Hermite—Fejér插值多项式列的p-平均误差弱等价于相应的最佳逼近多项式列的p-平均误差．在信息基计算复杂性的意义下，如果可允许信息泛函为计算函数在固定点的值，那么当1≤p，q〈∞时，基于第一类Chebyshev多项式零点的Lagrange插值多项式列和Hermite-Fejér插值多项式列在Wiener空间下的p-平均误差弱等价于相应的最小非自适应p-平均信息半径．     

插值多项式在一重积分Wiener空间下的同时逼近平均误差

本文在加权L_p范数逼近意义下确定了基于第一类Chebyshev 结点组的Lagrange 插值多项式列在一重积分Wiener 空间下同时逼近平均误差的渐近阶. 结果显示在L_p范数逼近意义下Lagrange 插值多项式列的平均误差弱等价于相应的最佳逼近多项式列的平均误差. 同时, 当2≤p≤4 时,Lagrange 插值多项式列导数逼近的平均误差弱等价于相应的导数最佳逼近多项式列的平均误差. 作为对比, 本文也确定了相应的Hermite-Fejér 插值多项式列在一重积分Wiener空间下逼近的平均误差的渐近阶.     

Lagrange插值在—重积分Wiener空间下的同时逼近平均误差

在加权L_p范数逼近意义下,确定了基于扩充的第二类Chebyshev结点组的Lagrange插值多项式列,在一重积分Wiener空间下同时逼近平均误差的渐近阶.结果显示,在L_p范数逼近意义下,Lagrange插值多项式列逼近函数及其导数的平均误差都弱等价于相应的最佳逼近多项式列的平均误差.同时,在信息基复杂性的意义下,若可允许信息泛函为标准信息,则上述插值算子列逼近函数及其导数的平均误差均弱等价于相应的最小非自适应信息半径.     

拟Hermite插值在一重积分Wiener空间下的平均误差

本文在L_p范数逼近意义下确定了一种拟Hermite插值多项式列在一重积分Wiener空间下平均误差的弱渐近阶.结果显示在信息基复杂性的意义下,若可允许信息泛函为Hermite数据,则这种插值多项式列的平均误差弱等价于相应的最小非自适应信息半径.     

Grnwald插值算子在Wiener空间下的平均误差

得到了以第二类Chebyshev多项式的零点为插值结点组的Grnwald插值多项式在Wiener空间下平均误差的一个估计.     

Gr(ü)nwald插值算子在Wiener空间下的平均误差

得到了以第二类Chebyshev多项式的零点为插值结点组的Gr(ü)nwald插值多项式在Wiener空间下平均误差的一个估计.     

拟Hermite-Fejr插值在一重积分Wiener空间下的平均误差

本文主要在Lp范数逼近意义下确定一类拟Hermite-Fejr插值多项式列在一重积分Wiener空间下平均误差的弱渐近阶.结果说明若概率空间不同,插值算子列在平均误差的意义下可能具有完全不同的逼近性质.在某些特殊情形下得到了其值或强渐近阶.     

关于HERMITE-FEJER型插值算子逼近度的某些问题

本文讨论 Hermite-Fejér 型插值算子逼近光滑函数的逼近特征.[1]得到当第一类多项式的零点取作插值节点时,Hermite-Fejér 算子的逼近度不会比1/n 更好.本文则得到,当 Jacobi 多项式 J_n~(d.d)(x)(α>-1)的零点取作插值节点时,既使任意提高函数的光滑程度,Hermite-Fejér 算子的逼近度也不会比 1/n 更好.     

Hermite-Fejér插值在一重积分Wiener空间下的平均误差

本文在L_p-范数逼近意义下确定了一种Hermite-FIeér插值多项式列在一重积分Wiener空间下平均误差的弱渐近阶.结果显示在信息基复杂性的意义下,若可允许信息泛函为Hermite数据,则这种插值多项式列的平均误差在阶的意义下不是次最优的.     

几类Kantorovich型插值算子在Orlicz空间内的逼近

分别讨论了以第二类Chebyshev多项式的零点、Jacobi多项式的零点、第一类Chebyshev多项式的零点为插值结点组的五类Kantorovich型插值算子在Orlicz空间内的逼近问题,得到了逼近阶的上界估计.     

The average errors for Hermite-Fejr interpolation on the Wiener space

For 1≤ p ∞, firstly we prove that for an arbitrary set of distinct nodes in [-1, 1], it is impossible that the errors of the Hermite-Fejr interpolation approximation in L p -norm are weakly equivalent to the corresponding errors of the best polynomial approximation for all continuous functions on [-1, 1]. Secondly, on the ground of probability theory, we discuss the p-average errors of Hermite-Fejr interpolation sequence based on the extended Chebyshev nodes of the second kind on the Wiener space. By our results we know that for 1≤ p ∞ and 2≤ q ∞, the p-average errors of Hermite-Fejr interpolation approximation sequence based on the extended Chebyshev nodes of the second kind are weakly equivalent to the p-average errors of the corresponding best polynomial approximation sequence for L q -norm approximation. In comparison with these results, we discuss the p-average errors of Hermite-Fejr interpolation approximation sequence based on the Chebyshev nodes of the second kind and the p-average errors of the well-known Bernstein polynomial approximation sequence on the Wiener space.     

The Average Errors for Hermite Interpolation on the 1-Fold Integrated Wiener Space

For the weighted approximation in Lp-norm,the authors determine the weakly asymptotic order for the p-average errors of the sequence of Hermite interpolation based on the Chebyshev nodes on the 1-fold integrated Wiener space.By this result,it is known that in the sense of information-based complexity,if permissible information functionals are Hermite data,then the p-average errors of this sequence are weakly equivalent to those of the corresponding sequence of the minimal p-average radius of nonadaptive information.     

GLOBAL SMOOTHNESS PRESERVATION BY BIVARIATE INTERPOLATION OPERATORS

1　IntroductionIn the case when Pn(f,x) represents the univariate interpolation polynomial of Her-mite-Fejér based on Chebyshev nodesof the firstkind or the univariate interpolation polyno-mials of Lagrange based on Chebyshev nodes of the second kind and± 1 ,or the univariaterational Shepard operators,the following result of partial preservation of global smoothnessis proved in[4] :If f∈Lip M(α;[-1 ,1 ] ) ,0 <α≤ 1 ,then there existsβ=β(α) <α and M′>such thatω(Pn(f ) ;h)≤ M′h…     

The average errors for lagrange interpolation on the Wiener space

For the weighted approximation in L _p -norm, we determine the asymptotic order for the paverage errors of Lagrange interpolation sequence based on the Chebyshev nodes on the Wiener space. We also determine its value in some special case.     

The pointwise complete asymptotic expansion for the approximation of Lipschitz functions by Hermite-Fejer interpolation polynomials

The pointwise complete asymptotic expansion is derived for the approximation of Lipschitz functions by Hermite-Fejér interpolation polynomials based on the Chebyshev polynomials of the first kind.     

On the approximation of the continuous functions by some Hermite-Fejer interpolation polynomials

The object of this note is to improve Some wellknown results, which are related with the approximation problems of the continuous functions by Hermite-Fejér interpolation which based on the zeros of Chebyshev polynomials of the first or second kind.     

A Modification of Lagrange Interpolation

A modification of Lagrange interpolation based on the zeros of the Chebyshev polynomial of the second kind is constructed, which interpolates at many ofgiven data. Thus, for this node-system the main result gives an affimative answer to a problem suggested by Bernstein in 1930. Moreover, our modification has a Timan-Gopengauz type approximation rate.     

连续可导函数类的最优拉格朗日插值

在构造拉格朗日插值算法时,插值结点的选择是十分重要的.给定一个足够光滑的函数,如果结点选择的不好,当插值结点个数趋于无穷时,插值函数不收敛于函数本身.例如龙格现象:对于龙格函数f(x)=1/1+25x^2,如果拉格朗日插值的结点取[-1,1]上的等距结点,那么逼近的误差会随着结点个数增多而趋于无穷大⑴,由此可知插值结点的选择尤为重要.