We present three linearization methods to over-approximate non-linear multivariate polynomials with convex polyhedra. The first one is based on the substitution of some variables by intervals. The principle of the second linearization technique is to express polynomials in the Bernstein basis and deduce a polyhedron from the Bernstein coefficients. The last method is based on Handelman’s theore...

i=0 aix , ai ∈ R. We will denote by πn the linear (vector) space of all such polynomials. The actual degree of p is the largest i for which ai is non-zero. The functions 1, x, . . . , x form a basis for πn, known as the monomial basis, and the dimension of the space πn is therefore n + 1. Bernstein polynomials are an alternative basis for πn, and are used to construct Bezier curves. The i-th Be...

which are now called Bernstein polynomials, in order to present a short proof of the Weierstrass Approximation Theorem. The subsequent history is well documented, see, e.g., [29] for the period up to 1955, the monograph [18] published in 1953, and the survey article [9] which appeared on the occasion of the hundredth anniversary of the above paper by Bernstein. Since the latter publication prov...

We survey some recent applications of Bernstein expansion to robust stability, viz. checking robust Hurwitz and Schur stability of polynomials with polynomial parameter dependency by testing determinantal criteria and by inspection of the value set. Then we show how Bernstein expansion can be used to solve systems of strict polynomial inequalities.

This paper presents a nonnegative polynomial that cannot be represented with nonnegative coefficients in the simplicial Bernstein basis by subdividing the standard simplex. The example shows that Bernstein Theorem cannot be extended to certificates of nonnegativity for polynomials with zeros at isolated points.

Keywords: Integro-differential equations Volterra equations Abel's integral equations Bernstein polynomials Singular volterra integral equations a b s t r a c t In this study, a new collocation method based on the Bernstein polynomials is introduced for the approximate solution of a class of linear Volterra integro-differential equations with weakly singular kernel. If the exact solution is pol...

Experimental observations of rootfinding by generalized companion matrix pencils expressed in the Lagrange basis show that the method can sometimes be numerically stable, and indeed sometimes be much more stable than rootfinding of polynomials expressed in even the Bernstein basis. This paper details some of those experiments and provides a theoretical justification for this. We prove that a ne...

In [20] a generalization of Bernstein polynomials and Bézier curves based on umbral calculus has been introduced. In the present paper we describe new geometric and algorithmic properties of this generalization including: (1) families of polynomials introduced by Stancu [19] and Goldman [12], i.e., families that include both Bernstein and Lagrange polynomial, are generalized in a new way, (2) a...

They investigated pointwise convergence properties of (1) in a compact sub-interval of [0,∞). Then Gadjiev and Çakar [2] obtained uniform convergence of (1) on semi-axis [0,∞) on some subspace of bounded and continuous functions by using the test functions ( x 1+x) ν , ν = 0, 1, 2. In 1996 q-based generalization of the classical Bernstein polynomials were introduced by G. M. Phillips [3]. He ha...

In this paper we propose an efficient numerical technique for solving fractional initial value problems. It is based on the Bernstein polynomials. We derive an explicit form for the Bernstein operational matrix of fractional order integration. Numerical results are presented. In order to show the efficiency of the presented method, we compare our results with some operational matrix techniques.