1. Introduction

In the last four decades after the integral modification of Bernstein polynomials by Durrmeyer, several new Durrmeyer-type operators were introduced and their approximation properties were discussed. In 2007, Gupta et al. [1]proposed a family of linear positive operators as

B n ( f , x ) = 1 ( n + 1 ) k = 1 b n , k ( x ) 0 b n , k ( t ) f ( t ) d t , x [ 0 , ) ,
(1.1)

where

b n , k ( t ) = 1 B ( k , n + 1 ) t k - 1 ( 1 + t ) - n - k - 1 ,

for fC γ [0, ), where C γ [0, ), γ > 0 be the class of all continuous functions defined on [0, ) satisfying the growth condition |f (t)|Ctγ, C > 0 and B(k, n + 1) is beta function. They [1] established the direct and inverse results for these operators.

In the recent years, q-calculus was used in approximation theory and several new operators were introduced and their approximation properties were discussed (see [26], etc.). Motivated by these operators, we now introduce the q-analogue of (1.1). For fC[0,∞) and 0 < q < 1, we propose the q-Beta operators as

B n q ( f , x ) = 1 [ n + 1 ] q k = 1 b n , k q ( x ) 0 / A b n , k q ( t ) f ( t ) d q t , x [ 0 , ) ,
(1.2)

where

b n , k q ( t ) = q ( k - 1 ) 2 / 2 B q ( k , n + 1 ) t k - 1 ( 1 + t ) q - n - k - 1 ,

and B q (t, s) denote the q-Beta function [7] is given by

B q ( t , s ) = K ( A , t ) 0 / A x t - 1 ( 1 + x ) q t + s d q x ,

where K ( x , t ) = 1 1 + x x t ( 1 + 1 / x ) q t ( 1 + x ) q 1 - t . In particular, for any positive integer n, K ( x , n ) = q n ( n - 1 ) 2 , K(x,0) = 1, B q ( t , s ) = Γ q ( t ) Γ q ( s ) Γ q ( t + s ) and ( a + b ) q n = s = 0 n - 1 ( a + q s b ) , n ∈ ℕ, a, b ∈ ℝ.

This article is the extension of the earlier work of [1]. Here, we consider the q variant of the operators discussed in [1] and obtain the recurrence relations for moments. We also obtain some direct results for the q operators, which also include the asymptotic formula. In the end, we establish the conditions for better approximation.

2. Preliminaries

To make the article self-content, here we mention certain basic definitions of q-calculus, details can be found in [8, 9] and the other recent articles. For each nonnegative integer k, the q-integer [k] q and the q-factorial [k] q ! are, respectively, defined by

[ k ] q = ( 1 - q k ) / ( 1 - q ) , q 1 k , q = 1 ,

and

[ k ] q ! = [ k ] q [ k - 1 ] q [ 1 ] q , k 1 1 k = 0 .

For the integers n, k satisfying nk ≥ 0, the q-binomial coecients are defined by

n k q = [ n ] q ! [ k ] q ! [ n - k ] q ! .

The q-derivative of a function f: is defined by

D q f ( x ) = f ( x ) - f ( q x ) ( 1 - q ) x ,x0,

and the q-improper integral (see [10]) is given by

0 / A f ( t ) d q t = ( 1 - q ) j = - f ( q j / A ) ( q j / A ) , A > 0 .

The q-integral by parts is given by

b a f ( t ) D q ( g ( t ) ) d q t = [ f ( t ) g ( t ) ] a b - a b g ( q t ) D q ( f ( t ) ) d q t .

Lemma 1. For n, k ≥ 0, we have

D q ( 1 + x ) q n + k + 1 = [ n + k + 1 ] q ( 1 + q x ) q n + k ,
(2.1)
D q 1 ( 1 + x ) q n + k + 1 = - [ n + k + 1 ] q ( 1 + x ) q n + k + 2 .
(2.2)

Proof. Using q-derivative operator, we can write

D q ( 1 + x ) q n + k + 1 = 1 ( q 1 ) x ( j = 0 n + k ( 1 + q j + 1 x ) j = 0 n + k ( 1 + q j x ) ) = ( q n + k + 1 1 ) ( q 1 ) j = 0 n + k 1 ( 1 + q j + 1 x ) = [ n + k + 1 ] q ( 1 + q x ) q n + k .

Equation (2.2) can be obtained directly by using q-quotient rule as follows:

D q ( 1 ( 1 + x ) q n + k + 1 ) = [ n + k + 1 ] q ( 1 + q x ) q n + k ( 1 + x ) q n + k + 1 ( 1 + q x ) q n + k + 1 = [ n + k + 1 ] q ( 1 + x ) q n + k + 1 ( 1 + q n + k + 1 x ) = [ n + k + 1 ] q ( 1 + x ) q n + k + 2 .

Remark 1. By using (2.1) and D q xk− 1= [k − 1] q xk− 2, we get

D q ( x k 1 ( 1 + x ) q n + k + 1 ) = ( 1 + x ) q n + k + 1 [ k 1 ] q x k 2 x k 1 [ n + k + 1 ] q ( 1 + q x ) q n + k ( 1 + x ) q n + k + 1 ( 1 + q x ) q n + k + 1 = [ k 1 ] q x k 2 ( 1 + q x ) q n + k + 1 [ n + k + 1 ] q x k 1 ( 1 + q n + k + 1 x ) ( 1 + x ) q n + k + 1 = x k 1 x ( 1 + x ) ( 1 + q x ) q n + k + 1 [ ( 1 + x ) [ k 1 ] q x [ n + k + 1 ] q ] = x k 1 x ( 1 + x ) ( 1 + q x ) q n + k + 1 [ [ k 1 ] q q k 1 [ n + 2 ] q x ] .

Hence, we obtain

x ( 1 + x ) D q x k - 1 ( 1 + x ) q n + k + 1 = x k - 1 ( 1 + q x ) q n + k + 1 ( [ k - 1 ] q - q k - 1 [ n + 2 ] q x ) .
(2.3)

Lemma 2. We have following equalities

q x ( 1 + x ) D q ( b n , k q ( x ) ) = [ n + 2 ] q b n , k q ( q x ) [ k - 1 ] q q k - 2 [ n + 2 ] q - q x ,
(2.4)
t q 1 + t q D q b n , k q t q = [ n + 2 ] q q 2 b n , k q ( t ) [ k - 1 ] q q k - 2 [ n + 2 ] q - t .
(2.5)

Proof. Above equalities can be obtained by direct computations using definition of operator and (2.3). □

Theorem 1. If mth (m > 0, m ∈ ℕ)-order moment of operator (1.2) is defined as

B n , m q ( x ) : = B n q ( t m , x ) = 1 [ n + 1 ] q k = 1 b n , k q ( x ) 0 / A b n , k q ( t ) t m d q t , x [ 0 , ) ,

then B n , 0 q ( x ) =1 and for n> m, we have following recurrence relation,

( [ n + 2 ] q - [ m + 2 ] q ) B n , m + 1 q ( q x ) = q ( [ m + 1 ] q + x [ n + 2 ] q ) B n , m q ( q x ) + q x ( 1 + x ) D q ( B n , m q ( x ) ) .
(2.6)

Proof. By using (2.4), we have

q x ( 1 + x ) D q ( B n , m q ( x ) ) = 1 [ n + 1 ] q k = 1 q x ( 1 + x ) D q b n , k q ( x ) 0 / A b n , k q ( t ) t m d q t = [ n + 2 ] q [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A ( [ k 1 ] q q k 2 [ n + 2 ] q t ) b n , k q ( t ) t m d q t + [ n + 2 ] q [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A b n , k q ( t ) t m + 1 d q t q x [ n + 2 ] q [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A b n , k q ( t ) t m d q t = I + [ n + 2 ] q B n , m + 1 q ( q x ) q x [ n + 2 ] q B n , m q ( q x ) ,

by (2.5) and q-integration by parts, we get

I = 1 [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A ( q t m + 1 + t m + 2 ) D q b n , k q ( t / q ) d q t = - 1 [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A ( q [ m + 1 ] q t m + [ m + 2 ] q t m + 1 ) b n , k q ( t ) d q t = - [ m + 1 ] q q B n , m q ( q x ) - [ m + 2 ] q B n , m + 1 q ( q x ) ,

by combining above two equations, we can write

q x ( 1 + x ) D q ( B n , m q ( x ) ) = - [ m + 1 ] q q B n , m q ( q x ) - [ m + 2 ] q B n , m + 1 q ( q x ) + [ n + 2 ] q B n , m + 1 q ( q x ) - q x [ n + 2 ] q B n , m q ( q x ) = ( [ n + 2 ] q - [ m + 2 ] q ) B n , m + 1 q ( q x ) - q ( [ m + 1 ] q + x [ n + 2 ] q ) B n , m q ( q x ) .

Hence, the result follows. □

Corollary 2. We have

B n , 1 q ( x ) = ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) ,
(2.7)
B n , 2 q ( x ) = ( q [ 2 ] q + x [ n + 2 ] q ) ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) ( [ n + 2 ] q - [ 3 ] q ) + x ( q + x ) [ n + 2 ] q q ( [ n + 2 ] q - [ 2 ] q ) ( [ n + 2 ] q - [ 3 ] q )
(2.8)

Corollary 3. If we denote central moments by ϕ n , m q ( x ) = B n q ( ( t - x ) m , x ) , m = 1,2, then we have

ϕ n , 1 q ( x ) = ( q + x [ 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) ,
(2.9)
ϕ n , 2 q ( x ) = x 2 1 + q 3 q [ n + 2 ] q + [ 2 ] q [ 3 ] q + x ( ( q 2 + 1 ) [ n + 2 ] q + 2 q [ 3 ] q ) + q 2 [ 2 ] q ( [ n + 2 ] q - [ 2 ] q ) ( [ n + 2 ] q - [ 3 ] q )
(2.10)

Remark 2. As a special case when q → 1-, we have

B n , 1 ( x ) = ( 2 + n ) x + 1 n , B n , 2 ( x ) = ( n + 3 ) ( n + 2 ) n ( n - 1 ) x 2 + 4 ( n + 2 ) n ( n - 1 ) x + 2 n ( n - 1 ) .

The first two central moments for q → 1 are

B n ( ( t - x ) , x ) = 2 x + 1 n , B n ( ( t - x ) 2 , x ) = x ( 1 + x ) ( 2 n + 10 ) + 2 n ( n - 1 ) .

which are the moments obtained by Gupta et al. [1] for Beta operator.

3. Ordinary approximation

Let C B [0, ) be the space of all real valued continuous bounded function f on [0, ) endowed with the norm || f || = sup{|f(x)| : x ∈ [0, )}. Further let us consider the following K-functional:

K 2 ( f , δ ) = inf g W 2 { | | f - g | | + δ | | g | | } ,

where δ > 0 and

W 2 = { g C B [ 0 , ) : g , g C B [ 0 , ) } .

From [11], there exist an absolute constant C > 0 such that

K 2 ( f , δ ) C ω 2 ( f , δ 1 / 2 ) ,
(3.1)

where

ω 2 ( f , δ 1 / 2 ) = sup 0 < h δ sup x [ 0 , ) | f ( x + 2 h ) - 2 f ( x + h ) + f ( x ) |

is the second-order modulus of smoothness of fC B [0, ). By

ω ( f , δ ) = sup 0 < h δ sup x [ 0 , ) | f ( x + h ) - f ( x ) |

we denote the usual modulus of continuity of fC B [0, ).

Theorem 4. Let 0 < q < 1, we have

| B n q ( f , x ) f ( x ) | C ω 2 ( f , ϕ n , 2 q ( x ) + ϕ n , 1 q 2 ( x ) ) + ω ( f , ϕ n , 1 q ( x ) )

for every x ∈ [0, ) and fC B [0, ), where C is a positive constant.

Proof. We consider modified operators B n q ¯ defined by

B ¯ n q ( f , x ) = B n q ( f , x ) - f q + [ n + 2 ] q x [ n + 2 ] q - [ 2 ] q + f ( x ) ,
(3.2)

x ∈ [0, ). The operators B ¯ n q preserve the linear functions:

B ¯ n q ( t - x , x ) =0
(3.3)

Let gW2 and t ∈ [0, ). Using Taylor's expansion, we have

g ( t ) = g ( x ) - g ( x ) ( t - x ) + x t ( t - u ) g ( u ) d u ,

and (3.3), we have

B ̄ n q ( g , x ) = g ( x ) + B ¯ n q x t ( t - u ) g ( u ) d u , x .

Therefore, from (3.2), we have

| B ̄ n q ( g , x ) - g ( x ) | B n q x t ( t - u ) g ( u ) d u , x + x q + [ n + 2 ] q x [ n + 2 ] q - [ 2 ] q q + [ n + 2 ] q x [ n + 2 ] q - [ 2 ] q - u g ( u ) d u B n q x t | t - u | | g ( u ) | d u , x + x q + [ n + 2 ] q x [ n + 2 ] q - [ 2 ] q q + [ n + 2 ] q x [ n + 2 ] q - [ 2 ] q - u | g ( u ) | d u B n q ( ( t - x ) 2 , x ) + q + [ 2 ] q x [ n + 2 ] q - [ 2 ] q | | g | | .
(3.4)

From Corollary 3, we get

| B ¯ n q ( g , x ) - g ( x ) | ϕ n , 2 q ( x ) + ϕ n , 1 q 2 ( x ) | | g | | .
(3.5)

By (3.2) and Corollary 1, we have

| B ¯ n q ( f , x ) | | B n q ( f , x ) | + 2 | | f | | | | f | | B n q ( 1 , x ) + 2 | | f | | 3 | | f | | .
(3.6)

Now using (3.2), (3.5), and (3.6), we obtain

| B n , q ( f , x ) - f ( x ) | | B ¯ n q ( f - g , x ) - ( f - g ) ( x ) | + | B ¯ n q ( g , x ) - g ( x ) | + f q + [ n + 2 ] q x [ n + 2 ] q - [ 2 ] q - f ( x ) 4 | | f - g | | + ( ϕ n , 2 q ( x ) + ϕ n , 1 q 2 ( x ) ) | | g | | + f q + [ n + 2 ] q x [ n + 2 ] q - [ 2 ] q - f ( x ) .

Thus taking infimum on the right-hand side over all gW2, we get

| B n q ( f , x ) - f ( x ) | 4 K 2 f , ϕ n , 2 q ( x ) + ϕ n , 1 q 2 ( x ) + ω ( f , ϕ n , 1 q ( x ) ) .

In the view of (3.1), we get

| B n q ( f , x ) - f ( x ) | C ω 2 f , ϕ n 2 q ( x ) + ϕ n 1 q 2 ( x ) + ω ( f , ϕ n , 1 q ( x ) ) .

This completes the proof of the theorem. □

4. Weighted approximation

Here, we give weighted approximation theorem for the operator B n q ( f , x ) . Similar type of results are given in [3].

Let B x 2 [ 0 , ) be the set of all functions f defined on the interval [0, ) satisfying the condition

|f ( x ) | M f ( 1 + x 2 ) ,

where M f is a constant depending on f. B x 2 [ 0 , ) is a normed space with the norm

f x 2 = sup x [ 0 , ) | f ( x ) | 1 + x 2 , f B x 2 [ 0 , ) .

C x 2 [ 0 , ) denotes the subspace of all continuous functions in B x 2 [ 0 , ) and C x 2 * [ 0 , ) denotes the subspace of all functions f C x 2 [ 0 , ) with lim x f ( x ) 1 + x 2 =k.

Theorem 5. Let q = q n ∈ (0, 1) such that q n 1 as n → ∞, then for each f C x 2 * [ 0 , ) , we have

l i m n B n q n ( f , x ) - f ( x ) x 2 = 0 .
(4.1)

Proof. By the Korovkin's theorem (see [12]), B n q n ( f , x ) converges to f uniformly as n → ∞ for f C x 2 * [ 0 , ) if it satisfies B n q n ( t i ; x ) x i for i = 0, 1, 2 uniformly as n → ∞.

As, B n q n ( 1 , x ) = 1 ,

|| B n q n ( 1 , x ) -1| | x 2 =0.
(4.2)

By Corollary 2, for n > 1,

| | B n q n ( t , x ) - x | | x 2 = sup x [ 0 , ) | B n q n ( t , x ) - x | 1 + x 2 q n ( [ n + 2 ] q n - [ 2 ] q n ) + [ n + 2 ] q n ( [ n + 2 ] q n - [ 2 ] q n ) sup x [ 0 , ) x 1 + x 2 q n ( [ n + 2 ] q n - [ 2 ] q n ) + [ n + 2 ] q n ( [ n + 2 ] q n - [ 2 ] q n ) ,

as n → ∞, we get

| | B n q n ( t , x ) - f ( x ) | | x 2 0 .
(4.3)

Similarly for n > 1, we have

B n q n ( t 2 , x ) x 2 x 2 = sup x [ 0 , ) | B n q n ( t 2 , x ) x 2 | 1 + x 2 [ n + 2 ] q n 2 + [ n + 2 ] q n / q n ( [ n + 2 ] q n [ 2 ] q n ) ( [ n + 2 ] q n [ 3 ] q n ) sup x [ 0 , ) x 2 1 + x 2 + ( 1 + q n + q n [ 2 ] q n ( [ n + 2 ] q n [ 2 ] q n ) ( [ n + 2 ] q n [ 3 ] q n ) sup x [ 0 , ) x 1 + x 2 + q n 2 [ 2 ] q n ( [ n + 2 ] q n [ 2 ] q n ) ( [ n + 2 ] q n ) [ n + 2 ] q n 2 + [ n + 2 ] q n / q n ( [ n + 2 ] q n [ 2 ] q n ) ( [ n + 2 ] q n [ 3 ] q n ) + ( 1 + q n + q n [ 2 ] q n ( [ n + 2 ] q n [ 2 ] q n ) ( [ n + 2 ] q n [ 3 ] q n ) + q n 2 [ 2 ] q n ( [ n + 2 ] q n [ 2 ] q n ) ( [ n + 2 ] q n [ 3 ] q n ) ,

as n → ∞, we get

| | B n q n ( t 2 , x ) - x 2 | | x 2 0 .
(4.4)

By (4.2), (4.3), (4.4), and Korovkin's theorem, we get the desired result. □

Theorem 6. Let q = q n ∈ (0, 1) such that q n 1 as n → ∞, then for each f C x 2 [ 0 , ) and α> 0, we have

l i m n sup x [ 0 , ) | B n q n ( f , x ) - f ( x ) | ( 1 + x 2 ) α + 1 = 0 .
(4.5)

Proof. For any fixed x0 > 0, we have

sup x [ 0 , ) | B n q n ( f , x ) - f ( x ) | ( 1 + x 2 ) α + 1 sup x x 0 | B n q n ( f , x ) - f ( x ) | ( 1 + x 2 ) α + 1 + sup x x 0 | B n q n ( f , x ) - f ( x ) | ( 1 + x 2 ) α + 1 | | B n q n ( f , x ) - f ( x ) | | C [ 0 , x 0 ] + | | f | | sup x x 0 | B n q n ( 1 + t 2 , x ) | ( 1 + x 2 ) α + 1 + sup x x 0 | f ( x ) | ( 1 + x 2 ) α + 1 .

By Theorem 5 and Corollary 2 first two terms of above inequality tends to 0 as n → ∞. Last term of inequality can be made small enough for large x0 > 0. This completes the proof.

5. Central moments and asymptotic formula

In this section, we observe that it is not possible to estimate recurrence formula B n q ( ( t - x ) m , x ) in q calculus, there may be some techniques, but at the moment it can be considered as an open problem. Here we establish the recurrence relation for the central moments and obtain asymptotic formula.

Lemma 3. If we de ne the central moments as

T n , m ( x ) = B n q ( ( t - x ) q m , x ) = 1 [ n + 1 ] q k = 1 b n , k q ( x ) 0 / A b n , k q ( t ) ( t - x ) q m d q t , x [ 0 , ) ,

then

T n , 0 ( x ) = 1 , T n , 1 ( x ) = ( q + x [ 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) , T n , 2 ( x ) = ( q [ 2 ] q + x [ n + 2 ] q ) ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) ( [ n + 2 ] q - [ 3 ] q ) + x ( q + x ) [ n + 2 ] q q ( [ n + 2 ] q - [ 2 ] q ) ( [ n + 2 ] q - [ 3 ] q ) - ( q x + x ) ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) + q x 2 .

and for n > m, we have the following recurrence relation:

[ n + 2 ] q - [ m + 2 ] q T n , m + 1 ( q x ) = q x ( 1 + x ) D q T n , m ( x ) + [ m ] q T n , m - 1 ( q x ) + [ 3 ] q q m x + q - x [ m + 1 ] q T n , m ( q x ) + [ 2 ] q q m x [ 3 ] q q m x + q - x - [ 3 ] q q 2 m + 1 x 2 - q x [ m ] q T n , m - 1 ( q x ) + q m x [ 2 ] q q m x [ 3 ] q q m x + q - x - [ 3 ] q q 2 m + 1 x 2 - q x + q 2 m + 1 x 2 q 2 x - [ 3 ] q q m x - q + x [ m - 1 ] q T n , m - 2 ( q x ) + x ( 1 - q m + 1 ) [ n + 2 ] q T n , m ( q x ) + q x ( 1 - q m - 1 ) [ n + 2 ] q T n , m ( q x ) - q x 2 ( 1 - q m - 1 ) ( 1 - q m ) [ n + 2 ] q T n , m - 1 ( q x ) .

proof. Using the identity

q x ( 1 + x ) D q [ b n , k q ( x ) ] = [ k - 1 ] q q k - 2 [ n + 2 ] q - q x [ n + 2 ] q b n , k q ( q x )

and q derivatives of product rule, we have

q x ( 1 + x ) D q [ T n , m ] = 1 [ n + 1 ] q k = 1 q x ( 1 + x ) D q ( b n , k q ( x ) ) 0 / A b n , k q ( t ) ( t - x ) q m d q t - [ m ] q [ n + 1 ] q k = 1 q x ( 1 + x ) b n , k q ( q x ) 0 / A b n , k q ( t ) ( t - q x ) q m - 1 d q t

Thus

E : = q x ( 1 + x ) D q ( T n , m ( x ) ) + [ m ] q T n , m - 1 ( q x ) = 1 [ n + 1 ] q k = 1 q x ( 1 + x ) D q ( b n , k q ( x ) ) 0 / A b n , k q ( t ) ( t - x ) q m d q t = [ n + 2 ] q [ n + 1 ] q k = 1 b n , k q ( q x ) [ k - 1 ] q q k - 2 [ n + 2 ] q - q x 0 / A b n , k q ( t ) ( t - x ) q m d q t = [ n + 2 ] q [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A [ k - 1 ] q q k - 2 [ n + 2 ] q - t + t - q m x - q x + q m x b n , k q ( t ) ( t - x ) q m d q t = 1 [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A q 2 t q 1 + t q D q b n , k q t q ( t - x ) q m d q t + [ n + 2 ] q [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A b n , k q ( t ) ( t - x ) q m + 1 d q t + [ n + 2 ] q [ n + 1 ] q q x ( q m - 1 - 1 ) k = 1 b n , k q ( q x ) 0 / A b n , k q ( t ) ( t - x ) q m d q t = 1 [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A ( t q + t 2 ) D q b n , k q t q ( t - x ) q m d q t + [ n + 2 ] q [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A b n , k q ( t ) ( t - x ) q m + 1 d q t + [ n + 2 ] q [ n + 1 ] q q x ( q m - 1 - 1 ) k = 1 b n , k q ( q x ) 0 / A b n , k q ( t ) ( t - x ) q m d q t .

Using the identities

( t - q m x ) ( t - q m + 1 x ) = t 2 - [ 2 ] q q m x t + q 2 m + 1 x 2

and

( t - q m x ) ( t - q m + 1 x ) ( t - q m + 2 x ) = t 3 - [ 3 ] q q m x t 2 + [ 3 ] q q 2 m + 1 x 2 t - q 3 m + 3 x 3

we obtain the following identity after simple computation

( q t + t 2 ) ( t x ) q m = ( q t + t 2 ) ( t x ) ( t q x ) q m 1 = [ t 3 + ( q x ) t 2 q x t ] ( t q x ) q m 1 = ( t q x ) q m + 2 + ( [ 3 ] q q m x + q x ) ( t q x ) q m + 1 + [ [ 2 ] q q m x { [ 3 ] q q m x + q x } [ 3 ] q q 2 m + 1 x 2 q x ) ] ( t q x ) q m + [ q m x { [ 2 ] q q m x ( [ 3 ] q q m x + q x ) [ 3 ] q q 2 m + 1 x 2 q x } + q 2 m + 1 x 2 { q 2 x [ 3 ] q q m x q + x } ] ( t q x ) q m 1 .

Using the above identity and q integral by parts

a b u ( t ) D q ( v ( t ) ) d q t = [ u ( t ) v ( t ) ] a b - a b v ( q t ) D q [ u ( t ) ] d q t ,

we have

E = - [ m + 2 ] q T n , m + 1 ( q x ) - [ 3 ] q q m x + q - x [ m + 1 ] q T n , m ( q x ) - [ 2 ] q q m x [ 3 ] q q m x + q - x - [ 3 ] q q 2 m + 1 x 2 - q x [ m ] q T n , m - 1 ( q x ) - q m x [ 2 ] q q m x [ 3 ] q q m x + q - x - [ 3 ] q q 2 m + 1 x 2 - q x + q 2 m + 1 x 2 q 2 x - [ 3 ] q q m x - q + x [ m - 1 ] q T n , m - 2 ( q x ) + [ n + 2 ] q [ n + 1 ] q k = 1 b n , k q ( q x ) 0 / A b n , k q ( t ) ( t - x ) q m + 1 d q t - [ n + 2 ] q [ n + 1 ] q q x ( 1 - q m - 1 ) k = 1 b n , k q ( q x ) 0 / A b n , k q ( t ) ( t - x ) q m d q t

Finally, using

( t - x ) q m + 1 = ( t - x ) ( t - q x ) q m = ( t - q x ) q m + 1 - x ( 1 - q m + 1 ) ( t - q x ) q m

and

( t - x ) q m = ( t - x ) ( t - q x ) q m - 1 = ( t - q x ) q m - x ( 1 - q m ) ( t - q x ) q m - 1 ,

we get

E = - [ m + 2 ] q T n , m + 1 ( q x ) - ( [ 3 ] q q m x + q - x ) [ m + 1 ] q T n , m ( q x ) - [ 2 ] q q m x [ 3 ] q q m x + q - x - [ 3 ] q q 2 m + 1 x 2 - q x [ m ] q T n , m - 1 ( q x ) - q m x [ 2 ] q q m x [ 3 ] q q m x + q - x - [ 3 ] q q 2 m + 1 x 2 + q x + q 2 m + 1 x 2 q 2 x - [ 3 ] q q m x - q + x [ m - 1 ] q T n , m - 2 ( q x ) + [ n + 2 ] q T n , m + 1 ( q x ) - x ( 1 - q m + 1 ) [ n + 2 ] q T n , m ( q x ) - q x ( 1 - q m - 1 ) [ n + 2 ] q T n , m ( q x ) + q x 2 ( 1 - q m - 1 ) ( 1 - q m ) [ n + 2 ] q T n , m - 1 ( q x ) .

This completes the proof of recurrence relation.

Theorem 7. Let fC [0, ) be a bounded function and (q n ) denote a sequence such that 0 < q n < 1 and q n 1 as n → ∞. Then we have for a point x ∈ (0, )

lim n [ n ] q n ( B n q n ( f , x ) - f ( x ) ) = ( 2 x + 1 ) lim n D q n f ( x ) + x ( 1 + x ) lim n D q n 2 f ( x ) .

Proof. By q-Taylor's formula [7] on f, we have

f ( t ) = f ( x ) + D q f ( x ) ( t - x ) + 1 [ 2 ] q D q 2 f ( x ) ( t - x ) q 2 + Φ q ( x ; t ) ( t - x ) q 2

for 0 < q < 1, where

Φ q ( x ; t ) = f ( t ) - f ( x ) - D q f ( x ) ( t - x ) - 1 [ 2 ] q D q 2 f ( x ) ( t - x ) q 2 ( t - x ) q 2 , if  x t 0 , if  x = t .
(5.1)

We know that for n large enough

lim t x Φ q n ( x ; t ) = 0 .
(5.2)

That is for any ε > 0, A > 0, there exists a δ > 0 such that

| Φ q n ( x ; t ) | < ε
(5.3)

for |t − x| < δ and n sufficiently large. Using (5.1), we can write

B n q n ( f , x ) - f ( x ) = D q n f ( x ) T n , 1 ( x ) + D q n 2 f ( x ) [ 2 ] q n T n , 2 ( x ) + E n q n ( x ) ,

where

E n q ( x ) = 1 [ n + 1 ] q k = 1 b n , k q ( x ) 0 / A b n , k q ( t ) Φ q ( x ; t ) ( t - x ) q 2 d q t .

We can easily see that

lim n [ n ] q n T n , 1 ( x ) = 2 x + 1 and lim n [ n ] q n T n , 2 ( x ) = 2 x ( 1 + x ) .

In order to complete the proof of the theorem, it is suffficient to show that li m n [ n ] q n E n q n ( x ) =0. We proceed as follows:

Let

R n , 1 q n ( x ) = [ n ] q n 1 [ n + 1 ] q n k = 1 b n , k q n ( x ) 0 / A b n , k q n ( t ) Φ q n ( x ; t ) ( t - x ) q n 2 χ x ( t ) d q t

and

R n , 2 q n ( x ) = [ n ] q n 1 [ n + 1 ] q n k = 1 b n , k q n ( x ) 0 / A b n , k q n ( t ) Φ q n ( x ; t ) ( t - x ) q n 2 ( 1 - χ x ( t ) ) d q t ,

so that

[ n ] q n E n q n ( x ) = R n , 1 q n ( x ) + R n , 2 q n ( x ) ,

where χ x (t) is the characteristic function of the interval {t : |t − x| < δ}.

It follows from (5.1)

| R n , 1 q n ( x ) | < ε 2 x ( x + 1 ) as  n .

if |t − x|δ, then | Φ q n ( x ; t ) | M δ 2 ( t - x ) 2 , where M > 0 is a constant. Since

( t - x ) 2 = ( t - q 2 x + q 2 x - x ) ( t - q 3 x + q 3 x - x ) = ( t - q 2 x ) ( t - q 3 x ) + x ( q 3 - 1 ) ( t - q 2 x ) + x ( q 2 - 1 ) ( t - q 2 x ) + x 2 ( q 2 - 1 ) ( q 2 - q 3 ) + x 2 ( q 2 - 1 ) ( q 3 - 1 ) ,

we have

| R n , 2 q n ( x ) | M δ 2 [ n ] q n 1 [ n + 1 ] q n k = 1 b n , k q n ( x ) 0 / A b n , k q n ( t ) ( t - x ) q n 4 d q t + M δ 2 x ( | ( q n 3 - 1 ) + ( q n 2 - 1 ) | ) [ n ] q n 1 [ n + 1 ] q n k = 1 b n , k q n ( x ) 0 / A q n k b n , k q n ( t ) ( t - x ) q n 3 d q t + M δ 2 x 2 ( q n 2 - 1 ) 2 [ n ] q n 1 [ n + 1 ] q n k = 1 b n , k q n ( x ) 0 / A q n k b n , k q n ( t ) ( t - x ) q n 2 d q t

and

| R n , 2 q n ( x ) | M δ 2 [ n ] q n T n , 4 ( x ) + x ( 2 - q n 2 - q n 3 ) [ n ] q n T n , 3 ( x ) + x 2 ( q n 2 - 1 ) 2 [ n ] q n T n , 2 ( x ) .

Using Lemma 3, we have

T n , 4 ( x ) C 1 , x [ n ] q n 2 , T n , 3 ( x ) C 2 , x [ n ] q n 2  and  T n , 4 ( x ) C 3 , x [ n ] q n .

Thus, for n suciently large R n , 2 q n ( x ) 0. This completes the proof of theorem. □

Corollary 8. Let fC [0, ) be a bounded function and (q n ) denote a sequence such that 0 < q n < 1 and q n 1 as n → ∞. Suppose that the first and second derivative f '(x)

and f '' (x) exist at a point x ∈ (0, ), we have

lim n [ n ] q n ( B n q n ( f , x ) - f ( x ) ) = f ( x ) ( 2 x + 1 ) +x ( 1 + x ) f ( x ) .

6. Better error approximation

King [13] in 2003 proposed a new approach to modify the Bernstein polynomials to improve rate of convergence, by making operator to preserve test functions e0 and e1. As the q-Beta operators B n q ( f , x ) reproduce only constant functions, this motivated us to propose the modification of (1.2), so that they reproduce constant as well as linear functions.

Define sequence {un,q(x)} of real valued continues functions on [0, ) with 0 ≤ un,q(x) < ∞, as

u n , q ( x ) = x ( [ n + 2 ] q - [ 2 ] q ) - q [ n + 2 ] q .

We replace x in definition of operator (1.2) with un,q(x). Therefore, modified operator is given as

B n q ̃ ( f ; x ) = 1 [ n + 1 ] q k = 1 b n , k q ( u n , q ( x ) ) 0 / A b n , k q ( t ) f ( t ) d q t , x I [ 1 / q [ n ] q , ) ,
(6.1)

Remark 3. By simple computation we can write

B n q ̃ ( 1 ; x ) = 1 , B n q ̃ ( t ; x ) = x B n q ̃ ( t 2 ; x ) = x 2 [ n + 3 ] q ( [ n + 2 ] q - [ 2 ] q ) q [ n + 2 ] q ( [ n + 2 ] q - [ 3 ] q ) + x [ n + 2 ] q - 2 + q [ n + 2 ] q ( [ n + 2 ] q - [ 3 ] q ) - q ( [ n + 2 ] q - 1 ) [ n + 2 ] q ( [ n + 2 ] q - [ 2 ] q ) ( [ n + 2 ] q - [ 3 ] q ) .

Therefore,

B ˜ n q ( t x ) 2 ; x ) = x 2 ( [ n + 3 ] q ( [ n + 2 ] q [ 2 ] q ) q [ n + 2 ] q ( [ n + 2 ] q [ 3 ] q ) 1 ) + x ( [ n + 2 ] q 2 + q [ n + 2 ] q ( [ n + 2 ] q [ 3 ] q ) ) q ( [ n + 2 ] q 1 ) [ n + 2 ] q ( [ n + 2 ] q [ 2 ] q ) ( [ n + 2 ] q [ 3 ] q ) .

Theorem 9. Let fC B (I), then for every xI and for n > 1, C > 0, we have

| B n q ̃ ( f ; x ) - f ( x ) | C ω 2 ( f , δ n ) ,
(6.2)

where δ n = B n q ̃ ( ( t - x ) 2 ; x ) .

Proof. Let g W 2 , by Taylor's series

g ( t ) - g ( x ) = g ( x ) ( t - x ) + x t g ( s ) ( t - s ) d s

therefore, by linearity and Remark 3, we get

| B n q ̃ ( g ; x ) - g ( x ) | B n q ̃ ( t - x , x ) g + g 2 B n q ̃ ( ( t - x ) 2 ; x ) B n q ̃ ( ( t - x ) 2 ; x ) g .

Also

| B n q ̃ ( f , x ) | | | f | | | B n q ̃ ( 1 , x ) | = f .

Therefore,

| B n q ̃ ( f ; x ) - f ( x ) | | B n q ̃ ( f - g ; x ) - ( f - g ) ( x ) | + | B n q ̃ ( g ; x ) - g ( x ) | 2 f - g + B n q ¯ ( ( t - x ) 2 ; x ) g

on choosing δ n = B n q ̃ ( ( t - x ) 2 ; x ) , taking infimum over g W 2 , we get the desired result.

Theorem 10. Let q = q n satisfies 0 < q n < 1 and let q n 1 as n → ∞. For each f C x 2 * ( I ) we have

lim n B ̃ n q n ( f ) - f x 2 =0.

Proof. To prove theorem (Using the Theorem in [14]), it is sufficient to verify the following three conditions

lim n B ̃ n q n - ( t ν , x ) - x ν x 2 = 0 , ν = 0 , 1 , 2 .
(6.3)

By Remark 3, we have B ̃ n q n ( 1 , x ) =1 and B ̃ n q n ( t , x ) =x, the first and second condition of (6.3) is fulfilled for ν = 0 and ν = 1.

And

B ̃ n q n ( t 2 , x ) - x 2 x 2 [ n + 3 ] q n ( [ n + 2 ] q n - [ 2 ] q n ) q n [ n + 2 ] q n ( [ n + 2 ] q n - [ 3 ] q n ) - 1 sup x [ 0 , ) x 2 1 + x 2 + [ n + 2 ] q n - 2 + q n [ n + 2 ] q n ( [ n + 2 ] q n - [ 3 ] q n ) sup x [ 0 , ) x 1 + x 2 + q n ( [ n + 2 ] q n - 1 ) [ n + 2 ] q n ( [ n + 2 ] q n - [ 2 ] q n ) ( [ n + 2 ] q n - [ 3 ] q n ) ,

which implies that as n → ∞

lim n B ̃ n q n ( t 2 , x ) - x 2 x 2 = 0 .

Thus, the proof is completed. □

7. Stancu approach

In 1968, Stancu introduced Bernstein-Stancu operators in [15] a linear positive operator depending on two non-negative parameters α and β satisfying the condition 0 ≤ αβ. Recently, many researcher applied this approach to many operators, for detail see [16, 17, 2], etc.

For fC[0, ) and 0 < q < 1, we define the q-Beta Stancu operators as

B n q ^ ( f , x ) = 1 [ n + 1 ] q k = 1 b n , k q ( x ) 0 / A b n , k q ( t ) f [ n ] q t + α [ n ] q + β d q t , x [ 0 , ) ,
(7.1)

where 0 ≤ αβ.

In each of following theorems, we assume that q = q n , where q n is a sequence of real numbers such that 0 < q n < 1 for all n and lim n→∞ q n = 1.

Theorem 11. For B n q ^ ( t s , x ) , s = 0, 1, 2 the following identities hold:

B n q ^ ( 1 , x ) = 1 , B n q ^ ( t , x ) = [ n ] q [ n ] q + β ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) + α [ n ] q + β , B n q ^ ( t 2 , x ) = [ n ] q 2 ( [ n ] q + β ) 2 ( q [ 2 ] q + x [ n + 2 ] q ) ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) ( [ n + 2 ] q - [ 3 ] q ) + x ( q + x ) [ n + 2 ] q q ( [ n + 2 ] q - [ 2 ] q ) ( [ n + 2 ] q - [ 3 ] q ) + 2 α [ n ] q ( [ n ] q + β ) 2 ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) + α 2 ( [ n ] q + β ) 2 .

Proof of the theorem can be obtained directly by using linearity of operator and Corollary 2.

Corollary 12. If we denote central moments by Φ n , m q ( x ) = B n q ^ ( ( t - x ) m , x ) , m = 1, 2, then we have

Φ n , 1 q ( x ) = [ n ] q [ n ] q + β ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) + α [ n ] q + β - x , Φ n , 2 q ( x ) = x 2 + [ n ] q 2 ( [ n ] q + β ) 2 ( q [ 2 ] q + x [ n + 2 ] q ) ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) ( [ n + 2 ] q - [ 3 ] q ) + x ( q + x ) [ n + 2 ] q q ( [ n + 2 ] q - [ 2 ] q ) ( [ n + 2 ] q - [ 3 ] q ) + 2 α [ n ] q ( [ n ] q + β ) 2 ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) + α 2 ( [ n ] q + β ) 2 - 2 x [ n ] q [ n ] q + β ( q + x [ n + 2 ] q ) ( [ n + 2 ] q - [ 2 ] q ) + α [ n ] q + β .

Theorem 13. Let 0 < q < 1, we have

B n q ^ ( f , x ) - f ( x ) C ω 2 f , Φ n 2 q ( x ) + Φ n 1 q 2 ( x ) + ω ( f , Φ n , 1 q ( x ) )

for every α, β ≥ 0, x ∈ [0, ) and fC B [0, ), where C is a positive constant.

Proof of theorem is just similar to Theorem 4.