Boundary Value Problems

Impact Factor 0.819

Boundary Value Problems Cover Image
Research
Open Access

Unification of the Bernstein-type polynomials and their applications

Boundary Value Problems20132013:56

https://doi.org/10.1186/1687-2770-2013-56

©  Simsek; licensee Springer 2013

Received: 12 November 2012

Accepted: 27 February 2013

Published: 20 March 2013

Abstract

In this paper, we investigate some new identities related to the unification of the Bernstein-type polynomials, Bernoulli polynomials, Euler numbers and Stirling numbers of the second kind. We also give some remarks and applications of the Bernstein-type polynomials related to solving high even-order differential equations by using the Bernstein-Galerkin method. We also give some applications on these polynomials and differential equations.

MSC:11B68, 12D10, 14F10, 26C05, 26C10, 30B40, 30C15, 42A38, 44A10.

Keywords

Bernstein polynomials generating function Bezier curves Laplace transform functional equation high-order differential equations Bernstein-Galerkin method Bernoulli polynomials Bernoulli numbers Euler polynomials Euler numbers Genocchi polynomials Genocchi numbers Stirling numbers of the second kind

1 Introduction

Generating functions play an important role in the investigation of various useful properties of the sequences and differential equations. These functions are also used to find many properties and formulas for the sequences. In [1], the author constructed certain generating functions for the unification of the classical Bernstein polynomials. Using these generating functions, the author derived several interesting and useful identities for these polynomials. The Bernstein polynomials have been defined by many different ways, for example, by q-series, by complex function and by many algorithms. The Bernstein polynomials are used in approximations of functions as well as in other fields such as smoothing in statistics, in numerical analysis, constructing the Bezier curves. The Bernstein polynomials are also used to solve differential equations.

According to Farouki [2], the Bernstein polynomial basis was introduced 100 years ago (Bernstein, 1912) as a means to constructively prove the ability of polynomials to approximate any continuous function, to any desired accuracy, over a prescribed interval. Their slow convergence rate and the lack of digital computers to efficiently construct them caused the Bernstein polynomials to lie dormant in the theory rather than practice of approximation for the better part of a century. The Bernstein coefficients of a polynomial provide valuable insight into its behavior over a given finite interval, yielding many useful properties and elegant algorithms that are now being increasingly adopted in other application domains.

Recently, the author [1] introduced and investigated the following generating functions which use a unification of the classical Bernstein polynomials:
F ( t , b , s : x ) = 2 b x b s ( t 2 ) b s e t ( 1 − x ) ( b s ) ! ,
(1)
where b , s ∈ N 0 : = { 0 , 1 , 2 , 3 , … } , t ∈ C and x ∈ [ 0 , 1 ] . The following function is a generating function of the polynomials S n ( b , s , x )
F ( t , b , s : x ) = ∑ n = 0 ∞ S n ( b , s , x ) t n n ! ,
(2)

where S 0 ( b , s , x ) = ⋯ = S b s − 1 ( b , s , x ) = 0 .

An explicit formula of the polynomials S n ( b , s , x ) is given by the following theorem [1].

Theorem 1.1 Let x ∈ [ 0 , 1 ] . Let b, n and s be nonnegative integers. If n ≥ b s , then we have
S n ( b , s , x ) = ( n b s ) x b s ( 1 − x ) n − b s 2 b ( s − 1 ) .
Remark 1.2 If we set s = 1 in (2), we have
S n ( b , 1 , x ) = B b n ( x ) ,

which denotes the classical Bernstein basis function (cf. [1–7]). Consequently, the polynomials S n ( b , s , x ) are a unification of the Bernstein polynomials.

The remainder of this study is organized as follows.

Section 2: We give many properties of the unification of the Bernstein-type polynomials: partition of unity, alternating sum, subdivision property. We also give many functional equations and differential equations of this generating function. Using these equations, many properties of the unification of the Bernstein-type polynomials can be found. Section 3: Integral representations of the unification of the Bernstein-type polynomials are given. Using these representations, we give an identity. Section 4: By using the Laplace transform, we find some identities of the unification of the Bernstein-type polynomials. Section 5: By using a new generating function, we prove the Marsden identity for the unification of the Bernstein-type polynomials. Section 6: By using generating functions, we give relations between the unification of the Bernstein-type polynomial, the unification of the Bernoulli polynomial of higher order and the Stirling numbers of the second kind. Section 7: By using the unification of the Bernstein-type polynomials and the Bernstein-Galerkin methods, we solve high even-order differential equations. Section 8: We give some remarks on the unification of the Bernstein-type polynomials and Bezier-type curves.

2 Properties of the unification of the Bernstein-type polynomials

In this section, we investigate some properties of the unification of the Bernstein-type polynomials.

2.1 Partition of unity

The unification of the Bernstein-type polynomials S n ( b , s , x ) does not have partition of unity. That is, by using (1), we derive the following functional equation:
∑ s = 0 ∞ F ( t , 1 , s : x ) = 2 e t 2 ( 2 − x ) .
By using the same method as that in [7] and (2), we arrive at the formula for the polynomials S n ( 1 , s , x )
∑ s = 0 n S n ( 1 , s , x ) = 2 1 − n ( 2 − x ) n .
Remark 2.1 The polynomials 2 b ( s − 1 ) S n ( b , s , x ) have partition of unity. That is,
∑ b s = 0 n 2 b ( s − 1 ) S n ( b , s , x ) = 1 .

2.2 Alternating sum

By using (1), we derive the following functional equation which is used to find an alternating sum of the unification of the Bernstein-type polynomials S n ( b , s , x ) :
∑ s = 0 ∞ ( − 1 ) s F ( t , 1 , s : x ) = 2 e t 2 ( 2 − 3 x ) .

By using the same method as that in [7] and (2), we arrive at a formula for the alternating sum of the polynomials S n ( 1 , s , x ) , which is given by the following theorem.

Theorem 2.2
∑ s = 0 n ( − 1 ) s S n ( 1 , s , x ) = 2 1 − n ( 2 − 3 x ) n .

2.3 Subdivision property

Here, we give partial differential equations and a functional equation of the generating function for the unification of the Bernstein-type polynomials S n ( b , s , x ) . By using this functional equation, we derive the subdivision property unification of the Bernstein-type polynomials S n ( b , s , x ) .

We set
F ( t , b , s : y x ) = F ( y t , b , s : x ) e t ( 1 − y ) .
(3)

By using the above functional equation and (2), we derive the subdivision property for the polynomials S n ( b , s , x ) by the following theorem.

Theorem 2.3
S n ( b , s , x y ) = ∑ k = b s n 2 k − 1 S k ( b , s , x ) S n ( 1 , k , y )
or
S n ( b , s , x y ) = ∑ k = b s n S k ( b , s , x ) B k n ( y ) ,
(4)

where B k n ( y ) denotes the classical Bernstein basis function.

Remark 2.4 Substituting s = 1 into (4), we obtain the subdivision property for the classical Bernstein basis functions:
B b n ( x y ) = ∑ k = b n B b k ( x ) B k n ( y ) .
Using (3), we give the following partial differential equations:
∂ ∂ y F ( t , b , s : y x ) = e t ( 1 − y ) ∂ ∂ y F ( y t , b , s : x ) − t F ( y t , b , s : x )
and
∂ ∂ x F ( t , b , s : y x ) = e t ( 1 − y ) ∂ ∂ x F ( y t , b , s : x ) .

By applying these partial differential equations, we obtain the following derivative relations which are related to the subdivision property unification of the Bernstein-type polynomials S n ( b , s , x ) , respectively:

Theorem 2.5
∂ ∂ y S n ( b , s , x y ) = ∑ j = 0 n j B j n ( y ) S j ( b , s , x ) − n y n − 1 S n − 1 ( b , s , x )
and
∂ ∂ x S n ( b , s , x y ) = ∑ j = 0 n B j n ( y ) ∂ ∂ x S j ( b , s , x ) .

3 Integral representations

In this section, we derive integral representations of the unification of the Bernstein-type polynomials S n ( b , s , x ) . We also give an identity which connects the binomial coefficients, gamma and beta functions.

The beta function B ( α , β ) is a function of two complex variables α and β, defined by
B ( α , β ) = ∫ 0 1 t α − 1 ( 1 − t ) β − 1 d t = B ( β , α ) ( ℜ ( α ) > 0 , ℜ ( β ) > 0 )
(5)
(cf. [[8], p.9, Eq. (60)]). The beta function is related to the gamma function; one has
B ( α , β ) = Γ ( α ) Γ ( β ) Γ ( α + β ) .
Replacing α by n ∈ Z + and β by m ∈ Z + in the above equation, we get
B ( α , β ) = Γ ( n ) Γ ( m ) Γ ( n + m ) = ( n − 1 ) ! ( m − 1 ) ! ( n + m − 1 ) !
(6)

(cf. [[8], p.9, Eq. (62)]).

Theorem 3.1
∫ 0 1 S n ( b , s , x ) d x = 2 b ( 1 − s ) ( n b s ) B ( b s + 1 , n − b s + 1 )
(7)
or
∫ 0 1 S n ( b , s , x ) d x = 2 b ( 1 − s ) ( n b s ) ∑ l = 0 n − b s ( − 1 ) n − b s − l ( n − b s l ) 1 n − l + 1 .
(8)
Proof
∫ 0 1 S n ( b , s , x ) d x = 2 b ( 1 − s ) ( n b s ) ∫ 0 1 x b s ( 1 − x ) n − b s d x ,
(9)
where
b s ≤ n .

By using (5), we easily arrive at the desired result. □

Binomial coefficients play an important role in mathematics and mathematical physics, especially in statistics, probability and analytic number theory. Therefore, by using (7) and (8), we derive the following identity related to the binomial coefficients, gamma and beta functions:
∑ l = 0 n − b s ( − 1 ) n − b s − l ( n − b s l ) 1 n − l + 1 = 1 ( n + 1 ) ( n b s ) .

4 Identities

In this section, by using the Laplace transform, we give some identities of the unification of the Bernstein-type polynomials S n ( b , s , x ) .

Using the generating function in (2), we get
e − t ∑ n = 0 ∞ S n ( b s , x ) t n n ! = 2 b x b s ( t 2 ) b s ( b s ) ! e − x t .
(10)
Integrating equation (10) (by parts) with respect to t from zero to infinity, we have
∑ n = 0 ∞ S n ( b , s , x ) n ! ∫ 0 ∞ e − t t n d t = 2 b ( 1 − s ) x b s ( b s ) ! ∫ 0 ∞ t b s e − x t d t .
(11)
If we appropriately use the case x > 0 of the following Laplace transform of the function f ( t ) = t k :
∫ 0 ∞ t k e − u t d t = k ! u k + 1 ,
(12)

by substituting (12) into (11), we arrive at the following theorem.

Theorem 4.1 Let | 1 − x | < 1 . Then we have
∑ n = 0 ∞ x S n ( b , s , x ) = 2 b ( 1 − s ) .
(13)

Remark 4.2 If we set s = 1 in (13), then we arrive at Theorem 15 in [7].

We modify (2) as follows:
e x t ∑ n = 0 ∞ S n ( b , s , x ) t n n ! = 2 b x b s ( t 2 ) b s ( b s ) ! e t .
From the above equation, we get
∑ n = 0 ∞ x n t n n ! ∑ n = 0 ∞ S n ( b , s , x ) t n n ! = 2 b ( 1 − s ) x b s ( b s ) ! ∑ n = 0 ∞ t n + b s n ! .

Therefore, we arrive at the following theorem.

Theorem 4.3
∑ j = 0 n ( n j ) x j S n − j ( b , s , x ) = ( n b s ) 2 b ( 1 − s ) x b s .

5 Marsden identity

In this section, by using generating functions, we prove the Marsden identity for the unification of the Bernstein-type polynomials S n ( b , s , x ) . This identity is associated with a formula for rational linear transformation of B-splines, which are of interest in computer-aided geometric design and approximation theory.

We set
h ( x , u , t ) = ∑ n = 0 ∞ ( x − u ) n t n n !
or
h ( x , u , t ) = e ( x − u ) t .
We derive the following functional equation:
h ( x , u , t ) = h ( 1 , u , x t ) h ( x , 1 , u t ) .
From the above functional equation, we get
∑ n = 0 ∞ ( x − u ) n t n n ! = ( ∑ n = 0 ∞ ( 1 − u ) n x n t n n ! ) ( ∑ n = 0 ∞ ( − 1 ) n ( 1 − x ) n u n t n n ! ) .
Therefore
∑ n = 0 ∞ ( x − u ) n t n n ! = ∑ n = 0 ∞ ( ∑ j = 0 n ( − 1 ) n − j ( n j ) x j ( 1 − x ) n − j u n − j ( 1 − u ) j ) t n n ! .
(14)
From the above equation, we have
∑ n = 0 ∞ ( x − u ) n t n n ! = ∑ n = 0 ∞ ( ∑ j = 0 n ( − 1 ) n − j 2 n − 2 ( n n − j ) S n ( 1 , j , x ) S n ( 1 , n − j , u ) ) t n n ! .
By comparing the coefficients of t n n ! on the both sides of the above equation, we obtain
( x − u ) n 1 n ! = 1 n ! ∑ j = 0 n ( − 1 ) n − j 2 n − 2 ( n n − j ) S n ( 1 , j , x ) S n ( 1 , n − j , u ) .

Therefore, we arrive at the Marsden identity which is given by the following theorem.

Theorem 5.1
( x − u ) n = ∑ j = 0 n ( − 1 ) n − j 2 n − 2 ( n n − j ) S n ( 1 , j , x ) S n ( 1 , n − j , u ) .
Remark 5.2 By using (14), we also obtain the Marsden identity for the classical Bernstein polynomials B j n ( x ) as follows:
( x − u ) n = ∑ j = 0 n ( − 1 ) n − j ( n n − j ) B j n ( x ) B n − j n ( u ) .

6 Relations between the polynomial S n ( b , s , x ) , unification of the Bernoulli polynomial of higher order and Stirling numbers of the second kind

The so-called unification of the Bernoulli, Euler and Genocchi polynomials Y n , β ( x ; k , a , b ) were defined by Ozden [9]. The polynomials Y n , β ( x ; k , a , b ) are defined by means of the following generating function:
f a , b ( x ; t ; k , β ) = 2 1 − k t k e t x β b e t − a b = ∑ n = 0 ∞ Y n , β ( x ; k , a , b ) t n n ! ,
(15)
where k is an integer parameter, a and b are real parameters and β is a complex parameter. Observe that
Y n , β ( 0 ; k , a , b ) = Y n , β ( k , a , b )

(cf. [9, 10]).

The above generating function is related to some special polynomials as follows.

Remark 6.1 Substituting a = b = k = 1 into (15), we have the Apostol-Bernoulli polynomials (cf. [11–13]):
Y n , β ( x ; 1 , 1 , 1 ) = B n ( x , β ) ;
substituting b = 1 , k = 0 and a = − 1 into (15), we have the Apostol-Euler polynomials:
Y n , β ( x ; 0 , − 1 , 1 ) = E n ( x , β ) ;
substituting b = 1 , k = 1 and a = − 1 into (15), we have the Apostol-Genocchi polynomials:
Y n , β ( x ; 1 , − 1 , 1 ) = 1 2 G n ( x , β ) ;
substituting β = b = k = a = 1 into (15), we have
Y n , 1 ( x ; 1 , 1 , 1 ) = B n ( x ) ,
where B n ( x ) denotes the classical Bernoulli polynomials and substituting β = b = k = 1 and a = − 1 into (15), we have
Y n , 1 ( x ; 0 , − 1 , 1 ) = E n ( x ) ,

where E n ( x ) denotes the classical Euler polynomials.

Now, the modification of (15) is given by
( 2 a ) v ( t 2 ) k v e t x ( β a e t − 1 ) v = ∑ n = 0 ∞ Y n , β a ( v ) ( x ; k , 1 , 1 ) t n n ! .
(16)

The following definition provides a natural generalization and unification of λ-Stirling numbers of the second kind, which is defined by Srivastava [12, 13].

Definition 6.2 Let λ ∈ C and v ∈ N 0 . The generalized λ-Stirling type numbers of the second kind S ( n , v ; λ ) are defined by means of the following generating function:
f S , v ( t ; λ ) = ( λ e t − 1 ) v v ! = ∑ n = 0 ∞ S ( n , v ; λ ) t n n ! .
(17)
Remark 6.3 By setting λ = 1 in (17), we get
S ( n , v ) = S ( n , v ; 1 ) ,
where S ( n , v ) denotes the Stirling numbers of the second kind. It is also well known that
x n = ∑ v = 0 n ( x v ) v ! S ( n , v ) ,
(18)
so that
S ( n , 0 ) = δ n , 0 , S ( n , 1 ) = S ( n , n ) = 1 and S ( n , n − 1 ) = ( n 2 ) ,

δ n , 0 being the Kronecker symbol (cf. [8, 12, 14, 15]).

Theorem 6.4 Let b, n and s be nonnegative integers with n ≥ b s . Then we have
2 b ( 1 − s ) a − b ( 1 − x ) n − b s = ∑ j = b s n ( n j ) ( n b s ) S ( j , b s ; β a ) Y n − j , β a ( b s ) ( 1 − x ; k , 1 , 1 ) ,

where Y n , β a ( v ) ( x ; k , 1 , 1 ) and S ( j , b s ; β a ) denote the unification Bernoulli polynomial of higher order and β a -Stirling numbers of the second kind, respectively.

Proof By (2), we have
a b x b s ( ( β a e t − 1 ) b s ( b s ) ! ) ( ( 2 a ) b ( t 2 ) b s e ( 1 − x ) t ( β a e t − 1 ) b s ) = ∑ n = 0 ∞ S n ( b , s , x ) t n n ! .
By using (2), (16) and (17) in the above equation, we have
∑ n = 0 ∞ S n ( b s , x ) t n n ! = a b x b s ( ∑ n = 0 ∞ Y n , β a ( b s ) ( 1 − x ; k , 1 , e ) ) ( ∑ n = 0 ∞ S ( n , b s ; β a ) t n n ! ) .

From the above equation, after some calculation, we find the desired result. □

Theorem 6.5 Let b and n be nonnegative integers with n ≥ b . Then we have
( 1 − x ) n = ∑ m = 0 n ∑ j = 0 b ( n m ) ( b j ) j m E n − m ( b ) ( 1 − x ) ,
(19)

where E n − m ( b ) ( 1 − x ) denotes the Euler polynomials of higher order.

Proof By (2), we have
2 b e ( 1 − x ) t ( e t + 1 e t + 1 ) b = ∑ n = 0 ∞ S n ( b , 0 , x ) t n n ! .
From the above, we have
∑ n = 0 ∞ S n ( b , 0 , x ) t n n ! = e ( 1 − x ) t ( 2 e t + 1 ) b ( e t + 1 ) b = ( ∑ n = 0 ∞ ∑ j = 0 b ( b j ) j n t n n ! ) ( ∑ n = 0 ∞ E n ( b ) ( 1 − x ) t n n ! ) .

By using the Cauchy product in the above, after some calculation, we find the desired result. □

We recall from the work of Gould [[14], Vol. 7, Eq. (2.45)] that
∑ j = 0 b ( b j ) j m = 2 b ∑ j = 0 m 1 2 j ( b j ) B j , j m ,
(20)
where
B j , j m = j ! S ( m , j ) .

By substituting (20) into (19), we arrive at the following result.

Corollary 6.6 The following identity holds true:
S n ( b , 0 , x ) = ∑ m = 0 n ∑ j = 0 m ( n m ) ( b j ) 2 b − j E n − m ( b ) ( 1 − x ) B j , j m .

7 Unification of the Bernstein-type polynomials for solving high even-order differential equations by the Bernstein-Galerkin methods

In [4], Doha et al. gave an application of the Bernstein polynomials for solving high even-order differential equations by using the Bernstein-Galerkin and the Bernstein-Petrov-Galerkin methods. The methods do not contain generating functions for proving explicitly the derivatives formula of the Bernstein polynomials of any degree and for any order in terms of Bernstein polynomials themselves. Here, we prove this formula for the unification of the Bernstein-type polynomials S n ( b , s , x ) by a higher-order partial differential equation and functional equations. We also give some remarks and applications related to these polynomials and the Bernstein-Galerkin method.

We modify (1) as follows:
F ( t , b − k , s − k : x ) = 2 b − k x b s − k ( t 2 ) b s − k e t ( 1 − x ) ( b s − k ) ! = ∑ n = 0 ∞ S n ( b − k , s − k , x ) t n n ! ,
(21)
where k ∈ N 0 = { 0 , 1 , 2 , … } and x ∈ [ 0 , 1 ] . Let b, k, n and s be nonnegative integers and n ≥ b s − k ≥ 0 , then we get
S n ( b − k , s − k , x ) = ( n b s − k ) x b s − k ( 1 − x ) n − b s + k 2 b ( s − 1 ) ,
(22)
so that, obviously,
S n ( b , s , x ) = S n ( b − 0 , s − 0 , x ) .

By using the same method as in [15], we now give a higher-order partial differential equation for the generating function F ( t , b , s : x ) as follows.

We set
g ( t , x ; b , s ) = 2 b x b s ( t 2 ) b s ( b s ) !
and
h ( t , x ) = e t ( 1 − x ) .
We have
F ( t , b , s : x ) = g ( t , x ; b , s ) h ( t , x ) .
By using Leibnitz’s formula for the v th derivative, with respect to x, of the product F ( t , b , s : x ) of the above two functions, we obtain the following higher-order partial differential equation:
∂ v F ( t , b , s : x ) ∂ x v = ∑ j = 0 v ( v j ) ( ∂ j g ( t , x ; b , s ) ∂ x j ) ( ∂ v − j h ( t , x ) ∂ x v − j ) .
By using (1) in the above partial differential equation, we get the following higher order partial differential equation:
∂ v F ( t , b , s : x ) ∂ x v = ∑ j = 0 v ( − 1 ) v − j ( v j ) F ( t , b − j , s − j : x ) .

By substituting (21) into the above equation, after some calculation, we arrive at the following theorem.

Theorem 7.1 Let x ∈ [ a , b ] . Let b, s and v be nonnegative integers with n ≥ b s . Then we have
S n ( v ) ( b , s , x ) = n ! ( n − v ) ! ∑ j = 0 v ( − 1 ) v − j ( v j ) S n − v ( b − j , s − j , x ) ,
where
S n ( v ) ( b , s , x ) = d v S n ( b , s , x ) d x v .
Integrating equation (22) (by parts) with respect to x from 0 to 1 and using Theorem 3.1, we have
∫ 0 1 S n ( b , s , x ) d x = 2 b ( 1 − s ) n + 1 ,
for all b and s.
∫ 0 1 S n ( v ) ( b , s , x ) S n ( b , s , x ) d x = 2 2 b ( 1 − s ) n ! ( 2 n + 1 ) ( n − v ) ! ( n b s ) ∑ j = 0 v ( − 1 ) v − j ( v j ) ( n b s − j ) ( 2 n 2 b s − j ) .
(23)
We recall from the work of Doha et al. [4] that if f ( x ) is a differentiable function of degree m and defined on [ 0 , 1 ] , then a linear combination of the Bernstein polynomials can be written. Therefore, we can easily have
f ( x ) = ∑ b , s = 0 m c b , s , m S m ( b , s , x ) ,
where b s ≤ m , otherwise S m ( b , s , x ) = 0 and
∑ b , s = 0 m = ∑ b = 0 m ∑ s = 0 m .
By using the same method as in [4], we write
f ( v ) ( x ) = d v f ( x ) d x v = ∑ b , s = 0 m c b , s , m d v S m ( b , s , x ) d x v ,
where b s ≤ m , otherwise S m ( b , s , x ) = 0 . We now give an application for the solution of high even-order differential equations. We also recall from the work of Doha et al. [4] that for x ∈ [ 0 , 1 ] ,
f ( x ) = u ( 2 m ) + ∑ j = 1 2 m − 1 γ j u ( j ) + γ 0 u
(24)
by the following boundary conditions:
u ( v ) ( 0 ) = 0 , u ( v ) ( 1 ) = 0 ; 0 ≤ v ≤ m − 1
(cf. [4]). By using the same method as that of Doha et al. [4], we apply the unification of the Bernstein-type polynomials S m ( b , s , x ) to the Bernstein-Galerkin approximation for solving (24); that is,
Y m = { S m ( b , s , x ) : m ≥ b s }
and
Z m = { u ∈ Y m : u ( v ) ( 0 ) = 0 , u ( v ) ( 1 ) = 0 ; 0 ≤ v ≤ m − 1 } .

By applying the Bernstein-Galerkin approximation (24), we find u m ∈ Z m as follows. For solving this equation, we need the following notations, which we recall from the work of Doha et al. [[4], p.9, Eq. (4.4)].

The inner product 〈 u , v 〉 on L 2 ( I ) is defined by
〈 u , v 〉 = ∫ I u ( x ) v ( x ) d x .
By using this inner product, we modify (24) as follows:
〈 f ( x ) , g n ( k , x ) 〉 = 〈 u n ( 2 m ) , g n ( k , x ) 〉 + ∑ j = 1 2 m − 1 γ j 〈 u n ( j ) , g n ( k , x ) 〉 + γ 0 〈 u n , g n ( k , x ) 〉 ,
(25)
where m ≤ k ≤ n − m , 2 m ≤ n and
g n ( k , x ) = S n ( b + k , s + k , x ) = ( n b s + k ) x b s + k ( 1 − x ) n − b s − k 2 b ( s − 1 ) .
The matrix representation of the above equation is given by
F = ( A + ∑ j = 1 2 m − 1 γ j B j + γ 0 B 0 ) C ,
where
By using (23), one can easily find A, B j ( j = 0 , 1 , 2 , … , 2 m − 1 ); that is,
a k j = 〈 g n ( 2 m ) ( j , x ) , g n ( k , x ) 〉 = ∫ 0 1 g n ( 2 m ) ( j , x ) g n ( k , x ) d x
and
b k j i = 〈 g n ( i ) ( j , x ) , g n ( k , x ) 〉 = ∫ 0 1 g n ( i ) ( j , x ) g n ( k , x ) d x .
Remark 7.2 According to Doha et al. [4], it is important to apply the Galerkin-spectral Bernstein approximation for how to choose an appropriate basis for Z m such that the linear system resulting in the Bernstein-Galerkin approximation to (25) is possible. That is,
Z m = span { g n ( m , x ) , g n ( m + 1 , x ) , … , g n ( n − m , x ) } ,

where g n ( k , x ) ∈ Z m for all m ≤ k ≤ n − m . The 2m boundary conditions lead to the first m, and the least m expansion coefficients are zero.

Remark 7.3 By using the Bernstein-Galerkin and the Bernstein-Petrov-Galerkin methods, Doha et al. [4] solved the following boundary value problem:
u ( 2 ) ( x ) − u ( x ) = ( 4 − 2 x 2 ) sin x + 4 x cos x , x ∈ [ 0 , 1 ] ,
subject to the boundary conditions u ( 0 ) = u ( 1 ) = 0 , with the exact solution
u ( x ) = ( 1 − x 2 ) sin x

(cf. see for detail [4, 16]).

8 Further remarks on Bezier curves

The unification of the Bernstein-type polynomials is used to construct Bezier-type curves which are used in computer-aided graphics design and related fields and also in the time domain, particularly in animation and interface design (cf. [2, 6]).

The Bezier-type curve of degree n can be generalized by the author [1] as follows:
B n ( b , s , x ) = ∑ 0 ≤ b , s ≤ n ( b s ≤ n ) P b , s S n ( b , s , x ) ,
(26)

where x ∈ [ 0 , 1 ] , S n ( b , s , x ) denotes the unification of the Bernstein-type polynomials and P b , s are the control points.

The unification of the Bernstein-type polynomials might affect the shape of the curves.

Author’s contributions

The author completed the paper himself. The author read and approved the final manuscript.

Declarations

Acknowledgements

Dedicated to Professor Hari M Srivastava.

The present investigation was supported by the Scientific Research Project Administration of Akdeniz University.

Authors’ Affiliations

(1)
Department of Mathematics, Faculty of Science, University of Akdeniz

References

  1. Simsek Y: Construction a new generating function of Bernstein-type polynomials. Appl. Math. Comput. 2011, 218: 1072-1076. 10.1016/j.amc.2011.01.074MathSciNetView ArticleGoogle Scholar
  2. Farouki RT: The Bernstein polynomials basis: a centennial retrospective. Comput. Aided Geom. Des. 2012, 29: 379-419. 10.1016/j.cagd.2012.03.001MathSciNetView ArticleGoogle Scholar
  3. Bernstein SN: Démonstration du théorème de Weierstrass fondée sur la calcul des probabilités. Commun. Soc. Math. Kharkov, Sér. 2 1912-1913, 13: 1-2.Google Scholar
  4. Doha EH, Bhrawy AH, Saker MA: On the derivatives of Bernstein polynomials: an application for the solution of high even-order differential equations. Bound. Value Probl. 2011., 2011: Article ID 829543. doi:10.1155/2011/829543Google Scholar
  5. Phillips GM CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC 14. In Interpolation and Approximation by Polynomials. Springer, New York; 2003.View ArticleGoogle Scholar
  6. Simsek, Y: Generating functions for the Bernstein-type polynomials: a new approach to deriving identities and applications for these polynomials. Hacet. J. Math. Stat. (in press)Google Scholar
  7. Simsek Y: Functional equations from generating functions: a novel approach to deriving identities for the Bernstein basis functions. Fixed Point Theory Appl. 2013., 2013: Article ID 80Google Scholar
  8. Srivastava HM, Choi J: Series Associated with the Zeta and Related Functions. Kluwer Academic, Dordrecht; 2001.View ArticleGoogle Scholar
  9. Ozden H: Unification of generating function of the Bernoulli, Euler and Genocchi numbers and polynomials. AIP Conf. Proc. 2010, 1281: 1125-1128.View ArticleGoogle Scholar
  10. Ozden H, Simsek Y, Srivastava HM: A unified presentation of the generating functions of the generalized Bernoulli, Euler and Genocchi polynomials. Comput. Math. Appl. 2010, 60: 2779-2787. 10.1016/j.camwa.2010.09.031MathSciNetView ArticleGoogle Scholar
  11. Kim YH, Kim W, Jang LC: On the q -extension of Apostol-Euler numbers and polynomials. Abstr. Appl. Anal. 2008., 2008: Article ID 296159Google Scholar
  12. Luo QM, Srivastava HM: Some generalizations of the Apostol-Genocchi polynomials and the Stirling numbers of the second kind. Appl. Math. Comput. 2011, 217: 5702-5728. 10.1016/j.amc.2010.12.048MathSciNetView ArticleGoogle Scholar
  13. Srivastava HM: Some generalizations and basic (or q -) extensions of the Bernoulli, Euler and Genocchi polynomials. Appl. Math. Inf. Sci. 2011, 5: 390-444.MathSciNetGoogle Scholar
  14. Gould, HW: http://www.math.wvu.edu/~gould/Vol.7.PDF
  15. Simsek Y: On q -deformed Stirling numbers. Int. J. Math. Comput. 2012, 15: 70-80.MathSciNetGoogle Scholar
  16. Ramadan MA, Lashien IF, Zahra WK: High order accuracy nonpolynomial spline solutions for 2 μ th order two point boundary value problems. Appl. Math. Comput. 2008, 204: 920-927. 10.1016/j.amc.2008.07.038MathSciNetView ArticleGoogle Scholar

Copyright

© Simsek; licensee Springer 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.