Direct and inverse theorems for Bernstein polynomials with inner singularities

We introduce a new type of Bernstein polynomials, which can be used to approximate the functions with inner singularities. The direct and inverse results of the weighted approximation of this new type of combinations are obtained.     

Gauss–Lobatto to Bernstein polynomials transformation

The aim of this paper is to transform a polynomial expressed as a weighted sum of discrete orthogonal polynomials on Gauss–Lobatto nodes into Bernstein form and vice versa. Explicit formulas and recursion expressions are derived. Moreover, an efficient algorithm for the transformation from Gauss–Lobatto to Bernstein is proposed. Finally, in order to show the robustness of the proposed algorithm, experimental results are reported.     

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.     

Bernstein polynomials and composite Bézier curves

Analytical principles of the theory of Bézier curves are presented. A new approach to the construction of composite Bézier curves of prescribed smoothness both on a plane and in a multidimensional Euclidean space is proposed.     

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.     

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.     

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.     

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.     

New representation of the remainder in the Bernstein approximation

This short note presents a new representation of the remainder in the Bernstein approximation based on divided differences and some immediate applications. It is the only known representation of the remainder in the Bernstein approximation of arbitrary functions as a convex combination of divided differences of second order on known knots. As an application we obtain sharp inequalities for functions possessing bounded divided differences of second order and a new proof of the classical Weierstrass approximation theorem.     

Numerical solution of some classes of integral equations using Bernstein polynomials

This paper is concerned with obtaining approximate numerical solutions of some classes of integral equations by using Bernstein polynomials as basis. The integral equations considered are Fredholm integral equations of second kind, a simple hypersingular integral equation and a hypersingular integral equation of second kind. The method is explained with illustrative examples. Also, the convergence of the method is established rigorously for each class of integral equations considered here.     

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.     

多元Bernstein多项式加权逼近的Steckin-Marchaud型不等式

引进一种新的光滑模,建立多元Ｂｅｒｎｓｔｅｉｎ多项式加权逼近的Ｓｔｅｃｋｉｎ Ｍａｒｃｈａｕｄ型不等式．     

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.     

Construction a new generating function of Bernstein type polynomials

Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties of this generating functions are given. By applying this generating function, not only derivative of these polynomials but also recurrence relations of these polynomials are found. Interpolation function of these polynomials is also constructed by Mellin transformation. This function interpolates these polynomials at negative integers which are given explicitly. Moreover, relations between these polynomials, the Stirling numbers of the second kind and Bernoulli polynomials of higher order are given. Furthermore some remarks associated with the Bezier curves are given.     

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.     

Numerical solution of fractional differential equations with a Tau method based on Legendre and Bernstein polynomials

In this paper, we state and prove a new formula expressing explicitly the integratives of Bernstein polynomials (or B‐polynomials) of any degree and for any fractional‐order in terms of B‐polynomials themselves. We derive the transformation matrices that map the Bernstein and Legendre forms of a degree‐n polynomial on [0,1] into each other. By using their transformation matrices, we derive the operational matrices of integration and product of the Bernstein polynomials. These matrices together with the Tau method are then utilized to reduce the solution of this problem to the solution of a system of algebraic equations. The method is applied to solve linear and nonlinear fractional differential equations. Copyright © 2013 John Wiley & Sons, Ltd.     

Numerical solution of the nonlinear age-structured population models by using the operational matrices of Bernstein polynomials

In this paper a numerical method for solving the nonlinear age-structured population models is presented which is based on Bernstein polynomials approximation. Operational matrices of integration, differentiation, dual and product are introduced and are utilized to reduce the age-structured population problem to the solution of algebraic equations. The method in general is easy to implement, and yields good results. Illustrative examples are included to demonstrate the validity and applicability of the new technique.     

Pointwise Approximation Theorems for Combinations and Derivatives of Bernstein Polynomials

We establish the pointwise approximation theorems for the combinations of Bernstein polynomials by the rth Ditzian-Totik modulus of smoothness wФ^r（f, t） where Ф is an admissible step-weight function. An equivalence relation between the derivatives of these polynomials and the smoothness of functions is also obtained.     

A rational approximation based on Bernstein polynomials for high order initial and boundary values problems

We introduce a new method to solve high order linear differential equations with initial and boundary conditions numerically. In this method, the approximate solution is based on rational interpolation and collocation method. Since controlling the occurrence of poles in rational interpolation is difficult, a construction which is found by Floater and Hormann [1] is used with no poles in real numbers. We use the Bernstein series solution instead of the interpolation polynomials in their construction. We find that our approximate solution has better convergence rate than the one found by using collocation method. The error of the approximate solution is given in the case of the exact solution f ∈ C^d+2[a, b].     

Properties of fractional calculus with respect to a function and Bernstein type polynomials

This paper is divided into two stages. In the first stage, we investigated a new approach for the $\psi$-Riemann–Liouville fractional integral and the Faa di Bruno formula for the $\psi$-Hilfer fractional derivative. In addition, we discussed other properties involving the $\psi$-Hilfer fractional derivative and the $\psi$-Riemann–Liouville fractional integral. In the second stage, Bernstein polynomials involving the $\psi (·)$ function are investigated and the $\psi$-Riemann–Liouville fractional integral and $\psi$-Hilfer fractional derivative from the Bernstein polynomials are evaluated. We also discussed the relationship between the $\psi$-Hilfer fractional derivative with Laguerre polynomials and hypergeometric functions, and a version of the fractional mean value theorem with respect to a function. Motivated by the Bernstein polynomials, the second stage uses the Bernstein polynomials to approximate the solution of a fractional integro-differential equation with Hilfer fractional derivative and concluding with a numerical approach with its respective graph.