THE EXACT CONVERGENCE RATE AT ZERO OF LAGRANGE INTERPOLATION POLYNOMIAL TO ｜x｜^α

In this paper we present a generalized quantitative version of a result the exact convergence rate at zero of Lagrange interpolation polynomial to spaced nodes in [-1,1] due to M.Revers concerning f（x） = ｜x｜α with on equally     

THE DIVERGENCE OF LAGRANGE INTERPOLATION FOR |x|α

This paper shows that the sequence of Lagrange interpolation polynomials corresponding to the function f(x) = |x|α(1 ＜α＜ 2) on [-1, 1] can diverge everywhere in the interval except at zero and the end-points.     

THE DIVERGENCE OF LAGRANGE INTERPOLATION FOR |x|~a

This paper shows that the sequence of Lagrange interpolation polynomials corresponding to the function f(x) =|x|~a(1相似文献   

THE CONVERGENCE ORDER OF THE INTERPOLATION PROCESS BY LAGRANGE POLYNOMIALS

Let f(x) be an arbitrary continuous function on [-1, 1] and letus denote T_n(x)=cos nθ, x=cos θ,T_n(x) is to be known as the first kind of Chebyshev polynomial ofdegree n. The zeros. of T_n(x) are     

THE DIVERGENCE OF LAGRANGE INTERPOLATION FOR |x|α (2＜α＜4) AT 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 the present paper, we prove that the sequence of Lagrange interpolation polynomials corresponding to |x|α(2 ＜α＜ 4) on equidistant nodes in [-1,1] diverges everywhere, except at zero and the end-points.     

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 thespecial case where the interpolation nodes are xi= (i/n)(i= 1,2,…,n;r>0) , it is proved that the exact order of approximation is O(1/n),O(1/nlogn) and O(1/n), respectively, corresponding to O1.     

THE DIVERGENCE OF LAGRANGE INTERPOLATION FOR ｜x｜^α

This paper shows that the sequence of Lagrange interpolation polynomials corresponding to the rune tion f（z） =｜x｜^α（1〈α〈2） on [-1,1] can diverge everywhere in the interval except at zero and the end-points.     

ON LAGRANGE INTERPOLATION TO |x|α(1 ＜α＜ 2) WITH EQUALLY SPACED NODES

S.M. Lozinskii proved the exact convergence rate at the zero of Lagrange interpolation polynomials to |x| based on equidistant nodes in [-1, 1]. In 2000, M. Rever generalized S.M. Lozinskii's result to |x|α(0 ≤α≤ 1). In this paper we will present the exact rate of convergence at the point zero for the interpolants of |x|α(1 ＜α＜ 2)..     

THE DIVERGENCE OF LAGRANGE INTERPOLATION FOR ｜x｜^α（2〈α〈4）AT EQUIDISTANT NODES

It is a classical result of Bernstein that the sequence of Lagrange interpolation polumomials to ｜x｜ at equally spaced nodes in [-1, 1] diverges everywhere, except at zero and the end-points. In the present paper, toe prove that the sequence of Lagrange interpolation polynomials corresponding to ｜x｜^α （2 〈 α 〈 4） on equidistant nodes in [-1, 1] diverges everywhere, except at zero and the end-points.     

CHARACTERIZATION OF THE CONVERGENCE DOMAINS OF POLYNOMIAL SERIES AND THE MINIMAL CONVERGENCE DOMAIN

A characterization of the convergence domains of polynomial series is disucssed. the minimalconvergence domain for a kind of polynomial series is shown.     

ON NEWMAN-TYPE RATIONAL INTERPOLATION TO ｜x｜ AT THE CHEBYSHEV NODES OF THE SECOND KIND

Recently Brutman and Passow considered Newman-type rational interpolation to ｜x｜ induced by arbitrary set 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 paper we consider the special case where the interpolation nodes are the zeros of the Chebyshev polynomial of the second kind and prove that in this case the exact order of approximation is O（1/n｜nn）     

ON LAGRANGE INTERPOLATION TO |x|α(1 < α < 2) WITH EQUALLY SPACED NODES

S.M.Lozinskii proved the exact convergence rate at the zero of Lagrange interpolation polynomials to |x| based on equidistant nodes in [-1,1]. In 2000, M. Rever generalized S.M.Lozinskii's result to |x|α(0 <≤ α≤ 1). In this paper we will present the exact rate of convergence at the point zero for the interpolants of |x|α1(1 < α < 2)..     

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.     

ON THE RATE OF POINTWISE CONVERGENCE OF THE DURRMEYER-TYPE OPERATORS

For bounded or some locally bounded functions f measurable on an interval I there is estimated the rate of convergence of the Durrmeyer-type operators Lnf at those points x∈IntI at which the one-sided limits f(x± 0) exist. In the main theorems the Chanturiya's modulus of variation is used.     

THE EXACT ORDER OF |x-x_k|~s|I_k(x)|~t

In this paper we give the exact order of丨x-x_k丨~丨l_k(x)丨~for any fixed nonnegativeintegers s and t,which is n~(-s),n~(-s)lnn and n~(1-)for s≤t-2,s=t-1 and s≥t,respectively.     

APPROXIMATION PROPERTIES OF LAGRANGE INTERPOLATION POLYNOMIAL BASED ON THE ZEROS OF （1- x^2）cosnarccosx

We study some approximation properties of Lagrange interpolation polynomial based on the zeros of （1-x^2）cosnarccosx. By using a decomposition for f（x） ∈ C^τC^τ＋1 we obtain an estimate of ‖f（x） -Ln＋2（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.     

THE MONOTONICITY OF CONVERGENCE RATE FOR MGS METHODS

In this paper we prove that the convergence rate of the modified Gauss-Seidel method is a monotonic function for some precondition parameters.     

THE UNIFORM CONVERGENCE RATE OF KERNEL DENSITY ESTIMATE

In this paper,we study the uniform convergence rate of kernel density estimate f_nand get optimal uniform rate of convergence without the assumption of compact supportfor kernel function.It is proved that if the density function f satisfies λ-condition andthe kernel function K is λ-good(see section 1),then we havelimsup (n/(logn))~(λ/(1+2λ))丨_n(x)-f(x)丨≤const,a.s.     

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.     

THE CONVERGENCE RATE OF MULTI-BERNSTEIN-DURRMEYER OPERATORS WITH JACOBI WEIGHTS

In this paper , we will consider the convergence rate of Multi-Bernstein-Durrmeyer operators with Jaco-bi weights and characterizations of approximation rate by means of a new K-functional.