OPTIMAL BIRKHOFF INTERPOLATION AND BIRKHOFF NUMBERS IN SOME FUNCTION SPACES

This paper investigates the optimal Birkhoff interpolation and Birkhoff numbers of some function spaces in space L_∞[-1,1] and weighted spaces L_p,ω[-1,1],1≤p<∞,with w being a continuous integrable weight function in(-1,1).We proved that the Lagrange interpolation algorithms based on the zeros of some polynomials are optimal.We also show that the Lagrange interpolation algorithms based on the zeros of some polynomials are optimal when the function values of the two endpoin...     

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 Simultaneous Approximation in Lp-norm

Let C_[-1,1]~(N) be the class of N-th continuously differentiable functions on [-1,1], denote by L_(p[-1,1]) the class of L_p-integrable functions on [-1,1], E_n(f)_p is thebest approximation of f∈L_(p[-1,1]) by nth algebraic polynomials, and C(·) is a positive constant only depending upon the quantities in the brackets. In Theorem 1, the condition that f(x)∈C_([-1,1])~((N-1)), f~((N-1))(x) is absolutely continuous, and f~((N))(x)∈L_(p[-1,1]) for N=O equals that f(x)∈L_(p[-1,1]).     

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.     

Sample Numbers and Optimal Lagrange Interpolation of Sobolev Spaces Wr1*

This paper investigates the optimal recovery of Sobolev spaces W^r₁[?1, 1], r ∈ N in the space L1[?1, 1]. They obtain the values of the sampling numbers of W^r₁[?1, 1] in L₁[?1, 1] and show that the Lagrange interpolation algorithms based on the extreme points of Chebyshev polynomials are optimal algorithms. Meanwhile, they prove that the extreme points of Chebyshev polynomials are optimal Lagrange interpolation nodes.     

基于修正的第二类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 ）.     

Approximation to Continuous Functions by a Kind of Interpolation Polynomials

In this paper, an interpolation polynomial operator Fn (f; l, x ) is constructed based on the zeros of a kind of Jacobi polynomials as the interpolation nodes. For any continuous function. f(x)∈ C^b[-1,1] (0≤b≤1) Fn(f; l,x) converges to f(x) uniformly, where l is an odd number.     

The best quadrature based on given Hermite information for the Sobolev class KW~r[a,b]

As usual, denote by KWr[a,b] the Sobolev class consisting of every function whose (r-1)th derivative is absolutely continuous on the interval [a,b] and rth derivative is bounded by K a.e. in [a, b]. For a function f∈KWr[a, b], its values and derivatives up to r -1 order at a set of nodes x are known. These values are said to be the given Hermite information. This work reports the results on the best quadrature based on the given Hermite information for the class KWr[a. b]. Existence and concrete construction issue of the best quadrature are settled down by a perfect spline interpolation. It turns out that the best quadrature depends on a system of algebraic equations satisfied by a set of free nodes of the interpolation perfect spline. From our another new result, it is shown that the system can be converted in a closed form to two single-variable polynomial equations, each being of degree approximately r/2. As a by-product, the best interpolation formula for the class KWr[a, b] is also obtained.     

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.     

ON LAGRANGE INTERPOLATION FOR |X|~α (0 < α < 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.     

A fast algorithm for multivariate Hermite interpolation

Multivariate Hermite interpolation is widely applied in many fields, such as finite element construction, inverse engineering, CAD etc.. For arbitrarily given Hermite interpolation conditions, the typical method is to compute the vanishing ideal I （the set of polynomials satisfying all the homogeneous interpolation conditions are zero） and then use a complete residue system modulo I as the interpolation basis. Thus the interpolation problem can be converted into solving a linear equation system. A generic algorithm was presented in [18], which is a generalization of BM algorithm [22] and the complexity is O（τ^3） where r represents the number of the interpolation conditions. In this paper we derive a method to obtain the residue system directly from the relative position of the points and the corresponding derivative conditions （presented by lower sets） and then use fast GEPP to solve the linear system with O（（τ ＋ 3）τ^2） operations, where τ is the displacement-rank of the coefficient matrix. In the best case τ = 1 and in the worst case τ = [τ/n], where n is the number of variables.     

Approximation of functions on the Sobolev space with a Gaussian measure

We discuss the best approximation of periodic functions by trigonometric polynomials and the approximation by Fourier partial summation operators, Valle-Poussin operators, Ces`aro operators, Abel opera-tors, and Jackson operators, respectively, on the Sobolev space with a Gaussian measure and obtain the average error estimations. We show that, in the average case setting, the trigonometric polynomial subspaces are the asymptotically optimal subspaces in the L q space for 1≤q ∞, and the Fourier partial summation operators and the Valle-Poussin operators are the asymptotically optimal linear operators and are as good as optimal nonlinear operators in the L q space for 1≤q ∞.     

Optimal Recovery of Functions on the Sphere on a Sobolev Spaces with a Gaussian Measure in the Average Case Setting

In this paper, we study optimal recovery(reconstruction) of functions on the sphere in the average case setting. We obtain the asymptotic orders of average sampling numbers of a Sobolev space on the sphere with a Gaussian measure in the Ld-1q(S) metric for 1 ≤ q ≤∞, and show that some worst-case asymptotically optimal algorithms are also asymptotically optimal in the average case setting in the Ldq(S-1)metric for 1 ≤ q ≤∞.     

ON LAGRANGE INTERPOLATION FOR |X|~α (0 &lt; α &lt; 1)

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

The Maximum Trigonometric Degrees of Quadrature Formulae with Prescrib ed No des

The purpose of this paper is to study the maximum trigonometric degree of the quadrature formula associated with m prescribed nodes and n unknown additional nodes in the interval（-π, π]. We show that for a fixed n, the quadrature formulae with m and m ＋ 1 prescribed nodes share the same maximum degree if m is odd. We also give necessary and sufficient conditions for all the additional nodes to be real, pairwise distinct and in the interval（-π, π] for even m, which can be obtained constructively. Some numerical examples are given by choosing the prescribed nodes to be the zeros of Chebyshev polynomials of the second kind or randomly for m ≥ 3.     

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相似文献   

Uniform convergence of the p-Bieberbach polynomials in domains with zero angles

Let G  C be a simply connected domain whose boundary L := αG is a Jordan curve and 0 ∈ G.Let w = ψ(z) be the conformal mapping of G onto the disk B(0, r0) := {w : |w| r0}, satisfying ψ(0) = 0,ψ′(0) = 1. We consider the following extremal problem for p 0:∫∫G|ψ′(z)- P ′n(z) pdσz→ min in the class of all polynomials Pn(z) of degree not exceeding n with Pn(0) = 0, P ′n(0) = 1. The solution to this extremal problem is called the p-Bieberbach polynomial of degree n for the pair(G, 0). We study the uniform convergence of the p-Bieberbach polynomials Bn,p(z) to the ψ(z) on G with interior and exterior zero angles determined depending on the properties of boundary arcs and the degree of their "touch".     

AVERAGE KOLMOGOROV N-WIDTHS (N-K WIDTH) AND OPTIMAL INTERPOLATION OF SOBOLEV CLASS IN L_p(R)

The author obtains the exact values of the average n-K widths for some Sobolev classes defined by an ordinary differential operator P(D)=multiply from i=1 to r(D-t_il), t_i∈R, in the metric L_(R), 1≤p≤∞, and identifies some optimal subspaces. Furthermore, the optimal interpolation problem for these Sobolev classes is considered by sampling the function values at some countable sets of points distributed reasonably on R, and some exact results are obtained.     

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)..     

CONVERGENCE OF (0,1,2,3) INTERPOLATION ON AN ARBITRARY SYSTEM OF NODES

1. IntroductionThis note deals with convergence of (0,1,2,3) illterpolation on an arbitrary system of nodes.Fisrt we illtroduce some definitions and notations.LetGiven a fiXed even integer m, let Ajk 6 Pm.--1 (the set of polynomials of degree at most mn-- 1)satisfyThen the (0,1,...,m--1) Hermite--Fej6r type illterpolation for f 6 C[--1, 1] is defined byand the (0,1,...,m--1) Hernilte interpolation for f e Cd--'[--1, 1] is defined by(of. [6]). We also need a well known fact:where 11' 11 sta…