Mean Convergence of Lagrange Type Interpolation on an Arbitrary System of Nodes

Abstract Sufficient conditions of convergence and rate of convergence for Lagrange type interpolation in theWeighted L~p norm on an arbitrary system of nodes are given.     

Mean Convergence of Extended Lagrange Interpolation with Freud Weights

Let W := exp(-Q), where Q is of smooth polynomial growth at , for example Q(x) = |x|, > 1. We call W² a Freud weight. The mean convergence of Lagrange interpolation at the zeros of the orthonormal polynomials associated with the Freud weight WW² has been studied by several authors, as has the Lebesgue function of Lagrange interpolation. J. Szabados had the idea to add two additional points of interpolation, thereby reducing the Lebesgue constant to grow no faster than log n. In this paper, we show that mean convergence of Lagrange interpolation at this extended set of nodes displays a similar advantage over merely using the zeros of the orthogonal polynomials.     

Weighted Convergence of Lagrange Interpolation Based on Gauss-Kronrod Nodes

The Gauss-Kronrod quadrature scheme, which is based on the zeros of Legendrepolynomials and Stieltjes polynomials, is a standard rule for automaticnumerical integration in mathematical software libraries. For a long time,very little was known about the underlying Lagrange interpolationprocesses. Recently, the authors proved new bounds and asymptoticproperties for the Stieltjes polynomials and, subsequently, appliedthese results to investigate the associated interpolation processes. Thepurpose of this paper is to survey the quality of these interpolationprocesses, with additional results that extend and complete the existingones. The principal new results in this paper are necessary and sufficientconditions for weighted convergence. In particular, we show that theLagrange interpolation polynomials associated with the above interpolationprocesses have the same speed of convergence as the polynomials of bestapproximation in certain weighted Besov spaces.     

基于LAGRANGE插值的高阶微分中值定理

本文基于LAGRANGE插值，将微积分中非常重要的中值定理推广到了高阶的情形。     

基于Chebyshev多项式零点的Lagrange插值多项式逼近的注记

本文通过一个例子说明了文献[3]中定理6.9的不完善之处,并建立了:若f∈C^r_[-1,1],则     

Mean Convergence of Lagrnage Type Interpolation on an Arbitrary System of Nodes

Abstract   Sufficient conditions of convergence and rate of convergence for Lagrange type interpolation in the weighted L ^p norm on an arbitrary system of nodes are given. Supported by the National Natural Sciences Foundation of China (No.19671082)     

Convergence of Lagrange Interpolation Polynomials for Piecewise Smooth Functions

The present paper first establishes a decomposition result for f(x)∈ C ^r C ^r+1. By using this decomposition we thus can obtain an estimate of ∣f(x) - L _n (f,x)∣ which reflects the influence of the position of the x's and ω(f ^(r+1),δ)_j, j = 0,1,...,s, on the error of approximation. This revised version was published online in June 2006 with corrections to the Cover Date.     

扩充的Hermite-Fejér插值算子平均收敛性

讨论了以Ｊａｃｏｂｉ正交多项式零点为插值结点的扩充Ｈｅｒｍｉｔｅ－Ｆｅｊｅｒ插值算子在Ｌｐｕ空间的平均收敛性。首先给出了算子加权平均收敛的条件,进一步得到了收敛阶。     

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.     

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

在L_q-范数逼近的意义下,确定了基于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-平均信息半径.     

A New Third S.N.Bernstein Interpolation Polynomial

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＷｅｋｎｏｗｎｔｈａｔｉｓｎｏｔｐｏｓｓｉｂｌｅｔｈａｔｔｈｅＬａｇｒａｎｇｅｉｎｔｅｒｐｏｌａｔｉｏｎｐｏｌｙｎｏｍｉａｌｓｃｏｎｖｅｒｇｅｕｎｉ－ｆｏｒｍｌｙｔｏｆ（ｘ）ｆｏｒａｌｌｃｏｎｔｉｎｕｏｕｓｆｕｎｃｔｉｏｎｓｆ（ｘ）ｏｎ［－１，１］．Ａｓａｒｅｓｕｌｔ，ｏｎｅｃａｎｕｓｅｖａｒｉｏｕｓｗａｙｓｔｏｃｈａｎｇｅｔｈｅＬａｇｒａｎｇｅｉｎｔｅｒｐｏｌａｔｉｏｎｐｏｌｙｎｏｍｉａｌｓｕｃｈｔｈａｔｔｈｅｙｕｎｉｆｏｒｍｌｙｃｏｎｖｅｒｇｅｔｏａｌｌｃｏｎ…     

Convergence of Gaussian Quadrature and Lagrange Interpolation in Haar Systems

Consider a Markov system of functions whose linear span is dense with respect to the uniform norm in the space of the continuous functions on a finite interval. Gaussian rules are those which correctly integrate as many successive basis functions as possible with the lesser number of nodes. In this paper we provide a simple proof of the fact that such rules converge for all bounded Riemann-Stieltjes integrable functions. The proposed proof is also valid for any sequence of quadrature rules with positive coefficients which converge for the basis functions. Taking the nodes of the Gaussian rules as nodes for Lagrange interpolation, we give a sufficient condition for the convergence in L ₂-norm of such processes for bounded Riemann-Stieltjes integrable functions.     

多元分次Lagrange插值

对多元多项式分次插值适定结点组的构造理论进行了深入的研究与探讨.在沿无重复分量代数曲线进行Lagrange插值的基础上,给出了沿无重复分量分次代数曲线进行分次Lagrane插值的方法,并利用这一结果进一步给出了在R~2上构造分次Lagrange插值适定结点组的基本方法.另外,利用弱Gr(o|¨)bner基这一新的数学概念,以及构造平面代数曲线上插值适定结点组的理论,进一步给出了构造平面分次代数曲线上分次插值适定结点组的方法,从而基本上弄清了多元分次Lagrange插值适定结点组的几何结构和基本特征.     

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-平均信息半径．     

A Criterion for the Uniform Convergence of the Lagrange-Jacobi Interpolation Process

We obtain a uniform and sufficient condition for the convergence of the Lagrange interpolation process with Jacobi nodes on a closed interval [a, b] ? (?1, 1). The condition is stated in terms of the second differences of the interpolated function and uses its values only at the interpolation nodes. Some well-known criteria for uniform convergence are obtained as a consequence of our result.     

给定极点的有理函数插值序列的收敛性

设Γ∈Ｃ（１，α），α＞０．Ｇ是复平面上以Γ为边界的有界单连通区域．本文考虑了极点位于G外部，以广义Ｆａｂｅｒ-Ｄzｒｂａsｊａｎ有理函数的零点为插值结点的Ｌａｇｒａｎｇｅ插值有理函数序列对Ａ（G）和Ｅ^ｑ（Ｇ）（１＜ｑ＜＋∞）中函数的一致逼近和平均逼近阶的估计．     

Vandermonde行列式对Lagrange插值公式的应用

给出了广义Vandermonde行列式的一种求法,并运用它给出了Lagrange插值公式的几个证明.     

Mean Convergence of Derivatives of Extended Lagrange Interpolation with Additional Nodes

Weighted L^p convergence of derivatives of extended Lagrange interpolation at the union of zeros of generalized Jacobi polynomials and some additional points is investigated.     

扩充的Hermite—Fejer插值算子平均收敛性

讨论了以Ｊａｃｏｂｉ正交多项式零点为插值结点的扩充Ｈｅｒｍｉｔｅ－Ｆｅｊｅｒ插值算子在Ｌｕ＾ｐ空间的平均收敛性。首先给出了算子加权平均收敛的条件,进一步得到了收敛阶。     

On summability of weighted Lagrange interpolation. I

The paper is devoted to the study of summability of weighted Lagrange interpolation on the roots of orthogonal polynomials with respect to a weight function w. Starting from the Lagrange interpolation polynomials we shall construct a wide class of discrete processes (using summations) which are uniformly convergent in a suitable Banach space (C,·) of continuous functions (w denotes a weight). We shall give such conditions with respect to w, , (C,·) and to summation methods for which the uniform convergence holds. Error estimates for the approximation will also be considered.