Tests for speeding up the determination of the Bernstein enclosure of the range of a multivariate polynomial and a rational function over a box and a simplex are presented. In the polynomial case, this enclosure is the interval spanned by the minimum and the maximum of the Bernstein coe cients which are the coe cients of the polynomial with respect to the tensorial or simplicial Bernstein basis...

One hundred years after the introduction of the Bernstein polynomial basis, we survey the historical development and current state of theory, algorithms, and applications associated with this remarkable method of representing polynomials over finite domains. Originally introduced by Sergei Natanovich Bernstein to facilitate a constructive proof of the Weierstrass approximation theorem, the leis...

In the present paper a Korovkin-type theorem is proposed for the approximation operators defined by the inverse Ftransforms. These results allow us to choose between a variety of shapes to be used as atoms of the fuzzy partitions used within the F-transform’s framework. In this way we can enlarge considerably the class of F-transforms proposed recently by I. Perfilieva. The new fuzzy partitions...

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. much harder version under recent consideration to enforce bounds constraints on the polynomial. In this paper, we consider of constructioning such approximations using polynomials Bernstein basis. We a family inequality-constrained quadratic programs. univariate case, cone cons...

We show that the Bernstein polynomial basis on a given interval is “optimally stable,” in the sense that no other nonnegative basis yields systematically smaller condition numbers for the values or roots of arbitrary polynomials on that interval. This result follows from a partial ordering of the set of all nonnegative bases that is induced by nonnegative basis transformations. We further show,...

In this mostly expository paper we explain how the Bernstein basis, widely used in computer-aided geometric design, provides an efficient method for real root isolation, using de Casteljau’s algorithm. We discuss the link between this approach and more classical methods for real root isolation. We also present a new improved method for isolating real roots in the Bernstein basis inspired by Rou...