In this paper, a numerical method for solving LNFODE (Linear Non-homogenous Fractional Ordinary Differential Equation) is presented. The method presented is based on Bernstein polynomials approximation. The operational matrices of integration, differentiation and products are introduced and utilized to reduce the LNFODE problem in order to solve algebraic equations. The method is general, easy ...

In this extended abstract we consider the use of Bernstein polynomials (BPs) for the approximation of distributions and transient probabilities of continuous time Markov chains (CTMCs). We show that while standard BPs are not appropriate to this purpose it is possible to derive from them a family of functions, called in the sequel Bernstein expolynomials (BEs), which enjoys those properties tha...

For Pisot numbers β with irreducible β-polynomial, we prove that the discrepancy function D(N, [0, y)) of the β-adic van der Corput sequence is bounded if and only if the β-expansion of y is finite or its tail is the same as that of the expansion of 1. If β is a Parry number, then we can show that the discrepancy function is unbounded for all intervals of length y 6∈ Q(β). We give explicit form...

A new explicit formula for the integrals of Bernstein polynomials of any degree for any order in terms of Bernstein polynomials themselves is derived. A fast and accurate algorithm is developed for the solution of high even-order boundary value problems (BVPs) with two point boundary conditions but by considering their integrated forms. The Bernstein–Petrov–Galerkinmethod (BPG) is applied to co...

Using the language of Riordan arrays, we define a notion of generalized Bernstein polynomials which are defined as elements of certain Riordan arrays. We characterize the general elements of these arrays, and examine the Hankel transform of the row sums and the first columns of these arrays. We propose conditions under which these Hankel transforms possess the Somos-4 property. We use the gener...

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.

Abstract. Since for q > 1, the q-Bernstein polynomials Bn,q are not positive linear operators on C[0, 1], the investigation of their convergence properties turns out to be much more difficult than that in the case 0 < q < 1. In this paper, new results on the approximation of continuous functions by the q-Bernstein polynomials in the case q > 1 are presented. It is shown that if f ∈ C[0, 1] and ...

Many engineering objects have surfaces that are critical to their performance. Analysis codes are used to design these surfaces for efficient performance. The iterative procedure of design followed by analysis requires the ability to generate and modify such surfaces rapidly. In the work described in the paper, surfaces which blend together bifurcated inlets are generated. A functional blendino...

Ghandmjit L. Bajaj t Department of Computer Science, Purdue University, West Lafayette, IN 47907 In this paper (part one of a trilogy), we introduce the concept of a discriminating family of regular algebraic curves (real, nonsingular and connected). Several discriminating families are obtained by different characterizations of the zero contours of the Bernstein-Bezier (BB) form of bivariate po...

We introduce here a generalization of the modified Bernstein polynomials for Jacobi weights using the q-Bernstein basis proposed by G.M. Phillips to generalize classical Bernstein Polynomials. The function is evaluated at points which are in geometric progression in ]0, 1[. Numerous properties of the modified Bernstein Polynomials are extended to their q-analogues: simultaneous approximation, p...