Rate of convergence for Szasz–Mirakyan–Durrmeyer operators with derivatives of bounded variation

https://doi.org/10.1016/j.amc.2007.10.036Get rights and content

Abstract

In the present paper, we estimate the rate of convergence for Szasz–Mirakyan–Durrmeyer operators with derivatives of bounded variation.

Introduction

Let DBγ(0, ∞),(γ  0) be the class of all locally integrable functions defined on (0, ∞), with the growth condition ∣f(t)∣  Meγt, M > 0 and f  BV on every finite subinterval [0, ∞). Then for a function f  DBγ(0, ∞).

We consider the Szasz–Mirakyan–Durrmeyer operators [4], which are defined bySn(f,x)=nk=1pn,k(x)0pn,k(t)f(t)dt,x[0,),wherepn,k(x)=e-nx(nx)kk!.Alternately we may rewrite (1) asSn(f,x)=0kn(x,t)f(t)dt,wherekn(x,t)=nk=0pn,k(x)pn,k(t).Also let βn(x,t)=0tkn(x,s)ds, then it is easily verified thatβn(x,)=0kn(x,s)ds=1.Very recently Srivastava et al. [5] and Gupta et al. [2] estimated the convergence rates for functions having derivatives of bounded variation for certain integral operators and second kind of beta operators respectively. Also very recently Gupta et al. [3] studied some other summation-integral type operators. In the present paper, we extend the results of Gupta et al. [2] and study the rate of convergence by means of the decomposition technique of functions having derivatives of bounded variation. More precisely the functions having derivatives of bounded variation on every finite subinterval on the interval [0, ∞) be defined asf(x)=f(0)+0xψ(t)dt,0<axb,where ψ is a function of bounded variation on [a, b]. We denote the auxiliary function fx, byfx(t)=f(t)-f(x-),0t<x,0,t=x,f(t)-f(x+),x<t<.

Section snippets

Auxiliary results

In this section we give certain results, which are necessary to prove the main result.

Lemma 1

[1]For m  N  {0}, if we define the mth order moment byVn,m(x)=nk=0pn,k(x)0pn,k(t)(t-x)mdtthenVn,0(x)=1,Vn,1(x)=1nand Vn,2(x)=2nx+2n2=2(nx+1)n2.

Also there holds the following recurrence relation:nVn,m+1(x)=xVn,m(1)(x)+2mVn,m-1(x)+(m+1)Vn,m(x),mN.Consequently by the recurrence relation, for all x  [0, ∞), we haveVn,m(x)=O(n-[(m+1)/2]).

Remark 1

If n  2, then from Lemma 1, it is easily verified thatVn,2(x)2x+1n.

Remark 2

It is also

Main result

In this section we prove the following main theorem.

Theorem

Let f  DBγ(0, ), γ > 0 and x  (0, ). Then for n  max{2, }, we have|Sn(f,x)-f(x)|(2x+1)nxk=1[n]Vx-xkx+xk((f)x)+xnVx-xnx+xn((f)x)+(2x+1)nx2(|f(2x)-f(x)-xf(x+)|+|f(x)|)+(2x+1)2e2γxxn+|f(x+)|n3/2+121n|f(x+)-f(x-)|,2x+1nx2|f(x)|where Vab(fx) denotes the total variation of fx on [a, b].

Proof

We haveSn(f,x)-f(x)=0kn(x,t)(f(t)-f(x))dt=0xtkn(x,t)f(u)dudtusing the identityf(u)=12[f(x+)+f(x-)]+(f)x(u)+12[f(x+)-f(x-)]sgn(u-x)+f(x)-12f(x+)+f(x-)

References (5)

There are more references available in the full text version of this article.

Cited by (14)

View all citing articles on Scopus
View full text