A new application of Bernstein–Bezoutian matrices, a type of resultant matrices constructed when the polynomials are given in the Bernstein basis, is presented. In particular, the approach to curve implicitization through Sylvester and Bézout resultant matrices and bivariate interpolation in the usual power basis is extended to the case in which the polynomials appearing in the rational paramet...

An alternative approach, known today as the Bernstein polynomials, to Weierstrass uniform approximation theorem was provided by Bernstein. These basis polynomials have attained increasing momentum, especially in operator theory, integral equations and computer-aided geometric design. Motivated improvements of computational disciplines, we propose a new generalization Bernstein–Kantorovich opera...

We prove the right Lax-type inequality on subarcs of the unit circle of the complex plane for complex algebraic polynomials of degree n having no zeros in the open unit disk. This is done by establishing the right Bernstein-Szegő-Videnskii type inequality for real trigonometric polynomials of degree at most n on intervals shorter than the period. The paper is closely related to recent work by B...

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

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

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

A method is investigated by which tight bounds on the range of a multivariate rational function over a box can be computed. The approach relies on the expansion of the numerator and denominator polynomials in Bernstein polynomials. Convergence of the bounds to the range with respect to degree elevation of the Bernstein expansion, to the width of the box and to subdivision are proven and the inc...

In this paper we propose the Bernstein polynomials to achieve the numerical solutions of nonlinear fractional-order chaotic system known by fractional-order Brusselator system. We use operational matrices of fractional integration and multiplication of Bernstein polynomials, which turns the nonlinear fractional-order Brusselator system to a system of algebraic equations. Two illustrative exampl...

In this paper, Bernstein piecewise polynomials are used to solve the integral equations numerically. A matrix formulation is given for a non-singular linear Fredholm Integral Equation by the technique of Galerkin method. In the Galerkin method, the Bernstein polynomials are exploited as the linear combination in the approximations as basis functions. Examples are considered to verify the effect...