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.

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