On Rate of Approximation by Modified Beta Operators

We establish the rate of convergence for the modified Beta operators B n f, x, for functions having derivatives of bounded variation.


Introduction
In the year 1995 Gupta and Ahmad 1 proposed modified Beta operators so as to approximate Lebesgue integrable functions on R as These operators are linear positive operators and reproduce only the constantfunctions.In particular, it can be observed by the definition of Beta function that Gupta and Ahmad 1 estimated asymptotic formula and error estimate for these operators in simultaneous approximation.Later Gupta et al. 2 studied the approximation properties of these operators in L p norm and they obtained some direct results for the linear combinations.Here we continue our studies on these operators.First we consider the following class of functions.
By DB r 0, ∞ , r ≥ 0 we mean the class of absolutely continuous functions f defined on 0, ∞ , which satisfy the following: ii this class has a derivative f on the interval 0, ∞ coinciding a.e. with a function which is of bounded variation on every finite subinterval of 0, ∞ .It can be observed that all functions f ∈ BD r 0, ∞ possess for each c > 0 the representation Very recently Gupta and Agrawal 3 and Gupta et al. 4 have obtained an interesting result on the rate of convergence of certain Durrmeyer type operators in ordinary and simultaneous approximation.İspir et al. 5 estimated similar results for Kantorovich operators for functions with derivatives of bounded variation.We now extend the study for the modified Beta operators and estimate the rate of convergence of the operators 1 for functions having derivatives of bounded variation.

Auxiliary Results
We shall use the following lemmas to prove our main theorem.Lemma 2.1 1 .Let the function T n,m x , m ∈ ℵ 0 , be defined as

International Journal of Mathematics and Mathematical Sciences 3
Then

2.2
Also for each x ∈ 0, ∞ , one has

2.3
Remark 2.2.From Lemma 2.1 and using Cauchy-Schwarz inequality, for n sufficiently large, it follows that where C > 2.

2.5
Proof.By using Lemma 2.1, for n sufficiently large, we have

2.6
The proof of the second inequality is similar, and we skip the details.

Rate of Approximation
Our main result is stated as follows.
International Journal of Mathematics and Mathematical Sciences Theorem 3.1.Let f ∈ DB r 0, ∞ , r ∈ N, and x ∈ 0, ∞ .Then for n sufficiently large, one has where the auxiliary function f x is given by Proof.By mean value theorem, we have

3.3
Applying the identity

3.4
International Journal of Mathematics and Mathematical Sciences 5 Equation 3.3 becomes keeping in mind that the last term of the above identity vanishes

3.5
As

3.6
Thus in view of the above values, Lemma 2.1, and Remark 2.2, 3.5 reduces to

6 International Journal of Mathematics and Mathematical Sciences
In order to complete the proof of the theorem, it is sufficient to estimate the terms E n f, x and F n f, x .Applying integration by parts, using Lemma 2.3 and taking y x − x/ √ n, we have

3.8
Let u x/ x − t .Then we have 3.9 Thus,

3.10
On the other hand, we have International Journal of Mathematics and Mathematical Sciences 7

3.11
For the estimation of the first two terms in the right-hand side of 3.11 .we proceed as follows.Applying Holder's inequality, Remark 2.2, and Lemma 2.1, we have

3.12
Also, by Remark 2.2, the third term of the right side of 3.11 is given by

2 International
denotes the total variation of f x on a, b .