We show that the size of the 1-norm condition number of the univariate Bernstein basis for polynomials of degree n is O(2n/ √ n). This is consistent with known estimates [3], [5] for p = 2 and p = ∞ and leads to asymptotically correct results for the p-norm condition number of the Bernstein basis for any p with 1 ≤ p ≤ ∞.

Fast and efficient methods of evaluation of the connection coefficients between shifted Jacobi and Bernstein polynomials are proposed. The complexity of the algorithms is O(n), where n denotes the degree of the Bernstein basis. Given results can be helpful in a computer aided geometric design, e.g., in the optimization of some methods of the degree reduction of Bézier curves.

Bernstein polynomials are a classical tool in Computer Aided Design to create smooth maps with a high degree of local control. They are used for the construction of Bézier surfaces, free-form deformations, and many other applications. However, classical Bernstein polynomials are only defined for simplices and parallelepipeds. These can in general not directly capture the shape of arbitrary obje...

We combine recently-developed finite element algorithms based on Bernstein polynomials [1, 14] with the explicit basis construction of the finite element exterior calculus [5] to give a family of algorithms for the Rham complex on simplices that achieves stiffness matrix construction and matrix-free action in optimal complexity. These algorithms are based on realizing the exterior calculus base...

We solve the problem of finding an enclosure for the range of a multivariate polynomial over a rectangular region by expanding the given polynomial into Bernstein polynomials. Then the coefficients of the expansion provide lower and upper bounds for the range and these bounds converge monotonically if the degree of the Bernstein polynomials is elevated. To obtain a faster improvement of the bou...

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.

One of the greatest pleasures in mathematics is the surprising connections that often appear between apparently disconnected ideas and theories. Some particularly striking instances exist in the interaction between probability theory and analysis. One of the simplest is the elegant proof of the Weierstrass approximation theorem by S. Bernstein [2]: on the surface, this states that if f : [0, 1]...

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

We study the existence and shape preserving properties of a generalized Bernstein operator Bn fixing a strictly positive function f0, and a second function f1 such that f1/f0 is strictly increasing, within the framework of extended Chebyshev spaces Un. The first main result gives an inductive criterion for existence: suppose there exists a Bernstein operator Bn : C[a, b] → Un with strictly incr...

Given p polynomials of n variables over a field k of characteristic 0 and a point a ∈ k, we propose an algorithm computing the local Bernstein-Sato ideal at a. Moreover with the same algorithm we compute a constructible stratification of k such that the local Bernstein-Sato ideal is constant along each stratum. Finally, we present non-trivial examples computed with our algorithm.