A Bernstein-Bézier basis is developed for H(div)-conforming finite elements that gives a clear separation between the curls of the Bernstein basis for the polynomial discretisation of the space H1, and the non-curls that characterize the specific H(div) finite element space (Raviart-Thomas in our case). The resulting basis has two distinct components reflecting this separation with the basis fu...

The problem of minimizing a polynomial over the standard simplex is one of the basic NP-hard nonlinear optimization problems — it contains the maximum clique problem in graphs as a special case. It is known that the problem allows a polynomial-time approximation scheme (PTAS) for polynomials of fixed degree, which is based on polynomial evaluations at the points of a sequence of regular grids. ...

Let Q ∈ C[x1, . . . , xn] be a homogeneous polynomial of degree k > 0. We establish a connection between the Bernstein-Sato polynomial bQ(s) and the degrees of the generators for the top cohomology of the associated Milnor fiber. In particular, the integer uQ = max{i ∈ Z : bQ(−(i+n)/k) = 0} bounds the top degree (as differential form) of the elements in H DR (Q(1), C). The link is provided by t...

In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial solutions in the Bernstein form using least squares approximation combined with some properties of dual Bernstein polynomials which guarantee high efficiency of our approach. The method can deal with both linear and nonlinear differential equations. More...

In this survey paper we give a short account on characterizations for very classical orthogonal polynomials via extremal problems and the corresponding inequalities. Beside the basic properties of the classical orthogonal polynomials we consider polynomial inequalities of Landau and Kolmogoroff type, some weighted polynomial inequalities in L2-norm of Markov-Bernstein type, as well as the corre...

Many weighted polynomial inequalities, such as the Bernstein, Marcinkiewicz, Schur, Remez, Nikolskii inequalities, with doubling weights were proved by Mastroianni and Totik for the case [Formula: see text], and by Tamás Erdélyi for [Formula: see text]. In this paper we extend such polynomial inequalities to those for generalized trigonometric polynomials. We also prove the large sieve for gene...