Multivariate Markov polynomial inequalities and Chebyshev nodes

This article considers the extension of V.A. Markov's theorem for polynomial derivatives to polynomials with unit bound on the closed unit ball of any real normed linear space. We show that this extension is equivalent to an inequality for certain directional derivatives of polynomials in two variables that have unit bound on the Chebyshev nodes. We obtain a sharpening of the Markov inequality for polynomials whose values at specific points have absolute value less than one. We also obtain an interpolation formula for polynomials in two variables where the interpolation points are Chebyshev nodes.     

A proof of Markov's theorem for polynomials on Banach spaces

Our object is to present an independent proof of the extension of V.A. Markov's theorem to Gâteaux derivatives of arbitrary order for continuous polynomials on any real normed linear space. The statement of this theorem differs little from the classical case for the real line except that absolute values are replaced by norms. Our proof depends only on elementary computations and explicit formulas and gives a new proof of the classical theorem as a special case. Our approach makes no use of the classical polynomial inequalities usually associated with Markov's theorem. Instead, the essential ingredients are a Lagrange interpolation formula for the Chebyshev nodes and a Christoffel-Darboux identity for the corresponding bivariate Lagrange polynomials. We use these tools to extend a single variable inequality of Rogosinski to the case of two real variables. The general Markov theorem is an easy consequence of this.     

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…     

APPROXIMATION OF MODIFIED LAGRANGE INTERPOLATION IN ORLICZ SPACES

In this paper, the authors give the Marcinkiewicz-Zygmund inequality based on the zeros of the first kind Chebyshev polynomials in Orlicz norm. As application, the degree of approximation by two kinds of modified Lagrange inter polatory polynomials in Orlicz spaces is studied.     

ON LAGRANGE INTERPOLATION FOR [X|a (0＜a＜1)

We study the optimal order of approximation for |x|a (0 ＜ a ＜ 1) by Lagrange interpolation polynomials based on Chebyshev nodes of the first kind. It is proved that the Jackson order of approximation is attained.     

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

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

Lagrange插值逼近导数的平均收敛

<正>We consider the rate of mean convergence of derivatives by Lagrange interpolation operators L_n(f,x) based on the zeros of Chebyshev polynomials of the first kind.A sharp estimate of the derivative of L_n(f,x)—f(x) in terms of the error of best approximation by polynomials of degree n is derived.     

Lebesgue functions corresponding to a family of Lagrange interpolation polynomials

In this paper we obtain various explicit forms of the Lebesgue function corresponding to a family of Lagrange interpolation polynomials defined at an even number of nodes. We study these forms by using the derivatives up to the second order inclusive. We estimate exact values of Lebesgue constants for this family from below and above in terms of known parameters. In a particular case we obtain new convenient formulas for calculating these estimates.     

Simultaneous Lagrange interpolating approximation need not always be convergent

Recently, several publications have been devoted to investigation of simultaneous Lagrange interpolating approximation. In this paper we carefully construct a counterexample with a system of nodes showing that the simultaneous Lagrange interpolating approximation need not always be convergent. It is especially interesting to note that the system of nodes behaving “badly” in this case is exactly the “near optimal choice” in the ordinary Lagrange interpolating case, the zeros of the Chebyshev polynomials.     

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

On Lagrange interpolation for |<Emphasis Type="Italic">X</Emphasis>|<Superscript><Emphasis Type="Italic">α</Emphasis></Superscript> (0 < <Emphasis Type="Italic">α</Emphasis> < 1)

We study the optimal order of approximation for |x| ^α (0 < α < 1) by Lagrange interpolation polynomials based on Chebyshev nodes of the first kind. It is proved that the Jackson order of approximation is attained. Supported by the NSFC, 10601065.     

Multi-node higher order expansions of a function

By using the values and higher derivatives of a function at the given nodes, a kind of multi-node higher order expansion of the function is presented. The error terms of the expansions are given. Particular examples are the extensions of the Taylor polynomials, Bernstein polynomials and Lagrange interpolation polynomials. The expansions are numerical approximation polynomials and very useful particular for the functions for which the higher derivatives can be obtained easily.     

Bivariate Polynomial Interpolation over Nonrectangular Meshes

In this paper, by means of a new recursive algorithm of non-tensor-product-typed divided differences, bivariate polynomial interpolation schemes are constructed over nonrectangular meshes firstly, which is converted into the study of scattered data interpolation. And the schemes are different as the number of scattered data is odd and even, respectively. Secondly, the corresponding error estimation is worked out, and an equivalence is obtained between high-order non-tensor-product-typed divided differences and high-order partial derivatives in the case of odd and even interpolating nodes, respectively. Thirdly, several numerical examples illustrate the recursive algorithms valid for the non-tensor-product-typed interpolating polynomials, and disclose that these polynomials change as the order of the interpolating nodes, although the node collection is invariant. Finally, from the aspect of computational complexity, the operation count with the bivariate polynomials presented is smaller than that with radial basis functions.     

Restricted even permutations and Chebyshev polynomials

We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.     

Lagrange interpolation on extended generalized Jacobi nodes

We consider theL ^p -convergence of interpolatory processes for nonsmooth functions. Therefore we use generalizations of the well-known Marcinkiewicz-Zygmund inequality for trigonometric polynomials to the case of algebraic polynomials, extending a result of Y. Xu. Particularly, we obtain the order of convergence for certain Lagrange and quasi-Lagrange interpolatory processes on generalized Jacobi nodes. Our approach enables us also to discuss the influence of additional nodes near the endpoints ±1.     

Nonsingularity of some classes of matrices, and minimal solutions of Silverman''s game on discrete sets

We establish the irreducibility of each game in four infinite three-parameter families of even order Silverman games, and the major step in doing so is to prove that certain matrices A, related in a simple way to the payoff matrices, are nonsingular for all relevant values of the parameters. This nonsingularity is established by, in effect, producing a matrix D such that AD is known to be nonsingular. The elements of D are polynomials from six interrelated sequences of polynomials closely related to the Chebyshev polynomials of the second kind. Each of these sequences satisfies a second order recursion, and consequently has many Fibonacci-like properties, which play an essential role in proving that the product AD is what we claim it is. The matrices D were found experimentally, by discovering patterns in low order cases worked out with the help of some computer algebra systems. The corresponding results for four families of odd order games were reported in an earlier paper.     

Determination of the Jump of a Function of Generalized Bounded Variation by the Derivatives of a Trigonometric Interpolation Polynomial

We obtain formulas expressing the value of the jump of a bounded periodic function of harmonic bounded variation in a neighborhood of the point under consideration via the derivatives of odd order of the Lagrange trigonometric interpolation polynomial with equidistant nodes and via the derivatives of even order of the conjugate polynomial.     

Outcomes of the Abel Identity

We discuss some outcomes of an umbral generalization of the Abel identity. First we prove that a concise proof of the Lagrange inversion formula can be deduced from it. Second, we show that the whole class of Sheffer sequences, if manipulated to an umbral level, coincides with the subclass of Abel polynomials. Finally, we apply these techniques to obtain explicit formulae for some classical polynomial sequences, even in non Sheffer cases (Chebyshev and Gegenbauer polynomials).     

Counting strings in Dyck paths

This paper deals with the enumeration of Dyck paths according to the statistic “number of occurrences of τ”, for an arbitrary string τ. In this direction, the statistic “number of occurrences of τ at height j” is considered. It is shown that the corresponding generating function can be evaluated with the aid of Chebyshev polynomials of the second kind. This is applied to every string of length 4. Further results are obtained for the statistic “number of occurrences of τ at even (or odd) height”.     

THE DIVERGENCE OF LAGRANGE INTERPOLATION IN EQUIDISTANT NODES

It is a classical result of Bernstein that the sequence of Lagrange interpolation polynomials to [x] at equally spaced nodes in [- 1,1 ] diverges everywhere, except at zero and the end-points. In this paper we show that the sequence of Lagrange interpolation polynomials corresponding to the functions which possess better smoothness on equidistant nodes in [- 1,1 ] still diverges every where in the interval except at zero and the end-points.