Asymptotic expansion and extrapolation for Bernstein polynomials with applications

Given a real functionf C ^2k [0,1],k 1 and the corresponding Bernstein polynomials {B _n (f)} _n we derive an asymptotic expansion formula forB _n (f). Then, by applying well-known extrapolation algorithms, we obtain new sequences of polynomials which have a faster convergence thanB _n (f). As a subclass of these sequences we recognize the linear combinations of Bernstein polynomials considered by Butzer, Frentiu, and May [2, 6, 9]. In addition we prove approximation theorems which extend previous results of Butzer and May. Finally we consider some applications to numerical differentiation and quadrature and we perform numerical experiments showing the effectiveness of the considered technique.This work was partially supported by a grant from MURST 40.     

Uniform approximation by combinations of Bernstein polynomials

We prove a pointwise characterization result for combinations of Bernstein polynomials. The main result of this paper includes an equivalence theorem of H. Berens and G. G. Lorentz as a special case.     

Fractals and Bernstein polynomials

Self-similarity of Bernstein polynomials, embodied in their subdivision property is used for construction of an Iterative (hyperbolic) Function System (IFS) whose attractor is the graph of a given algebraic polynomial of arbitrary degree. It is shown that such IFS is of just-touching type, and that it is peculiar to algebraic polynomials. Such IFS is then applied to faster evaluation of Bézier curves and to introduce interactive free-form modeling component into fractal sets.     

Convexity preserving and predicting by Bernstein polynomials

It is known that the Bernstein polynomials of a function f defined on [0, 1 ] preserve its convexity properties, i.e., if f⁽ⁿ⁾ 0 then for m n, (B_mf)⁽ⁿ⁾ 0. Moreover, if f is n-convex then (B_mf)⁽ⁿ⁾ 0. While the converse is not true, we show that if f is bounded on (a, b) and if for every subinterval [α, β] (a, b) the nth derivative of the mth Bernstein polynomial of f on [α, β] is nonnegative then f is n-convex.     

Note on Bernstein polynomials and Kantorovich polynomials

We obtain two asymptotic representations of remainder of approximation of derivable functions by Bernstein polynomials and Kantorovich polynomials separately.     

Estimation of probability characteristics by generalized Bernstein polynomials

Approximations based on Bernstein polynomials are used for smoothing a sample quantile function and estimating the underlying distribution and its characteristics. Generalized Bernstein-type polynomials are introduced to reduce the bias of estimation under various types of distributions including finite distributions. The asymptotic behavior of the expectations of these estimators is studied. Bibliography: 10 titles.Published in Zapiski Nauchnykh Seminarov POMI, Vol. 294, 2002, pp. 127–138.     

Bernstein polynomials and learning theory

When learning processes depend on samples but not on the order of the information in the sample, then the Bernoulli distribution is relevant and Bernstein polynomials enter into the analysis. We derive estimates of the approximation of the entropy function x log x that are sharper than the bounds from Voronovskaja's theorem. In this way we get the correct asymptotics for the Kullback–Leibler distance for an encoding problem.     

Convexity and Bernstein polynomials onk-simploids

This paper is concerned with Bernstein polynomials onk-simploids by which we mean a cross product ofk lower dimensional simplices. Specifically, we show that if the Bernstein polynomials of a given functionf on ak-simploid form a decreasing sequence thenf +l, wherel is any corresponding tensor product of affine functions, achieves its maximum on the boundary of thek-simploid. This extends recent results in [1] for bivariate Bernstein polynomials on triangles. Unlike the approach used in [1] our approach is based on semigroup techniques and the maximum principle for second order elliptic operators. Furthermore, we derive analogous results for cube spline surfaces.This work was partially supported by NATO Grant No. DJ RG 639/84.     

On the approximation of differentiable functions by Bernstein polynomials and Kantorovich polynomials

E.V. Voronovskaya and S.N. Bernstein established an asymptotic representation for the deviation of functions from Bernstein polynomials under the condition that the function has an even-order derivative. In the present paper, a similar problem is solved in the case when the function has an odd-order derivative. In addition, analogous representations are obtained for the deviations of functions from Kantorovich polynomials.     

-functionals and multivariate Bernstein polynomials

This paper estimates upper and lower bounds for the approximation rates of iterated Boolean sums of multivariate Bernstein polynomials. Both direct and inverse inequalities for the approximation rate are established in terms of a certain K-functional. From these estimates, one can also determine the class of functions yielding optimal approximations to the iterated Boolean sums.     

Jacobi polynomials in Bernstein form

The paper describes a method to compute a basis of mutually orthogonal polynomials with respect to an arbitrary Jacobi weight on the simplex. This construction takes place entirely in terms of the coefficients with respect to the so-called Bernstein–Bézier form of a polynomial.     

Saturation theorems for generalized Bernstein polynomials

In the present paper, we give the explicit formula of the principal part of n ∑ k=0 ([k]q -[n]qx)sxk n-k-1 ∏ m=0 (1-qmx) with respect to [n]q for any integer s and q ∈ (0,1]. And, using the expressions, we obtain saturation theorems for Bn(f,qn;x) approximating to f(x) ∈ C[0,1], 0 < qn ≤ 1, qn → 1.     

Generalized Bernstein polynomials with Pollaczek weight

Bernstein polynomials are a useful tool for approximating functions. In this paper, we extend the applicability of this operator to a certain class of locally continuous functions. To do so, we consider the Pollaczek weight

which is rapidly decaying at the endpoints of the interval considered. In order to establish convergence theorems and error estimates, we need to introduce corresponding moduli of smoothness and K-functionals. Because of the unusual nature of this weight, we have to overcome a number of technical difficulties, but the equivalence of the moduli and K-functionals is a benefit interesting in itself. Similar investigations have been made in [B. Della Vecchia, G. Mastroianni, J. Szabados, Weighted approximation of functions with endpoint or inner singularities by Bernstein operators, Acta Math. Hungar. 103 (2004) 19–41] in connection with Jacobi weights.     

Approximation by Bernstein polynomials at the discontinuity points of derivatives

We obtain asymptotic formulas for the deviation of Bernstein polynomials from functions at the first-kind discontinuity points of the highest derivatives of odd order.     

Some remarks on Hölder approximation by Bernstein polynomials

In this work we deal with the approximation in Hölder norms of univariate and bivariate continuous functions that satisfy certain Hölder conditions, by classical Bernstein polynomials and by tensor products and Boolean sums of them. Estimates of the degree of convergence are included.     

Bernstein–Sato polynomials in positive characteristic

In characteristic zero, the Bernstein–Sato polynomial of a hypersurface can be described as the minimal polynomial of the action of an Euler operator on a suitable D-module. We consider analogous D-modules in positive characteristic, and use them to define a sequence of Bernstein–Sato polynomials (corresponding to the fact that we need to consider also divided powers Euler operators). We show that the information contained in these polynomials is equivalent to that given by the F-jumping exponents of the hypersurface, in the sense of Hara and Yoshida [N. Hara, K.-i. Yoshida, A generalization of tight closure and multiplier ideals, Trans. Amer. Math. Soc. 355 (2003) 3143–3174].