Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Manuscript Sigma

Download as pdf or txt
Download as pdf or txt
You are on page 1of 10

STATISTICAL APPROXIMATION TO BÖGEL-TYPE

CONTINUOUS FUNCTIONS

SEVDA KARAKUŞ AND KAMIL DEMIRCI

Abstract. In this paper, using the concept of statistical convergence which


is stronger than the statistical convergence, we obtain a statistical approxi-
mation theorem for sequences of positive linear operators de…ned on the space
of all real valued B-continuous functions on a compact subset of the real line.
Then, we construct an example such that our new approximation result works
but its classical and statistical cases do not work. Also we compute the rate
of statistical convergence of sequence of positive linear operators.

1. Introduction
The classical Korovkin theory is mainly connected with the approximation to
continuous functions by means of positive linear operators (see, for instance, [4, 22]).
However, this theory was generalized by using the notion of B-continuity instead of
the ordinary continuity [5, 6, 7, 8, 9]. Furthermore, in recent years, with the help of
the concept of statistical convergence, various statistical approximation results have
been proved [1, 2, 15, 16, 17, 20]. Recall that every convergent sequence (in the usual
sense) is statistically convergent but its converse is not always true. Also, statistical
convergent sequences are neither convergent nor statistically convergent. So, the
usage of this method of convergence in the approximation theory provides us many
advantages. The main goal of this paper is to obtain a statistical approximation
theorem for sequences of positive linear operators de…ned on the space of all real
valued B-continuous functions on a compact subset of the real line.
Let K be the subset of positive integers. Then the natural density of K is given
by (K) = lim n1 jKn j if it exists, where Kn = fk 2 K : k ng and the vertical
n
bars denote the cardinality of the set. A sequence x = fxk g is called statistical
convergent to the number L if for each " > 0,
1
lim jfk n : jxk Lj "gj = 0;
n n
i.e. if the set K = K (") := fk n : jxk Lj "g has natural density zero [18, 19,
21]. In this case we write st lim x = L.
Recently various kinds of statistical convergence for sequences have been intro-
duced by Mursaleen and Edely [25]. Now we recall this concept
Let be a mapping of the set of N in to itself. A continuous linear functional '
de…ned on the space l1 of all bounded sequences is called an invariant mean ( or
mean) [26] if and only if
(i) '(x) 0 when the sequence x = fxk g has xk 0 for all k;

Key words and phrases. Statistical convergence, statistical convergence, the Korovkin the-
orem, B-continuity.
2000 Mathematics Subject Classi…cation. 41A25, 41A36.
1
2 SEVDA KARAKU Ş AND KAM IL DEM IRCI

(ii) '(e) = 1, where e = (1; 1; :::);


(iii) '(x) = '((x (n) )) for all x 2 l1 :
Thus, mean extends the limit funtional on c of all convergent sequences in
the sense that '(x) = lim x for all x 2 c [24]. Consequently, c V where V is the
set of bounded sequences all of whose means are equal. It is known [28] that

V = x 2 l1 : limtpm (xm ) = L uniformly in m, L = lim x


p

where
xm + x
+ x 2 (m) + ::: + x p (m)
(m)
tpm (xm ) := :
p+1
We say that a bounded sequence x = fxk g is convergent if and only if x 2 V .
Let
( )
Vs = x 2 l1 : st lim tpm (xm ) = L uniformly in m, L = lim x :
p

A sequence x = fxk g is said to be statistically convergent to L if and only if


x 2 V s (see, for details, [25]). In this case we write ( ) lim xk = L. That is,
1
lim jfp n : jtpm (xm ) Lj "gj = 0, uniformly in m:
n n

Using the above de…nitions, the next result follows immediately.


Lemma 1.1. Statistical convergence implies statistical convergence.
However, one can construct an example which guarantees that the converse of
Lemma 1.1 is not always true. Such an example was given in [25] as follows:
Example 1.1. Consider the case (n) = n + 1 and the sequence u = fum g de…ned
as
1; if m is odd,
(1.1) um =
1; if m is even,
is statistically convergence ( ( ) lim um = 0) but it is neither convergent nor
statistically convergent.

2. A Korovkin Type Approximation Theorem


In [10, 11, 12], Bögel introduced a new concept of continuity as follows:
Let X and Y be compact subsets of the real numbers, and let D = X Y . Then,
a function f : D ! R is called a B continuous at a point (x; y) 2 D if, for every
" > 0, there exists a positive number = (") such that
j x;y [f (u; v)]j < ",
for any (u; v) 2 D with ju xj < and jv yj < , where the symbol x;y [f (u; v)]
denotes the mixed di¤erence of f de…ned by
x;y [f (u; v)] = f (u; v) f (u; y) f (x; v) + f (x; y):
By Cb (D) we denote the space of all B-continuous functions on D: Recall that
C(D) and B(D) denote the space of all continuous (in the usual sense) functions
and the space of all bounded function on D; respectively. Then, notice that C(D)
Cb (D): Moreover, one can …nd an unbounded B continuous function, which follows
STATISTICAL APPROXIM ATION TO BÖGEL-TYPE CONTINUOUS FUNCTIONS 3

from the fact that, for any function of the type f (u; v) = g(u) + h(v); we have
x;y [f (u; v)] = 0 for all (x; y); (u; v) 2 D.
The following lemma for B-continuous functions was proved by Badea et. al.
[7].

Lemma A ([7]). If f 2 Cb (D); then, for every " > 0; there are two positive
numbers A(") = A("; f ) and B(") = B("; f ) such that
"
x;y [f (u; v)] + A(")(u x)2 + B(")(v y)2
3
holds for all (x; y), (u; v) 2 D:

A function f : D ! R is said to be B bounded on D if there exists M > 0 such


that
j x;y [f (u; v)]j M
holds for any (x; y), (u; v) 2 D: By Bb (D); we mean the set of all B-bounded
functions on D: Since D is a compact subset of R2 ; it is not hard to see that
Cb (D) Bb (D) (see, for instance, [5]). So, the usual supremum norm on the
spaces B(D) is given by
kf kB(D) := sup jf (x; y)j for f 2 B(D);
(x;y)2D

and also the norm on the space Bb (D) is de…ned by


kf kBb := sup j x;y [f (u; v)]j f or f 2 Bb (D):
(x;y);(u;v)2D

Let L be a linear operator from Cb (D) into B (D). Then, as usual, we say that
L is positive linear operator provided that f 0 implies L (f ) 0. Also, we denote
the value of L (f )at a point (x; y) 2 D by L(f (u; v); x; y) or, brie‡y, L(f ; x; y):
Throughout the paper, for …xed (x; y) 2 D and f 2 Cb (D); we use the function
Fx;y de…ned as follows:
(2.1) Fx;y (u; v) = f (u; y) + f (x; v) f (u; v) for (u; v) 2 D:
Since
x;y [Fx;y (u; v)] = x;y [f (u; v)]
holds for all (x; y); (u; v) 2 D; the B continuity of f implies the B continuity of
Fx;y for every …xed (x; y) 2 D: We also use the following test functions
e0 (u; v) = 1; e1 (u; v) = u; e2 (u; v) = v and e3 (u; v) = u2 + v 2 :
With this terminology we have the classical Korovkin theorem in two variables
for B continuous functions as follows:
Theorem 2.1. Let fLm g be a sequence of positive linear operators mapping from
Cb (D) into B (D) :Assume that the following conditions hold:
(i) Lm (e0 ; x; y) = 1 for all (x; y) 2 D and m 2 N;
(ii) Lm (e1 ; x; y) = e1 (x; y) + um (x; y) ;
(iii) Lm (e2 ; x; y) = e2 (x; y) + vm (x; y) ;
(iv) Lm (e3 ; x; y) = e3 (x; y) + wm (x; y) ;
4 SEVDA KARAKU Ş AND KAM IL DEM IRCI

where fum (x; y)g, fvm (x; y)g and fwm (x; y)g converge to zero uniformly on D
as m approach in…nity. Then, the sequence fLm (Fx;y ; x; y)g converges uniformly
to f (x; y) with respect to (x; y) 2 D, where Fx;y is given by (2.1).
Then, we have the following statistical version of Theorem 2.1 by applying the
statistical limit operator instead of the limit operator in Theorem 2.1.

Theorem 2.2. [14]Let fLn g be a sequence of positive linear operators mapping


from Cb (D) into B (D) :Assume that the following conditions hold:

(i) fm 2 N : Lm (e0 ; x; y) = 1 for all (x; y) 2 Dg = 1;


(ii) st lim kLm (e1 ) e1 kB(D) = 0;
m
(iii) st lim kLm (e2 ) e2 kB(D) = 0;
m
(iv) st lim kLm (e3 ) e3 kB(D) = 0:
m

Then, for all f 2 Cb (D); we have

st lim ktpm (Lm (Fx;y )) f kB(D) = 0;

where Fx;y is given by (2.1).


Now we have the following main result using the concept of statistical convergence.

Theorem 2.3. Let fLm g be a sequence of positive linear operators mapping from
Cb (D) into B (D) :Assume that the following conditions hold:

(i) Lm (e0 ; x; y) = 1 for all m 2 N;


(ii) ( ) lim ktpm (Lm (e1 )) e1 kB(D) = 0;
(iii) ( ) lim ktpm (Lm (e2 )) e2 kB(D) = 0;
(iv) ( ) lim ktpm (Lm (e3 )) e3 kB(D) = 0:

Then, for all f 2 Cb (D); we have

( ) lim kLm (Fx;y ) f kB(D) = 0;

where Fx;y is given by (2.1).

Proof. Let f 2 Cb (D) and (x; y) 2 D be …xed. Using the B continuity of the
function Fx;y given by (2.1), Lemma A implies that, for every " > 0; there exist
two positive numbers A(") and B(") such that

"
(2.2) j x;y [Fx;y (u; v)]j + A(")(u x)2 + B(")(v y)2
3

holds for every (u; v) 2 D. Also, by (i), observe that

(2.3) Lm (Fx;y ; x; y) f (x; y) = Lm ( x;y [Fx;y (u; v)] ; x; y)


STATISTICAL APPROXIM ATION TO BÖGEL-TYPE CONTINUOUS FUNCTIONS 5

holds for all m 2 N: Then, using the monotonicity and the linearity of the operators
Lm ; for all m 2 N; it follows from (2.2) and (2.3) that
jtpm (Lm (Fx;y ; x; y)) f (x; y)j
Lm (Fx;y ; x; y) + L (m) (Fx;y ; x; y) + ::: + L p (m) (Fx;y ; x; y) (p + 1) f (x; y)
=
p+1 p+1
(Lm (Fx;y ; x; y) f (x; y)) + L (m) (Fx;y ; x; y) f (x; y) + ::: + L p (m) (Fx;y ; x; y) f (x; y)
=
p+1
Lm ( x;y [Fx;y (u; v)] ; x; y) + L (m) (
[Fx;y (u; v)] ; x; y) + ::: + L p (m) ( x;y [Fx;y (u; v)] ; x; y)
x;y
=
p+1
Lm (j x;y [Fx;y (u; v)]j ; x; y) + L (m) (j x;y [Fx;y (u; v)]j ; x; y) + ::: + L p (m) (j x;y [Fx;y (u; v)]j ; x; y)
p+1
"
+ C (") jtpm (Lm (e3 ; x; y)) e3 (x; y)j + 2C (") d jtpm (Lm (e2 ; x; y)) e2 (x; y)j
3
+2C (") d jtpm (Lm (e1 ; x; y)) e1 (x; y)j
where C (") = max fA("); B(")g and d = max fjxj ; jyjg : Then we get easily
(2.4) jtpm (Lm (Fx;y ; x; y)) f (x; y)j
"
+ U (") jtpm (Lm (e3 ; x; y)) e3 (x; y)j
3
+U (") jtpm (Lm (e2 ; x; y)) e2 (x; y)j
+U (") jtpm (Lm (e1 ; x; y)) e1 (x; y)j :
where U (") = max fC (") ; 2dC (")g. Taking supremum over (x; y) 2 D on the
both-side of (2.4) we obtain, for all m 2 N, that
" n
(2.5) ktpm (Lm (Fx;y )) f kB(D) + U (") ktpm (Lm (e3 )) e3 kB(D)
3
+ ktpm (Lm (e2 )) e2 kB(D)
o
+ ktpm (Lm (e1 )) e1 kB(D) :

Now for a given r > 0, choose " > 0 such that " < 3r. Then, form (2.5), we obtain

1 n o 3
1X 3r "
p n : ktpm (Lm (Fx;y )) f kB(D) r p n : ktpm (Lm (ei )) ei kB(D) :
n n i=1 9U (")

Using (ii), (iii) and (iv), we obtain


( ) lim ktpm (Lm (Fx;y )) f kB(D) = 0:

The proof is complete.

Remark 2.1. We know that, for some f 2 Cb (D), the function f may be unbounded
on the compact set D. However, we can say from the conditions (i), (2.2) and (2.3)
that the number
ktpm (Lm (Fx;y )) f kB(D)
in Theorem 2.3 is …nite for each m; p 2 N:
6 SEVDA KARAKU Ş AND KAM IL DEM IRCI

Remark 2.2. We now show that our result Theorem 2.3 is stronger than its clas-
sical version Theorem 2.1 and statistical version Theorem 2.2. To see this …rst
consider the following Bernstein-type operators introduced by Lorentz [23]
m m
X Xs s t m m s
(2.6) Hm (f ; x; y) = Fx;y ; xs y t (1 x y)m s t
;
s=0 t=0
m m s t
where Fx;y is given by (2.1), and (x; y) 2 I 2 = [0; 1] [0; 1]; f 2 Cb (D): Then, by
Theorem 2.1, we obtain that, for any f 2 Cb (D)
(2.7) lim kHn (Fx;y ) f kB(D) = 0:
n
Using 2.6, we introduce the following positive linear operators on Cb (D) :
1; f (u; v) = 1;
(2.8) Lm (f (u; v) ; x; y) =
(1 + um )Hm (f ; x; y) f 2 Cb (D) and f (u; v) 6= 1
where fum g is given by 1.1. By (2.7) and ( ) lim um = 0, we observe that the
sequence of positive linear operators fLm g de…ned by (2.8) satisfy all hypotheses of
Theorem 2.3. So, we have
( ) lim ktpm (Lm (Fx;y )) f kB(D) = 0:
However, since fum g is not convergent and statistical convergent, we conclude that
Theorem 2.1 and Theorem 2.2 do not work for the operators Lm in (2.8) while our
Theorem 2.3 still works.

3. Rate of Statistically Convergence


In this section we compute the rate of statistically -convergence of Theorem
2.3.
De…nition 3.1. A sequence fxm g is statistically -convergent to a number L with
the rate of 2 (0; 1) if for every " > 0,
jfp n : jtpm (xm ) Lj "gj
lim = 0; uniformly in m:
n n1
In this case, it is denoted by
xm L = o(n ) ( ( )) :
Using this de…nition, we obtain the following auxiliary result.
Lemma 3.1. Let fxm g and fym g be sequences. Assume that xm L1 = o(n 1 ) ( ( ))
and ym L2 = o(n 2 ) ( ( )) : Then we have
(i) (xm L1 ) (ym L2 ) = o(n ) ( ( )), where := min f 1 ; 2 g ;
(ii) (xm L1 ) = o(n 1 ) ( ( )), for any real number .
Proof. (i) Assume that xm L1 = o(n 1 ) ( ( )) and ym L2 = o(n 2 ) ( ( )) :
Then, for " > 0, observe that
jfp n : j(tpm (xm ) L1 ) (tpm (ym ) L2 )j "gj
n1
p n : jtpm (xm ) L1 j 2" + p n : jtpm (ym ) L2 j 2"
n1
p n : jtpm (xm ) L1 j 2" p n : jtpm (ym ) L2 j 2"
(3.1) +
n1 1 n1 2
STATISTICAL APPROXIM ATION TO BÖGEL-TYPE CONTINUOUS FUNCTIONS 7

Now by taking the limit as n ! 1 in (3.1) and using the hypotheses, we conclude
that
jfp n : j(tpm (xm ) L1 ) (tpm (ym ) L2 )j "gj
lim = 0; uniformly in m,
n n1
which completes the proof of (i). Since the proof of (ii) is similar, we omit it.

Using the mixed modulus of smoothness, we introduce a Shisha-Mond type the-


orem [29] for establishing the degree of approximation. Now we recall the concept
of mixed modulus of smoothness. For f 2 Cb (D), the mixed modulus of smoothness
of f , denoted by ! mixed (f ; 1 ; 2 ), is de…ned to be
! mixed (f ; 1; 2) = sup fj x;y [f (u; v)]j : ju xj 1; jv yj 2g

for 1 ; 2 > 0: In order to obtain our result, we will make use of the elementary
inequality
! mixed (f ; 1 1; 2 2) (1 + 1 ) (1 + 2 ) ! mixed (f ; 1; 2)

for 1 ; 2 > 0. The modulus ! mixed has been used by several authors in the frame-
work of “Boolean sum type” approximation (see, for example, [13]). Elementary
properties of ! mixed can be found in [27] (see also [3]) and in particular for the case
of B-continuous functions in [5].
Then we have the following result.
Theorem 3.2. Let fLm g be a sequence of positive linear operators mapping from
Cb (D) into B (D). Assume that the following conditions holds:
(i) Lm (e0 ; x; y) = 1 for all m 2 N; q
(ii) ! mixed (f ; m ; m ) = o(n 1 ) ( ( )) as m ! 1 where m := ktpm (Lm ('))kB(D)
q
2 2
and m := ktpm (Lm ( ))kB(D) with ' (u; v) = (u x) ; (u; v) = (v y)
Then, for all f 2 Cb (D); we have
ktpm (Lm (Fx;y )) f kB(D) = o(n 1 ) ( ( )) ;

where Fx;y is given by (2.1).

Proof. Let f 2 Cb (D) and (x; y) 2 D be …xed. Using the B continuity of the
function Fx;y given by (2.1), Lemma A implies that, for every " > 0; there exist
two positive numbers A(") and B(") such that
"
j x;y [Fx;y (u; v)]j + A(")(u x)2 + B(")(v y)2
3
holds for every (u; v) 2 D. Also, by (i), observe that
Lm (Fx;y ; x; y) f (x; y) = Lm ( x;y [Fx;y (u; v)] ; x; y)
holds for all m 2 N: Then, using the properties of ! mixed we obtain
(3.2) j x;y [Fx;y (u; v)]j
! mixed (f ; ju xj ; jv yj)
1 1
1+ ju xj 1+ jv yj ! mixed (f ; 1; 2) :
1 2
8 SEVDA KARAKU Ş AND KAM IL DEM IRCI

Hence, using the monotonicity and the linearity of the operators Lm , for all m 2 N,
it follows from (3.2) that

jtpm (Lm (Fx;y ; x; y)) f (x; y)j


Lm (Fx;y ; x; y) + L (m) (Fx;y ; x; y) + ::: + L p (m) (Fx;y ; x; y) (p + 1) f (x; y)
=
p+1 p+1
(Lm (Fx;y ; x; y) f (x; y)) + L (m) (Fx;y ; x; y) f (x; y) + ::: + L p (m) (Fx;y ; x; y) f (x; y)
=
p+1
Lm ( x;y [Fx;y (u; v)] ; x; y) + L (
[Fx;y (u; v)] ; x; y) + ::: + L p (m) ( x;y [Fx;y (u; v)] ; x; y)
(m) x;y
=
p+1
Lm (j x;y [Fx;y (u; v)]j ; x; y) + L (m) (j x;y [Fx;y (u; v)]j ; x; y) + ::: + L p (m) (j x;y [Fx;y (u; v)]j ; x; y)
p+1
1 1 1
Lm 1+ ju xj 1+ jv yj ! mixed (f ; 1 ; 2 ) ; x; y
p+1 1 2
1 1
+L (m) 1+ ju xj 1+ jv yj ! mixed (f ; 1 ; 2 ) ; x; y
1 2
1 1
+::: + L p (m) 1+ ju xj 1+ jv yj ! mixed (f ; 1 ; 2 ) ; x; y
1 2
1 1
! mixed (f ; 1; 2) 1+ tpm (Lm (ju xj ; x; y)) + tpm (Lm (jv yj ; x; y))
1 2
1
+ tpm (Lm (ju xj : jv yj ; x; y)) :
1 2

Using Cauchy-Schwartz inequality, we have

(3.3) jtpm (Lm (Fx;y ; x; y)) f (x; y)j


( r
1 2
! mixed (f ; 1 ; 2 ) 1 + tpm Lm ((u x) ; x; y)
1
r
1 2
+ tpm Lm ((v y) ; x; y)
2
r r )
1 2 2
+ tpm Lm ((u x) ; x; y) tpm Lm ((v y) ; x; y)
1 2

Taking supremum over (x; y) 2 D on the both-sides of inequality (3.3) we obtain,


for all m 2 N, that

(3.4) ktpm (Lm (Fx;y )) f kB(D) 4! mixed (f ; m; m)

q q
where 1 := m := ktpm (Lm ('))kB(D) and 2 := m := ktpm (Lm ( ))kB(D) :
Now, given " > 0, it follows from (3.4) that
(3.5)
n o
p n : ktpm (Lm (Fx;y )) f kB(D) " p n : ! mixed (f ; "
m; m) 4
n1 1 n1 1
STATISTICAL APPROXIM ATION TO BÖGEL-TYPE CONTINUOUS FUNCTIONS 9

Letting n ! 1 in (3.5), we conclude from (i) and (ii) that


n o
p n : ktpm (Lm (Fx;y )) f kB(D) "
lim = 0, uniformly in m;
n n1 1
which means
ktpm (Lm (Fx;y )) f kB(D) = o(n 1 ) ( ( )) :

References
[1] Anastassiou, G.A., Duman, O.: A Baskakov type generalization of statistical Korovkin theory.
J. Math. Anal. Appl. 340, 476-486 (2008).
[2] Anastassiou, G.A., Duman, O.: Statistical fuzzy approximation by fuzzy positive linear op-
erators. Comput. Math. Appl. 55, 573-580 (2008).
[3] Anastassiou, G.A., Gal, S.G.: Approximation Theory: Moduli of Continuity and Global
Smoothness Preservation, Birkhäuser, Boston, 2000.
[4] Altomare, F., Campiti, M.: Korovkin-Type Approximation Theory and Its Applications.
Walter de Gruyter, Berlin, 1994.
[5] Badea, I.: Modulus of continuity in Bögel sense and some applications for approximation by
a Bernstein-type operator. Studia Univ. Babeş-Bolyai Ser. Math.-Mech. 18, 69-78 (1973) (in
Romanian).
[6] Badea, C., Cottin, C.: Korovkin-type theorems for generalized Boolean sum operators, Ap-
proximation theory (Kecskemét, 1990), 51-68, Colloq. Math. Soc. János Bolyai, 58, North-
Holland, Amsterdam, 1991.
[7] Badea, C., Badea, I. and Gonska, H.H.: A test function and approximation by pseudopoly-
nomials. Bull. Austral. Math. Soc. 34, 53-6 (1986).
[8] Barbosu, D.: A korovkin-type theorem for the approximation of n-variate B-continuous func-
tions. Studia Univ."Babes-Bolyai" vol.XLII, No.1, 25-31 (1997).
[9] Barbosu, D.: Aproximarea functiilor de mai multe variabile prin sume booleene de operatori
liniari de tip interpolator. Ed.Risoprint,Cluj-Napoca (Romanian) (2002).
[10] Bögel, K.: Mehrdimensionale di¤erentiation von funktionen mehrerer veränderlicher. J. Reine
Angew. Math. 170, 197-217 (1934).
[11] Bögel, K.: Über mehrdimensionale di¤erentiation, integration und beschränkte variation. J.
Reine Angew. Math. 173, 5-29 (1935).
[12] Bögel, K.: Über die mehrdimensionale di¤erentiation. Jahresber. Deutsch. Mat.-Verein. 65,
45-71 (1962).
[13] Cottin, C.: Approximation by bounded pseudo-polynomials, in “Function Spaces” (ed. J.
Musielak et al.). Teubner-Texte zur Mathematik. 120, 152-160 (1991).
[14] Demirci K., Dirik F.: A Korovkin-type approximation theorem in statistical sense to B-
Continuous Functions, (submitted).
[15] Duman, O., Khan, M.K. and Orhan, C.: A-Statistical convergence of approximating opera-
tors. Math. Inequal. Appl. 4, 689-699 (2003).
[16] Duman, O., Erkuş, E. and Gupta, V.: Statistical rates on the multivariate approximation
theory. Math. Comput. Modelling 44, 763-770 (2006).
[17] Erkuş, E., Duman, O. and Srivastava, H.M.: Statistical approximation of certain positive lin-
ear operators constructed by means of the Chan-Chyan-Srivastava polynomials. Appl. Math.
Comput. 182, 213-222 (2006).
[18] Fast, H.: Sur la convergence statistique, Colloq. Math., 2, 241-244 (1951).
[19] Fridy, J. A.: On statistical convergence, Analysis, 5, 301-313 (1985).
[20] Karakuş, S., Demirci, K. and Duman, O.: Equi-statistical convergence of positive linear
operators. J. Math. Anal. Appl. 339, 1065-1072 (2008).
[21] Kolk, E.: The statistical convergence in Banach spaces, Acta Et Commentationes Tartuensis,
928, 41-52 (1991).
[22] Korovkin, P.P.: Linear Operators and Approximation Theory. Hindustan Publ. Co., Delhi,
1960.
[23] Lorentz, G.G.: Bernstein Polynomials,Toronto. Univ.of Toronto Press, 1953.
10 SEVDA KARAKU Ş AND KAM IL DEM IRCI

[24] Mursaleen, M.: On some new invariant matrix methods of summability, Q. J. Math. 34,
77–86 (1983).
[25] Mursaleen, M.: O.H.H. Edely: On invariant mean and statistical convergence, Appl. Math.
Lett. (2009), doi: 10.1016/j.aml.2009.06.005.
[26] Raimi, R.A.: Invariant means and invariant matrix methods of summability. Duke Math. J.,
30, 81-94 (1963).
[27] Schumaker, L. L.: Spline Functions: Basic Theory. John Wiley & Sons, New York, 1981.
[28] Schaefer, P.: In…nite matrices and invariant means. Proc. Amer. Math. Soc. 36, 104–110
(1972).
[29] Shisha, O., Mond, B.: The degree of approximation of linear operators. Proc. Nat. Acad. Sci.
U.S.A., 60, 1196-1200 (1968).
Sevda Karakuş
Sinop University, Faculty of Sciences and Arts,
Department of Mathematics, TR-57000, Sinop, Turkey
E-Mail: skarakus@sinop.edu.tr
Kamil Demirci
Sinop University, Faculty of Sciences and Arts,
Department of Mathematics, TR-57000, Sinop, Turkey
E-Mail: kamild@sinop.edu.tr

You might also like