Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynomials, an algorithm for calculating the GCD of an arbitrary collection of univariate polynomials, and an algorithm for computing a μ-basis for the syzygy module of an arbitrary collection of univariate polynomials. Division algorithms for mult...

The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n= 6 or 7 variables. This article describes a polytope (...

in this paper we present a new method for solving fractional optimal control problems with delays in state and control. this method is based upon bernstein polynomial basis and using feedback control. the main advantage of using feedback or closed-loop controls is that they can monitor their effect on the system and modify the output accordingly. in this work, we use bernstein polynomials to tr...

This paper compares the performance and efficiency of different function range interval methods for plotting f(x, y) = 0 on a rectangular region based on a subdivision scheme, where f(x, y) is a polynomial. The solution of this problem has many applications in CAGD. The methods considered are interval arithmetic methods (using the power basis, Bernstein basis, Horner form and centred form), aff...

This paper compares the performance and efficiency of different function range interval methods for plotting f (x, y)= 0 on a rectangular region based on a subdivision scheme, where f (x, y) is a polynomial. The solution of this problem has many applications in CAGD. The methods considered are interval arithmetic methods (using the power basis, Bernstein basis, Horner form and centred form), an...

The purpose of this paper is to establish Lp error estimates, a Bernstein inequality, and inverse theorems for approximation by a space comprising spherical basis functions located at scattered sites on the unit n-sphere. In particular, the Bernstein inequality estimates Lp Bessel-potential Sobolev norms of functions in this space in terms of the minimal separation and the Lp norm of the functi...

The lowest two-sided cell of the extended affine Weyl group We is the set {w ∈ We : w = x · w0 · z, for some x, z ∈ We}, denoted W(ν). We prove that for any w ∈ W(ν), the canonical basis element C w can be expressed as 1 [n]!χλ(Y )C ′ v1w0 C w0v2 , where χλ(Y ) is the character of the irreducible representation of highest weight λ in the Bernstein generators, and v1 and v −1 2 are what we call ...

We construct Jacobi-weighted orthogonal polynomials (α,β,γ) n,r (u,v,w), α,β,γ > −1, α+ β + γ = 0, on the triangular domain T . We show that these polynomials (α,β,γ) n,r (u, v,w) over the triangular domain T satisfy the following properties: (α,β,γ) n,r (u,v,w) ∈ n, n≥ 1, r = 0,1, . . . ,n, and (α,β,γ) n,r (u,v,w) ⊥ (α,β,γ) n,s (u,v,w) for r =s. Hence, (α,β,γ) n,r (u,v,w), n= 0,1,2, . . ., r =...

We constructmultiple representations relative to different bases of the generalized Tschebyscheff polynomials of second kind. Also, we provide an explicit closed from of The generalized Polynomials of degree r less than or equal n in terms of the Bernstein basis of fixed degree n. In addition, we create the change-of-basis matrices between the generalized Tschebyscheff of the second kind polyno...