Approximation Constants in Equidistant Lagrange Interpolation

In this paper we present a new limit relation for the equidistant Lagrange interpolation polynomials to |x|, (0, 1] on the internal [–1, 1]. The result extends a well-known result of D. L. Berman and S. M. Losinskii. Furthermore, we briefly discuss on a possible connection of the limit relation to another prominent constant in best uniform polynomial approximation for |x| - the so-called Bernstein constant.     

On the Zero-Divergence of Equidistant Lagrange Interpolation

 In 1942, P. Szász published the surprising result that if a function f is of bounded variation on [−1, 1] and continuous at 0 then the sequence of the equidistant Lagrange interpolation polynomials converges at 0 to . In the present note we give a construction of a function continuous on [−1, 1] whose Lagrange polynomials diverge at 0. Moreover, we show that the rate of divergence attains almost the maximal possible rate. (Received 2 February 2000)     

On the Zero-Divergence of Equidistant Lagrange Interpolation

 In 1942, P. Szász published the surprising result that if a function f is of bounded variation on [−1, 1] and continuous at 0 then the sequence of the equidistant Lagrange interpolation polynomials converges at 0 to . In the present note we give a construction of a function continuous on [−1, 1] whose Lagrange polynomials diverge at 0. Moreover, we show that the rate of divergence attains almost the maximal possible rate.     

Best Approximation of Functions like |x| exp(−A|x|)

We determine the exact order of best approximation by polynomials and entire functions of exponential type of functions like?_λ, α(x)=|x|^λ exp(−A|x|^−α). In particular, it is shown thatE(?_λ, α, _n, L_p(−1, 1))∼n^{−(2λp+αp+2)/2p(1+α)}×exp(−(1+α⁻¹)(Aα)^1/(1+α) cos απ/2(1+α) n^α/(1+α)), whereE(?_λ, α, _n, L_p(−1, 1)) denotes best polynomial approximation of?_λ, αinL_p(−1, 1),λ∈,α∈(0, 2],A>0, 1?p?∞. The problem, concerning the exact order of decrease ofE(?_0, 2, _n, L_∞(−1, 1)), has been posed by S. N. Bernstein.     

On the Interpolation by Discrete Splines with Equidistant Nodes

In this paper we consider equidistant discrete splines S(j), j , which may grow as O(|j|^s) as |j|→∞. Such splines are relevant for the purposes of digital signal processing. We give the definition of the discrete B-splines and describe their properties. Discrete splines are defined as linear combinations of shifts of the B-splines. We present a solution to the problem of discrete spline cardinal interpolation of the sequences of power growth and prove that the solution is unique within the class of discrete splines of a given order.     

Norms on L of Periodic Interpolation Splines with Equidistant Nodes

We consider the set S _r,n of periodic (with period 1) splines of degree r with deficiency 1 whose nodes are at n equidistant points x_i=i / n. For n-tuples y = (y₀, ... , y_n-1), we take splines s _r,n (y, x) from S _r,n solving the interpolation problem

$$s_{r,n} (y,t_i ) = y_i,$$

where t _i = x _i if r is odd and t _i is the middle of the closed interval [x _i , x _i+1 ] if r is even. For the norms L _r,n ^* of the operator y → s _r,n (y, x) treated as an operator from l¹ to L¹ [0, 1] we establish the estimate

$$L_{r,n}^ * = \frac{4}{{\pi ^2 n}}log min(r,n) + O\left( {\frac{1}{n}} \right)$$

with an absolute constant in the remainder. We study the relationship between the norms L _r,n ^* and the norms of similar operators for nonperiodic splines.

     

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.     

ON THE ORDER OF APPROXIMATION FOR THE RATIONAL INTERPOLATION TO ｜x｜

The order of approximation for Newman-type rational interpolation to |x| is studied in this paper. For general set of nodes, the extremum of approximation error and the order of the best uniform approximation are estimated. The result illustrates the general quality of approximation in a different way. For the special case where the interpolation nodes are $x_i = \left( {\frac{i}{n}} \right)^r (i = 1,2, \cdots ,n;r > 0)$x_i = \left( {\frac{i}{n}} \right)^r (i = 1,2, \cdots ,n;r > 0) , it is proved that the exact order of approximation is O( \frac1n ),O( \frac1nlogn ) and O( \frac1n^r )O\left( {\frac{1}{n}} \right),O\left( {\frac{1}{{n\log n}}} \right) and O\left( {\frac{1}{{n^r }}} \right) , respectively, corresponding to 01.     

基于扰动结点的Lagrange插值算子逼近的 Steckin-Marchaud型不等式

建立了基于扰动超球Jacobi结点的Marcinkiewicz zygmund不等式并借助一种新的K泛函给出了基于扰动超球Jacobi结点的积分型Lagrange插值算子逼近的Steckin Marchaud型不等式.     

基于修正的第二类Chebyshev结点的Newman型有理插值函数对|x|的逼近

Recently Brutman and Passow considered Newman-type rational interpolation to ｜x｜ induced by arbitrary sets of symmetric nodes in [-1,1] and gave the general estimation of the approximation error.By their methods,one could establish the exact order of approximation for some special nodes.In the present note we consider the sets of interpolation nodes obtained by adjusting the Chebyshev roots of the second kind on the interval [0,1] and then extending this set to [-1,1] in a symmetric way.We show that in this case the exact order of approximation is O（ 1 n 2 ）.     

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.     

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.     

A Limit Function for Equidistant Fourier Interpolation

Denote by s_n the nth order Fourier polynomial of the odd function f of period 2π equal to 1 on ]0, π[. The Gibbs phenomenon is caused by the well-known fact that [formula] An analogous Gibbs phenomenon is caused by a similar limiting behaviour of s*_n, the nth order trigonometric polynomial interpolating f at jπ/n (1 ≤ j ≤ 2n).     

在等距节点处的反周期函数的(0,m1,m2,...,mp)三角插值

研究了以π为周期的反周期函数的Birkhoff三角插值,解决了在等距节点处的反周期函数的(0,m1,m2,…,mp)三角插值问题,得到了解存在的条件.     

Rs空间中的Lagrange插值

本文给出了构造空间π^s_n中Lagrange插值适定结点组的添加超平面法以及构造沿无重复分量代数超曲面插值适定结点组的添加超平面法,从而弄清楚了这两种适定结点组间的几何结构。     

On the Negative Extremums of Fundamental Functions of Lagrange Interpolation Based on Chebyshev Nodes

In this paper, we investigate the negative extremums of fundamental functions of Lagrange interpolation based on Chebyshev nodes. Moreover, we establish some companion results to the theorem of J. Szabados on the positive extremum.     

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

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

扰动Chebyshev结点上的Hermite－Fejer插值

本文发现当Ｃｈｅｂｙｓｈｅｖ结点产生某些扰动时，只要扰动量不超过，则基于扰动后的Ｃｈｅｂｙｓｈｅｖ结点的Ｈｅｒｍｉｔｅ－Ｆｅｊｅｒ插值过程仍然保持对［－１，１］上任意连续函数的一致收敛性，此外，文中还给出了这种收敛性的收敛速度估计。     

扰动Chebyshev结点上的Hermite－Fejer插值

本文发现当Ｃｈｅｂｙｓｈｅｖ结点产生某些扰动时，只要扰动量不超过，则基于扰动后的Ｃｈｅｂｙｓｈｅｖ结点的Ｈｅｒｍｉｔｅ－Ｆｅｊｅｒ插值过程仍然保持对［－１，１］上任意连续函数的一致收敛性，此外，文中还给出了这种收敛性的收敛速度估计。