The dual basis functions for the Bernstein polynomials

An explicit formula for the dual basis functions of the Bernstein basis is derived. The dual basis functions are expressed as linear combinations of Bernstein polynomials. This revised version was published online in June 2006 with corrections to the Cover Date.     

On dual Bernstein polynomials and stochastic fractional integro-differential equations

In recent years, random functional or stochastic equations have been reported in a large class of problems. In many cases, an exact analytical solution of such equations is not available and, therefore, is of great importance to obtain their numerical approximation. This study presents a numerical technique based on Bernstein operational matrices for a family of stochastic fractional integro-differential equations (SFIDE) by means of the trapezoidal rule. A relevant feature of this method is the conversion of the SFIDE into a linear system of algebraic equations that can be analyzed by numerical methods. An upper error bound, the convergence, and error analysis of the scheme are investigated. Three examples illustrate the accuracy and performance of the technique.     

Fast simplicial finite element algorithms using Bernstein polynomials

Fast algorithms for applying finite element mass and stiffness operators to the B-form of polynomials over d-dimensional simplices are derived. These rely on special properties of the Bernstein basis and lead to stiffness matrix algorithms with the same asymptotic complexity as tensor-product techniques in rectangular domains. First, special structure leading to fast application of mass matrices is developed. Then, by factoring stiffness matrices into products of sparse derivative matrices with mass matrices, fast algorithms are also obtained for stiffness matrices.     

Fast simplicial quadrature-based finite element operators using Bernstein polynomials

We derive low-complexity matrix-free finite element algorithms for simplicial Bernstein polynomials on simplices. Our techniques, based on a sparse representation of differentiation and special block structure in the matrices evaluating B-form polynomials at warped Gauss points, apply to variable coefficient problems as well as constant coefficient ones, thus extending our results in Kirby (Numer Math, 2011, in press).     

Bézier representation of the constrained dual Bernstein polynomials

Explicit formulae for the Bézier coefficients of the constrained dual Bernstein basis polynomials are derived in terms of the Hahn orthogonal polynomials. Using difference properties of the latter polynomials, efficient recursive scheme is obtained to compute these coefficients. Applications of this result to some problems of CAGD is discussed.     

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.     

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.     

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.     

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

Constrained multi-degree reduction of triangular Bézier surfaces using dual Bernstein polynomials

We propose a novel approach to the problem of multi-degree reduction of Bézier triangular patches with prescribed boundary control points. We observe that the solution can be given in terms of bivariate dual discrete Bernstein polynomials. The algorithm is very efficient thanks to using the recursive properties of these polynomials. The complexity of the method is O(n²m²), n and m being the degrees of the input and output Bézier surfaces, respectively. If the approximation—with appropriate boundary constraints—is performed for each patch of several smoothly joined triangular Bézier surfaces, the result is a composite surface of global C^r continuity with a prescribed order r. Some illustrative examples are given.     

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.     

A new class of polynomials associated with Bernstein and beta polynomials

The purpose of this paper is to define a new class polynomials. Special cases of these polynomials give many famous family of the Bernstein type polynomials and beta polynomials. We also construct generating functions for these polynomials. We investigate some fundamental properties of these functions and polynomials. Using functional equations and generating functions, we derive various identities related to theses polynomials. We also construct interpolation function that interpolates these polynomials at negative integers. Finally, we give a matrix representations of these polynomials. Copyright © 2013 John Wiley & Sons, Ltd.     

Fast evaluation of trigonometric polynomials from hyperbolic crosses

The discrete Fourier transform in d dimensions with equispaced knots in space and frequency domain can be computed by the fast Fourier transform (FFT) in arithmetic operations. In order to circumvent the ‘curse of dimensionality’ in multivariate approximation, interpolations on sparse grids were introduced. In particular, for frequencies chosen from an hyperbolic cross and spatial knots on a sparse grid fast Fourier transforms that need only arithmetic operations were developed. Recently, the FFT was generalised to nonequispaced spatial knots by the so-called NFFT. In this paper, we propose an algorithm for the fast Fourier transform on hyperbolic cross points for nonequispaced spatial knots in two and three dimensions. We call this algorithm sparse NFFT (SNFFT). Our new algorithm is based on the NFFT and an appropriate partitioning of the hyperbolic cross. Numerical examples confirm our theoretical results.     

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.     

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.     

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.