Convergence Estimates in Approximation Theory

Vijay
Gupta · Ravi P. Agarwal
Convergence
Estimates in
Approximation
Theory
Convergence Estimates in Approximation Theory
Vijay Gupta • Ravi P. Agarwal
Convergence Estimates
in Approximation Theory
123
Vijay Gupta Ravi P. Agarwal
School of Applied Sciences Department of Mathematics
Netaji Subhas Institute of Technology Texas A&M University - Kingsville
New Delhi, India Kingsville, TX, USA
ISBN 978-3-319-02764-7 ISBN 978-3-319-02765-4 (eBook)

DOI 10.1007/978-3-319-02765-4
Springer Cham Heidelberg New York Dordrecht London
Library of Congress Control Number: 2013956134
Mathematics Subject Classification (2010): 41A36, 41A25, 41A17, 30E10
© Springer International Publishing Switzerland 2014

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of
the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology
now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection
with reviews or scholarly analysis or material supplied specifically for the purpose of being entered
and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of
this publication or parts thereof is permitted only under the provisions of the Copyright Law of the
Publisher’s location, in its current version, and permission for use must always be obtained from Springer.
Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations
are liable to prosecution under the respective Copyright Law.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
While the advice and information in this book are believed to be true and accurate at the date of
publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for
any errors or omissions that may be made. The publisher makes no warranty, express or implied, with
respect to the material contained herein.
Printed on acid-free paper
Springer is part of Springer Science+Business Media (www.springer.com)

Preface
The aim of the general approximation methods concerning linear positive operators
is to deal with convergence behavior. The accuracy can be ascertained to a desired
degree by applying different methods. We are also concerned with the amount of
computation required to achieve this accuracy. A direct theorem provides the order
of approximation for functions of specified smoothness. The converse of the direct
result, that is, the inverse theorem, infers the nature of smoothness of the function
from its order of approximation. Asymptotic analysis is a key tool for exploring the
ordinary and partial differential equations that arise in the mathematical modeling
of real-world phenomena. The rate of convergence infers the speed at which a
convergent sequence approaches its limit.
This work treats the convergence results mainly for linear positive operators.
After the well-known theorem due to Weierstrass and the important convergence
theorem of Korovkin, many new operators were proposed and constructed by several
researchers. The theory of these operators has been an important area of research in
the last few decades. The basic results and direct estimates in both local and global
approximation are also presented. We also discuss the asymptotic expansion of some
of the linear positive operators, which is important for convergence estimates. We
know that to improve the order of approximation, we can consider the combinations.
By considering the linear combinations, we have to slacken the positivity conditions
of the operators. Here we discuss linear and iterative combinations and present
some results. Some operators reproduce constant and linear functions. Two decades
ago it was observed that if we modify the original operators, we can have a better
approximation. Later some researchers studied this direction and observed that some
operators that do not even preserve linear functions can give a better approximation
if they are modified to preserve linear functions. The overconvergence phenomena
for certain operators, which were not discussed in the book by Gal, [77] are also
discussed here. We present some results of overconvergencies to larger sets in the
complex plane.
In this book, the crucial role of the rate of convergence for functions of bounded
variation and for functions having derivatives of bounded variation is emphasized.
New and efficient methods that are applicable to general operators are also
v
vi Preface
discussed. The advantages of these methods consist of obtaining improved and even
optimal estimates, as well as of broadening the applicability of the results. Several
results have been established for different exponential-type operators and integral
operators. Still, this type of study can be extended to other generalizations of the
known operators. Also, the rate of convergence for functions of bounded variation
on mixed summation–integral-type operators having different basis functions has
not been studied to date, including Szász–Baskakov, Baskakov–Szász, and Beta–
Szász operators, among others. It can be considered an open problem. We mention
some results without proofs, while in other cases, proofs and outlines are given. The
book is useful for beginners and for those who are working on analysis and related
areas.
This monograph is divided into 11 chapters:
In Chap. 1, which is introductory in nature, we present some basic definitions and
the standard theorems, which are important for the convergence point of view.
In Chap. 2, we discuss some important results on linear positive operators
related to convergence. Some direct results, which include pointwise convergence,
asymptotic formulas, and error estimations, are presented here. We also deal
with some important results, including discretely defined operators, Kantorovich-
and Durrmeyer-type operators, mixed summation–integral-type operators, Phillips
operators, and other integral-type operators.
In Chap. 3, we discuss the asymptotic behavior of some of the linear positive
operators. We discuss the complete asymptotic expansion of the Baskakov–
Kantorovich, Szász–Baskakov, Meyer–König–Zeller–Durrmeyer, and Beta
operators.
In Chap. 4, we mention approximation for certain combinations. The linear
combinations are no longer positive operators. Here we study some results for
linear and iterative combinations. Also, we consider a different form of the linear
combinations and present direct estimates for combinations of Szász–Baskakov
operators.
In Chap. 5, we present the techniques for getting a better approximation. Many
well-known approximating operators Ln ; preserve the constant as well as linear
functions. In 1983, King considered the modification of the classical Bernstein
polynomials so that the modified form preserves the test function e2 : A better
approximation can be achieved for the modified form. In this chapter, we present
some results for different operators discussed in recent years.
In Chap. 6, we study the overconvergence phenomenon for certain operators
that were not discussed in the book by Gal [77]. We present some results of
overconvergencies to larger sets in the complex plane than in the real domain. We
discuss some very recent results on complex Baskakov–Stancu operators, complex
Favard–Szász–Mirakjan–Stancu operators, complex Beta operators of the second
kind, genuine Durrmeyer–Stancu polynomials, and certain complex Durrmeyer-
type operators.
In Chap. 7, the pointwise approximation properties of some approximation
operators of the probabilistic type are established and studied. The rates of
convergence for Legendre–Fourier series, Hermite–Fejér polynomials, exponential-
Preface vii
type operators (which include Bernstein, Szász, Baskakov, Gamma, and Weierstrass
operators) are also discussed. The rates of convergence of such operators for a
bounded variation function f are given at those points x; where f .xC/ and
f .x/ exist. Here we also present some results on the Durrmeyer variants of such
operators. We also present the related results for a general class of summation–
integral-type operators and the Meyer–König and Zeller operators.
In Chap. 8, we discuss various Bézier variants of the approximation opera-
tors. They have close relationships with the fields of geometry modeling and
design. In this chapter, we present some important results on the approximation
of Bézier variants of a series of approximation operators, which include Bézier
variants of the Bernstein, Bleimann–Butzer–Hann, Balazs–Kantorovich, Szász–
Kantorovich, Baskakov, Baskakov–Kantorovich, Baskakov–Durrmeyer, and MKZ
operators, among others.
In Chap. 9, we study some other related results. We present the rate of approx-
imation on nonlinear operators. Also, we discuss the rate of convergence in terms
of Chanturiya’s modulus of variation. We also present some results for bounded
and absolutely continuous functions. Finally, we present the rate of convergence for
functions having derivatives coinciding a.e. with the function of bounded variation.
In Chap. 10, we present results related to simultaneous approximation. Although
lot of papers have appeared on such topic, in this chapter we mention the rate of
simultaneous approximation for certain Durrmeyer–Bézier operators for functions
of bounded variation. We also present the rate of convergence in simultaneous
approximation for certain summation–integral-type operators having derivatives of
bounded variation.
In the brief final chapter, Chap. 11, we present the future scope of related topics
and mention some open problems.
New Delhi, India Vijay Gupta

Kingsville, TX, USA Ravi P. Agarwal
Acknowledgments
I dedicate this book in the memory of my father, the late P. D. Gupta (1935–1996),
who inspired and encouraged me to opt for mathematics as my main subject at an
early stage. I am indebted to my mother, Uma Gupta, for her constant blessings. I
appreciate the constant support of my wife, Shalini, and my children, Arushi and
Anshay, at each stage of this book’s writing.
-Vijay Gupta
I dedicate this book in the memory of my father, the late Radhey Shiam Agarwal.
-Ravi P. Agarwal
ix
Contents
1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 1
1.1 Korovkin’s Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 2
1.2 Weierstrass Approximation Theorems . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 4
1.3 Order of Approximation . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 8
1.4 Differential Properties of Function . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 11
1.5 Notations and Inequalities . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 13
1.6 Bounded Variation.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 15
2 Approximation by Certain Operators .. . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 17
2.1 Discretely Defined Operators .. . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 17
2.2 Kantorovich Operators .. . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 27
2.3 Durrmeyer-Type Operators . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 29
2.4 Szász–Beta-Type Operators.. . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 36
2.5 Phillips Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 52
2.6 Integral Modification of Jain Operators . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 60
2.7 Generalized Bernstein–Durrmeyer Operators.. .. . . . . . . . . . . . . . . . . . . . 64
2.8 Generalizations of Baskakov Operators .. . . . . . . .. . . . . . . . . . . . . . . . . . . . 72
2.9 Mixed Summation–Integral Operators . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 89
3 Complete Asymptotic Expansion . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 93
3.1 Baskakov–Kantorovich Operators .. . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 93
3.2 Baskakov–Szász–Durrmeyer Operators .. . . . . . . .. . . . . . . . . . . . . . . . . . . . 97
3.3 Meyer–König–Zeller–Durrmeyer Operators .. . .. . . . . . . . . . . . . . . . . . . . 100
3.4 Beta Operators of the First Kind. . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 103
4 Linear and Iterative Combinations . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 109
4.1 Linear Combinations .. . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 109
4.2 Iterative Combinations . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 118
4.3 Another Form of Linear Combinations . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 129
4.4 Combinations of Szász–Baskakov Operators .. .. . . . . . . . . . . . . . . . . . . . 132
xi
xii Contents
5 Better Approximation .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 141

5.1 Bernstein–Durrmeyer-Type Operators . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 142
5.2 Phillips Operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 146
5.3 Szász–Mirakjan–Beta Operators . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 147
5.4 Integrated Szász–Mirakjan Operators . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 149
5.5 Beta Operators of the Second Kind.. . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 151
6 Complex Operators in Compact Disks . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 155
6.1 Complex Baskakov–Stancu Operators . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 155
6.2 Complex Favard–Szász–Mirakjan–Stancu Operators . . . . . . . . . . . . . . 166
6.3 Complex Beta Operators of the Second Kind . . .. . . . . . . . . . . . . . . . . . . . 175
6.4 Genuine Durrmeyer–Stancu Polynomials .. . . . . .. . . . . . . . . . . . . . . . . . . . 189
6.5 New Complex Durrmeyer Operators . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 196
6.6 Complex q-Durrmeyer-Type Operators . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 206
6.7 Complex q-Bernstein–Schurer Operators .. . . . . .. . . . . . . . . . . . . . . . . . . . 210
7 Rate of Convergence for Functions of Bounded Variation .. . . . . . . . . . . . 213
7.1 Fourier and Fourier–Legendre Series. . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 213
7.2 Hermite–Fejér Polynomials .. . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 216
7.3 Exponential-Type Operators .. . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 217
7.4 Bernstein–Durrmeyer-Type Polynomials . . . . . . .. . . . . . . . . . . . . . . . . . . . 222
7.5 Szász–Mirakyan–Durrmeyer-Type Operators . .. . . . . . . . . . . . . . . . . . . . 226
7.6 Baskakov–Durrmeyer-Type Operators . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 231
7.7 Baskakov–Beta Operators . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 239
7.8 General Summation–Integral-Type Operators . .. . . . . . . . . . . . . . . . . . . . 242
7.9 Meyer–König–Zeller Operators . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 244
8 Convergence for Bounded Functions on Bézier Variants . . . . . . . . . . . . . . 249
8.1 Bernstein–Bézier-Type Operators . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 250
8.2 Bleimann–Butzer–Hann–Bézier Operators . . . . .. . . . . . . . . . . . . . . . . . . . 252
8.3 Balazs–Kantorovich–Bézier Operators.. . . . . . . . .. . . . . . . . . . . . . . . . . . . . 254
8.4 Szász–Kantorovich–Bézier Operators .. . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 257
8.5 Baskakov–Bézier Operators . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 264
8.6 Baskakov–Kantorovich–Bézier Operators . . . . . .. . . . . . . . . . . . . . . . . . . . 268
8.7 Baskakov–Durrmeyer–Bézier Operators .. . . . . . .. . . . . . . . . . . . . . . . . . . . 275
8.8 MKZ Bézier-Type Operators . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 280
9 Some More Results on the Rate of Convergence .. . .. . . . . . . . . . . . . . . . . . . . 287
9.1 Nonlinear Operators .. . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 287
9.2 Chanturiya’s Modulus of Variation .. . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 296
9.3 Functions with Derivatives of Bounded Variation . . . . . . . . . . . . . . . . . . 301
9.4 Convergence for Bounded and Absolutely Continuous
Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 308
10 Rate of Convergence in Simultaneous Approximation . . . . . . . . . . . . . . . . . 313
10.1 Bernstein–Durrmeyer–Bézier-Type Operators ... . . . . . . . . . . . . . . . . . . . 314
10.2 General Class of Operators for DBV . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 325
Contents xiii
10.3 Baskakov–Beta Operators for DBV . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 333

10.4 Szász–Mirakian–Stancu–Durrmeyer Operators . . . . . . . . . . . . . . . . . . . . 334
11 Future Scope and Open Problems . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 345
References .. .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 349
Index . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 359
Chapter 1
Preliminaries
Approximation theory has been an established field of mathematics in the past

century. This chapter deals with the basic definitions and standard theorems of
approximation theory, which are important for the convergence point of view.
A polynomial function is a function P .x/ defined on a real line R by
P .x/ D a0 C a1 x C a2 x 2 C C an x n I x 2 R;
where n is a nonnegative integer and a0 ; a1 ; : : : ; an are real numbers. The degree of

a polynomial is n if an ¤ 0.
Let us denote by Hn the set of all polynomials whose degree does not exceed n.
Let f 2 C Œa; b and let P .x/ be an arbitrary polynomial. We set
.P / D max jP .x/ f .x/j:

axb
Also, if
En D En .f / D inf f.P /g;

P 2Hn
then the quantity En is said to be the best approximation to f .x/ by the polynomials
belonging to Hn .
A linear positive operator is a function L that has the following properties:
1. The domain D of L is a nonempty set of real functions all having the same real
domain T .
2. For all f 2 D; L.f / is again a real function with domain T .
3. If f; g 2 D and a; b 2 R, then af C bg 2 D and
L.af C bg/ D aL.f / C bL.g/:
4. If f 2 D and f .x/ 0, for all x 2 T , then L.f .x// 0, for all x 2 T .
V. Gupta and R.P. Agarwal, Convergence Estimates in Approximation Theory, 1

DOI 10.1007/978-3-319-02765-4__1, © Springer International Publishing Switzerland 2014
2 1 Preliminaries
In order to decide the uniform convergence of a sequence of linear positive

operators to the continuous functions, Bhoman [42] and Korovkin [174] found the
answer by giving a very simple criterion.
1.1 Korovkin’s Theorem
For a linear positive operator Ln , Korovkin [174] established the following

important theorem:
Theorem 1.1 ([174]). If the three conditions
Ln .1; x/ D 1 C ˛n .x/;
Ln .t; x/ D x C ˇn .x/;
Ln .t 2 ; x/ D x 2 C n .x/
are satisfied for the sequence of linear positive operators Ln .f; x/, where
˛n .x/; ˇn .x/, and n .x/ converge uniformly to zero in the interval Œa; b, then
the sequence Ln .f; x/ converges uniformly to the function f .x/ in this interval if
f .t/ is bounded, continuous in the interval Œa; b, continuous on the right at point
b, and continuous on the left at point a.
Proof. Since the function f .t/ is bounded [i.e., jf .t/j < M ], then for all x and t,
the inequality
2M < f .t/ f .x/ < 2M (1.1)
holds. Now, if the function f .x/ is continuous on the interval Œa; b, continuous on
the right at point b, and continuous on the left at point a, then we can find a ı > 0
for > 0 such that the inequality
< f .t/ f .x/ < (1.2)
holds if jt xj < ı; x 2 Œa; b. If we set .t/ D .t x/2 , where x 2 Œa; b is fixed,
inequalities (1.1) and (1.2) imply
2M 2M
.t/ < f .t/ f .x/ < C .t/:
ı2 ı2
In view of the monotonicity and linearity of Ln .f; x/, these inequalities imply
2M
Ln .1; x/ Ln . ; x/ Ln .f; x/ f .x/Ln .1; x/
ı2
2M
Ln .1; x/ C 2 Ln . ; x/: (1.3)
ı
1.1 Korovkin’s Theorem 3
Next, by the linearity of Ln .f; x/, we have
Ln . ; x/ D Ln .t 2 2tx C x 2 ; x/ D Ln .t 2 ; x/ 2xLn .t; x/ C x 2 Ln .1; x/

D x 2 C n .x/ 2x .x C ˇn .x// C x 2 .1 C ˛n .x//
D n .x/ 2xˇn .x/ C x 2 ˛n .x/ D ın .x/; (1.4)
where ın .x/ converges uniformly to zero in the interval Œa; b.

From the above equation and the first condition of Korovkin’s theorem, we see
that the right-hand side of inequality (1.3) converges uniformly to and the left-hand
side to in the interval Œa; b. Thus, there exists a number N./ such that the
inequality
2 < Ln .f; x/ f .x/Ln .1; x/ < 2
will hold if n > N./; x 2 Œa; b. Finally, since > 0 is arbitrary, the sequence
Ln .f; x/ f .x/Ln .1; x/
will converge uniformly to zero in the interval Œa; b, and hence we conclude that
the sequence Ln .f; x/ converges uniformly to f .x/ in the interval Œa; b.
Definition 1.1. The function
X
n
Tn .x/ D a0 C .ak cos kx C bk sin kx/
kD1
is called a trigonometric polynomial of order n if an2 C bn2 ¤ 0, and the series

a0
C.a1 cos xCb1 sin x/C.a2 cos 2xCb2 sin 2x/C C.an cos nxCbn sin nx/C
2
is called a trigonometric series.

Obviously, the product of two trigonometric polynomials of degree m and n,
respectively, is a polynomial of degree m C n.
Another important result given by Korovkin [174] for periodic functions is the
following:
Theorem 1.2 ([174]). If the three conditions
Ln .1; x/ D 1 C ˛n .x/;
Ln .t; x/ D x C ˇn .x/;
Ln .t 2 ; x/ D x 2 C n .x/
4 1 Preliminaries
are satisfied for the sequence of linear positive operators Ln .f; x/, where
˛n .x/; ˇn .x/, and n .x/ converge uniformly to zero in the interval Œa; b, then
the sequence Ln .f; x/ converges uniformly to the function f .x/ in this interval if
f .t/ is bounded, has period 2, is continuous in the interval Œa; b, is continuous
on the right at point b, and is continuous on the left at point a.
Shisha and Mond [212] obtained Korovkin’s result in the quantitative form and
established the following theorem:
Theorem 1.3 ([212]). Let 1 < a < b < 1, and let L1 ; L2 ; : : : be positive
operators all having the same domain D, which contains the restrictions of 1; t; t 2
to Œa; b. For n D 1; 2; : : :, suppose Ln .1/ is bounded. Let f 2 D be continuous in
Œa; b, with modulus of continuity !. Then, for n D 1; 2; : : :,
jjf Ln .f /jj jjf jj:jjLn .1/ 1jj C jjLn .1/ C 1jj!.n /;
where n D jj.Ln .Œt x2 //.x/jj1=2 , and jj:jj stands for the sup-norm over Œa; b.
In particular, if Ln .1/ D 1, then the conclusion becomes
jjf Ln .f /jj 2!.n /:
In another paper, Shisha and Mond [211] gave the full proof of the following
theorem:
Theorem 1.4 ([212]). Let L1 ; L2 ; : : : be positive operators whose common domain
D consists of real functions with domain .1; 1/. Suppose 1; cos x; sin x; f
belong to D, where f is an everywhere continuous, 2-periodic function, with
modulus of continuity !. Let 1 < a < b < 1, and suppose that for n D
1; 2; : : : ; Ln .1/ is bounded in Œa; b. Then for n D 1; 2; : : :,
jjf Ln .f /jj jjf jj:jjLn .1/ 1jj C jjLn .1/ C 1jj!.n /;

where n D jj Ln sin2 t x 2 .x/jj1=2 , and jj:jj stands for the sup-norm over Œa; b.
In particular, if Ln .1/ D 1, the conclusion becomes
jjf Ln .f /jj 2!.n /:
1.2 Weierstrass Approximation Theorems
The theory of approximation on linear positive operators P .x/ concerns how

the functions can be best approximated with simpler functions and quantitatively
characterizes the errors induced in so doing. The goal is to minimize the maximum
value of jf .x/ P .x/j.
1.2 Weierstrass Approximation Theorems 5
On the convergence of linear positive operators, the most important basic result is
due to the German mathematician Karl Weierstrass (1815–1897), who established
an important theorem, namely, the Weierstrass approximation theorem. There are
many proofs available of this important theorem. The early ones are due to Runge
(1885), Picard (1891), Lerch (1892 and 1903), Volterra (1897), Lebesgue (1898),
Mittag-Leffler (1900), Fejér (1900 and 1916), Landau (1908), De la Vallée Poussin
(1908), Jackson (1911), Sierpinski (1911), Bernstein (1912), and Montel (1918)
(see e.g. [LNT] and the references therein). We mention in this chapter the proof by
Korovkin [174], which is based on the Bernstein polynomials.
Theorem 1.5 ([174] Weierstrass’ first approximation theorem). If f is a
continuous function defined on Œa; b, then for a given > 0, there is a polynomial
P .x/ on Œa; b such that jf .x/ P .x/j < , for all x 2 Œa; b.
Proof. For a function f defined on Œ0; 1, consider the nth-degree Bernstein
polynomial defined by
!
X
n
n k k
.Bn f /.x/ D x .1 x/ f
nk
:
k n
kD0
The first three moments are calculated as

n
X n
Bn .1; x/ D x k .1 x/nk D Œx C .1 x/n D 1:
k
kD0
Next, the first-order moment is given by

!
X
n
n k k
Bn .t; x/ D x .1 x/nk
k n
kD0
X
n
.n 1/Š
D x k .1 x/nk
.k 1/Š.n k/Š
kD1
X
n1
.n 1/Š
D x kC1 .1 x/nk1
kŠ.n k 1/Š
kD0
D xBn1 .1; x/ D x:
The second-order moment of the Bernstein polynomial is given by

!
X
n
n k k2
Bn .t ; x/ D
2
x .1 x/nk 2
k n
kD0
6 1 Preliminaries
X
n
nŠ k.k 1/ C k
D x k .1 x/nk
kŠ.n k/Š n2
kD0
" n
1 X nŠ
D 2 x k .1 x/nk
n .k 2/Š.n k/Š
kD2
#
Xn
nŠ
C x .1 x/
k nk
.k 1/Š.n k/Š
kD1
" n2
1 X nŠ
D 2 x kC2 .1 x/nk2
n kŠ.n k 2/Š
kD0
#
X
n1
nŠ
C x .1 x/
kC1 nk1
kŠ.n k 1/Š
kD0
1
D 2 n.n 1/x 2 Bn2 .1; x/ C nxBn1 .1; x/
n
1 x.1 x/
D 2 n.n 1/x 2 C nx D x 2 C :
n n
Thus, Bn .ei .t/; x/ converges uniformly to ei .x/ in the interval Œ0; 1, where
ei .t/ D t i ; i D 0; 1; 2. Therefore, by Theorem 1.1, Bn .f; x/ converges uniformly
to the function f .x/ in the interval Œ0; 1. Now we shall generalize the result for the
interval Œa; b. In fact, let the function f .x/ be continuous in the interval Œa; b; then
we introduce the function
.y/ D f Œa C y.b a/:
Since the function .y/ is continuous in the interval Œ0; 1, there is a polynomial
P .y/ such that
jP .y/ .y/j < ; y 2 Œ0; 1:
Substituting
xa x a
yD ; Q.x/ D P ;
ba ba
and because
x a x a
D f a C .b a/ D f .x/;
ba ba
1.2 Weierstrass Approximation Theorems 7
we obtain
ˇ x a x a ˇ
ˇ ˇ
> ˇP ˇ D jQ.x/ f .x/j; x 2 Œa; b:
ba ba
This completes the proof of the theorem.
Subsequently, M. H. Stone generalized the above theorem to compact subsets
of Rn known as the Stone–Weierstrass theorem. In the case of the trigonometric
polynomials, Weierstrass gave the following theorem.
Theorem 1.6 ([174] Weierstrass’ second approximation theorem). If a function
f .x/ has period 2 and is continuous on the real axis, then we can find a
trigonometric polynomial T .x/ for > 0 such that the inequality
jT .x/ f .x/j < ; < x <
holds.
The simple proof of this second theorem was established by De La Vallée-Poussin
[236].
Definition 1.2. For f 2 C2 , the De La Vallée-Poussin singular integral is given by
Z
.2n/ŠŠ 1
t x
Vn .x/ D cos2n f .t/dt;
.2n 1/ŠŠ 2 2
where

n.n 2/ 2; n even;
nŠŠ D
n.n 2/ 1; n odd:
Theorem 1.7. If Vn .x/ denotes the De La Vallée-Poussin singular integral

(Definition 1.2), then for real values,
lim Vn .x/ D f .x/

n!1
holds uniformly.
Definition 1.3. A function defined by
1
X
f .x/ D an cos.b n x/;
nD0
where 0 < a < 1 and b denotes an odd positive integer, is called the Weierstrass
function, which is continuous everywhere but differentiable nowhere.
8 1 Preliminaries
1.3 Order of Approximation
For practical purposes, not only is the fact of the uniform convergence of a sequence
of polynomials important, but the speed of convergence is more important; that is,
for the polynomial Pn .x/ of degree n, it is important how fast en approaches zero,
where
en D max jPn .x/ f .x/j:

axb
Rb
Definition 1.4. Let Ln .f; x/ D a Kn .x; t/f .t/dt, where Kn .x; t/ 0 is the
kernel of distribution, be a positive operator on C.a; b/ (a; b may be ˙1) into
C 1 I Ln .f; x/ is said to be an exponential-type operator if
•
Z b
Kn .x; t/dt D 1
a
@ n
Kn .x; t/ D Kn .x; t/.t x/;
@x p.x/
where p.x/ is a polynomial of degree 2; p.x/ > 0 on .a; b/.

It is said to be regular if it further satisfies
•
Z b
Kn .x; t/dt D a.n/;
a
where a.n/ is a rational function of n; a.n/ ! 1 as n ! 1.

Definition 1.5. We say f .n/ D O.g.n//, defined as Big-O, if and only if there
exist n0 and a positive constant C , such that jf .n/j C jg.n/j, n > n0 .
f .n/
We say f .n/ D o.g.n//, defined as small-o, if lim D 0.
n!1 g.n/
Definition 1.6. The modulus of continuity of f is defined as
!f .ı/ !.f; ı/ D sup jf .t/ f .x/j :

xıt xCı
t 2Œa;b
Let f 2 C Œa; b; k 1, and ı > 0. Then the kth-order modulus of continuity of f
is defined by
!k .f; ı; a; b/ D supfj4kh f .x/j W jhj ı; x; x C kh 2 Œa; bg;

1.3 Order of Approximation 9
where 4kh f .x/ is the kth-order forward difference of f .x/ with step length h.
• If n is a natural number, then
!f .nı/ n!f .ı/:
• If > 0, where is any positive real number, then
!f . ı/ . C 1/!f .ı/:
• If !f .ı/ is an increasing function of ı and if we let 0 < ı1 < ı2 , then we have
!f .ı1 / !f .ı2 /:
• If f .x/ is uniformly continuous on .a; b/, then it is necessary and sufficient that
lim !f .ı/ D 0:
ı!0
Definition 1.7. A function f defined on an interval Œa; b is said to satisfy the

Lipschitz condition of exponent ˛ and the coefficient M if it satisfies the condition
jf .x/ f .y/j M jx yj˛ ; ˛ > 0:
In this case, we say that f 2 LipM ˛; ˛ > 0. In other words, if the inequality
!.f; ı/ C ı ˛ holds in the interval Œa; b, then we say f belongs to the class
LipM ˛; ˛ > 0.
Obviously, a function satisfying a Lipschitz condition is uniformly continuous.
If f 2 Lip ˛ and ˛ > 1, then f is a constant function.
Definition 1.8. A function f is said to belong to the Dini–Lipschitz class if the
equality
1
lim !.f; ı/ ln D0
ı!0 ı
holds.
Definition 1.9. Let us assume that 0 < a1 < a2 < b2 < b1 < 1. For sufficiently
small
> 0, we define the linear approximating function, namely, the Steklov mean
f
;m of mth-order corresponding to f 2 C˛ Œ0; 1/ ff 2 C Œ0; 1/ W jf .t/j
C:Œg.t/˛ ; C > 0} [where g.t/ mayP be some growth function with norm-jj:jj˛ on
C˛ Œ0; 1/ that is defined as jjf jj˛ D t 2.0;1/ jf .t/j.g.t//˛ ] by
Z
=2 Z
=2
f
;m .x/ D
m .f .x/ m
t f .x//dt1 dtm ;

=2
=2
10 1 Preliminaries
P
where t D m1 m i D1 ti ; t 2 Œa1 ; b1 and t f .x/ is the mth forward difference
m
of f with step length t. It is easily observed that the Steklov mean satisfies the
following properties (see [153]):
(i) f
;m has continuous derivatives up to order m on Œa1 ; b1 :
jjf
;m jjC Œa2 ;b2 C1
r !r .f;
; a2 ; b2 /; r D 1; 2; ; m:
.r/
(ii)
(iii) jjf f
;m jjC Œa2 ;b2 C2 !m .f;
; a1 ; b1 /:
(iv) jjf
;m jjC Œa2 ;b2 C3 jjf jj˛ ,
where Ci ; i D 1; 2; 3 are certain constants that depend on a1 ; a2 ; b1 ; b2 but are
independent of f and n, and !m .f;
; a1 ; b1 / is the modulus of continuity of order
m corresponding to f .
Definition 1.10. Let CB Œ0; 1/ be the space of all real-valued continuous bounded
functions f on Œ0; 1/, endowed with the norm jjf jj D supx2Œ0;1/ jf .x/j.
The Peetre K-functional is defined by
1
X
K2 .f; ı/ D inffjjf gjj C ıjjg 0 jj W g 2 W1
2
g;
kD0
where W1 2
D fg 2 CB Œ0; 1/ W g 0 ; g 00 2 CB Œ0; 1/g. By the DeVore–Lorentz
property, Theorem 2.4 of [60], there is an absolute constant M > 0 such that
p
K2 .f; ı/ M!2 .f; ı/;
p
where !2 .f; ı/ is the modulus of continuity of order 2.
Theorem 1.8 ([174] First Jackson theorem). For any continuous periodic
function f , the inequality
En .f / D jjTn .f; :/ f jj 6!.f; n1 /
holds, where Tn .f; x/ is a trigonometric polynomial of degree m n, which

deviates the least from the function f .x/.
In the following theorem, we denote by Tn;0 .f; x/ a trigonometric polynomial of
degree not greater than n and without an absolute term, which deviates the least
from the function f . Also, its deviation from the function is En;0 .f /.
Theorem 1.9 ([174] Second Jackson theorem). If the derivative of a periodic
function f is continuous and
En;0 .f 0 / D jjTn;0 .f 0 ; :/ f 0 jj D max jTn;0 .f 0 ; x/ f 0 .x/j;

x
then
6En;0 .f 0 /
En .f / :
n
1.4 Differential Properties of Function 11
For algebraic polynomials, Jackson gave the following theorems:

Theorem 1.10 ([174] Third Jackson theorem). If the function f is continuous in
the interval Œ1; 1, then
En .f / D jjPn .f; :/ f jj 6!.f; n1 /;
where !.f; ı/ is the modulus of continuity of the function f in this interval, and
Pn .f; x/ is an algebraic polynomial of degree not greater than n, which deviates
the least from the function f .
Theorem 1.11 ([174] Fourth Jackson theorem). If the function f is m times
differentiable in the interval Œ1; 1; m 1, and f .m/ .x/ is continuous, then the
inequality
6m Enm .f .m/ /
En .f /
n.n 1/ .n m C 1/
holds, where n > m.
1.4 Differential Properties of Function
In this section, we mention certain results (without proof) in the form of the
definitions; for details, we refer the reader to [174].
Definition 1.11 (Bernstein’s first inequality). Let
X
n
Tn .x/ D A C .ak cos kx C bk sin kx/
kD1
be an nth-order trigonometric polynomial. Then for jTn .x/j M , the inequality
jTn.s/ .x/j 2s ns M
holds.
Definition 1.12 (Bernstein’s second inequality). Let Pn .x/ be an algebraic
polynomial of degree n; jPn .x/j M; a x b; then the inequality
jPn.m/ .x/j Dnm M; a0 x b 0 ;
holds, where the constant D does not depend on n.

Definition 1.13 (Bernstein’s inequality). For the Bernstein-type operators
Ln .f; x/, Ditzian–Totik [62] provided the following Bernstein inequality:
12 1 Preliminaries
jj' 2r L.2r/
n f jjp C n jjf jjp ;
r
where '.x/ denotes the step-weight function.

Definition 1.14 (First Bernstein theorem). If the inequality
A
En .f / D jTn .f; :/ f jj ; n D 1; 2; : : : ; 0 < ˛ < 1;
n˛
holds for the continuous and periodic function f .x/, then the function f belongs to
the class Lips ˛.
Definition 1.15 (Second Bernstein theorem). If the inequality
A
En .f / D jTn .f; :/ f jj ; n D 1; 2; : : : ; 0 < ˛ < 1;
nkC˛
holds for the periodic function f .x/; k is a natural number, and then the function f
is differentiable k times and f .k/ belongs to the class Lips ˛.
Definition 1.16 (Third Bernstein theorem). If the condition
A
En .f / ; n D 1; 2; : : : ; 0 < ˛ < 1;
nkC˛
where k is a natural number or 0 is satisfied for a function f .x/ given in the interval
Œa; b, then the function f .x/ is k times differentiable in the interval Œa0 ; b 0 ; a <
a0 0:
Definition 1.18 (Zygmund’s theorem). In order for the inequality

A
En .f / ; n 2 N;
n
to hold, it is necessary and sufficient for the periodic function f to belong to the
class Z.
Definition 1.19. Let !k .f; ı; a; b/ be the kth-order modulus of continuity. Then the
generalized Zygmund class Liz.˛; k; a; b/ is the class of functions f on Œa; b for
which
!2k .f; ı; a; b/ C ı ˛k ;
where C is the constant.

1.5 Notations and Inequalities 13
1.5 Notations and Inequalities
Definition 1.20. A function f is said to be convex on Œa; b if, for any x1 ; x2 2

Œa; b,
f .x1 / C .1 /f .x2 / f . x1 C .1 /f .x2 //;
for any 2 Œ0; 1.

Definition 1.21. For 1 p < 1, the space Lp Œa; b is defined as the class of all
Rb
complex-valued functions for which a jf .x/jp dx < 1, where the integration is
taken in the Lebesgue sense. The norm in Lp Œa; b is defined by
Z b 1=p
kf kLp Œa;b D jf .x/jp dx ;
a
and the functions equal almost everywhere (a.e.) are identified. The space L1 Œa; b
consists of the complex-valued measurable functions that are essentially bounded
and is normed by
kf kL1 Œa;b D inffM W jf .x/j M a.e. on Œa; bg:
Definition 1.22. The following are the basic inequalities:

(i) Hölder’s inequality for summation:
1
X 1=p 1=q
jxi yi j jxi j p
jyi j q
;
i D1
where p > 1 and 1

p
C 1
q
D 1.
(ii) Hölder’s inequality for integration:
Z Z 1=p Z 1=q
jxi yi j jxi jp jyi jq ;
where p > 1 and p1 C q1 D 1.

(iii) Cauchy–Schwarz’s inequality for summation:
1
X 1=2 1=2
jxi yi j jxi j 2
jyi j 2
:
i D1
14 1 Preliminaries
(iv) Cauchy–Schwarz’s inequality for integration:

Z Z 1=2 Z 1=2
jxi yi j jxi j 2
jyi j 2
:
(v) Minkowski’s inequality for summation:

1
X 1=p 1=p 1=p
jxi C yi jp jxi jp C jyi jp :
i D1
(vi) Minkowski’s inequality for integration:

Z 1=p Z 1=p Z 1=p
jxi C yi jp jxi jp C jyi jp :
(vii) Jensen’s inequality for integration: If is a convex function and f is

integrable on Œa; b, then
Z Z
.f .t//dt .f .t//dt:
(viii) Bunyakovaki’s inequality for integration is given by
Z Z Z !1=2
b b b
f .x/.x/dx 2
f .x/dx 2
.x/dx :
a a a
Definition 1.23. The hypergeometric function is given by

1
X .a/k .b/k
2 F1 .a; bI cI x/ D xk ;
.c/k kŠ
kD0
and the Pochhammer–Berens confluent hypergeometric function is defined by

1
X .a/k x k
1 F1 .aI bI x/ D ;
.b/k kŠ
kD0
with the Pochhammer symbol .n/k given as
.n/k D n.n C 1/.n C 2/ .n C k 1/:
We can write .1/k D kŠ.

Definition 1.24. We denote by x i the falling factorial, which is defined as
x i D x.x 1/ .x j C 1/; x 0 D 1:
1.6 Bounded Variation 15
The rising factorial is denoted by x i and is defined as
x i D x.x C 1/ .x C j 1/; x 0 D 1:
The following theorem is the well-known Berry–Esseen bound for the central
limit theorem of probability theory:
Theorem 1.12 ([179]). Let fk g1 kD1 be a sequence of independent and identically
distributed random variables with the expectation E.1 g D a1 and the variance
E.1 a1 /2 P
D 2 > 0; Ej1 pa1 j3 D < 1, and let Fn stand for the distribution
p
n
function of kD1 .1 a1 /= n. Then there is an absolute constant C; 1= 2
C < 0:8 such that for all t and n,
ˇ Z t ˇ
ˇ ˇ
ˇFn .t/ p1 e u2 =2 C
d uˇˇ < 3 p :
ˇ 2 1 n
1.6 Bounded Variation
Definition 1.25. Let f be a finite real-valued function defined over a closed interval
Œa; b. For a given > 0, there exists a ı > 0 such that
ˇ n ˇ
ˇX ˇ
ˇ ˇ
ˇ Œf .br / f .ar /ˇ <
ˇ ˇ
rD1
ˇP ˇ
whenever ˇ nrD1 Œ.br / .ar /ˇ < ı, where
a1 < b1 a2 < b2 a3 < b3 an < bn :
Without
ˇ n altering theˇ meaning of the definition, we replace the condition
ˇX ˇ
ˇ ˇ
ˇ Œf .br / f .ar /ˇ < with the stronger condition
ˇ ˇ
rD1
X
n
jf .br / f .ar /j < :
rD1
Then f is said to be absolutely continuous on the interval Œa; b. The collection of
all absolutely continuous functions on Œa; b is denoted by AC.Œa; b/. The sum and
difference of two absolutely continuous functions are also absolutely continuous.
If the two functions are defined on a closed and bounded interval, then their product
is also absolutely continuous.
16 1 Preliminaries
Definition 1.26. Suppose a real-valued function f is defined on a closed interval

Œa; b. As the interval Œa; b is divided by points a D x0 < x1 < x2 < < xn1 <
xn D b, then a partition P of Œa; b is a finite collection
P D fx0 ; x1 ; x2 ; : : : ; xn1 ; xn g:
Suppose f W Œa; b ! R. If P is any partition of Œa; b, define
X
n
V .P / D jf .xi / f .xi 1 /j:
i D1
We define the total variation of f on Œa; b by
Vab .f / D sup V .P /;
P
where the supremum is taken over all possible partitions of Œa; b. In the case
Vab .f / < 1, we say that f is of bounded variation on Œa; b.
The following are some basic properties on functions of bounded variation:
• A monotonic function defined on a closed interval Œa; b is a function of bounded
variation.
• The sum, difference, or product of functions of bounded variation is also a
function of bounded variations.
• An absolutely continuous function is a function of bounded variation.
• An integral is a function of bounded variation.
• A continuous function may or may not be a function of bounded variation.
• A function of bounded variation is necessarily bounded.
• If a function f is a function of bounded variation over Œa; b and c is any point in
Œa; b, then f is also of bounded variation over Œa; c and Œc; b, and vice versa.
• If f 0 exists and is bounded on Œa; b, then f is of bounded variation on Œa; b.
Chapter 2
Approximation by Certain Operators
In the theory of approximation following the well-known Weierstrass theorem, the

study on direct results was initiated by Jackson’s classical work [160] on algebraic
and trigonometric polynomials of best approximation. However, because no general
constructional guidelines are available for producing fast analytical approximation
methods of a given type, it seems best to start with an appropriate sequence of
linear positive operators and then to modify it to suit the desired requirements. Apart
from the earlier known examples of linear positive operators, several new sequences
and classes of operators were constructed and studied following the preceding
idea. In this context, in the past five decades, integral modifications of the well-
known operators of the Kantorovich and Durrmeyer types have been introduced
and studied. Also, several mixed summation–integral-type operators have been
introduced and their approximation behaviors studied. Twenty-five years ago, the
q-Bernstein polynomials were introduced; next, the q-analogs of many well-known
operators were constructed and their approximation properties were discussed.
Some of the results on q-operators were compiled by the present authors in their
2013 book [31]. We will not discuss the q-operators here. In the present chapter, we
study the phenomena of ordinary and simultaneous approximation (approximation
of derivatives of the functions by the corresponding order derivatives of the
operators). We present some of the direct approximation theorems in ordinary and
simultaneous approximation.
2.1 Discretely Defined Operators
In this section, we mention some of the discretely defined operators and their
approximation results. For f 2 C Œ0; 1, the n-degree Bernstein polynomials are
defined as

18 2 Approximation by Certain Operators
X
n k
Bn .f; x/ WD pn;k .x/f ; x 2 Œ0; 1; (2.1)
n
kD0
where

n
pn;k .x/ D x k .1 x/nk :
k
It is well known that the Bernstein polynomials satisfy the following properties:
1. For all n 1,
Bn .f; 0/ D f .0/; Bn .f; 1/ D f .1/;
so that a Bernstein polynomial for f interpolates f at both endpoints of the

interval Œ0; 1:
2. The Bernstein polynomial is obviously linear since it follows that
Bn .af C bg; x/ D aBn .f; x/ C bBn .g; x/;
for all functions f and g defined on Œ0; 1 and a; b real.

3. The Bernstein polynomials can be expressed in the form of forward differences as
!
X
n
n
Bn .f; x/ D kh f .0/x k ;
k
kD0
where is the forward difference operator with step size h D 1=n:

4. If f .x/ is convex on Œ0; 1; then for all 0 x 1, we have
Bn .f I x/ f .x/; n 1
and
Bn1 .f I x/ Bn .f; x/; n 2:
In pointwise convergence, the error term incorporates a function at the point

under consideration and indicates bias of the method toward certain points, usually
at the endpoints of the interval. The errors in the approximation could be with
respect to a certain functional norm, seminorm, pointwise local or global. The
common characteristic of a global result is the involvement with the whole domain
of the functions, while with a local result it concerns limited subsets of the domain.
It is obvious that the Weierstrass approximation theorem is just a corollary of the
following theorem:
2.1 Discretely Defined Operators 19
Theorem 2.1 ([37] Pointwise convergence). For a function f .x/ bounded on

Œ0; 1, the relation
lim Bn .f; x/ D f .x/

n!1
holds at each point of continuity x of f , and the relation holds uniformly on Œ0; 1
if f .x/ is continuous on this interval Œ0; 1:
Theorem 2.2 ([181, 239] Voronovskaja’s asymptotic formula). Let f .x/ be
bounded in Œ0; 1, and suppose that the second derivative f 00 .x/ exists at a certain
point x of Œ0; 1. Then
x.1 x/ 00
lim nŒBn .f; x/ f .x/ D f .x/:
n!1 2
Theorem 2.3 ([38]). If q 2 N is even and f 2 C q Œ0; 1; then

" #
X
q
f .r/ .x/
lim n q=2
Bn .f; x/ f .x/ Bn ..e1 x/ ; x/
r
D 0;
n!1
rD1
rŠ
uniformly on Œ0; 1:

In simultaneous approximation, Lorentz, in his book [181], proved the following
pointwise convergence theorem:
Theorem 2.4 ([181] Simultaneous approximation). Let f .x/ be bounded in
.k/
Œ0; 1, and let f .k/ .x0 / exist at a point 0 x0 1; then Bn .x0 / ! f .k/ .x0 /:
Many researchers have written papers on convergence behaviors of the Bernstein
polynomials and for its generalizations. Ditzian [61] established the estimate
jf .x/ Bn .f; x/j C !'2 .f; n1=2 '.x/1 /; x 2 Œ0; 1; (2.2)
p
where 2 Œ0; 1; '.x/ D x.1 x/ and the Ditzian–Totik modulus of smoothness
of second order is given by
!2 .f; ı/ WD sup sup jf .x .x/h/ 2f .x/ C f .x C .x/h/j;

jhjı x˙h.x/2Œ0;1
in which W Œ0; 1 ! R is the step-weight function.

The case D 0 in (2.2) gives the classical local estimate, and D 1 gives
the global estimate developed by Ditzian–Totik [62]. The inequality was further
extended by Felten [69] as

1=2 '.x/
jf .x/ Bn .f; x/j C !2 f; n ; x 2 Œ0; 1: (2.3)
.x/
In this continuation, Floater [74] derived an error bound and an asymptotic formula
for derivatives of the Bernstein polynomials by differentiating a remainder formula
of Stancu.
Theorem 2.5 ([74] Error bound). Let f 2 C kC2 Œ0; 1 for some k 0; then

ˇ ˇ
ˇ.Bn f /.k/ f .k/ ˇ 1 k.k 1/jjf .k/ jj C kj1 2xj:jjf .kC1/ jj
2n

Cx.1 x/jjf .kC2/ jj ;
where jj:jj is the max norm on Œ0; 1:

Theorem 2.6 ([74] Asymptotic formula). Let f 2 C kC2 Œ0; 1 for some k 0;
then
1 dk
lim Œ.Bn f /.k/ f .k/ .x/ D Œx.1 x/f 00 .x/;
n!1 2 dx k
uniformly for x 2 Œ0; 1:
The well-known result on the Bernstein polynomials of equivalence is due to Knoop
and Zhou [173] and Totik [232]: It states that for f 2 C Œ0; 1 and for all n 2 N,

' 1 ' 1
C1 !2 f; p jjBn .f; :/ f jj C2 !2 f; p ;
n n
'
where C1 ; C2 > 0 are independent
p of n and f and !2 is the Ditzian–Totik modulus
of second order with ' D x.1 x/: Gal [76] established the results for the lower
bound of the Bernstein polynomials.
Theorem 2.7 ([76] Lower bound). If f 2 C 2 Œ0; 1 satisfies the condition
f 00 .x/ m > 0 for all x 2 Œ0; 1, then
r !
x.1 x/
j.Bn f /.x/ f .x/j c1 !2 f; ;
n
with C1 D m
2jjf 00 jj
< 12 :
Theorem 2.8 ([76] Lower bounds). Let us denote es .t/ D t s ; t 2 Œ0; 1; s 2
N; s 3:
(i) There do not exist k 2 f1; 2; : : : ; s 1g and cs;k > 0 (independent of n and x)
such that
r !
x.1 x/
Bn .es /.x/ x cs;k !k es ;
s
; 8x 2 Œ0; 1; n 2 N:
n
(ii) There exists Cs > 0 (independent of n and x) such that

r !
x.1 x/
Bn .es /.x/ x Cs !s es ;
s
; 8x 2 Œ0; 1; n 2 N:
n
(iii) For any polynomial Ps .x/ of degree s with positive coefficients [i.e., Ps .x/ D
a0 C a1 C C as x s ; as 0 for all k D 0; 1; : : : ; s], there exists Cs > 0
(independent of n and x) such that
r !
x.1 x/
Bn .Ps /.x/ Ps .x/ Cs !s Ps ; ; 8x 2 Œ0; 1; n 2 N:
n
Szász [227], in 1950, and Mirakyan [194] (also spelled Mirakian or Mirakjan),
in 1941, generalized the Bernstein polynomials to an infinite interval as
1
X k
Sn .f; x/ WD sn;k .x/f ; x 2 Œ0; 1/; (2.4)
n
kD0
where
.nx/k
sn;k .x/ D e nx :
kŠ
Stancu [221] obtained the following result on a uniform norm, using probabilistic
methods:
Theorem 2.9 ([221]). Let f 2 C 1 Œ0; a; a > 0; then for n 2 N, we have
p 1 p
jjSn .f; :/ f jj .a C a/: p !.f 0 ; 1= n/:
n
Singh [213] obtained the following sharp estimate in the simultaneous

approximation:
Theorem 2.10 ([213]). Let f 2 C rC1 Œ0; a; a > 0; then for n 2 N, we have
r 1 p
jjSn.r/.f; :/ f .r/ jj jjf .rC1/ jj C Kn;r : p !.f .rC1/ ; 1= n/;
n n
h p 1=2 p i
where Kn;r D .a=2/ C .r=2 n/ C .r 2 =4n/ .r 2 =4n/ C a : 1 C .r=2 n/ :
Totik [231] represented the Szász operators in the form of a difference function as
1
X 1 1
.nx/k X X .nx/k
Sn .f; x/ WD D k1=n .f I 0/ ;
kŠ kŠ
kD0 kD0 kD0
where
!
X k
ki k
kh .f I x/ D .1/ f .x C ih/:
i D0
i
Totik [231] introduced the modified modulus of smoothness as
!.ı/ D sup j2hpx .f I x/j; ı > 0;

0x<1
0<hı
where for an absolute constant K, !. ı/ K 2 !.ı/; 1. He obtained the

following equivalence result for the Szász operators:
Theorem 2.11 ([231]). Let f 2 CB Œ0; 1/. Then the following are equivalent:
(i) Sn .f; x/ f .x/ D o.1/; n ! 1:
(ii) !.ı/ D o.1/;
p ı ! 0:
(iii) f .x C h x/ f .x/ D o.1/; as h ! 0 uniformly in x:
(iv) The function f .x 2 / is uniformly continuous.
Totik showed that equivalence of .i i / , .i / holds even if f 2 CB Œ0; 1/ is replaced
by the weaker assumption on f 2 C Œ0; 1/; !.1/ < 1:
Theorem 2.12 ([231]). Let 0 < ˛ 1. For f 2 CB Œ0; 1/, the following are
equivalent:
(i) Sn .f; x/ f .x/ D o.n˛ /:
(ii) !.ı/ D O.ı 2˛ /:
Sun [225] gave an estimate for derivatives of these operators on functions of
bounded variation with growth of order O.t ˛t / and remarked that, unfortunately
for the continuous derivatives, his estimate does not include the case f 0 2 Lip 1;
.r/
on every finite subinterval of Œ0; 1/: For such a case, he obtained Sn .f; x/
f .x/ D O.log n=n/; r D 0; 1; 2; : : : : This degree is worse than the usual
.r/
degree 1=n. He also raised the question of whether a unified approach can be
developed, which may improve the estimate for the class f 0 2 Lip 1 on every
finite subinterval of Œ0; 1/: Kasana and Agrawal [169] extended the studies and
estimated a result for linear combinations of the Szász operators.
The modified Szász–Mirakjan operators discussed in [240] are defined as
1
X .nx C 1/2k
1 kCm
Sn .f I m; x/ WD f ; (2.5)
g..nx C 1/ I m/
2 .k C m/Š n.nx C 1/
kD0
1
X tk
where x 2 Œ0; 1/ and g.tI m/ D ; t 2 Œ0; 1/:
.k C m/Š
kD0
Walczak [240] considered the space Cp ; p 2 N0 ; associated with the weight

function w0 .x/ WD 1; wp .x/ WD .1 C x p /1 ; p 1 and consisting of all real-valued
functions on Œ0; 1/; for which wp .x/f .x/ is uniformly continuous and bounded on
Œ0; 1/: The norm on Cp is defined as jjf jjp WD supx2Œ0;1/ wp .x/jf .x/j: In [240],
it was proved that if f 2 Cp ;, then for the operators (2.5), one has the following
estimate:

1
jjSn.f I m; :/ f jjp M0 ! f I Cp I ; m; n 2 N;
n
where M0 is an absolute constant and the modulus of continuity !.f I Cp I t/ WD

sup0ht jjf .x C h/ f .x/jjp ; t 2 Œ0; 1/: In particular, if f 2 Cp1 WD ff 2 Cp W
f 0 2 Cp g; p 2 N0 ;, then
M1
jjSn .f I m; :/ f jjp ;
n
where M1 is an absolute constant.
From [241], we know that the Szász–Mirakjan operators are defined in terms
of a sample of the given function f on the points k=n; called knots. For the
operators Sn .f I m; x/, the knots are the numbers .k C m/=.n.nx C 1// for fixed m:
Thus, the question arises of whether the knots .k C m/=.n.nx C 1// cannot be
replaced by a given subset of points that are independent of x, provided this will
not change the degree of convergence. In connection with this question, Walczak
and Gupta [241] introduced the operators Ln .f I pI rI s; x/ for f 2 Bp ; p 2 N;
which is a class of all real-valued continuous functions f on Œ0; 1/; for which
wp .x/x k f .k/ .x/; k D 0; 1; 2; : : : ; p; is continuous and bounded on Œ0; 1/ and
f .p/ .x/ is uniformly continuous on Œ0; 1/ W
8 2k j
ˆ 1
X X p
ˆ
< 1 .ns x/2kCr f .j / ns x 2k
ns
Ir .ns x/ ; x > 0;
Ln .f I pI rI s; x/ WD 22kCr kŠ.r C k C 1/ j D0 jŠ (2.6)
ˆ kD0
:̂
f .0/; xD0;
where Ir is the modified Bessel function

1
X t 2kCr
Ir WD :
22kCr kŠ.r C k C 1/
kD0
Walczak and Gupta [241] estimated the rate of convergence of the operators
Ln .f I pI rI s; x/:
Theorem 2.13. Fix p 2 N0 ; r 2 Œ0; 1/ and s > 0: Then there exists a positive
constant M M.p; r; s/ such that for f 2 B2pC1 , we have

jjLn .f I 2p C 1I rI s; :/ f jj2pC1 M! f .2pC1/ I C0 I ns :
Theorem 2.14. Fix p 2 N0 ; r 2 Œ0; 1/ and s > 0: Then there exists a positive
constant M M.p; r; s/ such that for f 2 B2pC2 , we have
M.p; r; s/ .2pC2/
jjLn .f I 2p C 2I rI s; :/ f jj2pC2 jjf jj0 :
ns
The Baskakov operator Vn .f; x/ (see [34]) is defined as

1
X
nCk 1 xk
Vn .f; x/ D f .k=n/: (2.7)
k .1 C x/nCk
kD0
Several papers on this operator in a local character are available in the literature.
Concerning global approximation, Becker [36] established an equivalence theorem
for the Baskakov operator in polynomial-weight spaces, where the order of approxi-
mation takes the form .x.1 C x/=n/˛ : Totik [230] considered the modified modulus
of smoothness as
!.ı/ D sup j2hpx.1Cx/ .f I x/j; ı > 0;

0x<1
0<hı
and he obtained the following equivalence results for the Baskakov operators:
Theorem 2.15 ([230]). Let f 2 CB Œ0; 1/; then the following are equivalent:
(i) Vn .f; x/ f .x/ D o.1/; n ! 1:
(ii) !.ı/ D o.1/; ı ! 0:
(iii) f .x/ f .x C hx/ D o.1/; as h ! 0 uniformly in x 2 Œ0; 1/:
(iv) The function f .e x / is uniformly continuous on Œ0; 1/:
Theorem 2.16 ([230]). Let 0 < ˛ 1. For f 2 CB Œ0; 1/, the following are
equivalent:
(i) Vn .f; x/ f .x/ D o.n˛ /:
(ii) !.ı/ D O.ı 2˛ /:
It is well known that the weighted approximation is not a simple extension, because
the Baskakov operators are unbounded for the usual weighted norm jjf jjw D
jjwf jj1 : For f 2 CB Œ0; 1/, Xun and Zhou [244] introduced the norm
jjf jjw D jjwf jj1 C jf .0/j:
They discussed the rate of convergence for the Baskakov operators with the Jacobi
weights and obtained
w.x/jVn .f; x/ f .x/j D O.n˛ / , K.f; t/w D O.t ˛ /;

where w.x/ D x a .1 C x/b ; 0 < a < 1; b:0; 0 < ˛ < 1, and CB Œ0; 1/ is the set of
bounded continuous functions on Œ0; 1/: In 2011, Feng [70] introduced a new norm
and a new K-functional. Using the K-functional, he established direct and inverse
theorems for the Baskakov operators with the Jacobi-type weight. Let
˚
Ca;b; D f W f 2 CB Œ0; 1/; ' 2.2 / wf 2 CB Œ0; 1/
0
Ca;b; D ff W f 2 Ca;b; ; f .0/ D 0g;
p
where '.x/ D x.1 C x/ w.x/ D x a .1 C x/b ; x 2 Œ0; 1/; 0 a < 1, and
b 0: The K-functional is defined as
˚
K' .f; t/w; D inf jj' 2.1 / .f g/jjw C tjj' 2.2 / g 00 jjw ;
g2D
where D D fg W g 2 Ca;b;
0
; g 0 2 A:C:loc Œ0; 1/; jj' 2.2 / g 00 jjw < 1:
Theorem 2.17 ([70]). If f 2 Ca;b;
0
, then we have
jj' 2.1 / .Vn .f; :/ f /jjw MK' .f; n1 /w; :
Theorem 2.18 ([70]). Suppose f 2 Ca;b;

0
; 0 < ˛ < 1. Then the following
statements are equivalent:
(i) ' 2.1 / .x/w.x/jVn .f; x/ f .x/j D O.n˛ /; n 2.
(ii) K' .f; t/w; D O.t ˛ /; 0 < t < 1:
The Meyer–König–Zeller operators [192] are defined as
1
X
nCk k
Mn .f; x/ D x k .1 x/nC1 f ; 0 x < 1: (2.8)
k nCk
kD0
Usually, Mn is defined also for x D 1 by Mn .f; 1/ D f .1/: Totik [230] also

obtained equivalence results for the Mn operators defined by (2.8).
Theorem 2.19 ([230]). For a bounded and continuous function f W Œ0; 1/ ! R,
the following are equivalent:
(i) Mn .f; x/ f .x/ D o.1/; n ! 1:
(ii) 2h.1x/ .f I x/ D o.1/ as h ! 0 uniformly in x 2 Œ0; 1/:
(iii) f .x/ f .x C h.1
exx// D o.1/; as h ! 0 uniformly in x 2 Œ0; 1/:
(iv) The function f 1Ce x is uniformly continuous on Œ0; 1/:
Theorem 2.20 ([230]). Let 0 < ˛ 1. If f W Œ0; 1/ ! R is continuous and
bounded, then the following are equivalent:
(i) Mn .f; x/ f .x/ D o.n˛ /: p

(ii) x ˛ .1 x/2˛ j2h .f I x/j Kh2˛ 0 < h 14 x.1 x/; 0 x < 1 :
Mastroianni [188] introduce and study a sequence Ln of discrete linear positive
operators to approximate unbounded functions on the interval Œ0; 1/ WD RC :
Let .n /n1 be a sequence of real-valued functions defined on RC that are infinitely
differentiable on RC and that satisfy the following conditions:
n .0/ D 1 for every n 2 N:
.k/ S
.1/k n 0; for every n 2 N; x 2 RC ; k 2 N f0g:
For each .n; k/ 2 NN0 , there are a number p.n; k/ 2 N and a function ˛n;k 2 RC ;
.i Ck/ .i /
such that n D .1/k p.n;k/ .x/˛n;k .x/; i 2 N0 ; x 2 RC and
n ˛n;k .x/
lim D lim D 1:
n!1 p.n; k/ n!1 nk
f .x/
Agratini and Vecchia [18] consider that E2 .RC / WD ff 2 C.RC / W 1Cx 2 is
convergent as x ! 1g: The Mastroianni operators Ln map E2 .RC / into C.RC /
and are defined as
1
X
.1/k k
Ln .f; x/ D x k n.k/ .x/f : (2.9)
kŠ n
kD0
The special cases of Mastroianni’s [188] operators are the well-known Szász–
Favard–Mirakyan and the Baskakov operators:
1. n .x/ D e nx ; p.n; k/ D n and ˛n;k .x/ D nk (constant function on RC ): We
obtain the Szász–Favard–Mirakyan operators.
2. n .x/ D .1 C x/n ; p.n; k/ D n C k and for ˛n;k .x/ D n.n C 1/ .n C k
1/.1 C x/k : We obtain the Baskakov operators.
Agratini and Vecchia [18] obtained some direct results for the operators LnW
Theorem 2.21 ([18]). If f is locally Lip˛ on E RC ; ˛ 2 .0; 1, one has

jLn .f; x/ f .x/j Cf vn˛=2 .x 2 C x/˛=2 C 2d ˛ .x; E/ ; x 0;
where d.x; E/ represents the distance between x and E, and vn is defined in
Ln ..t x/2 ; x/ maxfun; jn;1 jan1 g.x 2 C x/ WD vn .x 2 C x/;
.j / j
with n;j WD n .0/=an and un WD n;2 C 2n; 1 C 1:
Along the lines of Ditzian–Totik, Agratini and Vecchia [18] consider ' 2 RRC an
admissible weight function. The second-order K-functional for f 2 CB Œ0; 1/ is
defined as
2.2 Kantorovich Operators 27
˚
K2;' .f; t/ D inf jjf gjj C tjj' 2 g 00 jj W g 0 2 A:C:loc .RC / ; t > 0;
g
where jj:jj stands for sup-norm, and g0 2 A:C:loc .RC / means that g is differentiable
and g 0 is absolutely continuous on every compact subset of RC :
Theorem 2.22 ([18]). If an D n0 .0/; n 2 N; and ' is an admissible weight
function such that ' 2 is concave, then

vn x.1 C x/
Ln .f; x/ 2K2;' f;
2' 2 .x/
holds for every x > 0, where vn is as defined in Theorem 2.21.
2.2 Kantorovich Operators
The Bernstein polynomials are not suitable for approximation to general discon-
tinuous functions. However, by replacing f .k=n/ in the definition of Bernstein
polynomial by an integral mean of f .x/ over a small interval around k=n, we may
obtain better results. To approximate Lebesgue integrable functions on the interval
Œ0; 1, Kantorovich [164] introduced the modified Bernstein polynomials as
X
n Z .kC1/=.nC1/
Pn .f; x/ D .n C 1/ pn;k .x/ f .t/dt; (2.10)
kD0 k=.nC1/
where
!
n k
pn;k .x/ D x .1 x/nk ; 0 x 1:
k
For f 2 L1 Œ0; 1; Lorentz [180] proved in his dissertation that

Z 1
jPn .f; x/ f .x/jdx ! 0.n ! 1/:
0
He also established the following result:

Theorem 2.23 ([180]). f 2 AC Œ0; 1 if and only if
lim varŒ0;1 ŒPn .f; x/ f .x/ D 0:

n!1
Decades later, in 1971, Hoeffding [155] also studied Bernstein–Kantorovich

polynomials and obtained a quantitative version of Lorentz’s result:
Theorem 2.24 ([155]). If F is the p difference of two convex absolutely continuous

R1
functions on Œ0; 1 and J.F 0 / D 0 x.1 x/jdf .x/j is finite, then
varŒ0;1 ŒPn .F; x/ F .x/ D O.n1=2 /:
Theorem 2.25 ([155]). Let f be a Lebesgue integrable function on bounded

variation inside .0; 1/. Then
Z 1
jPn .f; x/ f .x/jdx .2=e/1=2 J.f /n1=2 ;
0
where J.f / D J.F 0 /; as given in Theorem 2.24.

Bojanic and Sisha [46] proved the following theorem:
Theorem 2.26. Let f be a Lebesgue integrable function on Œ0; 1: Then, for n 2;
we have
Z 1 p 2 2
x.1 x/jPn1 .f; x/ f .x/jdx !.f; n1=2 /L1 :
0 3
In 1985, Agrawal and Prasad [25] improved the estimate of Theorem 2.23 and
established the following theorem:
Theorem 2.27. Let f be a Lebesgue integrable function on Œ0; 1: Then, for n 2,
Z 1p
x.1 x/jPn1 .f; x/ f .x/jdx 6:128384!.f; n1=2 /L1 :
0
The Kantorovich variant of Szász–Mirakjan operators is defined as

1
X Z .kC1/=n
Sn .f; x/ D n sn;k .x/ f .t/dt; (2.11)
kD0 k=n
k
where sn;k .x/ D e nx .nx/
kŠ
: In the Lp -norm, Totik [229] obtained the following
estimate:
Theorem 2.28. Let 0 < ˛ < 1 and 1 < p < 1. For an f 2 Lp Œ0; 1/, the
following are equivalent:
(i) jjSn f f jjLp Œ0;1/ Kn˛ ; n D 1; 2; : : :.
(ii) jjhpx .f; x/jjLp .h2 ;1/ C h˛ jj1h .f /jjLp Œ0;1/ Kh2˛ .h 0/;
where h .f; x/ D f .x h/ 2f .x/ C f .x C h/:

Baskakov–Kantorovich operators are defined as
1
X Z .kC1/=n
Vn .f; x/ D n bn;k .x/ f .t/dt; n 2 N; (2.12)
kD0 k=n
2.3 Durrmeyer-Type Operators 29
nCk1 x k
where bn;k .x/ D k .1Cx/nCk
: Abel and Gupta [4] introduced the

Baskakov–Kantorovich–Bézier operators Vn;˛ defined by
1
X Z .kC1/=n
.˛/
Vn;˛ .f; x/ D n Qn;k .x/ f .t/dt; .n 2 N; ˛ 1; or 0 < ˛ < 1/;
kD0 k=n
1
X
.˛/
where Qn;k .x/ D Jn;k
˛
.x/ Jn;kC1
˛
.x/; Jn;k .x/ D bn;j .x/: Abel and Gupta
j Dk

[4] estimated the rate of convergence for the operators Vn;˛ , which is discussed
here in Chap. 7. Additionally, Gupta and Radu [122] proposed the q-analog of the
Baskakov–Kantorovich operators as
1
X Z

ŒkC1q =Œnq
Vn;q .f; x/ D Œnq bn;k .qI x/ f q kC1 t dq t; n 2 N;
kD0 qŒkq =Œnq

nCk1 k
where bn;k .qI x/ D q k.k1/=2 x nCk : In [122], some direct results
k q
.1Cx/q
and the statistical convergence of these operators are discussed. For details on
q-operators, we refer the reader to the 2013 book by Aral, Gupta, and Agrawal [31].
2.3 Durrmeyer-Type Operators
In 1967, J. L. Durrmeyer modified the Bernstein polynomials in order to

approximate Lebesgue integrable functions on Œ0; 1: The Bernstein–Durrmeyer
operators introduced in [65] are defined as
X
n Z 1
Dn .f; x/ D .n C 1/ pn;k .x/ pn;k .t/f .t/dt; x 2 Œ0; 1; (2.13)
kD0 0
where the Bernstein basis function is defined as

n
k
Derriennic [58] first studied these operators in detail, and she obtained some direct
results in ordinary and simultaneous approximation. The Bernstein–Durrmeyer
operators preserve only the constant functions. Also, these operators satisfy the
commutativity property, that is, Dn .Dm .f; x// D Dm .Dn .f; x//:
We can write the binomial coefficient as

!
n nŠ n.n 1/.n 2/ .n k C 1/ .1/k .n/k
D D D :
k kŠ.n k/Š kŠ kŠ
In terms of hypergeometric functions, the Bernstein–Durrmeyer operators defined

by (2.13) can be expressed as
Z 1 X
n k
.n/k .n/k xt
Dn .f; x/ D .nC1/ f .t/ Œ.1x/.1t/n dt
0 .kŠ/2 .1x/.1t/
kD0
Z 1 X
n k
n .n/k .n/k xt
D .n1/ f .t/ Œ.1x/.1t/ dt
0 .1/k kŠ .1x/.1t/
kD0
Z 1
xt
D .nC1/ f .t/ Œ.1x/.1t/n 2 F1 n; nI 1I dt:
0 .1x/.1t/
For n > 0 and r > 1, by simple computation, we have
.n C 2/.r C 1/
Dn .t r ; x/ D 2 F1 .n; rI 1I x/ : (2.14)
.n C r C 2/
Theorem 2.29 ([58]). For any continuous function f on Œ0; 1, the sequence Dn
converges uniformly and
sup jDn .f; x/ f .x/j 2!.f; n1=2 /; for n 3:

x2Œ0;1
Theorem 2.30 ([58] Asymptotic formula). If f is integrable in Œ0; 1 and admits

a derivative of second order on Œ0; 1, then
lim nŒDn .f; x/ f .x/ D .1 2x/f 0 .x/ C x.1 x/f 00 .x/:

n!1
Theorem 2.31 ([58]). If f is integrable and admits a derivative of order r at x 2

Œ0; 1, then
dr dr
lim Dn .f; x/ D f .x/:
n!1 dx r dx r
Theorem 2.32 ([58]). If f admits a derivative of order r that is continuous on

dr .r/
Œ0; 1; then dx r Dn .f; x/ converges uniformly to f and
ˇ ˇ
ˇ .n C r C 1/Š.n r/Š d r dr ˇ
sup ˇˇ Dn .f; x/ f .x/ ˇ Kr !.f .r/ ; n1=2 /;
ˇ
x2Œ0;1 .n C 1/ŠnŠ dx r dx r
where Kr is a constant independent of f and n:

Agrawal and Kasana [23] extended the studies and established direct results in
simultaneous approximation for the Bernstein–Durrmeyer operators.
Theorem 2.33 ([23]). Let f 2 C rC1 Œ0; 1: Then for all n 2.r C 1/:.r C 2/ 1,
ˇˇ ˇˇ
ˇˇ .n C r C 1/Š.n r/Š .r/ ˇˇ .r C 1/
ˇˇ .r/ ˇˇ
Dn .f; x/ f ˇˇ jjf .rC1/ jj
ˇˇ .n C 1/ŠnŠ n C r C 2/
p
˛n;r n
C˛n;r 1C !.f .r/ ; n1=2 /;
2
where

1=2
.n C 1/
˛n;r D :
2.n C r C 2/.n C r C 3/
Theorem 2.34 ([23]). Let f be a bounded and integrable function on Œ0; 1

admitting a derivative of order .r C 2/ at a point x 2 Œ0; 1. Then

.n C r C 1/Š.n r/Š .r/
lim n Dn .f; x/ f .x/ .r C 1/.1 2x/f .rC1/ .x/
.r/
n!1 .n C 1/ŠnŠ
Cx.1 x/f .rC2/ .x/:
Further, this limit holds uniformly if f .rC2/ is continuous on Œ0; 1:

To approximate Lebesgue integrable functions on the interval Œ0; 1, the modified
Bernstein polynomials (see [113]) are defined as
X
n˛Cˇ Z 1
Pn;˛;ˇ .f; x/ D .n ˛ C 1/ pn;k .x/ pn˛;kˇ .t/f .t/dt
kDˇ 0
X
k
C pn;k .x/f ; (2.15)
n
k2In
where pn;k .x/ is as defined in (2.13), for n ˛; where ˛; ˇ are integers

satisfying ˛ ˇ 0, and In f0; 1; 2; : : : ; ng is a certain index set. For
˛ D ˇ D 0; In D f0g; this definition reduces to the Bernstein–Durrmeyer opera-
tors (2.13). When ˛ D ˇ D 1; In D f0g, we obtain the different form of the
operators introduced and studied by Gupta and Maheshwari [118]. Later we denote
Pn .f; x/ Pn;1;1 .f; x/ as
X
n Z 1
Pn .f; x/ D n pn;k .x/ pn1;k1 .t/f .t/dt C .1 x/n f .0/: (2.16)
kD0 0
Pointwise convergence and an asymptotic formula in simultaneous approximation

were studied by Gupta and Ispir [113].
Theorem 2.35 ([113]). Let f 2 C Œ0; 1, and let f .r/ exist at a point x 2 .0; 1/.
.r/
Then Pn .f; x/ D f .r/ .x/ C o.1/ as n ! 1:
Theorem 2.36 ([113]). Let f 2 C Œ0; 1: If f .rC2/ exists at a point x 2 .0; 1/, then

lim n Pn.r/ .f; x/ f .r/ .x/ D x.1 x/f .rC2/ .x/
n!1
CŒr x.1 C 2r/f .rC1/ .x/ r 2 f .r/ .x/:
In 1985, Kasana et al. [168] and Mazhar and Totik [191] independently
introduced the Durrmeyer-type modification of the well-known Szász–Mirakyan
operators as
1
X Z 1
Mn .f; x/ D n sn;k .x/ sn;k .t/f .t/dt; (2.17)
kD0 0
where the Szász–Mirakyan basis function is defined by
.nx/k
sn;k .x/ D e nx :
kŠ
Also, Mazhar and Totik [191] proposed another modification of Szász–Mirakyan
operators as
1
X Z 1
.Ln f /.x/ Ln .f; x/ D n sn;k .x/ sn;k1 .v/f .v/dv C e nx f .0/; (2.18)
kD1 0
which was introduced earlier by Phillips [199]. Obviously, Mn is a perfect

Durrmeyer-type [65] analog of the Szász–Mirakyan operators, but Ln has much
nicer properties than Mn : The main difference is that Ln preserves constant as well
as linear functions, while Mn preserves only the constant ones. Mazhar and Totik
[191] obtained the following results:
Theorem 2.37 ([191]). For every continuous function f 2 C Œ0; 1/, we have
p
jLn .f; x/ f .x/j 11!2 .f; x=n/:
Theorem 2.38 ([191]). Let f 2 C Œ0; 1/; f .x/ D O.e Ax /.A > 0/. If Ln .f; x/
f .x/ D ox .x=n/ x 0; n ! 1, then f is linear function. Furthermore,
Kx
jLn .f; x/ f .x/j ; x 0; n D 1; 2; : : : ;
n
holds if and only if f has a derivative belonging to Lip 1; where

˚
Lip 1 D f W jf .x C h/ f .x/j Kf h; x 0; h > 0 :
Theorem 2.39 ([191]). Let f 2 C Œ0; 1/ be bounded. Then with 0 < ˛ < 1,
Kx
jLn .f; x/ f .x/j ; x 0; n D 1; 2; : : : ;
n
holds if and only if f has a derivative belonging to Lip 1; where

n x ˛ o
Lip 1 D f W jf .x C h/ f .x/j K ; x 0; n D 1; 2; : : :
n
˚
also holds if and only if f 2 Lip 2 2˛ W D f 2 C Œ0; 1/ W !2 .f; ı/Kf ı ˛ ; ı>0 :
From the result of Shisha and Mond [212], Mazhar and Totik [191] also proved
p
.1 C .1 C x//jMn .f; x/ f .x/j K!.f; n1=2 /:
Theorem 2.40 ([191]). Let f 2 CB Œ0; 1/: Then Ln .f; x/f .x/ D o.1/.n ! 1/
is satisfied uniformly on Œ0; 1/ iff f .x 2 / is uniformly continuous on Œ0; 1/:
Theorem 2.41 ([191]). Let f 2 CB Œ0; 1/: Then Mn .f; x/ f .x/ D o.1/.n !
1/ is satisfied uniformly on Œ0; 1/ iff f .x 2 / is uniformly continuous on Œ0; 1/:
Gupta [95] studied the Szász–Durrmeyer operators Mn and obtained an asymp-
totic formula and error estimation in simultaneous approximation. He considered
the class ŁŒ0; 1/ of all measurable functions defined on Œ0; 1/ such that

Z 1
nt
ŁŒ0; 1/ WD f W e f .t/dt < 1 for some positive integer n :
0
This class is certainly bigger than the class of all Lebesgue integrable functions on
Œ0; 1/: Furthermore, he defined
˚
Ł˛ Œ0; 1/ WD f 2 ŁŒ0; 1/ W f .t/ D O.e ˛t /; t ! 1; ˛ > 0 :
Theorem 2.42 ([95] Asymptotic formula). Let f 2 Ł˛ Œ0; 1/, and let it be
bounded on every finite subinterval of Œ0; 1/ admitting a derivative of order .r C 2/
at a fixed point x 2 .0; 1/. Then
lim nŒMn.r/ .f; x/ f .r/ .x/ D .r C 1/f .rC1/ .x/ C xf .rC2/ .x/:
n!1
Theorem 2.43 ([95] Error estimation). Let f 2 Ł˛ Œ0; 1/ be bounded on every

finite subinterval of Œ0; 1/ if f .rC1/ exists and is continuous on .a
; bC
/;
> 0.
Then for n sufficiently large,
.r C 1/ .rC1/
jjMn.r/.f; :/ f .r/ jj jjf jj C C1 n1=2 !.f .rC1/ ; n1=2 / C O.ns /;
n
where the constant C1 is independent of f and n, !.f; ı/ is the modulus of

continuity of f on .a
; b C
/, and jj:jj denotes the sup-norm on Œa; b:
The modified Lupas operators [208] are defined as
Z 1 1
X Z 1
Vn .f; x/ D W .n; x; t/f .t/dt D .n 1/ bn;v .x/ bn;v .t/f .t/dt;
0 vD0 0
(2.19)
where

nCv1 xv
bn;v .x/ D :
v .1 C x/nCv
In 1991, Sinha et al. [215] improved the results obtained in [208] and called
the operators Vn “modified Baskakov operators." In reality, the operators (2.19)
are Durrmeyer-type modifications of the Baskakov operators. Sinha et al. [215]
considered the class Ł of all Lebesgue measurable functions f on Œ0; 1/ as

Z 1
jf .t/j
ŁD f W dt < 1 for some positive integer n :
0 .1 C t/n
The class Ł is bigger than the class of all Lebesgue integrable functions on Œ0; 1/:
Theorem 2.44 ([215] Asymptotic formula). Let f 2 Ł be bounded on every finite
subinterval of Œ0; 1/ admitting a derivative of order .r C 2/ at a fixed point x 2
.0; 1/. Let f .t/ D O.t ˛ / as t ! 1 for some ˛ > 0. Then we have
lim nŒVn.r/ .f; x/ f .r/ .x/ D r.1 C r/f .r/ .x/

n!1
C.rC1/.1C2x/f .rC1/ .x/Cx.1Cx/f .rC2/ .x/:
Theorem 2.45 ([215] Error estimation). Let f 2 Ł be bounded on every finite

subinterval of Œ0; 1/ and f .t/ D O.t ˛ / as t ! 1 for some ˛ > 0. If f .rC1/ exists
and is continuous on < a; b > .0; 1/, where < a; b > denotes an open interval
containing the closed interval Œa; b; then for n sufficiently large,

jjVn.r/ .f; :/ f .r/ jj C1 jjf .r/ jj C jjf .rC1/ jj n1
CC2 n1=2 !.f .rC1/ ; n1=2 / C O.ns /;
for any s > 0; where the constants C1 and C2 are independent of f and n, !.f; ı/
is the modulus of continuity of f on < a; b >, and norm-jj:jj denotes the sup-norm
on Œa; b:
Let .n /n2N be a sequence of real functions having the following properties on an
interval Œ0; b; b > 0; for every n 2 N; k 2 N0 :
n 2 C 1 Œ0; b; n .0/ D 1:
.k/
n is completely monotone; that is, .1/k n 0:
.kC1/ .k/
There exists a c 2 Z W n D nnCc ; n > maxf0; cg: By Chap. 4 of [209],
suitable sequences .n /n2N are given by
1. n .x/ D .1 x/n for the interval Œ0; 1 with c D 1;
2. n .x/ D e nx for the interval Œ0; 1/ with c D 0;
3. n .x/ D .1 C cx/n=c for the interval Œ0; 1/ with c > 0:
With I D Œ0; 1/, when c 0 and I D Œ0; 1, when c D 1, Heilmann [150]
proposed the general Durrmeyer-type operators as
1
X Z
Hn .f; x/ D .n c/ pn;v .x/ pn;v .t/f .t/dt; x 2 I; (2.20)
vD0 I
v .v/
where n 2 N; n > maxf0; cg, and pn;v .x/ D .1/v xvŠ n .x/:
2s .2s/
p2.46 ([150] Global direct result). Let ' f
Theorem 2 Lp .I /; 1 p < 1,
'.x/ D x.1 C cx/. Then
n o
jj' 2s .Hn f f /.2s/ jjp C !'2 .f .2s/ ; n1=2 /' 2s ;p C n1 jj' 2s f .2s/ jjp
holds with a constant C independent of n:

Theoremp 2.47 ([150] Converse result). Let f; ' 2s f .2s/ 2 Lp .I /; 1 p < 1,
'.x/ D x.1 C cx/; s 2 N; s < ˛ < s C 1: Then jj' 2s .Hn f f /.2s/ jjp D
O.ns˛ / implies
!'2.sC1/ .f; t/p D O.t 2˛ /:
In the other paper, Heilmann [149] derived

(a) A global direct result for the rate of approximation of the rth derivative of a
function f 2 Lrp .RC / WD fg W g.r/ 2 Lp .RC /; 1 p 1 by a sequence
.r/
Hn in the Lp -metric.
.r/
(b) A local convergence Hn ! f .r/ and a Voronovskaja theorem for functions
f 2 Lr1 .RC / WD fg W g .r/ 2 L1 Œ0; R. For every 0 < R < 1, there exist
positive constants M; m depending on g such that jg.r/ .t/j M.1 C t m /; t 2
RC g. It was noticed that Lrp .RC / is not contained in Lr1 .RC / [e.g., a function
g .r/ .t/ D t 1=2 ; 0 < t 1, and g.r/ .t/ D t 2 ; t 1, belongs to L1 .RC /;
but not to Lr1 .RC /]. For r D 0, L0p .RC / D Lp .RC / and L01 .RC / D L1 .RC /:
If f 2 Lrp .RC / [ Lr1 .RC /; r 2 N0 ; 1 p < 1; n > .c C m/r; x 2 RC ; then
Y
r1 X 1 Z 1
n C cl
.Hn f / .x/ D .nc/
.r/
pnCcr;v .x/ pncr;vCr .t/f .r/ .t/dt:
n c.l C 1/ vD0 0
lD0
The operators .Hn f /.r/ are not positive. Therefore, Heilmann [149] introduced
Hn;r f D D r Hn I r f; f 2 Lp .RC / [ L1 .RC /;
where D and I denote the differentiation integration operators, respectively.

p
Theorem 2.48 ([149] Global direct result). Let '.x/ D x.1 C cx/; n 2 N; n >
c.r C 6/. If f 2 Lp .RC /; 1 p < 1; then
n o
jj.Hn;r f f jjp C !'2 .f; n1=2 /p C n1 jjf jjp ;
with a constant C independent of n:
2.4 Szász–Beta-Type Operators
In [112] and [126] some approximation properties of mixed Szász-Baskakov

operators were discussed. To approximate integrable functions on Œ0; 1/, Gupta
et al. [140] introduced a mixed sequence of operators by modifying Szász operators
with the weights of Beta basis functions as
1
X Z 1
Sn .f; x/ D sn;v .x/ bn;v1 .t/f .t/dt C e nx f .0/; x 2 Œ0; 1/; (2.21)
vD1 0
where
.nx/v 1 tv
sn;v .x/ D e nx ; bn;v .t/ D :
vŠ B.n; v C 1/ .1 C t/nCvC1
In the kernel form, (2.21) may be written as
Z 1
Sn .f; x/ D Wn .x; t/f .t/dt;
0
P1
where Wn .x; t/ D vD1 sn;v .x/bn;v1 .t/ C e nx ı.t/; and ı.t/ is the Dirac delta
function. They obtained some direct results. To prove the main results of [140], the
following basic lemmas are required:
S
Lemma 2.1 ([137]). For m 2 N f0g; if the mth-order moment is defined as
1
X v m
Un;m .x/ D sn;v .x/ x ;
vD0
n
2.4 Szász–Beta-Type Operators 37
then Un;0 .x/ D 1; Un;1 .x/ D 0; and

.1/
nUn;mC1 .x/ D x Un;m .x/ C mUn;m1 .x/ :

Consequently, Un;m .x/ D O nŒ.mC1/=2 ; where Œ˛ denotes the integral part of ˛:
Lemma 2.2 ([140]). Let the function n;m .x/; m 2 N 0 ; be defined as
1
X Z 1
n;m .x/ D sn;v .x/ bn;v1 .t x/m dt C .x/m e nx :
vD1 0
Then
x x 2 .n C 2/ C 2nx
n;0 .x/ D 1; n;1 .x/ D ; n;2 .x/ D :
n1 .n 1/.n 2/
Also, we have the recurrence relation

.n m 1/n;mC1 .x/ D x .1/
n;m .x/ C m.x C 2/n;m1 .x/
C Œm C x.2m C 1/ n;m .x/; n > m C 1:
Consequently,for each x 2 Œ0; 1/ and from this recurrence relation, we have

n;m .x/ D O nŒ.mC1/=2 :
Lemma 2.3. Let ı be a positive number. Then, for every > 0; x 2 .0; 1/; there
exists a constant M.s; x/ independent of n and depending on s and x, such that
Z
Wn .x; t/t dt M.s; x/ns ; s D 1; 2; 3; : : : ;
jt xj>ı
hold locally.
Lemma 2.4 ([137]). The polynomials Qi;j;r .x/ exist independently of n and v,
such that
X d
x r D r Œsn;v .x/ D ni .v nx/j Qi;j;r .x/sn;v .x/; D :
2i Cj r
dx
i;j 0
Lemma 2.5 ([140]). Let n > r 1 and f .i / 2 CB Œ0; 1/ for i 2 f0; 1; 2; : : : ; rg.
Then
X 1 Z 1
nr
Sn.r/ .f; x/ D sn;v .x/ bnr;vCr1 .t/f .r/ .t/dt:
.n 1/.n 2/ .n r/ vD0 0
Proof. By simple computation, we have the following identities:

0
sn;v .x/ D nŒsn;v1 .x/ sn;v .x/; (2.22)
0
bn;v .t/ D nŒbnC1;v1 .t/ bnC1;v .t/; (2.23)
where x; t 2 Œ0; 1/: Furthermore, the lemma is proved by mathematical induction.

Using the above identities (2.22) and (2.23), we have
1
X Z 1
Sn0 .f; x/ D 0
sn;v .x/ bn;v1 .t/f .t/dt ne nx f .0/
vD1 0
1
X Z 1
D nŒsn;v1 .x/ sn;v .x/ bn;v1 .t/f .t/dt ne nx f .0/
vD1 0
Z 1
D nsn;0 .x/ bn;0 .t/f .t/dt ne nx f .0/
0
1
X Z 1
Cn sn;v .x/ Œbn;v .t/ bn;v1 .t/f .t/dt
vD1 0
Z 1
D ne nx n.1 C t/n1f .t /dt
0
1
X Z 1
1
Cn sn;v .x/ b0 .t/f .t/dt ne nx f .0/:
vD1 0 n 1 n;v1
Integrating by parts, we get

Z 1
Sn0 .f; x/ D ne nx f .0/ C ne nx .1 C t/n f 0 .t/dt
0
1
X Z 1
n
C sn;v .x/ bn;v1 .t/f 0 .t/dt ne nx f .0/
vD1
n1 0
1
X Z 1
n
D sn;v .x/ bn;v1 .t/f 0 .t/dt;
n1 vD0 0
which was to be proved. If we suppose that
X 1 Z 1
ni
Sn.i / .f; x/ D sn;v .x/ bni;vCi 1 .t/f .i / .t/dt;
.n 1/.n 2/ .n i / vD0 0
then by (2.22) and (2.23), and integration by parts, we obtain

X1
ni
Sn.i C1/ .f; x/ D Œsn;v1 .x/ sn;v .x/
.n 1/.n 2/ .n i/ vD0
Z 1
bni;vCi 1 .t /f .i / .t /dt
0
Z 1
ni
C .ne nx / bni;i 1 .t /f .i / .t /dt
.n 1/.n 2/ .n i/ 0
Z 1
ni
D nsn;0 .x/ bni;i .t /f .i / .t /dt
.n 1/.n 2/ .n i/ 0
1
X Z 1
ni
C nsn;v .x/ bni;vCi .t /f .i / .t /dt
.n 1/.n 2/ .n i/ vD1 0
Z 1
ni
ne nx bni;i 1 .t /f .i / .t /dt
.n 1/.n 2/ .n i/ 0
Z 1
ni C1
D sn;0 .x/ Œbni;i .t /bni;i 1 .t /f .i / .t /dt
.n1/.n2/ .ni/ 0
X1
ni C1
C sn;v .x/
.n 1/.n 2/ .n i/ vD1
Z 1
Œbni;vCi .t / bni;vCi 1 .t /f .i / .t /dt
0
Z 1
ni C1 1
D sn;0 .x/ b0 .t /f .i / .t /dt
.n1/.n2/ .ni/ 0 ni1 ni 1;i
i C1 1
X
n
C sn;v .x/
.n 1/.n 2/ .n i/ vD1
Z 1
1
b0 .t /f .i / .t /dt
0 n i 1 ni 1;vCi
X1 Z 1
ni C1
D sn;v .x/ bni 1;vCi .t /f .i C1/ .t /dt;
.n1/.n2/ .ni1/ vD0 0
which completes the proof.

Let us denote
C Œ0; 1/ ff 2 C Œ0; 1/ W f .t/ M t ; for some M > 0; > 0g:
Theorem 2.49 ([140] Point-wise Convergence). Let f 2 C Œ0; 1/; > 0; and
f .r/ exists at a point x 2 .0; 1/, then
r
d
S n .f; w/ D f .r/ .x/ C o.1/; as n ! 1:
d wr wDx
Proof. By Taylor’s expansion of f , we have
X
r1
f .i / .x/
f .t/ D .t x/i C ".t; x/.t x/r ;
i D0
iŠ
where ".t; x/ ! 0 as t ! x: Hence,

r Z 1 r
d d
S n .f; w/ D W n .t; w/f .t/dt
d wr wDx 0 d wr wDx
" r Z #
X f .x/ .i / 1
d r
D Wn .t; w/.t x/ dt
i
i D0
iŠ 0 d wr
wDx
Z 1 r
d
C Wn .t; w/".t; x/.t x/r dt
0 d wr wDx
WD R1 C R2 :
First, to estimate R1 , using binomial expansion of .t x/i and Lemma 2.2, we have
! r Z 1
X r
f .i / .x/ X i
i
@
R1 D .x/i v W n .t; w/t v
dt
i D0
i Š vD0 v @wr 0 wDx
.r/ r Z 1
f .x/ @
D Wn .t; w/t r dt D f .r/ .x/ C o.1/; n ! 1:
i Š @wr 0 wDx
Next, using Lemma 2.4, we have

X 1 Z
jQi;j;r .x/j X 1
jR2 j ni
jv nxjj sn;v .x/ bn;v1 .t/j".t; x/j:jt xjr dt
2i Cj r
xr vD1 0
i;j 0
C.n/r e nx j".0; x/j.x/r

WD R3 C R4 :
Since ".t; x/ ! 0 as t ! x for a given " > 0 there exists a ı > 0, such that
j".t; x/j < " whenever 0 < jt xj < ı: Thus, for some M1 > 0, we can write
X 1
X Z
R3 M1 ni
sn;v .x/jv nxj "j
bn;v1 .t/jt xjr
2i Cj r vD1 jt xj<ı
i;j 0
Z
C bn;v1 .t/M2 jt xj dt
jt xjı
WD R5 C R6 ;
jQi;j;r .x/j
where M1 D sup and M2 is independent of t.
2i Cj r xr
i;j 0
Applying Schwarz inequality for integration and summation respectively, we

obtain
X 1
X Z 1 1=2
R5 "M1 ni sn;v .x/jv nxjj bn;v1 .t/dt
2i Cj r vD1 0
i;j 0
Z 1 1=2
bn;v1 .t x/2r dt
0
1 1
!1=2
X X X
"M1 ni
sn;v .x/ sn;v .x/.v nx/ 2j
2i Cj r vD1 vD1
i;j 0
1 Z !1=2
X 1
sn;v .x/ bn;v1 .t x/ dt2r
:
vD1 0
Using Lemmas 2.1 and 2.2, we get

X
R5 "M1 ni O nj=2 O nr=2 D O.1/:
2i Cj r
i;j 0
X 1
X Z
R6 M 2 ni sn;v .x/jv nxjj bn;v1 .t/jt xj dt
2i Cj r vD1 jt xjı
i;j 0
X 1
X Z 1=2
M2 ni sn;v .x/jv nxjj bn;v1 .t/dt
2i Cj r vD1 jt xjı
i;j 0
Z 1=2
bn;v1 .t x/ dt 2
jt xjı
1
!1=2
X X
M2 ni
sn;v .x/.v nx/ 2j
2i Cj r vD1
i;j 0
1 Z !1=2
X 1
sn;v .x/ bn;v1 .t/.t x/ dt 2
vD1 0
X
D ni O nj=2 O n=2 D O n.r /=2 D o.1/:
2i Cj r
i;j 0
Thus, due to arbitrariness of " > 0 it follows that R3 D o.1/. Also, R4 ! 0 as

n ! 1 and hence, R2 D o.1/: Collecting the estimates of R1 and R2 , we get the
required result.
Theorem 2.50 ([140] Asymptotic Formula). Let f 2 C Œ0; 1/; > 0: If f .rC2/
exists at a point x 2 .0; 1/, then
r
d r.r C 1/ .r/
lim n Sn .f; w/ f .r/
.x/ D f .x/ C Œx.1 C r/ C rf .rC1/ .x/
n!1 d wr wDx 2
x
C .2 C x/f .rC2/ .x/:
2
Proof. Using Taylor’s expansion of f , we have
X
rC2
f .i / .x/
f .t/ D .t x/i C ".t; x/.t x/rC2 ;
i D0
iŠ
where ".t; x/ ! 0 as t ! x and ".t; x/ D O..t x/ /; t ! 1 for some > 0.

Applying Lemma 2.2, we have

dr
n S n .f; w/ f .r/
.x/
d wr wDx
" rC2 #
X f .x/ Z 1 d r
.i /
Dn Wn .t; w/.t x/ dt f .x/
i .r/
i D0
iŠ 0 d wr
wDx
Z 1 r
d
C n Wn .t; w/".t; x/.t; x/rC2 dt
0 d wr wDx
WD E1 C E2 :
2 ! 3
X
rC2 .i / X i Z 1 r
f .x/ i d
E1 D 4n .x/i j r
Wn .t; w/t j dt nf .r/ .x/5
i D0
i Š j D0
j 0 d w
wDx
f .x/
.r/ r
.r/
D n Sn .t ; x/ .rŠ/
rŠ
f .rC1/ .x/

C n .r C 1/.x/Sn.r/ .t r ; x/ C Sn.r/ .t rC1 ; x/
.r C 1/Š

f .rC2/ .x/ .r C 2/.r C 1/ 2 .r/ r
C n x Sn .t ; x/
.r C 2/Š 2

C.r C 2/.x/Sn.r/ .t rC1 ; x/ C Sn.r/ .t rC2 ; x/ :
It is easily verified from Lemma 2.2 that for each x 2 .0; 1/;
.n i 1/Š .n i 1/Š
Sn .t i ; x/ D .nx/i C i.i 1/ .nx/i 1 C O.n2 /:
.n 1/Š .n 1/Š
Therefore,

nr .n r 1/Š
E1 D nf .x/
.r/
1
.n 1/Š
r
f .rC1/ .x/ n .n r 1/Š
Cn .r C 1/.x/.rŠ/
.r C 1/Š .n 1/Š
rC1
n .n r 2/Š nr .n r 2/Š
C .r C 1/Šx C r.r C 1/ .rŠ/
.n 1/Š .n 1/Š

f .rC2/ .x/ .r C 1/.r C 2/x 2 nr .n r 1/Š
Cn .rŠ/
.r C 2/Š 2 .n 1/Š
rC1
n .n r 2/Š nr .n r 2/Š
C.r C 2/.x/ .r C 1/Šx C r.r C 1/ .rŠ/
.n 1/Š .n 1/Š
rC2
n .n r 3/Š .r C 2/Š 2
C x
.n 1/Š 2

nrC1 .n r 3/Š
C.r C 1/.r C 2/ .r C 1/Šx C O.n2 / :
.n 1/Š
In order to complete the proof of the theorem it is sufficient to show that E2 ! 0

as n ! 1, which can be easily proved along the lines of the Theorem 2.49 and by
using Lemmas 2.1, 2.2 and 2.4.
Let CB Œ0; 1/ be as defined in Definition 1.10. By [60], there exists C1 > 0
such that
p
K2 .f; ı/ C1 !2 .f; ı/: (2.24)
Theorem 2.51 ([140]). Let f 2 CB Œ0; 1/: Then there exists an absolute constant
C2 > 0 such that
r !
x.x C 1/ x
jSn .f; x/ f .x/j D C2 !2 f; C ! f; ;
n1 n1
for every x 2 Œ0; 1/ and n D 3; 4; : : : :

Proof. We define a new operator SOn W CB Œ0; 1/ ! CB Œ0; 1/ as follows:
nx
SOn .f; x/ D Sn .f; x/ C f .x/ f : (2.25)
n1
Then, by Lemma 2.2, we obtain SOn .t x; x/ D 0. Now, let x 2 Œ0; 1/ and g 2 W1
2
:
From Taylor’s formula,
Z t
g.t/ D g.x/ C g0 .x/.t x/ C .t u/g00 .u/d u; t 2 Œ0; 1/;
x
we get
Z t
SOn .g; x/ g.x/ D SOn .t u/g 00 .u/d u; x
0
Z t
D Sn .t u/g 00 .u/d u; x
0
Z nx=.n1/
n
C x u g 00 .u/d u: (2.26)
x n1
On the other hand,

ˇZ t ˇ
ˇ ˇ
ˇ .t u/g00 .u/d uˇ .t x/2 jjg 00 jj (2.27)
ˇ ˇ
0
and
ˇZ ˇ
ˇ nx=.n1/ n ˇ
ˇ 00 ˇ
ˇ x u g .u/d uˇ
ˇ x n1 ˇ
nx 2
x jjg 00 jj
n1
x2 x.1 C x/ 00
:jjg 00 jj jjg jj: (2.28)
.n 1/2 .n 1/2
Thus, by (2.26)–(2.28) and by the positivity of Sn , we have

x.1 C x/
jSOn .g; x/ g.x/j Sn .t x/2 ; x :jjg 00 jj C :jjg 00 jj:
.n 1/2
Hence, in view of Lemma 2.2,

2nx C .n C 2/x 2 x.1 C x/
jSOn .g; x/ g.x/j C :jjg 00 jj
.n 1/.n 2/ .n 1/2

2n 1 x.1 C x/ 00
C : jjg jj
.n 2/ .n 1/ n1
7
:x.1 C x/:jjg 00 jj: (2.29)
.n 1/
Again, applying Lemma 2.2, we find

1
X Z 1
jSn .f; x/j sn;v .x/ bn;v1 .t/f .t/dt C e nx jf .0/j jjf jj:
vD1 0
This means that Sn is a contraction; that is, jjSn f jj jjf jj; f 2 CB Œ0; 1/: Thus,
by (2.25),
jjSOn f jj jjSn f jj C 2jjf jj 3jjf jj; f 2 CB Œ0; 1/: (2.30)
Using (2.25), (2.29), and (2.30), we obtain

ˇ ˇ
ˇ nx ˇ
O ˇ
jSn .f; x/ f .x/j jSn .f; x/ f .x/j C ˇf .x/ f ˇ
.n 1/ ˇ
jSOn .f g; x/ .f g/.x/j C jSOn .g; x/ g.x/j
ˇ ˇ
ˇ nx ˇ
ˇ
C ˇf .x/ f ˇ
.n 1/ ˇ
ˇ ˇ
7 ˇ nx ˇ
4jjf gjjC 00 ˇ
:x.1Cx/:jjg jjC ˇf .x/f ˇ
.n1/ .n1/ ˇ

x.1 C x/
7 jjf gjj C :jjg 00 jj
.n 1/
ˇ ˇ
ˇ x ˇ
C ˇ ˇ
sup ˇf t .n 1/ f .t/ˇ
t;t .x=.n1//2Œ0;1/

x.1 C x/ x
7 jjf gjj C :jjg 00 jj C ! f; :
.n 1/ .n 1/
Now, taking the infimum on the right-hand side over all g 2 W1

2
and using (2.24),
we get the assertion of the theorem.
Theorem 2.52 ([140]). Let n > r C 2 3 and f .i / 2 CB Œ0; 1/ for i 2
f0; 1; 2; : : : ; rg: Then for x 2 Œ0; 1/, we have
ˇ .r/ ˇ
ˇS .f; x/ f .r/ .x/ˇ
n

nr nr
1 jjf .r/ jj C
.n 1/.n 2/ .n r/ .n 1/.n 2/ .n r/
" 1=2 #
.n C .r C 1/.r C 2//x 2 C 2.n C r.r C 2//x C r.r C 1/
1C
nr 2
:!.f .r/ ; .n r 1/1=2 /:

Proof. Obviously,
Z 1 1
X
bnr;vCr1 .t/dt D 1 and sn;v .x/ D 1:
0 vD0
We can use Lemma 2.5 to obtain
X 1
nr
Sn.r/ .f; x/ f .r/
.x/ D sn;v .x/
.n 1/.n 2/ .n r/ vD0
Z 1

bnr;vCr1 f .r/ .t/ f .r/ .x/ dt
0

nr
C 1 f .r/ .x/: (2.31)
.n 1/.n 2/ .n r/
Taking into account the well-known property !.f .r/ ; ı/ .1 C /!.f .r/ ; ı/;
where 0; we get
X 1
nr
jSn.r/ .f; x/ f .r/ .x/j sn;v .x/
.n 1/.n 2/ .n r/ vD0
Z 1
ˇ ˇ
bnr;vCr1 ˇf .r/ .t/ f .r/ .x/ˇ dt
0

nr
C jjf .r/ jj
.n 1/.n 2/ .n r/
X 1
nr
sn;v .x/
.n 1/.n 2/ .n r/ vD0
Z 1

bnr;vCr1 .t/.1 C ı 1 jt xj/! f .r/ ; ı dt
0

nr
C 1 jjf .r/ jj: (2.32)
.n 1/.n 2/ .n r/
Further, using Cauchy’s inequality, we have

1
X Z 1
sn;v .x/ bnr;vCr1 .t/jt xjdt
vD0 0
( 1 Z ) 1=2
X 1
sn;v .x/ bnr;vCr1 .t/.t x/ dt
2
: (2.33)
vD0 0
Also, by direct computations, we have

1
X Z 1
sn;v .x/ bnr;vCr1 .t/.t x/2 dt
vD0 0
n C .r C 1/.r C 2/ 2 2n C 2r.r C 2/
D x C x
.n r 1/.n r 2/ .n r 1/.n r 2/
r.r C 1/
C :
.n r 1/.n r 2/
Thus, by (2.32) and (2.33), we obtain
jSn.r/ .f; x/ f .r/ .x/j

nr n C .r C 1/.r C 2/ 2
1 C ı 1 x
.n 1/.n 2/ : : : .n r/ .n r 1/.n r 2/
1=2
2n C 2r.r C 2/ r.r C 1/
C xC !.f .r/ ; ı/
.n r 1/.n r 2/ .n r 1/.n r 2/

nr
C 1 jjf .r/ jj:
.n 1/.n 2/ .n r/
p
Choosing ı 1 D n r 1, we obtain the desired result.
A slightly different form of summation–integral-type Szász–Beta operators is
discussed in [119], which, for x 2 Œ0; 1/, is defined as
Z 1 1
X Z 1
Sn .f; x/ D Kn .x; t/f .t/dt D sn;v .x/ bn;v .t/dt C e nx f .0/; (2.34)
0 vD1 0
where
.nx/v 1 t v1 .nC1/v t v1

sn;v .x/De nx ; bn;v .t/D W D ;
vŠ B.nC1; v/ .1Ct/nCvC1 .v1/Š .1Ct/nCvC1
and .n/k represents the Pochhammer symbol given by
.n/v D n.n C 1/.n C 2/.n C 3/ .n C v 1/:
An alternate form in terms of the Pochhammer–Berens confluent hypergeometric

function of these operators is
Z 1
e nx nxf .t/ nxt
S.f; x/ D .n C 1/ F
1 1 n C 2I 2I dt C sn;0 .x/f .0/:
0 .1 C t/nC2 1Ct
Remark 2.1. For n > 0 and r > 0, the rth moments of these operators are given by
x.n r C 1/.r/ 1
Sn .t r ; x/ D Lr1 .nx/;
.n/
where L1r1 .nx/ is the generalized Laguerre polynomials, given by the relation
.m C n/Š
n .x/ D
Lm 1 F1 .nI m C 1I x/ :
mŠnŠ
Remark 2.2. One can easily observe that
ni 1 .n i /Š i ni 2 .n i /Š i 1
Sn .t i ; x/ D x C i.i 1/ x C O.n2 /:
.n 1/Š .n 1/Š
The main advantage of studying these operators is that they reproduce constant
and linear functions. Some direct estimates in simultaneous approximation were
established in [119].
Theorem 2.53 ([119] Asymptotic formula). Let f 2 C Œ0; 1/; > 0: If f .rC2/
h i r.r 1/ .r/
lim n S.r/
n .f; x/ f .r/ .x/ D f .x/ C .x C 1/rf .rC1/ .x/
n!1 2
C.x 2 C x/f .rC2/ .x/:
Theorem 2.54 ([119] Error estimation). Let f 2 C Œ0; 1/; > 0 and r
m .r C 2/. If f .m/ exists and is continuous on .a
; b C
/;
> 0, then for n
sufficiently large, we have
X
m
jjS.r/
n .f; :/ f
.r/
jj C1 n1 jjf .i / jj C C2 !.f .rC1/ ; n1=2 / C O.n2 /;
j Dr
where the constants C1 and C2 are independent of f and n, !.f; ı/ is the modulus of
; bC
/, and jj:jj denotes the sup-norm on the interval Œa; b:
Proof. By a Taylor expansion of f , we have
X
m
f .i / .x/ f .m/ ./f .m/ .x/
f .t/D .tx/i C .tx/m .t/Ch.t; x/.1.t//;
i D0
iŠ mŠ
where lies between t and x and .t/ is the characteristic function on the interval
.a
; b C
/. For t 2 .a
; b C
/; x 2 Œa; b, we have
X m
f .i / .x/ f .m/ ./ f .m/ .x/
f .t/ D .t x/i C .t x/i :
i D0
iŠ mŠ
For t 2 Œ0; 1/ n .a
; b C
/; we define
X
m
f .i / .x/
h.t; x/ D f .t/ .t x/i :
i D0
iŠ
( )
X
m
f .i / .x/
n .f; x/ f
S.r/ .x/ D n ..t x/ ; x/ f
S.r/
.r/ i .r/
.x/
i D0
iŠ

f .m/ ./ f .m/ .x/
CS.r/
n .t x/m .t/; x
mŠ
n .h.t; x/.1 .t//; x/

CS.r/
WD E1 C E2 C E3 :
Using Remark 2.2, we obtain

!
X m
f .i / .x/ X i
i
dr
E1 D .x/i j r
i D0
i Š j D0 j dx
j 1
n .n j /Š j nj 2 .n j /Š j 1 2
x C j.j 1/ x C O.n / f .r/ .x/:
.n 1/Š .n 1/Š
Consequently,
X
m
kE1 kC Œa;b C1 n1 kf .i / kC Œa;b C O.n2 /; uniformly on Œa; b:
i Dr
Next, we estimate E2 as follows:

Z ˇ .m/ ˇ
1 ˇ f ./ f .m/ .x/ ˇ
jE2 j Kn.r/ .x; t/ ˇˇ ˇ jt xjm .t/dt
ˇ
0 mŠ
Z
!.f .m/ ; ı/ 1 .r/ jt xj
jKn .x; t/j 1 C jt xjm dt:
mŠ 0 ı
Next, by Remark 2.1, it follows that

1
X Z 1
sn;v .x/jv nxj j
bn;v .t/ jt xjq dt D O..n.j Dq/=2 /:
vD1 0
Therefore, by Lemma 2.4, we get

1
X Z 1
jsn;v
.r/
.x/j bn;v .t/ jt xjq dt
vD1 0
X X
1 Z 1
C2 ni sn;v .x/jv nxjj bn;v .t/jt xjq dt
2i Cj r vD1 0
i;j 0
D O.n.rq/=2 /;
jQi;j;r .x/j
uniformly in x, where C2 D sup sup r
: Choosing ı D n1=2 , we
2i Cj r x2Œa;b x
i;j 0
obtain, for s > 0,
!.f .m/ ; n1=2 /

jjE2 jjC Œa;b O.n.rm/=2 / C n1=2 O.n.rm1/=2 / C O.ns /
mŠ
C2 n.mr/=2 !.f .m/ ; n1=2 /:
Since t 2 Œ0; 1/ n .a
; b C
/, we can choose ı such that jt xj ı for all
x 2 Œa; b. Thus, by Lemma 2.4, we get
1 X
X Z
jjE2 jjC Œa;b n sn;v .x/jv nxj
i j
bn;v .t/jh.t; x/jdt
v1 2i Cj r jt xjı
i;j 0
C.n/r e nx jh.0; x/j:
If ˇ is any integer greater than or equal to f; mg, then we can find a constant C3
such that jh.t; x/j C3 jt xjˇ for jt xj ı. Hence, using the Schwarz inequality
for both integration and summation, Lemma 2.1 and Remark 2.1, we easily see that
E3 D O.nq / for any q > 0; uniformly on Œa; b: Combining the estimates of
E1 ; E2 ; E3 ; we see that the required result is immediate.
Theorem 2.55 ([119] Direct result). Let f 2 CB Œ0; 1/: Then for all x 2 Œ0; 1/
and n D 2; 3; 4; : : :, there exists an absolute positive constant C > 0 such that
r !
x.2 C x/
jSn .f; x/ f .x/j C !2 f; ;
n1
where CB Œ0; 1/ is given in Definition 1.10.

Proof. Let g 2 W1
2
and x; t 2 Œ0; 1/: Applying the Taylor expansion
Z t
0
g.t/ D g.x/ C g .x/.t x/ C .t u/g 00 .u/d u;
x
we have by Remark 2.1 that

Z t
Sn .g; x/ g.x/ D Sn .t u/g00 .u/d u; x :
x
Rt
On the other hand, j x .t u/g00 .u/d uj .t x/2 jjg 00 jj: Therefore,
x.2 C x/ 00
jSn .g; x/ g.x/j Sn .t x/2 ; x jjg 00 jj D jjg jj:
n1
Also, we have
1
X Z 1
jSn .f; x/j sn;v .x/ bn;v .t/jf .t/jdt C e nx jf .0/j jjf jj:
vD1 0
Thus,
jSn .f; x/ f .x/j jSn .f g; x/ .f g/.x/j

CjSn .g; x/ g.x/j
x.2 C x/ 00
2jjf gjj C jjg jj:
n1
p the infimum over all g 2 W1 and using the inequality K2 .f; ı/

2
Now taking
C !2 .f; ı/; ı > 0, we get the required result.
For 0 1 and CB Œ0; 1/ as given in Definition 1.10, the weighted modulus
of continuity and K-functional are defined as
!'2 .f; t/ D sup sup j2h' f j:

0<ht x˙h' .x/2Œ0;1/
D 2 D ff 2 CB Œ0; 1/ W f 0 2 A:C:loc.0;1/ ; jj' 2 f 00 jj < 1g;
K'2 .f; t 2 / D inffjjf gjj C t 2 jj' 2 g 00 jj W g 2 D 2 g;
2
D D ff 2 D 2 W jjf 00 jj < 1g;
2 2
K ' .f; t 2 / D inffjjf gjj C t 2 jj' 2 g 00 jj C t 4=.2 / jjg 00 jj W g 2 D g:
It is well known that

2
!'2 .f; t/
K'2 .f; t 2 /
K ' .f; t 2 /:
Qi and Zhang [204] obtained the pointwise approximation equivalence theorems

using the above unified modulus of smoothness.
Theorem 2.56 ([204] Direct
p result). Let f 2 CB Œ0; 1/; 0 1; ın2 .x/ D
' 2 .x/ C n1 , and '.x/ D x.2 C x/; n 4. Then

jSn .f; x/ f .x/j C !'2 f; n1=2 ın1 .x/ :
Theorem 2.57 ([204] Inverse result).

p Let f 2 CB Œ0; 1/; 0 < ˛ < 2; 0 1;
ın2 .x/ D ' 2 .x/ C n1 , and '.x/ D x.2 C x/; n 3. Then
jSn .f; x/ f .x/j D O..n1=2 ın1 .x//˛ /
if and only if !'2 .f; t/ D O.t ˛ /:
2.5 Phillips Operators
Let CB Œ0; 1/ be as defined in Definition 1.10 equipped with the norm jjf jj D
supx0 jf .x/j: The Phillips operators (see [190, 199]) are defined by
1
X Z 1
.Ln f /.x/ Ln .f; x/ D n pn;k .x/ pn;k1 .v/f .v/dvCe nx f .0/; (2.35)
kD1 0
where
.nx/k
pn;k .x/ D e nx : ;
kŠ
k D 0; 1; : : :, and x 0:
Taking into account the construction given in [71], we define the following
Phillips-type operator:
Z 1
1
Ltn .f; x/ .Ltn f /.x/ D : g.x; t; /:Ln .f; /d (2.36)
G.x; t/ 0
and Ltn .f; 0/ D f .0/; where g WTŒ0; 1/ .t0 ; 1/ Œ0; 1/ ! Œ0; 1/ is a function
such that g.x; t; :/ 2 C Œ0; 1/ L1 Œ0; 1/ for all .x; t/ 2 Œ0; 1/ .t0 ; 1/ and
t0 0; G W .0; 1/ .t0 ; 1/ ! .0; 1/,
Z 1
G.x; t/ D g.x; t; /d; (2.37)
0
with the assumptions

2.5 Phillips Operators 53
Z 1
1
: g.x; t; /:. x/d D 0 (2.38)
G.x; t/ 0
and
Z 1
1
: g.x; t; /:. x/2 d ˇ.t/x (2.39)
G.x; t/ 0
for every .x; t/ 2 .0; 1/ .t0 ; 1/ and ˇ W .t0 ; 1/ ! .0; 1/ a given function.
The parameter t may depend only on the natural number n. For example, an operator
of type (2.36) is the following:

X 1
n tx t k tx.tx C 1/ .tx C k 1/
Snt .f; x/ D 1 C : n 1C :
t n kŠ
kD1
Z 1
: pn;k1 .v/f .v/dv C f .0/ ;
0
where f 2 CB Œ0; 1/; x 0 and t > 0 (see [71]). The Phillips operators are
closely related to the Szász operators [71] defined by
1
X
k
Sn .f; x/ .Sn f /.x/ D pn;k .x/f : (2.40)
n
kD0
Indeed, if we replace the discrete values f .k=n/ in (2.40) by the integral terms
Z 1
n pn;k1 .v/f .v/dv; k D 1; 2; : : : ;
0
then we arrive at (2.35). Another generalization of (2.35) can be found in [99].

In [20, 21, 123], the local approximation properties of the operators defined
by (2.35) were studied. Let us consider CN Œ0; 1/ WD ff 2 C Œ0; 1/ W jf .t/j
C e N t ; C > 0g: The norm jj:jjCN for functions belonging to the class CN Œ0; 1/ is
defined as
jjf jjCN D sup jf .t/je N t :

x2Œ0;1/
Theorem 2.58 ([21] Pointwise convergence). If p D 1; 2; 3; : : :, f 2 CN Œ0; 1/

for some N > 0 and f .p/ exist at a point x 2 Œ0; 1/, then
n .f; x/ D f
L.p/ .x/ C o.1/; as n ! 1:
.p/
(2.41)
Furthermore, if f .p/ exists and is continuous on .a

; b C
/ .0; 1/;
> 0;
then (2.41) holds uniformly in x 2 Œa; b.
Theorem 2.59 ([21] Asymptotic formula). Let f 2 CN Œ0; 1/ for some n > 0.
If f .pC2/ exists at a point x 2 .0; 1/, then
n .f; x/ f
lim ŒL.p/ .x/ D pf .pC1/ .x/ C xf .pC2/ .x/:
.p/
(2.42)
!1
Additionally, if f .pC2/ exists and is continuous on .a

; b C
/ .0; 1/;
> 0;
then (2.42) holds uniformly in x 2 Œa; b.
Theorem 2.60 ([21] Error estimation). Let f 2 CN Œ0; 1/ for some n > 0 and
p q p C 2. If f .q/ exists and is continuous on .a
; b C
/ .0; 1/;
> 0;
then for sufficiently large,
jjL.p/
n .f; :/ f
.p/
jj maxfC n..qp/=2 !.f .q/ ; n1=2 /; C 0 n1 g;
where C D C.p/; C 0 D C 0 .p; f /; !.f .q/ ; ı/ is the modulus of continuity of f .q/

on .a
; b C
/, and jj:jj denotes the sup-norm on Œa; b.
In [72], direct results are formulated by the second-order Ditzian–Totik modulus
of smoothness given by
!'2 .f; ı/ D sup sup jf .x C h'.x// 2f .x/ C f .x h'.x//j;

0<hı x˙h'.x/2Œ0;1/
p
'.x/ D x; x 0: The corresponding K-functional is
K2;' .f; ı 2 / D inf fjjf hjj C ı 2 jj' 2 h00 jjg;

2
h2W1 .'/
where
2
W1 .'/ D fh 2 CB Œ0; 1/ W h0 2 ACloc Œ0; 1/; ' 2 h00 2 CB Œ0; 1/g:
It is known (see [62]) that K2;' .f; ı 2 / and !'2 .f; ı/ are equivalent; that is, there are
an absolute positive constant and C > 0 such that
C 1 !'2 .f; ı/ K2;' .f; ı 2 / C !'2 .f; ı/: (2.43)
Finta and Gupta [72] estimated a global direct result for Phillips-type operators. To
prove the direct result, they used the following lemmas:
Lemma 2.6 ([72]). The operators Ln and Ltn are linear positive and
Ln .u x; x/ D Ltn .u x; x/ 0
and
2
Ln ..u x/2 ; x/ D :'.x/2 ; x 0:
n
Moreover, jjLn f jj jjf jj and jjLtn f jj jjf jj; f 2 CB Œ0; 1/:

Proof. These properties can be derived by simple computations using (2.35)–(2.38):

1
X
pn;k .x/ D 1 (2.44)
kD1
and
Z 1
n pn;k1 .v/dv D 1; k D 1; 2; 3; : : : : (2.45)
0

Lemma 2.7 ([72]). For h 2 W1
2
.'/, we have
Z ˇZ ˇ
1 ˇ v ˇ 1
n pn;k1 .v/ ˇˇ .v w/h .w/d wˇˇ dv jj' 2 h00 jj;
00
0 k=n n
where k D 1; 2; : : :.
Proof. By [62], we obtain
jv wj jv .k=n/j

w k=n
for w between k=n and v. Hence,

ˇZ ˇ ˇZ v ˇ
ˇ v ˇ ˇ jv wj ˇ
ˇ .v w/h00 .w/d wˇˇ ˇˇ :wjh00 .w/jd wˇˇ
ˇ w
k=n k=n
ˇZ v ˇ
ˇ jv wj ˇˇ
ˇˇ d wˇ :jj' 2 h00 jj
k=n w

n k 2
: v :jj' 2 h00 jj:
k n
Thus, by (2.45), after simple computation, we have

Z ˇZ ˇ Z 1
1 ˇ v ˇ n2 2 00 k 2
n pn;k1 .v/ ˇˇ ˇ 00
.vw/h .w/d wˇ dv jj' h jj pn;k1 .v/ v dv
0 k=n k 0 n
n2 2 00 k 1
D jj' h jj: 3 D :jj' 2 h00 jj;
k n n
which was to be proved.
Lemma 2.8. If
2
k k
rn;k .x/ D x ;
n n2
k D 0; 1; 2; : : :, and x 0, then for x > 0, we have

1 Z
n2 X 1
.Ln f /00 .x/ D : pn;k .x/:n pn;k1 .v/f .v/dv:rn;k .x/ C n2 e nx f .0/
x2 0
kD1
and
1
00 n2 X k
.Sn f / .x/ D 2 : pn;k .x/f :rn;k .x/:
x n
kD0
Proof. Because
0
xpn;k .x/ D .k nx/:pn;k .x/; (2.46)
00 1
pn;k .x/ D .k nx/2 k :pn;k .x/: (2.47)
x2
Hence,
1
X Z 1
.Ln f /00 .x/ D n pn;k .x/00 :n pn;k1 .v/f .v/dv C n2 e nx f .0/
kD1 0
1 Z
n2 X 1
D : pn;k .x/:n pn;k1 .v/f .v/dv:rn;k .x/ C n2 e nx f .0/:
x2 0
kD1
The expression of .Sn f /00 is known, and it can be obtained in a similar way
from (2.40).
Lemma 2.9. We have
jj' 2 .Ln h/00 jj 8jj' 2.h/00 jj; h 2 W1

2
.'/:
Proof. If we use Lemma 2.8, (2.51), (2.52), (2.45), and Lemma 2.7, then
ˇ ˇ
'.x/2 ˇ.Ln h/00 .x/ .Sn h/00 .x/ˇ
1X
n
:jj' 2 h00 jj: pn;k .x/: jrn;k .x/j
x
kD1
1
" 2 #
n X k k
2 00
:jj' h jj: pn;k .x/: x C 2
x n n
kD1

n 1
:jj' 2 h00 jj: Sn .u x/2 ; x C Sn .u; x/
x n
n 2x
D :jj' 2 h00 jj: D 2jj' 2 h00 jj: (2.48)
x n
Following [62], we have
jj' 2 .Sn h/00 jj 6jj' 2 .h/00 jj; h 2 W1

2
.'/:
Hence, by (2.48), we have
jj' 2 .Ln h/00 jj jj' 2 .Ln h/00 ' 2 .Sn h/00 jj C jj' 2 .Sn h/00 jj 8jj' 2 .h/00 jj:

Theorem 2.61 ([72] Direct estimate). Let .Ln /n1 and .Ltn /n1 be defined as
in (2.35) and (2.36). Then there exists C > 0 such that

1
jjLn f f jj C !'2 f; p (2.49)
n
and

jjLtn f f jj C !'2 f; .n1 C ˇ.t//1=2 (2.50)
for all f 2 CB Œ0; 1/ and n D 1; 2; : : : :

Proof. Let h 2 W1
2
.'/ and x 0. By a Taylor expansion,
Z v
k k k
h.v/ D h C h0 v C .v w/h00 .w/d w (2.51)
n n n k=n
and by (2.45), we obtain
jLn .h; x/ Sn .h; x/j

1 ˇZ 1 ˇ
X ˇ k ˇ
n pn;k .x/ ˇˇ pn;k1 .v/ h.v/ h dv ˇˇ
0 n
kD1
1 ˇZ Z v ˇ
X ˇ 1
k ˇ
0 k
Dn pn;k .x/ ˇˇ pn;k1 .v/ h v C .vw/h .w/d w dv ˇˇ
00
0 n n k=n
kD1
1
X ˇZ Z ˇ
ˇ 1 v ˇ
Dn pn;k .x/ ˇˇ pn;k1 .v/ .v w/h00 .w/d w dv ˇˇ
kD1 0 k=n
1
X Z ˇZ ˇ
1 ˇ v ˇ
n pn;k .x/ pn;k1 .v/ ˇˇ .v w/h .w/d wˇˇ dv;
00
kD1 0 k=n
because
Z 1
k
pn;k1 .v/ v dv D 0; (2.52)
0 n
k D 1; 2; : : : : Using Lemma 2.7 and (2.44), we get

1
1 2 00 X 1
jLn .h; x/ Sn .h; x/j jj' g jj: pn;k .x/ jj' 2 h00 jj: (2.53)
n n
kD1
Now, let f 2 CB Œ0; 1/. Then, in view of Lemma 2.6, (2.53), and [62], we have
jLn .h; x/ Sn .h; x/j

jLn .f h; x/ .f h/xj C jLn .h; x/ Sn .h; x/j C jSn .h; x/ h.x/j
2 2 00
2jjf hjj C jj' h jj:
n
Hence,

1 2 00 1
jjLn f Sn f jj 2 inf jjf hjj C jj' h jj D 2K2;' f; ;
2
h2W1 .'/ n n
which completes the proof of (2.49).

Let f 2 CB Œ0; 1/ and x > 0. By a Taylor expansion,
Z
.Ln f /./ D .Ln f /.x/ C .Ln f /0 .x/:. x/ C . w/.Ln f /00 .w/d w
x
andby (2.37), (2.38), [62], we have
j.Ltn f /.x/ .Ln f /.x/j

ˇ Z 1 (Z ) ˇ
ˇ 1 ˇ
ˇ 00 ˇ
Dˇ : g.x; t; / . w/.Ln f / .w/d w d ˇ
ˇ G.x; t/ 0 x ˇ
Z 1 ˇZ ˇ
ˇ . w/ ˇ
1 ˇ ˇ
: g.x; t; / ˇ ˇ d:jj' 2 .Ln f /00 jj
G.x; t/ 0 ˇ x '.w/2 d w ˇ
Z 1
1 1
: g.x; t; /. x/2 d: jj' 2 .Ln f /00 jj:
G.x; t/ 0 '.x/2
Hence, in view of (2.39), we get
jjLtn f Ln f jj ˇ.t/jj' 2 .Ln f /00 jj: (2.54)
Next, using (2.54) and Lemma 2.9, we get
jjLtn h Ln hjj 8ˇ.t/jj' 2 h00 jj:
Then, by Lemma 2.6, we have
jjLtn f Ln f jj jjLtn .f h/ Ln .f h/jj C jjLtn h Ln hjj

2jjf hjj C 8ˇ.t/jj' 2h00 jj
˚
8 jjf hjj C ˇ.t/jj' 2 h00 jj : (2.55)
By (2.49), (2.43), and the definition of K2;' .f; n1 /, we obtain

1
jjLn f f jj C jjf hjj C jj' 2 h00 jj : (2.56)
n
Then (2.55) and (2.56) imply

1
jjLtn f f jj jjLtn f Ln f jjCjjLn f f jj C jjf hjjC ˇ.t/C jj' 2 h00 jj
n
or

1
jjLtn f f jj C:K2;' f; C ˇ.t/:
n
Again using (2.43), we arrive at (2.50), which completes the proof of the theo-
rem.
In 2011, Heilmann and Tachev [151] proved the commutativity of the Phillips
operators as well as their commutativity with an appropriate differential operator
and established a strong converse inequality of type A for the approximation
of real-valued continuous bounded functions f on the interval Œ0; 1/. In the
following, the norm is defined as jjf jj D supx0 jf .x/j: They also obtained a strong
Voronovskaja-type theorem.
Theorem 2.62 ([151] Voronovskaja-type theorem). Let g 2 CB Œ0; 1/; ' 2 g 000 ;
' 3 g 000 2 CB Œ0; 1/, and n > 0. Then
ˇˇ ˇˇ
ˇˇ ˇˇ
ˇˇLn g g 1 ' 2 g 00 ˇˇ
ˇˇ n ˇˇ
p ( r )
61 4p 1 3 000 1 C 2c 1 2 000
max 1 C 2c p jj' g jj; jj' g jj ;
2 n 3 n c n
where c denotes an arbitrary positive constant.

Theorem 2.63 ([151]). For every f 2 CB Œ0; 1/ and n > 0,

1
jjLn f f jj 2K'2 f;
n
holds.
Theorem 2.64 ([151]). For every f 2 CB Œ0; 1/ and n > 0,

1
K'2 f; 92:16 jjLn f f jj
n
holds.
2.6 Integral Modification of Jain Operators
In 1972, Jain [161] introduced the following operators:

1
X .ˇ/
Bnˇ .f; x/ D ln;k .x/f .k=n/; (2.57)
kD0
where 0 ˇ < 1 and the basis function is defined as
.ˇ/ nx.nx C kˇ/k1 .nxCkˇ/

ln;k .x/ D e :
kŠ
P
In [161], 1
.ˇ/
kD0 ln;k .x/ D 1: As a special case when ˇ D 0, the operators (2.57)
reduce to the well-known Szász–Mirakyan operators. In 1985, Umar and Razi [235]
extended the studies, proposing the Kantorovich-type integral modification of the
operators (2.57).
To approximate Lebesgue integrable functions on the interval Œ0; 1/, Gupta et al.
[146] introduced a new sequence of summation–integral-type operators, defined as
2.6 Integral Modification of Jain Operators 61
1
X Z 1
.ˇ/ .ˇ/
.ˇ/
Dn;c .f; x/ D n ln;k .x/ pnCc;k1 .t; c/f .t/ dt C ln;0 .x/f .0/; (2.58)
kD1 0
where
.ˇ/ nx.nx C kˇ/k1 .nxCkˇ/ .t/k .k/

ln;k .x/ D e ; pn;k .t; c/ D .t/;
kŠ kŠ n;c
with c 0, and two special cases:
1. n;0 .t/ D e nt ,
2. n;1 .t/ D .1 C t/n :
.ˇ/
For the case ˇ D 0; c D 0, our operators Dn;c reduce to Phillips operators [199].
For ˇ D 0; c D 1, we get the Szász–Beta-type operators introduced by Gupta et al.
[140]. One can easily observe by simple computation that
Z 1
.k C r/Š 1
pn;k .t; c/t r dt D QrC1 : (2.59)
i D1 .n i c/
0 kŠ
The present section deals with the approximation properties of the operators
.ˇ/
Dn;c .f; x/. Here we present some direct theorems, which include pointwise conver-
gence, asymptotic formula, rate of approximation in terms of modulus of continuity,
and weighted approximation.
Lemma 2.10 ([161]). For ˇ < 1, we have
x
Bnˇ .1; x/ D 1; Bnˇ .t; x/ D
1ˇ
and
x2 x
Bnˇ .t 2 ; x/ D C :
.1 ˇ/2 n.1 ˇ/3
Lemma 2.11 ([146]). For ˇ < 1, we have
nx 1
.ˇ/
Dn;c .1; x/ D 1; Dn;c
.ˇ/
.t; x/ D ;
.n c/ .1 ˇ/

nx nx 1 C .1 ˇ/2
.t ; x/ D
.ˇ/ 2
Dn;c C :
.n c/.n 2c/ .1 ˇ/2 .1 ˇ/3
Remark 2.3. From Lemma 2.11, it follows that

.ˇ/ ˇx cx
Dn;c .t x; x/ D C ;
1ˇ .n c/.1 ˇ/

.ˇ/ x2 2
2 nc.1C4ˇ/C2c .12ˇ/ nxŒ1C.1ˇ/2
Dn;c ..tx/2 ; x/ D ˇ C C :
.1ˇ/2 .nc/.n2c/ .nc/.n2c/.1ˇ/3
.ˇ/
Furthermore, Dn;c ..t x/m ; x/ is a polynomial in x of degree m, and for every
x 2 Œ0; 1/,

1
.ˇ/
Dn;c ..t x/ ; x/ D O Œ.mC1/=2 ; as n ! 1:
m
n
Theorem 2.65 ([146]). Let f 2 C Œ0; 1/ and ˇ ! 0 as n ! 1. Then the

.ˇ/
sequence fDn;c .f; x/g converges uniformly to f .x/ in Œa; b, where 0 a < b
< 1.
.ˇ/ .ˇ/
Proof. In view of Lemma 2.11, Dn;c .1; x/ D 1 for every n 2 N, Dn;c .t; x/ D
.ˇ/ 1C.1ˇ/2
.nc/.1ˇ/ tends to x, and Dn;c .t; x/ D .nc/.n2c/ .1ˇ/2 C .1ˇ/3
nx nx nx
tends to
x 2 as n ! 1, uniformly on every compact subset of Œ0; 1/. Hence, by the
Bohman–Korovkin theorem, the required result follows.
Theorem 2.66 ([146]). Let f be bounded and integrable on Œ0; 1/ and have a
second derivative at a point x 2 Œ0; 1/ with ˇ ! 0 as n ! 1. Then
x.cx C 2/ 00
.ˇ/
lim nŒDn;c .f; x/ f .x/ D cxf 0 .x/ C f .x/:
n!1 2
Remark 2.4. For 0 ˇ ˇ 0 =n < 1, from Remark 2.3, we have
ˇ0 x cx
˛1 WD Dn;c
.ˇ/
.t x; x/ C ;
n.1 ˇ/ .n c/.1 ˇ/
0
x2 ˇˇ nc.1C4ˇ/C2c 2 .12ˇ/
˛2 W DDn;c
.ˇ/
..tx/2 ; x/ C
.1ˇ/2 n .nc/.n2c/
nxŒ1C.1ˇ/2
C :
.nc/.n2c/.1ˇ/3
Theorem 2.67 ([146]). Let f 2 CB Œ0; 1/ and 0 ˇ ˇ 0 =n < 1. Then
p ˇ ˇ
ˇ ˇ0 x cx ˇ
jDn;c
.ˇ/
.f; x/ f .x/j C !2 .f; ın / C ! f; ˇˇ C ˇ ;
n.1 ˇ/ .n c/.1 ˇ/ ˇ
where C is a positive constant and ın D ˛12 C ˛2 , which are given in Remark 2.4.
The next result is the weighted approximation theorem, where the approximation
formula holds on the interval Œ0; 1/:
2.6 Integral Modification of Jain Operators 63
Let Bx 2 Œ0; 1/ D ff W for every x 2 Œ0; 1/; jf .x/j Mf .1 C x 2 /; Mf being a

constant depending on f g: By Cx2 Œ0; 1/; we denote the subspace of all continuous
f .x/
functions belonging to Bx 2 Œ0; 1/ and satisfying the condition limx!1 1Cx 2 is
finite. The norm on Cx2 Œ0; 1/ is kf kx 2 D supx2Œ0;1/ f .x/

1Cx 2
:
Theorem 2.68 ([146]). Let ˇ ! 0 as n ! 1: Then for each f 2 Cx2 Œ0; 1/ and
n > 2c, we have
lim kDn;c
.ˇ/
.f / f kx 2 D 0:
n!1
Proof. Using [75], we see that it is sufficient to verify the following conditions:
lim kDn;c .t ; x/ x kx 2 D 0; D 0; 1; 2:
.ˇ/
(2.60)
n!1
.ˇ/
Since Dn;c .1; x/ D 1, therefore for D 0 (2.60) holds. By Lemma 2.11 for n > c;
we have
.ˇ/
jDn;c .t; x/ xj
kDn;c
.ˇ/
.t; x/ xkx 2 D sup ;
x2Œ0;1/ 1 C x2

n x
1 sup
.n c/.1 ˇ/ x2Œ0;1/ 1 C x
2

n
1 ;
.n c/.1 ˇ/
and the condition (2.60) holds for D 1 as n ! 1: Again by Lemma 2.11, for
n > 2c; we have
.ˇ/
jDn;c .t 2 ; x/ x 2 j
kDn;c .t ; x/ x 2 kx 2 D sup
.ˇ/ 2
;
x2Œ0;1/ 1 C x2

n2 x2
1 sup
.n c/.n 2c/.1 ˇ/2 x2Œ0;1/ 1 C x
2

nŒ1 C .1 ˇ/2 x
C sup ;
.n c/.n 2c/.1 ˇ/3 x2Œ0;1/ 1 C x 2
and so the condition (2.60) holds for D 2 as n ! 1:

2.7 Generalized Bernstein–Durrmeyer Operators
Stancu [220] introduced a sequence of positive linear operators depending on the

parameters ˛ and ˇ; satisfying the condition 0 ˛ ˇ, the so-called Bernstein–
Stancu operators, as
X
n
kC˛
Bn;˛;ˇ .f I x/ D f pn;k .x/ ; (2.61)
nCˇ
kD0

where pn;k .x/ D kn x k .1 x/nk , and showed that as classical Bernstein
operators Bn .f I x/, Bn;˛;ˇ .f I x/ also converges to f .x/ uniformly on Œ0; 1 for
f 2 C Œ0; 1 : A new type of Bernstein–Durrmeyer operators, with the purpose of
approximating Lebesgue integrable functions on the mobile subinterval of Œ0; 1,
was introduced in [14] as
Z nC˛
n C ˇ 2nC1 X
n
nCˇ
DN n;˛;ˇ .f I x/ D .n C 1/ pNn;k .x/ pNn;k .t/ f .t/ dt;
n ˛
kD0 nCˇ
(2.62)
where
! k nk
n ˛ nC˛
pNn;k .x/ D x x :
k nCˇ nCˇ
If ˛ D ˇ D 0, these operators reduce to the usual Bernstein–Durrmeyer operators.

The operators (2.62) can be written in terms of a hypergeometric function as
Z nC˛ n
N nCˇ 2nC1 nCˇ nC˛ nC˛
Dn;˛;ˇ .f I x/ D .nC1/ f .t/ x t
n ˛
nCˇ
nCˇ nCˇ
0 1
x ˛
nCˇ
t ˛
nCˇ
2 F1 @n; nI 1I A dt:
nC˛
nCˇ x nC˛
nCˇ t
Lemma 2.12 ([14]). For n > 0 and r > 1, we have

!
X r
r ni ˛ ri .nC2/.i C1/ .nCˇ/x˛
N
Dn;˛;ˇ .t I x/ D
r
2 F1 n; i I 1I :
i D0
i .nCˇ/r .nCi C2/ n
Lemma 2.13 ([14]). For the operators Dn;˛;ˇ .f I x/ ; the following equalities
hold:
2.7 Generalized Bernstein–Durrmeyer Operators 65
DN n;˛;ˇ .1I x/ D 1;
n n C 2˛
DN n;˛;ˇ .tI x/ D xC ;
.n C 2/ .n C 2/ .n C ˇ/
2
2 ˛ n .n 1/
N
Dn;˛;ˇ t I x D x
nCˇ .n C 2/ .n C 3/

n ˛ 4n
C x
nCˇ n C ˇ .n C 2/ .n C 3/
2
n 2 2n˛ ˛
C C x
nCˇ .n C 2/ .n C 3/ .n C ˇ/ .n C 2/ nCˇ
2
2n˛ 1 ˛
C 2 .n C 2/
C :
.n C ˇ/ nCˇ

Lemma 2.14 ([14]). For f 2 C Œ0; 1, we have Dn;˛;ˇ f kf k :
Lemma 2.15 ([14]). For n 2 N, we have
2
DN n;˛;ˇ .t x/2 I x ı 2 .x/ ;
nC2 n
where ın2 .x/ D ' 2 .x/ C 1

nC2 ;
8 h i
< x ˛ nC˛
x ; x 2 nCˇ˛ nC˛
; nCˇ
' 2 .x/ D
nCˇ nCˇ h i h i :
:0 ; x 2 0; nCˇ
˛
[ x 2 nCˇ
nC˛
;1
Recall the following K-functional:

n 00 o

K2 .f; ı/ D inf kf gk C ı g W g 2 W 2 .ı > 0/ ;
n 0 00
o
where W 2 D g 2 C Œ0; 1 W g ; g 2 C Œ0; 1 and k:k is the uniform on C Œ0; 1.
By [59], there is a positive constant C > 0 such that
p
K2 .f; ı/ C !2 f; ı ; (2.63)
where the second-order modulus of smoothness for f 2 C Œ0; 1 is defined as

p
!2 f; ı D supp
sup jf .x C 2h/ 2f .x C h/ C f .x/j :
0<h ı x;xC2h2Œ0;1
We define the usual modulus of continuity for f 2 C Œ0; 1 as
! .f; ı/ D sup sup jf .x C h/ f .x/j :

0<hı x;xCh2Œ0;1
Theorem 2.69 ([14] Local approximation). For the operators DN n;˛;ˇ , there is a
constant C > 0 such that

ˇ ˇ
ˇDN n;˛;ˇ .f I x/ f .x/ˇ C !2 f; .n C 2/1 ın .x/ C ! f; 1 ;
nC2
h i
1 1=2
where f 2 C Œ0; 1, ın .x/ D ' 2 .x/ C nC2
, and x 2 ˛
; nC˛
nCˇ nCˇ
:
Proof. We introduce the auxiliary operators as follows:

n n C 2˛
Dn;˛;ˇ .f I x/ D DN n;˛;ˇ .f I x/ C f .x/ f xC :
.n C 2/ .n C 2/ .n C ˇ/
It is clear from Lemma 2.13 that
Dn;˛;ˇ .1I x/ D DN n;˛;ˇ .1I x/ D 1
and
n n C 2˛
Dn;˛;ˇ .tI x/ D DN n;˛;ˇ .tI x/ C x x D x:
.n C 2/ .n C 2/ .n C ˇ/
Let g 2 W 2 and t 2 Œ0; 1. By a Taylor expansion, we have
Zt
0 00
g .t/ D g .x/ C .t x/ g .x/ C .t u/ g .u/ d u:
x
Applying the operator Dn;˛;ˇ to both sides of the above equation, we get
0 1
Zt
00
Dn;˛;ˇ .gI x/ D g .x/ C Dn;˛;ˇ @ .t u/ g .u/ d uA
x
0 1
Zt
00
D g .x/ C DN n;˛;ˇ @ .t u/ g .u/ d uI x A
x
n nC2˛
.nC2/ xC .nC2/.nCˇ /
Z
n n C 2˛ 00
xC u g .u/ d u:
.n C 2/ .n C 2/ .n C ˇ/
x
Hence,
ˇ ˇ
ˇDn;˛;ˇ .gI x/ g .x/ˇ
0 t 1
Z ˇ 00 ˇ
ˇ ˇ
Dn;˛;ˇ @ jt uj ˇg .u/ˇ d uI x A
x
n nC2˛
Z ˇ ˇˇ ˇ
ˇ n n C 2˛ ˇ ˇ 00
C ˇ x C u ˇ ˇg .u/ˇˇ d u
ˇ .n C 2/ .n C 2/ .n C ˇ/ ˇ
x
00

Dn;˛;ˇ .t x/2 ; x g
2
n n C 2˛ 00
C xC x g : (2.64)
.n C 2/ .n C 2/ .n C ˇ/
On the other hand, from Lemma 2.15, we have

n n C 2˛
2
DN n;˛;ˇ .t x/2 ; x C xC x
.n C 2/ .n C 2/ .n C ˇ/
2
2 n C 2˛ 2x
ın2 .x/ C
nC2 .n C 2/ .n C ˇ/ .n C 2/
2
2 n
ı .x/ C
2
nC2 n .n C 2/ .n C ˇ/
2 1 4
ın2 .x/ C ı 2 .x/ : (2.65)
nC2 .n C 2/ 2 nC2 n
Thus, by (2.64),
ˇ ˇ 00
ˇDn;˛;ˇ .gI x/ g .x/ˇ 4
ın2 .x/ g ; (2.66)
nC2
h i
where x 2 ˛ nC˛
nCˇ ; nCˇ . Furthermore, by Lemma 2.14, we get
ˇ ˇ
ˇ ˇ ˇ ˇ ˇ n nC2˛ ˇ
ˇDn;˛;ˇ .f I x/ˇ ˇDN n;˛;ˇ .f I x/ˇ C jf .x/j C ˇf xC ˇ
ˇ .nC2/ .nC2/ .nCˇ/ ˇ
3 kf k ; (2.67)
for all f 2 C Œ0; 1 :

For f 2 C Œ0; 1 and g 2 W 2 ; using (2.66) and (2.67), we obtain

ˇ ˇ
ˇDN n;˛;ˇ .f I x/ f .x/ˇ
ˇ ˇ
ˇ n n C 2˛ ˇ
D ˇˇDn;˛;ˇ .f I x/ f .x/ C f xC f .x/ˇˇ
.n C 2/ .n C 2/ .n C ˇ/
ˇ ˇ ˇ ˇ
ˇDn;˛;ˇ .f gI x/ˇ C ˇDn;˛;ˇ .gI x/ g .x/ˇ
ˇ ˇ
ˇ n n C 2˛ ˇ
ˇ
C jg .x/ f .x/j C ˇf xC f .x/ˇˇ
.n C 2/ .n C 2/ .n C ˇ/
ˇ ˇ
4 00 ˇ n C 2˛ 2x ˇˇ
4 kf gk C ı .x/ g C ! f; ˇ
2 ˇ :
nC2 n .n C 2/ .n C ˇ/ .n C 2/ ˇ
Taking the infimum over all g 2 W 2 ; we obtain

ˇ ˇ 1
ˇDN n;˛;ˇ .f I x/ f .x/ˇ 4K2 f; 2
ı .x/
nC2 n
ˇ ˇ
ˇ n C 2˛ 2x ˇˇ
C! f; ˇˇ ;
.n C 2/ .n C ˇ/ .n C 2/ ˇ
and by inequality (2.63), we get

ˇ ˇ
ˇDN n;˛;ˇ .f I x/ f .x/ˇ C !2 f; .n C 2/1 ın .x/ C ! f; .n C 2/1 ;
and so the proof is completed.

Before we give the global
r approximation results, we recall some notations. Let
h i
f 2 C Œ0; 1 and ' .x/ D x nCˇ
˛ nC˛
nCˇ
x ; x 2 ˛
; nC˛
nCˇ nCˇ
: The second-
order Ditzian–Totik modulus of smoothness and corresponding K-functional are
given by, respectively,
p
'
!2 f; ı D sup
p h
sup i
jf .xCh' .x// 2f .x/ Cf .xh' .x//j ;
0<h ı x˙h'.x/2 ˛ ; nC˛
nCˇ nCˇ
n 00 o
00
KN 2;' .f; ı/ D inf kf gk C ı ' 2 g C ı 2 g W g 2 W 2 .'/ .ı > 0/ ;
n 0 00
o 0
where W 2 .'/ D g 2 C Œ0; 1 W g 2 ACloc Œ0; 1 ; ' 2 g 2 C Œ0; 1 and g 2
0
ACloc Œ0; 1 means that g is differentiable and g is absolutely continuous on every
closed interval Œa; b Œ0; 1 : There is a positive constant C > 0 such that
p
KN 2;' .f; ı/ C !2 f; ı :
'
(2.68)
Also, the Ditzian–Totik modulus of first order is given by

!

! .f; ı/ D sup sup jf .x C h .x// f .x/j ;
h i
0<hı x˙h'.x/2 ˛ nC˛
nCˇ ; nCˇ
where is an admissible step-weight function on Œ0; 1 :

Theorem 2.70 ([14] Global approximation). Let f 2 C Œ0; 1. Then

DN n;˛;ˇ f f C ! ' f; .n C 2/1=2 C !

! f; .n C 2/ 1
;
2
r
where C > 0 is an absolute constant, ' .x/ D x ˛
nCˇ
nC˛
nCˇ x , and x 2
h i
˛
; nC˛ :
nCˇ nCˇ
Proof. Again, we consider the auxiliary operators

N n n C 2˛
Dn;˛;ˇ .f I x/ D Dn;˛;ˇ .f I x/ C f .x/ f xC :
.n C 2/ .n C 2/ .n C ˇ/
Using the definition of the operator DQ n;˛;ˇ and Lemma 2.13, we obtain as in the
proof of Theorem 2.69 that
ˇ ˇ
ˇDn;˛;ˇ .gI x/ g .x/ˇ
0 t 1
Z ˇ 00 ˇ
ˇ ˇ
DN n;˛;ˇ @ jt uj ˇg .u/ˇ d uI x A
x
n nC2˛
Z ˇ ˇˇ ˇ
ˇ n n C 2˛ ˇ ˇ 00
C ˇ x C u ˇ ˇg .u/ˇˇ d u:
ˇ .n C 2/ .n C 2/ .n C ˇ/ ˇ
x
(2.69)
h i
Moreover, ın2 is a concave function on x 2 ˛
; nC˛
nCˇ nCˇ
. For u D x C .1 / t,
2 Œ0; 1 ; we get
jt uj jt xj jt xj jt xj
D 2 2 2 :
ın2 .u/ ın . x C .1 / t/ ın .x/ C .1 / ın2 .t/ ın .x/
Thus, if we use this inequality in (2.69), we have

0 t 1
Z 00
ˇ ˇ jt
ˇDn;˛;ˇ .gI x/ g .x/ˇ DN n;˛;ˇ @ uj
d uI x A
ın2 g
2
ın .u/
x
n nC2˛ ˇ ˇ
Z ˇ n ˇ 00
ˇ .nC2/ x C nC2˛
.nC2/.nCˇ/ uˇ

C d u ın2 g
ın2 .u/
x
1
2 00 N
2
ı n g Dn;˛;ˇ .t x/2 I x
ın .x/
2
n C 2˛ 2x
C : (2.70)
.n C 2/ .n C ˇ/ .n C 2/
By inequality (2.65), we have
ˇ ˇ
ˇDn;˛;ˇ .gI x/ g .x/ˇ 4
2 00
ın g
nC2

4 2 00 1 00
' g C g :
nC2 nC2
Using (2.67) and (2.70), we have for f 2 C Œ0; 1,

ˇ ˇ ˇ ˇ
ˇDN n;˛;ˇ .f I x/ f .x/ˇ ˇDn;˛;ˇ .f gI x/ˇ
ˇ ˇ
C ˇDn;˛;ˇ .gI x/ g .x/ˇ C jg .x/ f .x/j
ˇ ˇ
ˇ n n C 2˛ ˇ
C ˇˇf xC f .x/ˇˇ
.n C 2/ .n C 2/ .n C ˇ/

4 2 00 4 00

4 kf gk C ' g C g
nC2 .n C 2/2
ˇ ˇ
ˇ n n C 2˛ ˇ
ˇ
C ˇf xC f .x/ˇˇ :
.n C 2/ .n C 2/ .n C ˇ/
Taking the infimum over all g 2 W 2 ; we obtain

ˇ ˇ
ˇ ˇ 1 ˇ n nC2˛ ˇ
ˇDN n;˛;ˇ .f I x/ f .x/ˇ 4KN 2;' f; C ˇˇf xC f .x/ˇˇ : (2.71)
nC2 .nC2/ .nC2/ .nCˇ/
On the other hand,

ˇ ˇ
ˇ n n C 2˛ ˇ
ˇf x C f .x/ ˇ
ˇ .n C 2/ .n C 2/ .n C ˇ/ ˇ
ˇ ˇ
ˇ Œ.n C 2˛/ 2x .n C ˇ/ ˇ
ˇ
D ˇf x C .x/ f .x/ˇˇ
.n C 2/ .n C ˇ/ .x/
ˇ ˇ
ˇ Œ.n C 2˛/ 2x .n C ˇ/ ˇ
sup ˇf t C .t/ f .t/ˇˇ
ˇ .n C 2/ .n C ˇ/ .x/
Œ.nC2˛/2x .nCˇ /
t;t C .t / .nC2/.nCˇ / .x/
0 1
2 x ˛
j.n C 2˛/ 2x .n C ˇ/j
!
!
nCˇ
! f; ! @f; A
.n C 2/ .n C ˇ/ .x/ .n C 2/ .x/

1
D!

! f; :
.n C 2/
So, from (2.68) and (2.71), we obtain

DN n;˛;ˇ f f C ! ' f; .n C 2/1=2 C !

! f; .n C 2/1 ;
2
which is the desired result.

Theorem 2.71 ([14] Voronovskaja’s
00
h i asymptotic formula). Let f 2 C Œ0; 1. If
f exists at a point x 2 nCˇ
˛ nC˛
; nCˇ , then
0 00
lim n DN n;˛;ˇ .f I x/ f .x/ D .1 2x/ f .x/ C 2x .1 x/ f .x/ :
n!1
Proof. Using a Taylor expansion of f , we have
0 1 00
f .t/ D f .x/ C f .x/ .t x/ C f .x/ .t x/2 C " .t; x/ .t x/2 ;
2
where " .t; x/ ! 0 as t ! x: Applying DN n;˛;ˇ , we get

0
DN n;˛;ˇ .f I x/ f .x/ D f .x/ DN n;˛;ˇ ..t x/ ; x/
1 00
C f .x/ DN n;˛;ˇ .t x/2 ; x
2

CDN n;˛;ˇ " .t; x/ .t x/2 ; x ;

lim n DN n;˛;ˇ .f I x/ f .x/
n!1
0 1 00
D lim nf .x/ DN n;˛;ˇ ..t x/ ; x/ C lim n f .x/ DN n;˛;ˇ .t x/2 ; x
n!1 n!1 2

C lim nDN n;˛;ˇ " .t; x/ .t x/2 ; x
n!1

lim n DN n;˛;ˇ .f I x/ f .x/
n!1
0 00
D .1 2x/ f .x/ C 2x .1 x/ f .x/ C lim nDN n;˛;ˇ " .t; x/ .t x/2 ; x
n!1
0 00
D .1 2x/ f .x/ C 2x .1 x/ f .x/ C F:
In order for us to complete the proof, it is sufficient to show that F D 0: By the

Cauchy–Schwarz inequality, we have
1=2 1=2
F D lim nDN n;˛;ˇ "2 .t; x/ ; x DN n;˛;ˇ .t x/4 ; x : (2.72)
n!1
Furthermore, since "2 .x; x/ D 0 and "2 .:; x/ 2 C Œ0; 1, it follows that

lim nDN n;˛;ˇ "2 .t; x/ ; x D 0; (2.73)
n!1
h i
uniformly with respect to x 2 ˛ nC˛
nCˇ ; nCˇ . So from (2.72) and (2.73), we get
1=2 1=2
lim nDN n;˛;ˇ "2 .t; x/ ; x DN n;˛;ˇ .t x/4 ; x D 0:
n!1
Thus, we have
0 00
lim n DN n;˛;ˇ .f I x/ f .x/ D .1 2x/ f .x/ C 2x .1 x/ f .x/ ;
n!1
2.8 Generalizations of Baskakov Operators
The usual Baskakov–Durrmeyer operators were first introduced in [208]. Several

other generalizations of Baskakov operators have been proposed and studied in
recent years. In this direction, Gupta [92] introduced a different integral modifi-
cation of the Baskakov operators by considering the weight functions of Beta basis
functions as
1
X Z 1
Ln .f; x/ D pn;k .x/ bn;k .t/f .t/dt; x 2 Œ0; 1/; (2.74)
kD0 0
.n/k xk n.n C 1/k tk

where pn;k .x/ D and b n;k .t/ D .
kŠ .1 C x/nCk kŠ .1 C t/nCkC1
Gupta [92] showed that by considering the modification of the Baskakov
operators in the form (2.74), one can have a better approximation over the usual
Baskakov–Durrmeyer operators. Gupta [92] denoted by H Œ0; 1/ the class of all
measurable functions defined on Œ0; 1/ satisfying
2.8 Generalizations of Baskakov Operators 73
Z 1
jf .t/j
dt < 1 for some positive integer n:
0 .1 C t/nC1
Obviously, this class is bigger than the class of all Lebesgue integrable functions on
Œ0; 1/. Gupta [92] obtained an asymptotic formula and error estimation in simul-
taneous approximation for the operators (2.74). We mention here the asymptotic
formula:
Theorem 2.72 ([92]). Let H Œ0; 1/ be bounded on every finite subinterval of
Œ0; 1/, and let f .rC2/ exist at a fixed point x 2 .0; 1/: Let f .t/ D O.t ˛ /; as
t ! 1 for some ˛ > 0. Then we have
n .f; x/ f
lim ŒL.r/ .x/ D r r f .r/ .x/ C Œ.1 C r/ C x.1 C 2r/f .rC1/ .x/
.r/
n!1
Cx.1 C x/f .rC2/ .x/:
Motivated by the recent studies on certain Beta-type operators by Ismail and

Simeonov [157] in the hypergeometric form, Gupta and Yadav [133] represented
the operators (2.74) as
1
X Z 1
.n/k xk .n C 1/k tk
Ln .f; x/ D n f .t/dt
kŠ .1 C x/nCk 0 kŠ .1 C t/nCkC1
kD0
Z 1 1
X
f .t/.1 C x/ .n/k .n C 1/k .xt/k
Dn dt:
0 Œ.1 C x/.1 C t/nC1 .kŠ/2 Œ.1 C x/.1 C t/k
kD0
1
X .a/k .b/k
By hypergeometric series 2 F1 .a; bI cI x/ D x k and using the equality
.c/k kŠ
kD0
.1/k D kŠ, we can write
Z 1
f .t/.1 C x/ xt
Ln .f; x/ D n 2 F1 n; n C 1I 1I dt:
0 Œ.1 C x/.1 C t/nC1 .1 C x/.1 C t/
Now, using 2 F1 .a; bI cI x/ D 2 F1 .b; aI cI x/ and applying the Pfaff–Kummer

transformation
x
a
F
2 1 .a; bI cI x/ D .1 x/ 2 1 a; c bI cI
F ;
x1
we have
Z 1
1Cx xt
Ln .f; x/ D n f .t/ 2 F1 n C 1; 1 nI 1I dt;
0 .1 C x C t/nC1 1CxCt
(2.75)
which is the alternate form of the operators (2.74) in terms of hypergeometric

functions.
Based on the two parameters ˛; ˇ satisfying the conditions 0 ˛ ˇ, in
1983, Stancu gave the Stancu-type generalization of Bernstein operators [222].
The Stancu-type generalization of the Baskakov–Beta operators (namely, BBS
operators), for 0 ˛ ˇ, was introduced in [133] as
Z 1
nt C ˛ 1Cx
Ln;˛;ˇ .f; x/ D n f 2 F1
0 nCˇ.1 C x C t/nC1

xt
n C 1; 1 nI 1I dt: (2.76)
1CxCt
As a special case, if ˛ D ˇ D 0, the operators (2.76) reduce to Baskakov–Beta

operators (2.74). We consider
C Œ0; 1/ D ff 2 C Œ0; 1/ W f .t/ D O.t /; > 0g:
The operators Ln;˛;ˇ .f; x/ are well defined for f 2 C Œ0; 1/: In the present section,
we present the direct theorems, which include a Voronovskaja-type asymptotic
formula and an estimation of error in simultaneous approximation for the BBS
operators.
Lemma 2.16 ([133]). For 0 ˛ ˇ, we have
nr .n C r 1/Š.n r 1/Š
Ln;˛;ˇ .t r ; x/ D x r
.n C ˇ/ r
..n 1/Š/2

nr .n C r 2/Š.n r 1/Š
Cx r1 r 2
.n C ˇ/ r
..n 1/Š/2

nr1 .n C r 2/Š.n r/Š
Cr˛
.n C ˇ/r ..n 1/Š/2

nr1 .n C r 3/Š.n r/Š

Cx r2 r.r 1/2 ˛
.n C ˇ/r ..n 1/Š/2

r.r 1/˛ 2 nr2 .n C r 3/Š.n r C 1/Š
C C O.n2 /:
2 .n C ˇ/r ..n 1/Š/2
S
Lemma 2.17 ([92]). For m 2 N f0g, if
1
X m
k
Un;m .x/ D pn;k .x/ x ;
n
kD0
then Un;0 .x/ D 1; Un;1 .x/ D 0, and we have the recurrence relation
0
nUn;mC1 .x/ D x.1 C x/ Un;m .x/ C mUn;m1 .x/ :

Consequently, Un;m .x/ D O nŒ.mC1/=2 ; where Œm is an integral part of m.
Lemma 2.18 ([133]). If we define the central moments as
n;m .x/ D Ln;˛;ˇ ..t x/m ; x/;

1
X Z 1 m
nt C ˛
D pn;k .x/ bn;k .t/ x dt; m 2 N
0 nCˇ
kD0
then the following recurrence relation holds:

nCˇ
.n m 1/ n;mC1 .x/
n

D x.1 C x/ 0n;m .x/ C mn;m1 .x/

nCˇ ˛
C .m C nx C 1/ C x .n 2m 1/ n;m .x/
n nCˇ

˛ ˛ nCˇ
x x 1 mn;m1 .x/; n > m C 1:
nCˇ nCˇ n
Furthermore, one can obtain the first three moments as
x .n C ˇ.1 n// C n C ˛.n 1/

n;0 .x/ D 1; n;1 .x/ D ;
.n C ˇ/.n 1/

x 2 2n2 .n C 1/ C nˇ.nˇ 4 C 10n C 3ˇ/ C 2ˇ 2
n;2 .x/ D
.n C ˇ/2 .n 1/.n 2/
2
x 2n .nC2/C2n2 ˛2n2 ˇ.1C˛/C2n.2ˇ2˛C3˛ˇ/4˛ˇ
C
.nCˇ/2 .n1/.n2/
2n2 C n2 ˛.˛ C 2/ n˛.3˛ C 4/ C 2˛ 2
C :
.n C ˇ/2 .n 1/.n 2/
From the recurrence relation, we can easily verify that for all x 2 Œ0; 1/; we have
n;m .x/ D O.nŒ.mC1/=2 /:
Lemma 2.19 ([92]). The polynomials qi;j;r .x/ on Œ0; 1/, independent of n and k,
are such that
dr X
x r .1 C x/r p n;k .x/ D ni .k nx/j qi;j;r .x/pn;k .x/:
dx r 2i Cj r
i;j 0
Proof. Suppose that the result is true for r. Then by using the induction hypothesis
0
and x.1 C x/pn;k .x/ D .k nx/pn;k .x/; we have
dr k
r
x .1 C x/.nCk/
dx
0 1
d B X C
D @ ni .k nx/j qi;j;r .x/x kr .1 C x/.nCkCr/ A
dx 2i Cj r
i;j 0
X
D ni C1 .k nx/j 1 .j qi;j;r .x//x kr .1 C x/.nCkCr/
2i Cj r
i;j 0
X
C ni .k nx/j C1 qi;j;r .x//x kr1 .1 C x/.nCkCrC1/
2i Cj r
i;j 0
X
ni .k nx/j .r.1 C 2x/qi;j;r .x//x kr1 .1 C x/.nCkCrC1/
2i Cj r
i;j 0
X
0
C ni .k nx/j qi;j;r .x/x kr .1 C x/.nCkCr/
2i Cj r
i;j 0
X
D ni .k nx/j ..j C 1/qi 1;j C1;r .x//x kr .1 C x/.nCkCr/
2.i 1/C.j C1/r
i 1;j 0
X
C ni .k nx/j qi;j 1;r .x/x kr1 .1 C x/.nCkCrC1/
2i C.j 1/r
i 0;j 1
X
ni .k nx/j .r.1 C 2x/qi;j;r .x//x kr1 .1 C x/.nCkCrC1/
2i Cj r
i;j 0
X
0
C ni .k nx/j .qi;j;r .x//x kr .1 C x/.nCkCrC1/
2i Cj r
i;j 0
X
D ni .k nx/j qi;j;rC1 .x/x kr1 .1 C x/.nCkCrC1/ ;
2i Cj rC1
i;j 0
where
qi;j;rC1 .x/ D qi;j 1;r .x/ .j C 1/x.1 C x/qi 1;j C1;r .x/
0
r.1 C 2x/qi;j;r .x/ C x.1 C x/qi;j;r .x/
and 2i C j r C 1; i; j 0; with the convention that qi;j;r .x/ 0 if any one

of the constraints 2i C j r and i; j 0 is violated. Hence, the result is true for
r C 1. For r D 0, the result is trivial. Therefore, by induction, the result holds for
all r:
Using Lemmas 2.16–2.19, Gupta and Yadav [133] established the following
asymptotic formula and error estimation.
Theorem 2.73 ([133] Asymptotic formula). Let f 2 C Œ0; 1/ be bounded on
every finite subinterval of Œ0; 1/ admitting the derivative of order .r C 2/ at a fixed
x 2 .0; 1/. Let f .t/ D O.t / as t ! 1 for some > 0. Then we have

.r/
lim n Ln;˛;ˇ .f; x/ f .r/ .x/ D r.r ˇ/f .r/ .x/ C Œ.1 C r C ˛/
n!1
Cx.1 C 2r ˇ/f .rC1/ .x/

Cx.1 C x/f .rC2/ .x/:
Theorem 2.74 ([133] Error estimation). Let f 2 C Œ0; 1/ for some > 0 and
r m r C 2. If f .m/ exists and is continuous on .a
; b C
/ .0; 1/;
> 0,
then for n sufficiently large,
X
m
kLn;˛;ˇ .f; x/ f .r/ .x/kC Œa;b C1 n1
.r/
kf .i / kC Œa;b
i Dr
1=2
CC2 n !.f .m/ ; n1=2 / C O.n2 /;
where C1 ; C2 are constants independent of f and n, !.f; ı/ is the modulus of

; b C
/, and k:kC Œa;b denotes the sup norm on Œa; b.
For f 2 C Œ0; 1/; a new form of the modification of the well-known Baskakov
operator was introduced and studied by Finta in [71]. It is defined as
1
X Z 1
Dn .f; x/ D pn;k .x/ bn;k .t/f .t/ dt C pn;0 .x/f .0/; (2.77)
kD1 0
where
!
nCk1 xk 1 t k1
pn;k .x/ D ; bn;k .t/ D :
k .1 C x/nCk B.k; n C 1/ .1 C t/nCkC1
It is observed that Dn .f; x/ reproduces constant as well as linear functions. Verma

et al. [238] considered Baskakov–Durrmeyer–Stancu (abbr. BDS) operators as
follows:
1
X Z 1
nt C ˛
Dn.˛;ˇ/ .f; x/ D pn;k .x/ bn;k .t/f dt
0 nCˇ
kD1

˛
Cpn;0 .x/f ; (2.78)
nCˇ
where the basis functions are given in (2.77).

n;m .x/ D Dn.˛;ˇ/ ..t x/m ; x/

X1 Z 1 m
nt C ˛
D pn;k .x/ bn;k .t/ x dt
0 nCˇ
kD1
m
˛
Cpn;0 .x/ x ; m 2 N;
nCˇ
˛ˇx
then n;0 .x/ D 1 and n;1 .x/ D nCˇ
, and for n > m, we have the following
recurrence relation:
.n m/.n C ˇ/n;mC1 .x/

D nx.1 C x/Œ0n;m .x/ C mn;m1 .x/
CŒn.˛ ˇx/ 2m.˛ .n C ˇ/x/ C mnn;m .x/
2
˛ ˛
C .n C ˇ/m x mn x n;m1 .x/:
nCˇ nCˇ
n;m .x/ D O.nŒ.mC1/=2 /:
.˛;ˇ/
Remark 2.5. From Lemma 2.20, we find that Dn .t m ; x/ is a polynomial
.˛;ˇ/
in x of degree exactly m, for all m 2 N0 . Furthermore, Dn .t m ; x/ D
Pm m ˛nj nj j
j D0 j .nCˇ/m Dn .t ; x/, and we can write it as
nm .n C m 1/Š.n m/Š m
Dn.˛;ˇ/ .t m ; x/ D x
.n C ˇ/m nŠ.n 1/Š
mnm1 .n C m 2/Š.n m/Š
C Œn.m 1/ C ˛.n m C 1/x m1
m.m 1/nm2 ˛.n C m 3/Š.n m C 1/Š

C

˛.n m C 2/ m2
n.m 2/ C x C O.n2 /:
2
Lemma 2.21 ([145]). Let f be rtimes differentiable on Œ0; 1/ such that

f .r1/ .t/ D O.t /; > 0 as t ! 1. Then for r D 1; 2; : : : ; we have
1 Z 1
.˛;ˇ/ .r/ nr .nCr1/Š.nr/Š X .r/ ntC˛
ŒDn .f; x/D p nCr;k .x/ b nr;kCr f dt:
.nCˇ/r nŠ.n1/Š 0 nCˇ
kD0
Lemma 2.22 ([84]). Let f 2 C Œa; b: Then
.i / .2k/
kf
;2k kC Œa;b Ci fkf
;2k kC Œa;b C kf
;2k kC Œa;b g; i D 1; 2; : : : ; 2k 1;
where the Ci0 s are certain constants independent of f .

Here we present the pointwise approximation, asymptotic formula, and error
estimation in terms of a higher-order modulus of continuity in simultaneous
approximation.
We denote C Œ0; 1/ D ff 2 C Œ0; 1/ W f .t/ D O.t /; > 0g. It can be easily
.˛;ˇ/
verified that the operators Dn .f; x/ are well defined for f 2 C Œ0; 1/.
Theorem 2.75 ([145] Pointwise convergence). Let ˛; ˇ be two parameters satis-
fying the conditions 0 ˛ ˇ. If r 2 N; f 2 C Œ0; 1/ for some > 0 and f .r/
lim ŒDn.˛;ˇ/ .r/ .f; x/ D f .r/ .x/: (2.79)

n!1
Furthermore, if f .r/ exists and is continuous on .a

; b C
/ .0; 1/;
> 0,
then (2.79) holds uniformly in Œa; b:
The proof of the above theorem follows by using Remark 2.5, Lemmas 2.19, and
2.20; we omit the details here.
Theorem 2.76 ([145] Asymptotic formula). Let f 2 C Œ0; 1/ be bounded on
every finite subinterval of Œ0; 1/ admitting the derivative of order .r C 2/ at a fixed
x 2 .0; 1/. Let f .t/ D O.t / as t ! 1 for some > 0. Then we have

lim n ŒDn .f; x/ f .x/ D r.r 1 ˇ/f .r/ .x/
.˛;ˇ/ .r/ .r/
n!1
CŒr.1 C 2x/ C ˛ ˇxf .rC1/ .x/

Cx.1 C x/f .rC2/ .x/:
Using Lemmas 2.21, 2.20, and Remark 2.5, we find that the proof of
Theorem 2.76 follows using standard techniques; we omit the details here.
Theorem 2.77 ([145] Error estimation). Let f 2 C Œ0; 1/ for some > 0 and
0 < a < a1 < b1 < b < 1. Then for n sufficiently large, we have
kŒDn.˛;ˇ/ .r/ .f; :/ f .r/ kC Œa1 ;b1 C1 !2 .f .r/ ; n1=2 ; Œa1 ; b1 / C C2 nk kf k ;
where C1 D C1 .r/ and C2 D C2 .r; f /.

Proof. We can write
kŒDn.˛;ˇ/ .r/ .f; :/ f .r/ kC Œa1 ;b1 kŒDn.˛;ˇ/ .r/ ..f f

;2 /; :/kC Œa1 ;b1
.r/
CkŒDn.˛;ˇ/ .r/ .f
;2 ; :/ f
;2 kC Œa1 ;b1
.r/
Ckf .r/ f
;2 kC Œa1 ;b1
WD S1 C S2 C S3 :
.r/
Since f
;2 D .f .r/ /
;2 , by property (iii) of the Steklov mean (see Definition 1.9),
we get
S3 C1 !2 .f .r/ ;
; Œa; b/:
Next, using Theorem 2.76 and Lemma 2.22, we get
X
2Cr
S2 C2 n1
.i /
kf
;2 kC Œa;b
i Dr
1 .2Cr/
C4 n fkf
;2 kC Œa;b C kf
;2 kC Œa;b g:
By applying properties (ii) and (iv) of the Steklov mean, we obtain
S2 C4 n1 fkf k C
2 !2 .f .r/ ;
; Œa; b/g:
Finally, we estimate S1 by choosing a ; b satisfying the condition 0 < a < a <

a1 < b1 < b < b < 1. Also, let .t/ denote the characteristic function on the
interval Œa ; b . Then

S1 kŒDn.˛;ˇ/ .r/ .t/.f .t/ f
;2 .t//; : kC Œa1 ;b1

CkŒDn.˛;ˇ/ .r/ .1 .t/ f .t/ f
;2 .t/ ; :/kC Œa1 ;b1
WD S4 C S5 :
By Lemma 2.21, we have


ŒDn.˛;ˇ/ .r/ .t/.f .t/ f
;2 .t//; x
1
nr .n C r 1/Š.n r/Š X
D pnCr;k .x/
.n C ˇ/r nŠ.n 1/Š
kD0
Z 1
.r/ nt C ˛ .r/ nt C ˛
bnr;kCr .t/.t/ f f
;2 dt:
0 nCˇ nCˇ
Hence,
.˛;ˇ/ .r/
ŒD .t/.f .t/ f
;2 .t//; : C Œa1 ;b1 C5 kf .r/ f
;2 kC Œa ;b :
.r/
n

ˇ Now for ˇ x 2 Œa1 ; b1 and t 2 Œ0; 1/nŒa ; b , we choose a ı > 0 satisfying
ˇ nt C˛ ˇ
ˇ nCˇ x ˇ ı. By Lemma 2.19 and the Schwarz inequality, we have

I D jŒDn.˛;ˇ/ .r/ .1 .t/ f .t/ f
;2 .t/ ; x/j
X 1
jqi;j;r .x/j X
ni pn;k .x/jk nxjj
2i Cj r
x r .1 C x/r
kD1
i;j 0
Z ˇ ˇ
1 ˇ nt C ˛ nt C ˛ ˇˇ
bn;k .t/ .1 .t/ ˇˇf f
;2 dt
0 nCˇ nCˇ ˇ
ˇ ˇ
.n C r 1/Š ˇ ˛ ˛ ˇ
C .1 C x/ nr ˇ
.1 .t/ ˇf f
;2 ˇ
.n 1/Š nCˇ nCˇ ˇ

X 1
X
C6 kf k ni pn;k .x/jk nxjj
2i Cj r kD1
i;j 0
Z
.n C r 1/Š nr
bn;k .t/dt C .1 C x/
jt xj<ı .n 1/Š

X X1 Z 1 1=2
C6 kf k ı 2s ni pn;k .x/jk nxjj bn;k .t/dt
2i Cj r kD1 0
i;j 0
Z 4s !1=2
1
nt C ˛ .n C r 1/Š
bn;k .t/ x dt C .1 C x/nr
0 nCˇ .n 1/Š
X
X
1 1=2
2s nr
C6 kf k ı n i
pn;k .x/.k nx/ 2j
.1 C x/ .nx/ 2j
2i Cj r kD1
i;j 0
Z 4s !1=2
1
nt C ˛ .n C r 1/Š
bn;k .t/ x dt C kf k .1 C x/nr :
0 nCˇ .n 1/Š
Hence, by making the use of Lemmas 2.17 and 2.20, we get
I C7 kf k ı 2m O.n.i Cj=2s/ / C7 nq kf k ; q D s r=2;
where the last term vanishes as n ! 1. Now choosing m > 0 satisfying q k,

we have
I C7 n1 kf k :
Therefore, by property (iii) of the Steklov mean, we obtain
S1 C9 !2 .f .r/ ;
; Œa; b/ C C7 n1 kf k :
If we choose
D n1=2 , the theorem follows.
Another modification of the operators (2.77) was proposed by Gupta [103] (see
also [124]). For ˛ > 0, a new type of Baskakov–Durrmeyer operator is defined as
1
X Z 1
Bn;˛ .f; x/ D pn;v;˛ .x/ bn;v;˛ .t/f .t/dt C .1 C ˛x/n=˛ f .0/; (2.80)
vD1 0
where
.n=˛ C v/ .˛x/v
pn;v;˛ .x/ D
.v C 1/.n=˛/ .1 C ˛x/vCn=˛
and
˛.n=˛ C v C 1/ .˛t/v1
bn;v;˛ .t/ D :
.v/.n=˛ C 1/ .1 C ˛t/1CvCn=˛
Some local and global direct results for the operators (2.80) were established in
[103, 124]. Before presenting the main results, we will mention some lemmas
without proofs.
Tn;m;˛ .x/ D Bn;˛ ..t x/m ; x/

1
X Z 1
D pn;k;˛ .x/ bn;k;˛ .t/ .tx/m dtC.1C˛x/n=˛ .x/m ; m 2 N;
kD1 0
then Tn;0;˛ .x/ D 1 and Tn;1;˛ .x/ D 0, and for n > ˛m, we have the following
recurrence relation:
0
.n ˛m/Tn;mC1;˛ .x/ D x.1 C ˛x/ŒTn;m;˛ .x/ C 2mTn;m1;˛ .x/
CŒn.˛ ˇx/ C m.1 C 2˛x/Tn;m;˛ .x/:
n;m .x/ D O.nŒ.mC1/=2 /:
Remark 2.6. From Lemma 2.23, for each x 2 .0; 1/, we have
.n=˛ C i /.n=˛ i C 1/ i
Bn;˛ .t i ; x/ D x
.n=˛ C 1/.n=˛/
.n=˛ C i 1/.n=˛ i C 1/ i 1
Ci.i 1/ x C O.n2 /:
.n=˛ C 1/.n=˛/
Lemma 2.24 ([103]). The polynomials Qi;j;r;˛ .x/ on Œ0; 1/, independent of n and
k, exist such that
dr X
Œx.1 C ˛x/r r
pn;k;˛ .x/ D ni .k nx/j Qi;j;r;˛ .x/pn;k;˛ .x/:
dx 2i Cj r
i;j 0
Lemma 2.25 ([103]). Let f be rtimes differentiable on Œ0; 1/ such that

f .r1/ .t/ D O.t /; > 0 as t ! 1. Then for r D 1; 2; : : : and n > C r,
we have
1 Z 1
.r/ .n=˛Cr/.n=˛rC1/ X
Bn;˛ .f; x/D pnC˛r;k;˛ .x/ bn˛r;kCr;˛ .t /f .r/ .t /dt:
.n=˛C1/.n=˛/ 0
kD0
Let CB Œ0; 1/ be as defined in Definition 1.10 endowed with the norm jjf jj D
supx0 jf .x/j: The Peetre K-functional is defined by
K2 .f; ı/ D inffjjf gjj C ıjjg00 jj W g 2 W1

2
g;
where W1 2
D fg 2 CB Œ0; 1/ W g 0 ; g 00 2 CB Œ0; 1/g: By the DeVore–Lorentz
property (Theorem 2.4 of [60]), there exists an absolute constant M > 0 such that
p
K2 .f; ı/ M!2 .f; ı/;
p
where !2 .f; ı/ is the usual modulus of continuity of second order.
Theorem 2.78 (Local result [103]). Let f 2 CB Œ0; 1/: Then for all x 2 Œ0; 1/
and n 2 N; n > ˛, there exists an absolute positive constant M > 0 such that
r !
2x.1 C ˛x/
jBn;˛ .f; x/ f .x/j M!2 f; :
n˛
Proof. Let g 2 W1
2
and x; t 2 Œ0; 1/: By a Taylor expansion, we have
Z t
0
g.t/ D g.x/ C g .x/.t x/ C .t u/g 00 .u/d u:
x
Using Lemma 2.23, we obtain

Z t
Bn;˛ .g; x/ g.x/ D Bn;˛ .t u/g00 .u/d u; x :
x
Rt
Also, as j x .t u/g 00 .u/d uj .t x/2 jjg 00 jj, we have

jBn;˛ .g; x/ g.x/j Bn;˛ .t x/2 ; x jjg 00 jj
2x.1 C ˛x/ 00
D jjg jj:
n˛
Again, by Lemma 2.23, we have
1
X Z 1
jBn;˛ .f; x/j pn;k;˛ .x/ bn;k;˛ .t/jf .t/jdt
kD1 0
C.1 C ˛x/n=˛ jf .0/j jjf jj:
Thus,
jBn;˛ .f; x/ f .x/j jBn;˛ .f g; x/ .f g/.x/j

CjBn;˛ .g; x/ g.x/j
2x.1 C ˛x/ 00
2jjf gjj C jjg jj:
n˛
Finally, taking
p the infimum over all g 2 W1
2
and using the inequality K2 .f; ı/
M!2 .f; ı/; ı > 0, we get the required result.
Theorem 2.79 (Simultaneous approximation [124]). Let n > r C 1 2, x 2
Œ0; 1/; and f .i / 2 CB Œ0; 1/ for i 2 f0; 1; 2; : : : ; rg. Then

.n=˛ C r/.n=˛ r C 1/
jBn;˛
.r/
.f; x/ f .r/ .x/j 1 kf .r/ k
.n=˛ C 1/.n=˛/
.n=˛ C r/.n=˛ r C 1/ .r/
C2 ! f ; ı.n; r; x; ˛/ ;
.n=˛ C 1/.n=˛/
where
2n˛ C 4˛ 2 r.1 C r/ 2n C 4˛r.1 C r/

ı.n; r; x; ˛/ D x2 C x
.n ˛r/.n ˛.r C 1// .n ˛r/.n ˛.r C 1//
1=2
r.1 C r/
C :
.n ˛r/.n ˛.r C 1//
Proof. Applying Lemma 2.25, we get

.r/ .n=˛ C r/.n=˛ r C 1/
Bn;˛ .f; x/ f .r/ .x/ D 1 f .r/ .x/
.n=˛ C 1/.n=˛/
.n=˛ C r/.n=˛ r C 1/
C
.n=˛ C 1/.n=˛/
1
X Z 1 h
pnC˛r;v;˛ .x/ bn˛r;vCr;˛ .t/ f .r/ .t/f .r/ .x/ dt;
vD0 0
X1
R1
because 0 bn˛r;vCr;˛ .t/dt D 1 and pnC˛r;v;˛ .x/ D 1: Using the inequality
vD0
! f .r/ ; ı .1 C /! f .r/ ; ı ; 0, we get

.n=˛ C r/.n=˛ r C 1/
jBn;˛
.r/
.f; x/ f .r/ .x/j 1 kf .r/ k
.n=˛ C 1/.n=˛/
.n=˛ C r/.n=˛ r C 1/
C
.n=˛ C 1/.n=˛/
1
X Z 1
pnC˛r;v;˛ .x/ bn˛r;vCr;˛ .t /jf .r/ .t /f .r/ .x/jdt
vD0 0
.n=˛ C r/.n=˛ r C 1/

.n=˛ C 1/.n=˛/
1
X Z 1

pnC˛r;v;˛ .x/ bn˛r;vCr;˛ .t / 1Cı 1 jt xj ! f .r/ ; ı dt
vD0 0

.n=˛ C r/.n=˛ r C 1/
C 1 kf .r/ k: (2.81)
.n=˛ C 1/.n=˛/
Using the Cauchy–Schwarz inequality, we obtain

1
X Z 1
pnC˛r;v;˛ .x/ bn˛r;vCr;˛ .t/jt xjdt
vD0 0
X
1 Z 1 12
pnC˛r;v;˛ .x/ bn˛r;vCr;˛ .t/.t x/ dt
2
: (2.82)
vD0 0
Also, by easy computation, we have

1
X Z 1
pnC˛r;v;˛ .x/ bn˛r;vCr;˛ .t/.t x/2 dt
vD0 0
1
X
.v C r C 1/.v C r/ 2x.v C r/
D pnC˛r;v;˛ .x/ C x2
vD0
.n ˛r/Œn ˛.r C 1/ n ˛r
Œ2n˛ C 4r˛ 2 .1 C r/x 2 C Œ2n C 4˛r.1 C r/x C r.1 C r/

D : (2.83)
.n ˛r/.n ˛.r C 1//
After combining (2.81)–(2.83), we get

ˇ .r/ ˇ
ˇB .f; x/ f .r/ .x/ˇ
n;˛

.n=˛ C r/.n=˛ r C 1/ 2n˛ C 4˛ 2 r.1 C r/
1 C ı 1 x2
.n=˛ C 1/.n=˛/ .n ˛r/.n ˛.r C 1//
12
2n C 4˛r.1 C r/ r.r C 1/
C xC !.f .r/ ; ı/
.n ˛r/.n ˛.r C 1// .n ˛r/.n ˛.r C 1//

.n=˛ C r/.n=˛ r C 1/
C 1 f .r/ :
.n=˛ C 1/.n=˛/
Finally, if we choose ı D ı.n; r; x; ˛/, we obtain the assertion of the theorem.

Theorem 2.80 (Global result [103]). Let f 2 CB Œ0; 1/ and n ˛ C 1: Then
jjBn;˛ .f; :/ f jj C !'2 .f; n1=2 /;

p
where C > 0 is an absolute constant and '.x/ D 2x.1 C ˛x/; x 2 Œ0; 1/;
!'2 .f; ı/ D sup sup jf .x C h'.x/ 2f .x/ C f 9x h'.x//j

0<hı x˙h'.x/2Œ0;1/
is the Ditzian–Totik modulus of smoothness of second order.

Proof. Using a Taylor expansion, we have
Z t
k 0 k k
g.t/ D g Cg t C .t u/g00 .u/d u:
n n n k=n
Also, by Lemma 2.23, we have

1
X Z 1
k
Bn;˛ .g; x/ BO n;˛ .g; x/ D pn;k;˛ g.t/ g bn;k;˛ .t/dt
0 n
kD1
1
X Z 1 Z t
D pn;k;˛ bn;k;˛ .t/ .t u/g00 .u/d u dt;
kD1 0 k=n
where BOn;˛ .f; x/ denotes the modified Baskakov operators given by

1
X .n=˛ C k/ .˛x/k
BO n;˛ .f; x/ D f .k=n/; x 2 Œ0; 1/:
.k C 1/.n=˛/ .1 C ˛x/n=˛Ck
kD0
Therefore, by using p. 140 of [62], we have
jBn;˛ .g; x/ BOn;˛ .g; x/j

X 1 Z 1 ˇZ ˇ
ˇ t
jt ujd u ˇˇ
pn;k;˛ bn;k;˛ .t/ ˇˇ dtjj' 2 g 00 jj
0 k=n 2u.1 C ˛u/ ˇ
kD1
1 Z 1
1X .t k=n/2
pn;k;˛ .x/ bn;k;˛ .t/
2 0 k=n
kD1

1 1
C dtjj' 2 g 00 jj
1 C ˛k=n 1 C ˛t
1 Z 1
1X n n k 2
pn;k;˛ .x/ bn;k;˛ .t/ t dtjj' 2 g 00 jj
2 k n C ˛k 0 n
kD1
1 Z
1X n 1
.t k=n/2
C pn;k;˛ .x/ bn;k;˛ .t/ dtjj' 2 g 00 jj: (2.84)
2 k 0 1 C ˛t
kD1
Also, by easy computation, we have

Z 1
k n C ˛k 1
bn;k;˛ .t/.t k=n/2 dt D (2.85)
0 n n n˛
and
Z 1
.t k=n/2 k1 n C ˛k
bn;k;˛ .t/ dt D : (2.86)
0 1 C ˛t n n n C ˛.k C 1/
Combining (2.84)–(2.86), we get
jBn;˛ .g; x/ BO n;˛ .g; x/j

( 1 1
)
1 X 1 X 1 n C ˛k
pn;k;˛ .x/ C pn;k;˛ .x/ jj' 2 g 00 jj
2 n˛ n n C ˛.k C 1/
kD1 kD1
( 1
)
1 1 X 1 1
C pn;k;˛ jj' 2 g 00 jj jj' 2 g 00 jj: (2.87)
2 n˛ n n˛
kD1
Applying Lemma 2.23, for all f 2 CB Œ0; 1/, we have
jjBn;˛ .f; :/jj jjf jj: (2.88)
Next, applying a Taylor expansion of g and the Schwarz inequality, and using the
facts BO n;˛ .1; x/ D 1, BO n;˛ .t x; x/ D 0, and BO n;˛ ..t x/2 ; x/ D .x.1 C ˛x//=n;
we have
ˇ Z t ˇ
ˇ ˇ
O
jBn;˛ .g; x/ g.x/j ˇBn;˛ˇ O .t u/g .u/d u; x ˇˇ
00
k=n
ˇZ ˇ
ˇ t ˇ
Bn;˛ ˇˇ
O .t u/g .u/d uˇˇ ; x
00
k=n
x.1 C ˛x/ 00
BO n;˛ ..t x/2 ; x/jjg 00 .u/jj g .u/
n
1
D jj'O 2 g 00 jj; (2.89)
n
p
O
where '.x/ D x.1 C ˛x/; x 2 Œ0; 1/: Combining the estimates of (2.87)–(2.89),
we obtain
jBn;˛ .f; x/ f .x/j jBn;˛ .f g; x/ .f g/.x/j

ˇ ˇ ˇ ˇ
ˇ ˇ ˇ ˇ
C ˇBn;˛ .g; x/ BO n;˛ .g; x/ˇ C ˇBO n;˛ .g; x/ g.x/ˇ
1 1
2jjf gjj C jj' 2 g 00 jj C jj'O 2 g 00 jj
n˛ n

1 1
2 jjf gjj C jj' 2 g 00 jj
nn˛

1 2 00
C jjf gjj C jj'O g jj : (2.90)
n
Considering the K-functionals
K'2 .f; ı/ D inffjjf gjj C ıjj' 2 g 00 jj W g 2 W1

2
g; ı > 0;
and
K'2O .f; ı/ D inffjjf gjj C ıjj'O 2 g 00 jj W g 2 W1

2
g; ı > 0;
2.9 Mixed Summation–Integral Operators 89
by (2.90) for all f 2 CB Œ0; 1/ and n ˛ C 1; we obtain
jjBn;˛ f f jj 2K'2 .f; .n ˛/1 / C K'2O .f; n1 /:
O
Using pp. 11 and 37 of [62], the inequality '.x/ '.x/, we get the desired
result.
Using Lemmas 2.23–2.25, we also obtained in [103]—for the class C Œ0; 1/ D
ff 2 C Œ0; 1/ W f .t/ D O.t /; > 0g—the pointwise convergence, error
estimation, and asymptotic formula for Bn;˛ .
Theorem 2.81 ([103] Asymptotic formula). Let f 2 C Œ0; 1/: If f .rC2/ exists at
a point x 2 .0; 1/, then

.r/
lim n Bn;˛ .f; x/ f .r/ .x/ D ˛r.r 1/f .r/ .x/ C r.1 C 2˛x/f .rC1/ .x/
n!1
Cx.1 C ˛x/f .rC2/ .x/:
2.9 Mixed Summation–Integral Operators
While many mixed summation–integral operators are available in the literature, in

this section we mention only the operators that we believe will be of interest to the
reader.
Let us consider the following basis functions:
1 xv
bn;v .x/ D ;
B.n; v C 1/ .1 C x/nCvC1
.nx/v
sn;v .x/ D e nx ;
vŠ
!
nCv1 xv
pn;v .x/ D ;
v .1 C x/nCv

ln;k .x/ D e ;
kŠ
ncx !
c ncx C v 1
pn;v .x/ D
Œc
.1 C c/v .v D 0; 1; : : :/;
1Cc v
!
nCv1 v
mn;v .x/ D x .1 x/n ;
v
!
nCv v
O n;v .x/ D n
m x .1 x/n1 :
v
1. Beta–Szász operators (see [116]) are defined as

1
X Z 1
An .f; x/ D bn;v .x/ sn;v1 .t/f .t/dt C .1 C x/n1 f .0/: (2.91)
vD1 0
The operators An .f; x/ preserve only constant functions; the conclusion of the
asymptotic formula has the following form:

r.r C 1/ .r/
lim n An .f; x/ f .x/ D
.r/ .r/
f .x/ C Œr C x.1 C r/f .rC1/ .x/
n!1 2
x.1 C x/ .rC2/
C f .x/:
2
2. The discretely defined Baskakov–Szász operators [24] are given as
1
X Z 1
Bn .f; x/ D n pn;v .x/ sn;v1 .t/f .t/dt C .1 C x/n f .0/: (2.92)
vD1 0
The operators Bn .f; x/ preserve constant and linear functions; the conclusion of
the asymptotic formula is as follows:

x.2 C x/ 00
lim n Bn .f; x/ f .x/ D f .x/:
n!1 2
3. The Szász–Mirakyan–Baskakov-type operators (see [125]) are defined by

1
X Z 1
Cn .f; x/ D .n 1/ sn;v .x/ pn;v .t/f .t/dt: (2.93)
vD0 0
The operators Cn .f; x/ preserve only constant functions and have the following
form of asymptotic formula:

r.rC3/ .r/
lim n Cn .f; x/f .x/ D
.r/ .r/
f .x/CŒ.rC1/Cx.rC2/f .rC1/ .x/
n!1 2
x.2Cx/ .rC2/
C f .x/:
2
2.9 Mixed Summation–Integral Operators 91
4. The discretely defined Szász–Mirakyan–Baskakov-type operators (see [125]) are

given as
1
X Z 1
Dn .f; x/ D .n 1/ sn;v .x/ pn;v1 .t/f .t/dt C e nx f .0/: (2.94)
vD1 0
The operators Dn .f; x/ preserve only constant functions; the conclusion of the
asymptotic formula is as follows:

x.2 C x/ 00
lim n Dn .f; x/ f .x/ D 2xf 0 .x/ C f .x/:
n!1 2
5. In 2013, Gupta [105] proposed the mixed Durrmeyer-type integral modification

of the operators studied in [6] as
1
X Z 1
.Dn;c;d f /.x/ D .n d / Œc
pn;v .x/ Œd
bn;v .t/f .t/dt; x 0; (2.95)
vD0 0
Œd v .v/
where bn;v .t/ D .1/v tvŠ n;d .t/; with two special cases:
(a) n;0 .t/ D e nt .
(b) n;1 .t/ D .1 C t/n :
The operators .Dn;c;d f /.x/ reproduce the constant functions only, and the
asymptotic formula has the form
x.xcd C 1 C 2c/ 00
lim nŒ.Dn;c;d f /.x/ f .x/ D .1 C 2xd /f 0 .x/ C f .x/:
n!1 2c
6. The discretely defined Jain–Beta operators considered in [228] are as follows:
1
X Z 1
1 t v1
En .f; x/ D .ˇ/
ln;v .x/ f .t/dt C e nx f .0/:
vD1 0 B.n C 1; v/ .1 C t/nCvC1
(2.96)
The operators En .f; x/ reproduce only constant functions. The Korovkin-type
convergence theorem and statistical convergence for the operators En .f; x/ were
discussed in [228].
7. For the function f 2 L1 Œ0; 1, the Durrmeyer variant of mixed MKZ operators is
defined in [107] as
1
X Z 1
Mn .f; x/ D mn;v .x/ O n;v .t/f .t/dt:
m (2.97)
vD0 0
Abel et al. [7] obtained sharp estimates of the first and second central moments
and established the rate of convergence by the first modulus of continuity. They
also obtained the following Voronovskaja-type asymptotic formula:
Let x 2 Œ0; 1: For each function f 2 L1 Œ0; 1 that admits a second derivative
at x, the operators satisfy

lim n Mn .f; x/ f .x/ D .1 x/.1 2x/f 0 .x/ C x.1 x/2 f 00 .x/:
n!1
For the function f 2 L1 Œ0; 1 and ˛ 1, the Bézier variant of (2.97) considered
in [7] is
1
X Z 1
Mn;˛ .f; x/ D .˛/
Qn;v .x/ O n;v .t/f .t/dt;
m (2.98)
vD0 0
where
0 1˛ 0 1˛
1
X 1
X
.˛/
Qn;v .x/ D @ mn;j .x/A @ mn;j .x/A :
j Dv j DvC1
The following direct result was also established by Abel et al. [7]:
For every f 2 C Œ0; 1; ˛ 1, and ı > 0; we have
0 s 1
1x 2xC53=.n4/
jMn;˛ .f; x/f .x/j @1C ˛ A !.f; ı/; x 2 Œ0; 1; n 5:
ı nC1
Moreover, if f is differentiable on Œ0; 1 with f 0 bounded on Œ0; 1, we have

s
2x C 53=.n 4/
jMn;˛ .f; x/ f .x/j .1 x/ ˛
nC1
0 0 s 1 1
1x 2xC53=.n4/ A
@jf 0 .x/jC @1C ˛ !.f 0 ; ı/A :
ı nC1
Chapter 3
Complete Asymptotic Expansion
Another topic of interest on linear positive operators is the asymptotic expansion.

The commendable work on complete asymptotic expansion for different operators
was done in the last two decades by Abel and collaborators (see, e.g., [1–3,11–13]).
In this chapter, we discuss the asymptotic expansion of some of the operators.
Throughout this chapter, we denote by KŒq; x; q 2 N and x 2 I the class of all
functions f 2 L1 .I / that are q-times differentiable at x:
3.1 Baskakov–Kantorovich Operators
Baskakov–Kantorovich operators for x 2 I Œ0; 1/ are defined as

1
X Z .kC1/=n
Vn .f; x/ Dn bn;k .x/ f .t/dt; n 2 N;
kD0 k=n
xk
where bn;k .x/ D nCk1
k .1Cx/nCk
:
Throughout this section, for 0 j k s, we will denote the numbers
Z.s; k; j / by
!
X
s
s j
rk rC1j
Z.s; k; j / D .1/kj .1/ sr
S 1 ; (3.1)
r rj rC1 r C1
rDk
where Sji and ji denote the Stirling numbers of the first and second kind,
respectively, which are defined as
X
j
X
j
xj D Sji x i ; x j D ji x i ; j D 0; 1; : : : : (3.2)
i D0 i D0

94 3 Complete Asymptotic Expansion
Abel and Gupta [4] established the complete asymptotic expansion for
Baskakov–Kantorovich operators. To find the asymptotic expansion, we need the
following lemmas:
Lemma 3.1 ([4]). For er D t r ; r D 0; 1; : : :, we have the following representation:
X
r X k
j
Vn .er ; x/ D nk .1/kCj Srj rk rC1j
rC1 1 x rj :
j D0
r C 1
kD0
Proof. By direct computation and using the second identity in (3.2), we have
1
nr X
Vn .er ; x/ D bn;k .x/ .k C 1/rC1 k rC1
r C1
kD0
1
nr X X
rC1
j
D bn;k .x/ rC1 .k C 1/j k j
r C1 j D0
kD0
1
nr X X
r
j C1
D .j C 1/rC1 bn;k .x/k j
r C 1 j D0
kD0
nr X
r
j C1
D .j C 1/rC1 .n C j 1/j x j :
r C 1 j D0
Next, using the identity

X
j
.n C j 1/j D .1/j .n/j D .1/j Sjk .n/k ;
kD0
we conclude that
1 X kr X
r r
j C1
Vn .er ; x/ D n .1/kCj .j C 1/Sjk rC1 x j
r C1
kD0 j Dk
1 X k X
r k
rk rj C1 rj
D n .1/kCj .r j C 1/Srj rC1 x :
r C1 j D0
kD0

Lemma 3.2 ([4]). For s
x D .t x/s ; s D 0; 1; 2; : : :, the central moments possess
the representation
X
s X
k
Vn . s
x ; x/ D nk x sj Z.s; k; j /;
kDŒ.sC1/=2 j D0
where Z.s; k; j / is defined in (3.1).

3.1 Baskakov–Kantorovich Operators 95
Proof. By the binomial theorem and Lemma 3.1, we have

!
Xs
s
Vn . xs ; x/ D .x/sr Vn .er ; x/
rD0
r
!
X
s X
k X
s
s j
D nk .1/kCj x sj .1/ sr rk rC1j
S 1
j D0
r rj rC1 r C1
kD0 rDk
X
s X
k
D nk x sj Z.s; k; j /:
kD0 j D0
It remains for us to show that Vn . xs ; x/ D O.nŒ.sC1/=2 /: It suffices to show that

for 0 j k, Z.s; k; j / D 0 holds if 2k < s: Following [162], we have
! !
X
k
r Xk
r
Srrk D Ck;k rk
; r C k;k ; (3.3)
D0
kC D0
kC
where Ck;k D C k:k D 0 for k 1: First, consider the case j 1; using (3.3). For
1 j k, we have
! j !
X
kj
r j X r C1
rk rC1j
Srj rC1 D Ckj;kj C j;j
D0
k j C D1 j C
XX
kj
j
D .r C 1/kC1 P .k; j; ; ; r/;
D0 D1
where
Ckj;kj C j;j
P .k; j; ; ; r/ D .r j /1 .r k/
.k j C /Š .j C /Š
is a polynomial in the variable r of degree C 1: Thus,

!
XXX
kj j s
sr s
Z.s; k; j / D .1/kj
.1/ r k .r C 1 j /P .j; k; ; ; r/
D0 D1 rDk
r
!
XX
kj
X
j sk
sk
D .1/ s j k
.1/ sr
.rCkC1j /P .k; j; ; ; rCk/:
D0 D1 rD0
r
Since .r C k C 1 j /P .k; j; ; ; r C k/ is a polynomial in variable r of degree

C k, the inner sum vanishes if k < s k;. In the case j D 0, we have
!
Xs
sr s
Z.s; k; 0/ D .1/ k
.1/ S rk
r r
rDk
! k !
Xs X
sr s r
D .1/ k
.1/ Ck;k
r D0 kC
rDk
!
Xk
Ck;k X
sk
skr s k
D .1/ s k k
.1/ r ;
D0
.k C /Š rD0
r
which vanishes if k < s k. This completes the proof of the lemma.

Remark 3.1. For s D 0; 1; 2; : : : ; as a consequence of Lemma 3.2, we have
Vn . s
x ; x/ D O.nŒ.sC1/=2 /; n ! 1:
Theorem 3.1 ([4] Asymptotic expansion). Let q 2 N and x 2 .0; 1/. For each
function f 2 KŒ2q; x, the Baskakov–Kantorovich operators possess the asymptotic
expansion
X
q
X
2k
f .s/ .x/ X
k
Vn .f; x/ D f .x/ C nk x sj Z.s; k; j / C o.nq /; n ! 1;
sŠ j D0
kD1 sDk
where the numbers Z.s; k; j / are as defined in (3.1).

If we use Remark 3.1 and Lemma 3.2, the theorem follows after simple computation.
Corollary 3.1 ([4]). For each f 2 KŒ2; x; x 2 .0; 1/, we have
1 0
lim nŒVn .f; x/ f .x/ D f .x/ C x.1 C x/f 00 .x/ :
n!1 2
Example 3.1. For q D 3, we have
f 0 .x/ C x.1 C x/f 00 .x/

Vn .f; x/ D f .x/ C
2n
4f .2/ .x/ C 2x.1 C x/.5 C 4x/f .3/ .x/ C 3x 2 .1 C x/2 f .4/ .x/
C
24n2

1
C 2f .3/ .x/ C 2x.1 C x/.5 C 10x C 6x 2 /f .4/ .x/
48n3

Cx 2 .1 C x/2 .7 C 8x/f .5/ .x/ C x 3 .1 C x/3 f .6/ .x/ :
3.2 Baskakov–Szász–Durrmeyer Operators 97
3.2 Baskakov–Szász–Durrmeyer Operators
Let W .0; 1/; > 0 denote the space of all locally integrable functions f on
.0; 1/ satisfying f .t/ D O.e t / as t ! 1: Gupta and Srivastava [125] proposed
the Durrmeyer-type Baskakov–Szász operators as
1
X Z 1
Vn .f; x/ D n bn;v .x/ sn;v .t/f .t/dt; n 2 N;
vD0 0
where
!
nCv1 xv nt .nt/
v
bn;v .x/ D ; sn;v .t/ D e :
v .1 C x/nCv vŠ
For f 2 W .0; 1/, the operators Vn .f; x/ are well defined for each integer n > :
Abel et al. [8] established the complete asymptotic expansion for the Baskakov–
Szász operators. Throughout this section, we denote the number Z.s; k; j / for 0
j k s as
! !
s X
s
sj mj
Z.s; k; j / D .1/ sm
mj : (3.4)
j mj mk
mDk

j
The quantity in (3.4) denotes the Stirling numbers of the first kind defined as
i
j
X j
xj D x i ; j D 0; 1; : : : :
i
i D0
In the traditional notation of Stirling numbers of the first kind, we have Sji D

j
.1/j i : The following results are required for asymptotic expansion:
i
Lemma 3.3 ([8]). For all m D 0; 1; 2; : : : and x 2 .0; 1/, we have
!
X
m X k
m mj
k
Vn .em ; x/ D n mj x mj ; n ! 1:
j mk
kD0 j D0
R1
Proof. Obviously, with n 0 sn;v .t/t m dt D nm .v C m/m ; we have
1
X
Vn .em ; x/ D nm bn;v .x/.v C m/m
vD0
1
! ˇ
X nCv1 @ m kCm ˇˇ
m n
D n .1 C x/ y ˇ
vD0
v @y yDx=.1Cx/
m ˇ
@ y m ˇˇ
D nm .1 C x/n :
@y .1 y/n ˇyDx=.1Cx/
Using the Leibniz formula, we have

!
X m
m mj j .1/j .n/j
m n
Vn .em ; x/ D n .1 C x/ m y
j D0
j .1 y/nCj
!
1 X m mj j j
m
D m m n x
n j D0 j
! j
X m
m mj j X j
D m x ni m
j i
j D0 i D0
!
X
m X k
m mj
k
D n mj x mj :
j mk
kD0 j D0
This completes the proof of the lemma.

Lemma 3.4 ([8]). For each integer q > 0 and for each x 2 .0; 1/; we have
X
q
X
2k
f .s/ .x/ X
k
Vn . s
x ; x/ D nk Z.s; k; j /x sj C o.nq /; n ! 1:
sŠ j D0
kDŒ.sC1/=2 sDk
Remark 3.2. For s D 0; 1; 2; : : : ; as a consequence of Lemma 3.4, we have
Vn . s
x ; x/ D O.nŒ.sC1/=2 /; n ! 1:
Lemma 3.5 ([8]). Let I be an interval. For q 2 N and fixed x 2 I , let An W

L1 .I / ! C.I / be a sequence of linear positive operators with the property
An . s
x ; x/ D O.nŒ.sC1/=2 /; n ! 1:
Then, for each f 2 L1 .I / that is 2q-times differentiable at x, we have the

asymptotic relation
X
2q
f .s/ .x/
An .f; x/ D An . s
x ; x/ C o.nq /; n ! 1:
sD0
sŠ
3.2 Baskakov–Szász–Durrmeyer Operators 99
If, in addition, f .2qC2/ .x/ exists, the term o.nq / above can be replaced
by O.n.qC1/ /:
Lemma 3.6 ([8]). Let x > 0 be given. Assume that f 2 W .0; 1/ vanishes in
a neighborhood of x: Then for each positive constant q, Vn .f; x/ D O.nq / as
n ! 1:
function f 2 KŒ2q; x, the operators Vn .f; x/ possess the asymptotic expansion
X
q
X
2k
f .s/ .x/ X
k
Vn .f; x/ D f .x/ C nk x sj Z.s; k; j / C o.nq /; n ! 1;
sŠ j D0
kD1 sDk

Proof. In view of Lemma 3.6, we can assume without loss of generality that the
function f 2 KŒ2q; x is bounded on .0; 1/. By Lemma 3.4 and applications of
Lemma 3.5, we have
X
2q
f .s/ .x/
Vn .f; x/ D Vn . s
x ; x/ C o.nq /
sD0
sŠ
X
q
X
2k
f .s/ .x/ X
k
D nk Z.s; k; j /x sj C o.nq /; n ! 1;
sŠ j D0
kD0 sDk
which completes the proof of the theorem.

For the parameters ˛ 2 R and ˇ 2 Z, Abel et al. [10] considered general
Baskakov–Szász–Durrmeyer operators Vn;˛;ˇ as
1
X Z 1
Vn;˛;ˇ .f; x/ D n bnC˛;v .x/ sn;vCˇ .t/f .t/dt; n 2 N:
0
vDmaxf0;ˇg
The following main result concerning the asymptotic formula was established later.
function f 2 KŒ2q; x, the operators Vn;˛;ˇ .f; x/ possess the asymptotic expansion
X
q
Vn;˛;ˇ .f; x/ D f .x/ C nk ck;˛;ˇ .f I x/ C o.nq /; n ! 1;
kD1
where the coefficients ck;˛;ˇ .f I x/; k D 1; 2; : : : are given by
X
2k
f .s/ .x/ X
k
ck;˛;ˇ .f I x/ D x sj Z˛;ˇ .s; k; j /
sŠ j D0
sDk
and
Z˛;ˇ .s; k; j /
! s ! !
s X X mj i m j
kj
sm s j
D .1/ .ˇ C m/j
˛ kj i :
j mj m k mj i
mDk i D0
Moreover, if f 2 KŒ2.q C r/; x, for r 2 N0 , the differential operators possess the
asymptotic expansion
X
q
nk ck;˛;ˇ .f I x/ C o.nq /;
.r/ .r/
Vn;˛;ˇ .f; x/ Df .r/
.x/ C n ! 1:
kD1
Corollary 3.2 ([10]). Let x 2 .0; 1/: For each f 2 KŒ2; x, the following
asymptotic formula holds:
1
lim ŒVn;˛;ˇ .f; x/ f .x/ D .1 C ˇ C ˛x/f 0 .x/ C x.2 C x/f 00 .x/:
n!1 2
Moreover, if f 2 KŒ2r C 2; x, for r 2 N0 ; we have
.r/ 1
lim ŒVn;˛;ˇ .f; x/ f .r/ .x/ D r.r 1 C 2˛/f .r/ .x/
n!1 2
CŒ.r C ˛/x C 1 C ˇ C rf .rC1/ .x/
1
C x.2 C x/f .rC2/ .x/:
2
3.3 Meyer–König–Zeller–Durrmeyer Operators
For the parameters ˛ 2 R and ˇ 2 Z, the general Meyer–König–Zeller operators

for n C ˛ > 0 considered by Abel et al. [9] are defined as
1
X Z 1
Mn;˛;ˇ .f; x/ D .n C ˛/ mn;k .x/ mnC˛;kCˇ .t/.1 t/2 f .t/dt;
0
kDmaxf0;ˇg
(3.5)
nCk
where mn;k .x/ D x k .1x/nC1 . One can obtain the special cases of these
k
operators as
1. Mn;0;0 Mn is the natural MKZ–Durrmeyer operators.
ŒChen
2. Mn;2;0 Mn [53].
3.3 Meyer–König–Zeller–Durrmeyer Operators 101
ŒGuo
3. Mn1;0;2 Mn [89].
ŒGupta
4. Mn1;1;0 Mn [107].
Abel et al. [9] obtained a complete asymptotic expansion for the operators (3.5).
Theorem 3.4 ([9] Asymptotic expansion). Let ˛ 2 R and ˇ 2 Z: Assume that
q 2 N and x 2 I .0; 1/. For each function f 2 KŒ2q; x; the operators Mn;˛;ˇ
possess the asymptotic expansion
X
q
ck;˛;ˇ .f I x/
Mn;˛;ˇ .f; x/ D f .x/ C C o.nq / .n ! 1/;
kD1
.n C ˛ C ˇ C 1/k
where the coefficients ck;˛;ˇ .f I x/ .k D 1; 2; : : :/ are given by
X
2k
f .s/ .x/
ck;˛;ˇ .f I x/ D .1 x/s as;k;˛;ˇ .x/;
sD0
sŠ
with
!
X
k
kCˇ j
as;k;˛;ˇ .x/ D .k 1/Š .1/ kj
x
j D0
kj
! ! !
X
s
s r C˛CˇCj 1 r Cj 1
.1/ r
r:
rD0
r j k1
T1
Remark 3.3. For functions f 2 qD1 KŒq; x; we have the complete asymptotic
expansion
1
X ck;˛;ˇ .f I x/
Mn;˛;ˇ .f; x/ D f .x/ C .n ! 1/:
kD1
.n C ˛ C ˇ C 1/k
Remark 3.4. For the reader’s convenience, we list the initial coefficients explicitly:
c1;˛;ˇ .f I x/ D .1 x/.ˇ C 1 .˛ C ˇ C 1/x/f 0 .x/ C x.1 x/2 f .2/ .x/;

c2;˛;ˇ .f I x/ D .˛ C ˇ C 1/x.1 x/.ˇ C 2 .˛ C ˇ C 2/x/f 0 .x/

1
C .1 x/2 .ˇ C 1/.ˇ C 2/ 2.ˇ C 2/.˛ C ˇ C 3/x
2

C.˛ C ˇ C 2/.˛ C ˇ C 7/x 2 f .2/ .x/

1
Cx.1x/ 2C.ˇC1/x2.˛C4/x f .3/ .x/ x 2 .1x/4 f .4/ .x/:
3
2
An immediate consequence of Theorem 3.4 is the following Voronovskaja-type

formula:
Corollary 3.3 ([9]). Let x 2 I: For each function f 2 KŒ2; x; the operators
Mn;˛;ˇ satisfy

lim n Mn;˛;ˇ .f; x/f .x/ D.1x/.ˇC1.˛CˇC1/x/f 0 .x/Cx.1x/2 f .2/ .x/:
n!1
In the above-mentioned special cases, we obtain the formulas

0
lim n .Mn;0;0 .f; x/ f .x// D .1 x/2 xf 0 .x/ ;
n!1
0
lim n MnŒChen .f; x/ f .x/ D x.1 x/2 f 0 .x/ ;
n!1

lim n MnŒGuo .f; x/ f .x/ D .1 x/2 f 0 .x/ C xf 00 .x/ ;
n!1
0
lim n MnŒGupta .f; x/ f .x/ D .1 x/ x.1 x/f 0 .x/ :
n!1
For the operators Mn1;1;0 by Gupta and Abel [107], we obtain a concise
representation (3.6), which can be useful for the calculation of the coefficients
ck;1;0 .f I x/ by computer algebra software. To this end, for m D 0; 1; 2; : : :, we
denote by Tm .f I z0 / the Taylor polynomial of degree m, given by
X
m
f .s/ .z0 /
Tm .f I z0 /.z/ D .z z0 /s ;
sD0
sŠ
provided f admits a derivative of order m in z0 :

Corollary 3.4 ([9]). Under the assumption of Theorem 3.4, the operators
ŒGupta
Mn Mn1;1;0 possess the asymptotic expansion
X
q
ck;1;0 .f I x/
MnŒGupta .f; x/ D f .x/ C C o.nq / .n ! 1/;
kD1
.n C 1/k
where the coefficients ck;1;0 .f I x/ .k D 1; 2; : : :/ are given by

ˇ
.1/k @2k 1 z.1 y/ ˇ
ck;1;0 .f I x/ D y T2k .f I x/
k ˇ
kŠ k
@z @y k 1 z.x y/ ˇ zD1 : (3.6)
yDx
Remark 3.5 ([9]). For the reader’s convenience, we list the initial coefficients (3.6)
explicitly:
c1;1;0 .f I x/ D .1 x/.1 2x/f 0 .x/ C x.1 x/2 f .2/ .x/;

3.4 Beta Operators of the First Kind 103
c2;1;0 .f I x/ D 2x.1 x/.2 3x/f 0 .x/

C.1 x/2 .1 2x/.1 6x/f .2/ .x/
1
Cx.1 x/3 .2 5x/f .3/ .x/ C x 2 .1 x/4 f .4/ .x/;
2
c3;1;0 .f I x/ D 6x 2 .1 x/.3 4x/f 0 .x/
C6x.1 x/2 .3 15x C 16x 2 /f .2/ .x/
C.1 x/3 .1 18x C 81x 2 92x 3 /f .3/ .x/
Cx.1 x/4 .3 21x C 31x 2 /f .4/ .x/
1 1
C x 2 .1 x/5 .3 8x/f .5/ .x/ C x 3 .1 x/6 f .6/ .x/:
2 6
3.4 Beta Operators of the First Kind
The Beta operators Ln .n 2 N / for Lebesgue integrable functions f on the interval

I D .0; 1/ are defined by
Z 1
1
Ln .f; x/ D t nx1 .1 t/n.1x/1 f .t/dt; (3.7)
B.nx; n.1 x// 0
where B.m; n/ is the Beta function. These operators were introduced by Lupas [185]
in a slightly different form. Equation (3.7) was given by Khan [171].
Throughout this section, let the numbers Z.s; k; j / for 0 j k s be
given by
! kj
X
s
s r X
r j
Z.s; k; j / D .1/ sr
r r j r j i
rDk i D0
!
r j i
.1 r/kj i : (3.8)
kj i

j j
The quantities and above denote the Stirling numbers of the first and
i i
second kind, respectively, defined by
X
j j

X
j j
xj D .1/j i xi ; xj D x i ; j D 0; 1; : : : ;
i i
i D0 i D0
where x i D x.x 1/ .x i C 1/; x 0 D 1 is the falling factorial.

To obtain the asymptotic expansion, we need the following results:

Lemma 3.7 ([11]). For r D 0; 1; 2; : : : ; the moments Ln .e r ; x/ of the Beta
operators possess the representation
X k kj

1 X X
r
r rj rj i
r
Ln .e ; x/D x rj
.1r/kj i :
nk rj rj i kj i
kD0 j D0 i D0
Proof. Direct computation of the moments yields
B.nx C r; n.1 x// .nx/r

Ln .e r ; x/ D D :
B.nx; n.1 x// nr
We take advantage of the identities
r
X j

X
r j
.nx/r D .nx/j ; nj D .n/i ;
j i
j D0 i D0
and
!
X
i
i
.n/ D i
.n C r 1/k .1 r/i k ;
k
kD0
which is the Vandermonde convolution. Combining these formulas, we obtain
r j
i
!
.nx/r 1 X r X j X i
Ln .e ; x/ D
r
D x j
.n C r 1/k .1 r/i k
.n/r .n/r j D0 j i D0
i k
kD0
r j

!
X
r
.n C r 1/k X r X j i
D x j
.1 r/i k :
.n/r j i k
kD0 j Dk i Dk
Observing that
.n C r 1/i 1
D
.n/r nrk
completes the proof after some computation.

Lemma 3.8 ([11]). For s D 0; 1; 2; : : : ; the central moments of the Beta operators
possess the representation
X 1
Ln . s
x ; x/ D x sj Z.s; k; j /;
kDŒ.sC1/=2
nk

Proof. Application of the binomial formula yields for the central moments
!
Xs
s
Ln . s
x ; x/ D .x/sr Ln .e r ; x/
rD0
r
!
X
s
1 X
k X
s
s r
D x sj
.1/ sr
nk r r j
kD0 j D0 rDk
!
X
kj
r j

r j i
.1 r/kj i
r j i kj i
i D0
X
s
1 X
k
D x sj Z.s; k; j /:
kD0
nk j D0

It remains for us to prove that Ln . xs ; x/ D O nŒ.sC1/=2 : It is sufficient to show
that, for 0 j k; Z.s; k; j / D 0 if 2k < s: To this end, we recall some known
facts about Stirling numbers. The Stirling numbers of the first and second kinds
possess, respectively, the representations
!
!
r X
k
r r Xk
r
D .1/ k
Ck;k ; D C k;k
r k kC r k kC
D0 D0
(3.9)
.k D 0; : : : ; r/; where Ck;k D C k;k D 0; for k 1 (see [162]). The coefficients
Ck;i and C k;i are independent of r and satisfy certain partial difference equations
[162]. Taking advantage of the representation (3.9), we obtain, for 0 i C j k;

!
r r j r j i
r j r j i kj i
! i ! !
X
j
r X r j r j i
D .1/j Cj;j C i;i
D0
j C D0 i C kj i
X
j
X
i
D r k P .k; j; i; ; I r/;
D0 D0
where
.1/j Cj;j C i;i

P .k; j; i; ; I r/ D .r j / .r j i /
.k j i /Š .j C /Š .i C /Š
is a polynomial in the variable r of degree C : Thus, we conclude that

!
X
kj j
XX i Xs
sr s
Z.s; k; j / D .1/ r k P .k; j; i; ; I r/.1 r/kj i
i D0 D0 D0
r
rDk
!
X
kj j
XX i Xsk
sk
Ds k
.1/skr
i D0 D0 D0 rD0
r
P .k; j; i; ; I r C k/.1 r k/kj i :
Since P .k; j; i; ; I r C k/.1 r k/kj i is a polynomial in the variable r of

degree C C k j i k; the inner sum vanishes if k < s k, that is, if
2k < s: This completes the proof of Lemma 3.8.
Remark 3.6. An immediate consequence of Lemma 3.8 is that, for s D 0; 1; 2 : : : ;

Ln . s
x ; x/ D O nŒ.sC1/=2 .n ! 1/:
Theorem 3.5 ([11] Asymptotic expansion). Let q 2 N and x 2 I . For each

function f 2 KŒ2q; x; the Beta operators possess an asymptotic expansion into
a reciprocal factorial series:
X
q
1 X f .s/ .x/ X sj
2k k
Ln .f; x/ D f .x/ C x Z.s; k; j / C o.nq / .n ! 1/;
nk sŠ j D0
kD1 sDk

Proof. By Remark 3.6, the first conclusion in Lemma 3.5 is valid for the operators
Ln .f; x/. Therefore, we can apply Lemma 3.5, and the assertion of Theorem 3.5
follows after some calculations by Lemma 3.8.
Remark 3.7. For the reader’s convenience, we give the series explicitly, for q D 3 W
x.1 x/f 00 .x/

Ln .f; x/ D f .x/ C
2n
12x.1x/f .2/ .x/C8x.1x/.12x/f .3/ .x/C3x 2 .1x/2 f .4/ .x/
C
24n2

1
C 32x.1x/.12x/f .3/ .x/C6x.1x/.211xC11x 2 /f .4/ .x/
48n3

C8x .1x/ .12x/f .x/Cx .1x/ f .x/ CO.n4 / .n ! 1/:
2 2 .5/ 3 3 .6/
An immediate consequence of Theorem 3.5 is the following Voronovskaja-type

formula.
Corollary 3.5 ([11]). Let x 2 I: For each function f 2 KŒ2; x; the operators
Ln .f; x/ satisfy
1
lim n .Ln .f; x/ f .x// D x.1 x/f 00 .x/:
n!1 2
Chapter 4
Linear and Iterative Combinations
The linear positive operators are conceptually simpler, and easier to construct and
study, but they lack rapidity of convergence for sufficiently smooth functions.
In the last century, Bernstein [37] defined the combinations BO n of the Bernstein
polynomials Bn as
x.1 x/
BO n .f; x/ D Bn .f; x/ Bn .f 00 ; x/
2n
!
Xn
n k k x.1 x/ 00 k
D x .1 x/nk f f :
k n 2n n
kD0
00
He subtracted the leading term x.1x/ 2n Bn .f ; x/ to achieve the order of
2
approximation O.n /:
Also, Kantorovich’s well-known result states that the optimum rate of
convergence for any sequence of positive linear operators is at most O.n2 /:
To improve the order of approximation, one can apply the technique of linear
combinations and iterative combinations.
4.1 Linear Combinations
Thus, if we want to have a better order of approximation, we have to slacken the

positivity condition. For k 2 N , Butzer [48] considered the linear combinations
Bn2k of Bernstein polynomials Bn as
.2k 1/Bn2k D 2k B2n

2k2
Bn2k2 ; Bn0 D Bn :
Butzer [48] proved that if f .2k/ exists at a point x 2 Œ0; 1, then

110 4 Linear and Iterative Combinations
.Bn2k2 f /.x/ D O.nk /; k 2 N:
The limit limn!1 nk .Bn2k2 f /.x/ can be calculated by a recursion formula.

In general, the linear combinations Butzer considered for Bernstein polynomials are
defined as
X
k
Bn .f; k; x/ D C.j; k/L2j n .f; x/;
j D0
where
Y
k
2j
C.j; k/ D :
i D0
2j 2i
i ¤j
Later, May [190] considered these combinations to improve the order of approxi-
mation of the Phillips operators and established some direct, inverse, and saturation
results.
Independently, Rathore [205], in 1973, and May [189], in 1976, considered the
more general combinations for the sequence of linear positive operators of the
exponential type. The kth-order linear combinations Ln .f; k; x/ of the operators
Ldj n .f; x/; discussed in [189], are given by
X
k
Ln .f; k; x/ D C.j; k/Ldj n .f; x/;
j D0
where
Y
k
dj
C.j; k/ D ; k ¤ 0I C.0; 0/ D 1;
i D0
dj di
i ¤j
and d0 ; d1 ; : : : ; dk are arbitrary but fixed distinct positive integers.

In an alternate form, the linear combinations Ln .f; k; x/ can be defined as
ˇ ˇ
ˇ L .f; x/ d01 d02 d0k ˇˇ
ˇ d0 n :::
ˇ L .f; x/ d11 d12 d1k ˇˇ
1 ˇˇ d1 n
:::
ˇ
Ln .f; k; x/ D ˇ ::: ::: ::: ::: ::: ˇ ;
4ˇ ˇ
ˇ ::: ::: ::: ::: ::: ˇˇ
ˇ
ˇ Ldk n .f; x/ dk1 dk2 ::: dkk ˇ
where 4 is the Vandermonde determinant obtained by replacing the operator

column of the above determinant by the entries 1:
4.1 Linear Combinations 111
The Lupas–Durrmeyer operators (also called Baskakov operators) [208] are

defined as
Z 1 1
X Z 1
Vn .f; x/ D W .n; x; t/f .t/dt D .n 1/ bn;v .x/ bn;v .t/f .t/dt;
0 vD0 0
where

nCv1 xv
bn;v .x/ D :
v .1 C x/nCv
Kasana [170] estimated the direct, inverse, and saturation theorems for May’s linear
combinations [189]. We present the direct results with proofs and the inverse and
saturation results (without proofs) on Baskakov–Durrmeyer operators Vn defined on
a class C Œ0; 1/: We denote
C Œ0; 1/ ff 2 C Œ0; 1/ W jf .t/j M t ; > 0; M > 0g:
The norm-jj:jj on C Œ0; 1/ is defined as jjf jj D supt 2.0;1/ jf .t/jt :

Lemma 4.1. Let Tn;m .x/ D Vn .t x/m ; x . Then Tn;0 .x/ D 1; Tn;1 .x/ D
n2 ; n > 2, and for n > m C 2, we have
1C2x
0
.nm2/Tn;mC1 .x/ D x.1Cx/ŒTn;m .x/C2mTn;m1 .x/C.mC1/.1C2x/Tn;m .x/:
Corollary 4.1. Let and ı be two positive numbers and Œa; b Œ0; 1/. Then for
any m > 0, there exists a constant Mm such that
ˇˇZ ˇˇ
ˇˇ ˇˇ
ˇˇ W .n; x; t/t dt ˇˇˇˇ

Mm nm :
ˇˇ
jt xjı C Œa;b
Lemma 4.2. For p 2 N and n sufficiently large,
Vn ..t x/p ; k; x/ D n.kC1/ fQ.p; k; x/ C o.1/g
holds, where Q.p; k; x/ is a certain polynomial in x of degree p and t 2 Œ0; 1/ is

arbitrary but fixed.
Theorem 4.1 ([170] Asymptotic formula). Let f 2 C Œ0; 1/ for some > 0. If
f .2kC2/ exists at a point x 2 .0; 1/, then
X
2kC2
f .j / .x/
lim n kC1
ŒVn .f; k; x/ f .x/ D Q.j; k; x/; (4.1)
n!1 jŠ
j DkC1
where Q.j; k; x/ are certain polynomials in x of degree j: Moreover,
.1/k fx.1 C x/gkC1 .2k C 2/Š

Q.2k C 2; k; x/ D Qk
j D0 dj
.k C 1/Š
and
.1/k .1 C 2x/fx.1 C x/gk .2k C 2/Š

Q.2k C 1; k; x/ D Qk :
j D0 dj
2.kŠ/
Furthermore, if f .2kC1/ exists and is absolutely continuous over Œa; b and

f .2kC2/ 2 L1 Œa; b; then for any Œc; d .a; b/,
˚
jjVn .f; k; :/ f jj M nkC1 jjf jj C jjf .2kC2/ jjL1 Œa;b (4.2)
holds.
Proof. By using a Taylor expansion, we have
X
k
Vn .f; k; x/ f .x/ D C.j; k/Vdj n .f .t/ f .x/; x/
j D0
X
2kC2
f .i / .x/ X
k
C C.j; k/Vdj n ..t x/2kC2 ".t; x/; x/
i D1
i Š j D0
WD I1 C I2 ;
where ".t; x/ ! 0 as t ! x: Using Lemma 4.2, we see that
X
2kC2
f .i / .x/
I1 D Q.i; k; x/ C o.1/:
iŠ
i DkC1
Since ".t; x/ ! 0 as t ! x, it follows that for a given " > 0, there exists a ı > 0
such that j".t; x/j < " whenever jt xj < ı: For jt xj ı, we observe that
j".t; x/j Kjt xj :
X
k
I2 D C.j; k/Vdj n .".t; x/.t x/2kC2 ; x/
j D0
X
k 1
X Z 1
D C.j; k/.dj 1/ bdj n;v .x/ bdj n;v .t/".t; x/.t x/2kC2 dt
j D0 vD0 0
X
k 1
X Z Z
D C.j; k/.dj 1/ bdj n;v .x/ C
j D0 vD0 jt xj<ı jt xjı
bdj n;v .t/:".t; x/.t x/2kC2 dt:
Using Lemma 4.1, we have
X
k 1
X
I3 D C.j; k/.dj 1/ bdj n;v .x/
j D0 vD0
Z
bdj n;v .t/:".t; x/.t x/2kC2 dt
jt xj<ı
D ":O.n.kC1/ /:
Next, applying Schwarz’s inequality and Lemma 4.1, we have
X
k 1
X Z
I4 D C.j; k/.dj 1/ bdj n;v .x/ bdj n;v .t/:".t; x/.t x/2kC2 dt
j D0 vD0 jt xjı
X
k 1
X Z
K C.j; k/.dj 1/ bdj n;v .x/ bdj n;v .t/jt xj2kC2C dt
j D0 vD0 jt xjı
X
k Z 1 1=2
.t x/2s
K C.j; k/ W .dj n; x; t/ 2s4k2 4
dt
j D0 0 ı
D O.s=2 / D o.n.kC1/ /:
By combining I3 ; I4 , we get nkC1 I2 ! 0 as n ! 1. This completes the proof

of (4.1). The values of Q.2k C 2; k; x/ and Q.2k C 1; k; x/ can be obtained from
Lemma 4.2. Next, we have
Vn .f; k; x/ f .x/ D Vn . .t/.f .t/f .x//; k; x/

D Vn ..1 .t//.f .t/ f .x//; k; x/
WD I5 C I6 :
Proceeding along the lines of the estimate of I4 , we have, for all t 2 Œc; d ,
I6 K1 nkC1 jjf jj :

Next, by the given hypothesis on f for t 2 Œa; b and x 2 Œc; d , we have
X
2kC1
f .i / .x/
f .t/ f .x/ D .t x/i
i D1
i Š
Z t
1
C .t w/2kC1 f .2kC2/ .w/d w:
.2k C 1/Š x
Thus,
X
2kC1
f .i / .x/
I5 D Vn ..t x/i ; k; x/ C Vn .. .t/ 1/.t x/i ; k; x/
i D1
iŠ
Z t
1
D C Vn .t/ .t w/2kC1 f .2kC2/ .w/d w; k; x
.2k C 1/Š x
X
2kC1
f .i / .x/
WD ŒI7 C I8 C I9 :
i D1
iŠ
By Lemma 4.2, we get I7 D O.n.kC1/ /, uniformly for x 2 Œc; d : Next, proceeding

along the lines of I4 , for x 2 Œc; d , we have I8 D O.n.kC1/ /: Also, by Lemma 4.1,
we get
I9 D jjf .2kC2/ jjL1 Œa;b O.n.kC1/ /:
Combining the estimates of I7 ; I8 , and I9 , we obtain

( 2kC1 )
X
.kC1/
jjI5 jjC Œc;d K1 n jjf jjC Œc;d C jjf
.i / .2kC2/
jjL1 Œa;b :
i D1
Next, using the Goldberg and Meir property [84], we obtain

˚
jjI5 jjC Œc;d K2 n.kC1/ jjf jjC Œc;d C jjf .2kC2/ jjL1 Œa;b :
Finally, combining the estimates of I5 and I6 , the assertion (4.2) follows.
Theorem 4.2 ([170] Error estimation). Let f 2 C Œ0; 1/ and 0 < a1 < a2 <
b2 < b1 < 1: Then for n sufficiently large, there exists a constant Mk such that
˚
jjVn .f; k; :/ f jjC Œa2 ;b2 Mk !2kC2 .f; n1=2 ; a1 ; b1 / C n. kC1/ jjf jj :
Proof. By the linearity property, we have
Vn .f; k; x/ f .x/ D Vn .f f
;2kC2 ; k; x/
Cf
;2kC2 .x/ f .x/
CVn .f
;2kC2 ; k; x/ f
;2kC2 .x/
WD J1 C J2 C J3 :
Clearly,
X Z 1 ˇ ˇ
jJ1 j KjC.j; k/j W .dj n; x; t/ ˇf
;2kC2 .t/ f .t/ˇ dt:
j D0 0
Now, choose a ; b such that a1 < a < a2 < b2 0 such that
Z 1 ˇ ˇ
W .dj n; x; t/ ˇf
;2kC2 .t/ f .t/ˇ dt
0
jjf
;2kC2 f jjC Œa ;b C Mm nm jjf jj :
Hence, in view of the property of the Steklov mean f

;2kC2 , we have
jjJ1 jjC Œa2 ;b2 M1 !2kC2 .f; n1=2 ; a1 ; b1 / C Mm nm jjf jj :
Similarly,
jjJ2 jjC Œa2 ;b2 M2 !2kC2 .f; n1=2 ; a1 ; b1 /:
Next,
X
2kC1 .i /
f
;2kC2 .x/
.2kC2/
f
;2kC2 ./
f
;2kC2 D .t x/i C ;
i D0
iŠ .2k C 2/Š
where lies between t and x. We separate the integral into two parts as in the
estimate of J1 . Then, using Lemma 4.1, we obtain
jjVn .f
;2kC2 ; k; :/ f
;2kC2 jjC Œa2 ;b2
X
2kC2
.kC1/
M3 n jjf
;2kC2 jjC Œa2 ;b2 C Mm nm jjf
;2kC2 jj :
i DkC1
Again, using the Goldberg and Meir property [84], we obtain
jjf
;2kC2 jjC Œa2 ;b2
n o
.2kC2/
M4 jjf
;2kC2 jjC Œa2 ;b2 C jjf
;2kC2 jjC Œa2 ;b2 ; i D 1; 2; : : : ; 2k C 2:
Choosing m k C 1, we have
jjVn .f
;2kC2 ; k; :/ f
;2kC2 jjC Œa2 ;b2
n o
M5 n.kC1/ jjf
;2kC2 jjC Œa2 ;b2 C jjf
;2kC2 jjC Œa2 ;b2 :
.2kC2/
Again, by applying the Steklov mean property, choosing

D n1=2 , and combining
the estimates of J1 ; J2 and J3 , we get the required result.
Theorem 4.3 ([170] Inverse result). Let f 2 C Œ0; 1/ and 0 < ˛ < 2. Then, in
the following statements, .i / ) .i i / , .i i i / ) .iv/ hold:
(i) jjVn .f; k; :/ f jjC Œa1 ;b1 D O.n.˛.kC1/=2/ /:
(ii) f 2 Li z.˛; k C 1; a2 ; b2 /:
(iii) (a) For m < ˛.k C 1/ < m C 1; m D 0; 1; 2; : : : 2k C 1; f .m/ exists and
belongs to the class Lip.˛.k C 1/ m; a2 ; b2 /.
(b) For ˛.k C 1/ D m C 1; m D 0; 1; 2; : : : 2k; f .m/ exists and belongs to the
class Lip .1; a2 ; b2 /.
(iv) jjVn .f; k; :/ f jjC Œa3 ;b3 D O.n.˛.kC1/=2/ /;
where Li z.˛; k; a; b/ denotes the generalized Zygmund class of functions for
which !2k .f; h; a; b/ M h˛k when k D 1 Li z.˛; 1/ reduces to the Zygmund
class Lip ˛.
Theorem 4.4 ([170] Saturation result). Let f 2 C Œ0; 1/ and 0 < a1 < a2 <
a3 < b3 < b2 < b1 < 1: Then in the following statements, the implications
.i / ) .i i / ) .i i i / and .iv/ ) .v/ ) .vi / hold:
(i)jjVn .f; k; :/ f /jjC Œa1 ;b1 D O.n.kC1/ /:
(ii)f .2kC1/ 2 A:C:Œa2 ; b2 and f .2kC2/ 2 L1 Œa2 ; b2 .
(iii)jjVn .f; k; :/ f jjC Œa3 ;b3 D O.n.kC1// /:
(iv) jjVn .f; k; :/ f jjC Œa1 ;b1 D o.n.kC1/ /:
X
2kC2
(v) f 2 C 2kC2 Œa2 ; b2 and Q.j; k; x/f .j / .x/ D 0; x 2 Œa2 ; b2 ,
j DkC1
where the polynomials Q.j; k; x/ are defined in Theorem 4.1.
(vi) jjVn .f; k; :/ f jjC Œa3 ;b3 D o.n.kC1/ /.
In a simultaneous approximation for Baskakov (Lupas)–Durrmeyer operators,
Agrawal et al. [27] obtained the following asymptotic formula and an estimation
of error in simultaneous approximation for the linear combinations.
Theorem 4.5 ([27] Asymptotic formula). Let f be integrable on Œ0; 1/,
admitting a .2k C r C 2/th derivative at a point x 2 Œ0; 1/ with f .r/ .x/ D O.x ˛ /;
where ˛ is a positive integer not less than 2k C 2, as x ! 1. Then
X
2kC2
lim nkC1 ŒVn.r/ .f; k; x/ f .r/ .x/ D Q.i; k; r; x/f .i Cr/ .x/
n!1
i D1
and
lim nkC1 ŒVn.r/ .f; k C 1; x/ f .r/ .x/ D 0;

n!1
where Q.i; k; r; x/ are certain polynomials in x of degree at most i . Furthermore, if

f .2kCrC2/ exists and is continuous on < a; b >, then the above limits hold uniformly
on Œa; b: Here < a; b > Œ0; 1/ denotes an open interval containing the closed
interval Œa; b:
Theorem 4.6 ([27] Error estimation). Let 1 p 2k C 2 and f be integrable
on Œ0; 1/: If f .pCr/ exists and is continuous on < a; b >, having the modulus of
continuity !.f .pCr/ ; ı/ on < a; b >, and f .r/ .x/ D O.x ˛ /; where ˛ is a positive
integer p, then for n sufficiently large, we have
jjVn.r/ .f; k; :/ f .r/ jj maxfC1 np=2 !.f .pCr/ ; n1=2 /; C2 n.kC1/ g;
where C1 D C1 .k; p; r/ and C2 D C2 .k; p; r; f /:

In this continuation, Sinha et al. [214] obtained some local direct estimates in the
Lp -norm for the linear combinations of Baskakov–Durrmeyer operators Vn .f; x/
using the linear approximating technique of Steklov means. In the following three
theorems, 0 < a1 < a2 < b2 < b1 < 1 and Ii D Œai ; bi ; i D 1; 2:
Theorem 4.7 ([214] Error estimation). Let f 2 Lp Œ0; 1/; p > 1. If f has
2k C 2 derivatives on I1 with f .2kC1/ 2 A:C:.I1 / and f .2kC2/ 2 Lp .I1 /; then
for n sufficiently large,
jjVn .f; k; :/ f jjLp .I2 / Mk n.kC1/ fjjf .2kC2/ jjLp .I1 / C jjf jjLp Œ0;1/ g;
where Mk is a constant independent of f and n:

Theorem 4.8 ([214] Error estimation). Let f 2 L1 Œ0; 1/. If f has 2k C 1
derivatives on I1 with f .2k/ 2 A:C:.I1 / and f .2kC1/ 2 B:V:.I1 /; then for all n
sufficiently large,

jjVn .f; k; :/ f jjL1 .I2 / Mk n.kC1/ jjf .2kC1/ jjB:V:.I1 /

Cjjf .2kC1/ jjL1 .I2 / C jjf jjL1 Œ0;1/ ;

Theorem 4.9 ([214] Error estimation). Let f 2 Lp Œ0; 1/; p 1. Then for n
sufficiently large,

jjVn .f; k; :/ f jjLp .I2 / Mk !2kC2 .f; n1=2 ; p; I1 /; n.kC1/ jjf jjLp Œ0;1/ ;

4.2 Iterative Combinations
Another approach to improve the order of approximation is to take the iterates

of operators. Such an approach was considered first by Micchelli [193], who
considered the iterative combinations of the well-known Bernstein polynomials
Bn .f; x/ and was able to achieve a better order of approximation. The kth iterative
combinations of the Bernstein polynomial are defined as
X
k
k
Tn;k .f; x/ D .I .I Bn / /.f .t/; x/ D
k
.1/ pC1
Bnp .f; x/;
p
pD1
p
where Bn .f; x/, p 2 N denotes the pth iterate, and Bn0 .f; x/ D I . For f 2 C Œ0; 1,
Micchelli obtained the following result:
3k k
jjTn;k .f / f jj .2 1/! f; n1=2 ; n D 1; 2; : : : :
2
Here !.f; :/ denotes the modulus of continuity of f and jj:jj is the sup-norm on the
interval Œ0; 1:
Agrawal [22] sharpened the above result and also obtained an asymptotic formula
for the iterative combinations of Bernstein polynomials.
Theorem 4.10 ([22]). Let f 2 C Œ0; 1. Then for all n, we have
" ( )#
n 1 k
jjTn;k .f / f jj .2 1/ C
k
2 2
k
!.f; n1=2 /:
4 n
Theorem 4.11 ([22]). Let f 2 C Œ0; 1. If f .2k/ exists at a point x 2 Œ0; 1; then
X
2k
f .j / .x/
lim nk ŒTn;k .f; x/ f .x/ D Q.j; k; x/
n!1
j D2
jŠ
and
lim nk ŒTn;kC1 .f; x/ f .x/ D 0:

n!1
Furthermore, if f .2k/ exists and is continuous on Œ0; 1; then the above limits hold
uniformly in Œ0; 1:
Later, Agrawal [19] also investigated some problems concerning the degree of
approximation in simultaneous approximation by Micchelli combinations of Bern-
stein polynomials. He obtained the following pointwise convergence, asymptotic
formula, and error estimation:
4.2 Iterative Combinations 119
Theorem 4.12 ([19] Pointwise convergence). Let f 2 C Œ0; 1 and k; p 2 N .

If f .p/ exists at some point x 2 .0; 1/; then
.p/
lim Tn;k .f; x/ D f .x/:
n!1
Furthermore, if f .p/ exists and is continuous on < a; b >; where < a; b > denotes
an open interval containing the closed interval Œa; b; then the above limits hold
uniformly in Œa; b:
Theorem 4.13 ([19] Asymptotic formula). Let f 2 C Œ0; 1 and k; p 2 N .
If f .2kCp/ exists at some point x 2 .0; 1/; then
.p/
X f .j / .x/
2kCp
lim nk ŒTn;k .f; x/ f .p/ .x/ D Q.j; k; p; x/;
n!1
j Dp
jŠ
where Q.j; k; p; x/ are certain polynomials in x: Furthermore, if f .2kCp/ exists

and is continuous on < a; b >; then the above limits hold uniformly in Œa; b:
Theorem 4.14 ([19] Error estimation). Let p q 2k C p; f 2 C Œ0; 1. If f .q/
exists and is continuous on < a; b >; then
˚
jjTn;k .f; :/ f .p/ jjC Œa;b max C1 n.qp/=2 !.f .q/ ; n1=2 /; C2 nk ;
.p/
where C1 D C1 .k; p/ and C2 D C2 .k; p; f /:

For f 2 Lp Œ0; 1; 1 6 p < 1, the Bernstein–Durrmeyer operators Dn defined
in (2.13) can be expressed as
Z 1
Dn .f; x/ D Wn .t; x/f .t/ dt;
0
X
n
where Wn .t; x/ D .n C 1/ pn;k .x/pn;k .t/ is the kernel of the operators.
kD0
The iterative combination TOn;k W Lp Œ0; 1 ! C 1 Œ0; 1 of the operators is
defined as
!
Xk
k
TOn;k .f I t/ D I .I Dn /k .f I t/ D .1/rC1 Dnr .f I t/; k 2 N;
rD1
r
where Dn0 I and Dnr Dn .Dnr1 / for r 2 N: In the following two results, we
denote Ij D Œaj ; bj j D 1; 2; 3, 0 < a1 < a2 < a3 < b3 < b2 < b1 < 1:
Theorem 4.15 ([217] Direct theorem). If p > 1; f 2 Lp Œ0; 1; then for all n
sufficiently large,

O 1 k
kTn;k .f I :/ f kLp .I2 / 6 Ck !2k f; p ; p; I1 : C n kf kLp Œ0;1 ;
n
holds, where Ck is a constant independent of f and n:

Theorem 4.16 ([216] Local inverse theorem). Let f 2 Lp Œ0; 1; 1 6 p < 1;
0 < ˛ < 2k, and kTOn;k .f; :/ f kLp .I1 / D O.n˛=2 / as n ! 1: Then
!2k .f; ; p; I2 / D O. ˛ / as ! 0:
Gupta and Noor [119] proposed the mixed sequence of summation–integral-type
operators and introduced the integral modification of the Szász operators having
weights of Beta basis functions as
1
X Z 1
Sn .f; x/ D sn;v .x/ bn;v .t/f .t/dt C e nx f .0/
vD1 0
Z 1
D Kn .x; t/f .t/dt; x 2 Œ0; 1/; (4.3)
0
where
.nx/k 1 t v1
sn;v .x/ D e nx ; bn;v .t/ D
kŠ B.n C 1; v/ .1 C t/nCvC1
and
1
X
Kn .x; t/ D sn;v .x/bn;v .t/ C e nx ı.t/;
vD1
ı.t/ being the Dirac delta function. For these operators, they [119] obtained direct
results in simultaneous approximation. These operators are a modification of the
well-known Szász operators [227] defined by
1
X v
SOn .f; x/ D sn;v .x/f :
vD0
n
Finta et al. [73] considered iterative combinations Sn;k of the operators Sn as
X
k
k
Sn;k .f; x/ D .I .I Sn /k /.f .t/; x/ D .1/pC1 Snp .f; x/;
p
pD1
p
where Sn .f; x/, p 2 N denotes the pth iterate, and Sn0 .f; x/ D f; f 2 C Œ0; 1/
ff 2 C Œ0; 1/ W jf .t/j M t ; > 0; M > 0g: The norm-jj:jj on C Œ0; 1/ is
defined as jjf jj D supt 2.0;1/ jf .t/jt : Finta et al. [73] estimated the asymptotic
formula, error estimation, and a global direct result for the iterative combinations of
the operators (4.3). To prove the results, we need the following lemmas:
Lemma 4.3 ([119]). For the function Un;m .x/; m 2 N0 defined as
1
X v m
Un;m .x/ D sn;v .x/ x ;
vD0
n
we have Un;0 .x/ D 1 and Un;1 .x/ D 0: Furthermore, the recurrence relation
0
nUn;mC1 .x/ D x Un;m .x/ C mUn;m1 .x/ ; m D 1; 2; 3; : : :

holds. Consequently, for each fixed x 2 Œ0; 1/; Un;m .x/ D O nŒ.mC1/=2 :
Lemma 4.4 ([119]). For m 2 N0 (the set of nonnegative integers), the mth-order
moment for the operators Sn is defined as
Tn;m .x/ D Sn ..t x/m ; x/

X1 Z 1
D sn;v .x/ bn;v .t/.t x/m dt C e nx .x/m :
vD1 0
Then n;0 .x/ D 1; Tn;1 .x/ D 0; Tn;2 .x/ D x.2 C x/=.n 1/, and for n m, the
recurrence relation
0
.n m/Tn;mC1.x/ D x Tn;m .x/ C m.2 C x/Tn;m1 .x/
holds.
Corollary 4.2. Let ı be a positive number. Then for every > 0; x 2 .0; 1/, there
exists a constant M.s; x/ independent of n and depending on s and x such that
1
X Z
sn;v .x/ bn;v .t/t dt M.s; x/ns ; s D 1; 2; 3; : : : ;
vD1 jt xj>ı
locally on every bounded interval.

Lemma 4.5 ([73]). The recurrence relation
! mj
X m X 1 i Œp
m
ŒpC1
Tn;m .x/ D D Tn;mj .x/ Tn;i Cj .x/
j D0
j i D0 i Š
d
holds, where D denotes dx :
Lemma 4.6 ([73]). For p 2 N; m 2 N0 and x 2 Œ0; 1/, we have


Œp
Tn;m .x/ D O nŒ.mC1/=2 :
Lemma 4.7 ([73]). For the lth moment .l 2 N/ of Sn;k , we find that
Sn;k ..t x/l W x/ D O.nk /:
Lemma 4.8 ([73]). For the function sn;v .x/,
dr X
xr .sn;v .x// D ni .v nx/j Qi;j;r .x/ sn;v .x/
dx r 2i Cj r;
i;j 0
holds, where Qi;j;r .x/ are certain polynomials in x independent of n and v:

Lemma 4.9 ([73]). If f is r-times differentiable on Œ0; 1/ such that f .r1/ .t/ D
O.t ˛ /; ˛ > 0 as t ! 1; then for r D 1; 2; : : : and n > ˛ C r; we have
1 Z
.r/ nr1 .n r/Š X 1
Sn;k .f; x/ D sn;v .x/ bnr;vCr .t/f .r/ .t/dt:
.n 1/Š vD0 0
In the simultaneous approximation, the following are the main results for iterative
combinations:
Theorem 4.17 ([73]). Let f 2 C Œ0; 1/ such that f .2kCr/ exists at a point x 2
.0; 1/. Then
h i 2kCr
X
.r/
lim nk Sn;k .f; x/ f .r/ .x/ D P .j; k; r; x/f .j / .x/;
n!1
j Dr
where P .j; k; r; x/ are certain polynomials in x:

Proof. By a Taylor expansion of f , we have
X
2kCr
f .i / .x/
f .t/ D .t x/i C ".t; x/.t x/2kCr ;
i D0
iŠ
where " ! 0 as t ! x: Hence,

!
.r/
X
k
k dr p
Sn;k .f; x/ D .1/ pC1
S .f; x/
pD1
p dx r n
!Z
X
k
k 1
D .1/ pC1
Kn.r/ .x; y/Snp1 .f; y/dy
pD1
p 0
!Z
X
k
k 1
D .1/pC1 Kn.r/ .x; y/
pD1
p 0
8 9
<2kCr
X f .j / .x/ =
Snp1 ..tx/j ; y/CSnp1 .".t; x/.tx/2kCr ; y/ dy
: jŠ ;
j Dr
!Z
X
k
k 1
D .1/ pC1
Kn.r/ .x; y/ŒE1 C E2 dy:
pD1
p 0
Using the Binomial expansion of .t x/j and Lemma 4.4, we have

!
X
2kCr
f .j / .x/ X j
j
.x/j i Sn;k .t i ; x/
.r/
E1 D
j Dr
j Š i D0 i
X
2kCr
D f .r/ .x/ C nk P .j; k; r; x/f .j / .x/ C o.nk /;
j Dr
where we have used the identity

! !
X j
j i 0; j >r
.1/i D
i r .1/ ; j D r:
r
i D0
Next we estimate E2 as follows: If

Z 1
I D Kn.r/.x; y/Snp1 .".t; x/.t x/2kCr ; y/dy;
0
then by applying Lemma 4.8, we have
X 1
jQi;j;r .x/j X
jI j D ni jv nxjj sn;v .x/
2i Cj r
xr vD1
i;j 0
Z 1
bn;v .y/Snp1 .j".t; x/jjt xj2kCr ; y/dy C nr e nx j".0; x/jx 2kCr :
0
The second term on the right-hand side of above expression tends to zero as n ! 1:
Since ".t; x/ ! 0 as t ! x, for a given " > 0 such that j".t; x/j < " whenever
0 < j".t; x/j < ı, for jt xj ı; we have j".t; x/.t x/2kCr j M t for some
M > 0: Hence,
X 1
jQi;j;r .x/j X
jI j D ni jv nxjj sn;v .x/
2i Cj r
xr
vD1
i;j 0

Z Z
p1 p1
" bn;v .y/Sn .jtxj2kCr ; y/dyC bn;v .y/Sn .M t ; y/dy :
jt xj<ı jt xjı
Applying Schwarz’s inequality, and Lemmas 4.3 and 4.6, we see that I1 D "O.1/:
Proceeding in a similar way by applying Schwarz’s inequality and Corollary 4.2, we
obtain I2 D o.1/: Since " > 0 is arbitrary, we have I D o.nk /: This completes the
proof of the theorem.
Theorem 4.18 ([73]). Let f 2 C Œ0; 1/; > 0 and 0 < a1 < a2 < b2 < 1.
Then for all n sufficiently large, we have
.r/ ˚
S .f; / f .r/ M nk kf k C !2k f .r/ ; n1=2 ; a1 ; b1 / ;
n;k C Œa2 ;b2
where M is independent of f and n.

Proof. Let f
;2k .t/ be the Steklov mean of the .2k/th order corresponding to f .t/
over Œa; b1 . Then we have
.r/
S .f; :/ f .r/
n;k C Œa2 ;b2
.r/ .r/ .r/
6 Sn;k f f
;2k ; : C Œa2 ;b2 C Sn;k f
;2k ; : f
;2k C Œa2 ;b2
.r/
Cf .r/ f
;2k C Œa2 ;b2
WD J1 C J2 C J3 ; :
.r/
Since f
;2k D f .r/
;2k ; by property (iii) of the Steklov mean (see Definition 1.9
with growth of order O.t /, we have
J3 M1 !2k .f .r/ ;
; a1 ; b1 /:
Next, applying Theorem 4.17 and the interpolation property due to Goldberg and
Meier [84], we get
X
2kCr
.j /
J2 M2 nk f

;2k C Œa2 ;b2
j Dr

k
.r/ .2k/
M3 n
f
;2k C Œa2 ;b2 C f
;2k :
C Œa2 ;b2
Hence, by properties (ii) and (iv) of the Steklov mean, we have

J2 M4 nk kf k C
2k !2k f .r/ ;
; a1 ; b1 / :
Let a and b be such that 0 < a1 < a < a2 < b2 < b < b1 < 1: Also, let .t/
denote the characteristic function of the interval Œa ; b : Then
.r/
J1 D jjSn;k . .t/.f .t/ f
;2k .t/; :/jjC Œa2 ;b2
.r/
CjjSn;k ..1 .t//.f .t/ f
;2k .t/; :/jjC Œa2 ;b2
WD J4 C J5 :
We may note here that to estimate J4 and J5 , it is enough to consider their

expressions without the iterative combinations. By Lemma 4.9, it is clear that
.r/
Sn;k . .t/.f .t/ f
;2k .t/; x/
1 Z
nr1 .n r/Š X 1
.r/
D sn;v .x/ bnr;vCr .t/ .t/.f .r/ .t/ f
;2k .t//dt:
.n 1/Š vD0 0
Hence,
.r/ .r/
jjSn;k . .f f
;2k ; :/jjC Œa2 ;b2 M5 jjf .r/ f
;2k jjC Œa ;b :
Next, forx 2 Œa2 ; b2 and t 2 Œ0; 1/ n Œa ; b , we can choose a ı1 > 0 satisfying
.r/
jt xj ı1 . Therefore, by Lemma 4.8, we have for I Sn ..1 .t//.f .t/
f
;2k .t/; x/;
X 1
jQi;j;r .x/j X
jI j ni .v nx/j sn;v .x/jv nxjj
2i Cj r
xr vD1
i;j 0
Z 1
bn;v .t/.1 .t//jf .t/ f
;2k .t/jdt
0
r nx
Cn e .1 .0//jf .0/ f
;2k .0/j:
For sufficiently large n, the second term is zero. Thus, by Schwarz’s inequality,
X 1
X Z
jI j M6 jjf jj ni sn;v .x/jv nxjj bn;v .t/dt
2i Cj r vD1 jt xjı1
i;j 0
X 1
X
M6 jjf jj ı12s ni sn;v .x/jv nxjj
2i Cj r vD1
i;j 0
Z 1 1=2 Z 1 1=2
bn;v .t/dt bn;v .t/.t x/4s dt
0 0
1
!1=2
X X
M6 jjf jj ı12s n i
.v nx/ 2j
2i Cj r vD1
i;j 0
1 Z !1=2
X 1
sn;v .x/ bn;v .t/.t x/ dt 4s
:
vD1 0
Using Lemmas 4.3 and 4.4, we get
jI j M7 jjf jj ı12s O.ni Cj=2s / M7 jjf jj ;
where q D s .r=2/: Now, choosing q > 0 satisfying q k, we obtain
jI j M7 nk jjf jj :
Therefore, by property (iii) of the Steklov mean f

;2k , we get
J1 M8 jjf .r/ f
;2k jjC Œa ;b C M7 nk jjf jj
.r/
M9 !2k .f .r/ ;
; a1 ; b1 / C M7 nk jjf jj :
If we choose
D n1=2 , the theorem follows.
Next, we present the global approximation theorem, which can be used in the
next theorem to prove the global result for the iterative combinations.
Theorem 4.19 ([73]). Let f 2 CB Œ0; 1/ and n 2: Then

Sn .f; / f C ! 2 .f; n1=2 /;
'
p
where C > 0 is an absolute constant, '.x/ D x.2 C x/; x 2 Œ0; 1/, and
!'2 .f; ı/ D sup sup jf .x C h'.x// 2f .x/ C f .x h'.x//j

0<hı x˙h'.x/2.0;1/
is the Ditzian–Totik [62] second-order modulus of smoothness.

Proof. Let g 2 W1
2
.'/ (see Definition 1.10). By a Taylor expansion, we have
v v Z t
v
g.t/ D g C g0 t C .t u/g 00 .u/d u:
n n n v=n
Next,
1
X Z 1 h v i
Sn .g; x/ SOn .g; x/ D sn;v .x/ g.t/ g bn;v .t/dt
vD1 0 n
1
X Z 1 Z t
00
D sn;v .x/ bn;v .t/ .t u/g .u/d u dt:
vD1 0 v=n
Hence, by Lemma 9.6.1 of [62], we have
jSn .g; x/ SOn .g; x/j

1 Z 1 ˇZ ˇ
X ˇ t
jt uj ˇ
sn;v .x/ bn;v .t/ ˇˇ d uˇˇ dt:jj' 2 g 00 jj
vD1 0 v=n u.2 C u/
1
X Z ˇZ ˇ
1 ˇ t
jt uj ˇ
sn;v .x/ bn;v .t/ ˇˇ d uˇˇ dt:jj' 2 g 00 jj
vD1 0 v=n u.1 C u/
1
X Z 1
.t v=n/2
1 1
sn;v .x/ bn;v .t/ C dt:jj' 2 g 00 jj
vD1 0 v=n
1 C v=n 1 C t
( 1 1
)
X 1 X 1 nCv
sn;v .x/ C sn;v .x/ : :jj' 2 g 00 jj
vD1
n 1 vD1
n n C v C 1
( 1
)
1 X 1 2
C sn;v .x/ :jj' 2 g 00 jj :jj' 2 g 00 jj:
n 1 vD1 n n1
On the other hand, by Lemma 4.3, we have jjSn f jj jjf jj. Thus, by Lemma 9.6.1
of [62], we have
jSn .g; x/ SOn .g; x/j

jSn .f g; x/ .f g/.x/j C jSn .g; x/ SOn .g; x/j C jSOn .g; x/ g.x/
2 1
2jjf gjj C jj' 2 g 00 jj C jj'O 2 g 00 jj
n1 n

1 1
2 jjf gjj D jj' 2 g 00 jj C jjf gjj C jj'O 2 g 00 jj ;
n1 n
p
where 'O D x; x 2 Œ0; 1/. If we consider the following K-functional:
K'2 .f; ı/ D inffjjf gjj C ıjj' 2 g 00 jj W g 2 W1

2
g; ı > 0;
and
K'2O .f; ı/ D inffjjf gjj C ıjj'O 2 g 00 jj W g 2 W1

2
g; ı > 0;
respectively, then
jjSn f f jj jjSn f SOn f jj C jjSOn f f jj

2K'2 .f; .n 1/1 / C K'2O .f; n1 /;
for all f 2 CB Œ0; 1/ and n 2. Using Theorem 2.1.1 of [62], inequality

O
'.x/'.x/; x 2 Œ0; 1/, and Theorem 4.1.1 of [62], we get the assertion of the
theorem.
Theorem 4.20 ([73]). Let f 2 CB Œ0; 1/ and n 2: Then there exists a C.k/ > 0
such that
jjSn;k f f jj c.k/!'2 .f; n1=2 /:
Proof. We have
! !
X
k
k Xk
pC1 k
Sn;k .f; x/ f .x/ D .1/ pC1
ŒSn .f; x/ f .x/
p
.1/ f .x/
pD1
p pD0
p
!
X
k
k
D .1/ pC1
ŒSnp .f; x/ f .x/:
pD1
p
Using jjSn f jj jjf jj, we obtain
jjSnp f jj D jjSn .Snp1 f /jj jjSnp1 f jj jjf jj:
Hence,
jjSnp f f jj D jjSnp f Snp1 f jj C C jjSn f f jj

jjSnp1 .Sn f f /jj C C jjSnf f jj
pjjSn f f jj:
In conclusion,
! !
Xk
k Xk
k
jjSn;k f f jj jjSn f f jj
p
pjjSn f f jj
pD1
p pD1
p
!
Xk
k1
D jjSnf f jj D 2k1 kjjSn f f jj:
pD1
p 1
4.3 Another Form of Linear Combinations 129
In view of Theorem 4.19, there exists a C > 0 absolute constant such that
jjSn f f jj C !'2 .f; n1=2 /:
Thus,
jjSn;k f f jj 2k1 kC !'2 .f; n1=2 /;
and the constant c.k/ can be chosen as 2k1 kC; which completes the proof.
4.3 Another Form of Linear Combinations
In 1993, Bingzheng [40] considered the following linear combinations for the
general class of Durrmeyer-type operators as
X
r1
Mn;r .f; x/ D ˛i .n/Mni .f; x/;
i D0
where, with an absolute constant A; ni , ˛i .n/ satisfy

(a) PD
n
r1
n0 < n1 < nr1 An;
(b) D0 j˛i .n/j A;
Pir1
(c) D0 ˛i .n/ D 1;
Pir1 k
(d) i D0 ˛i .n/ni D 0; for k D 1; 2; : : : ; r 1.
Obviously, Mn;1 .f; x/ D Mn .f; x/, and these operators are defined as
1
X Z
Mn .f; x/ D .n c/ pn;v;c .c/ pn;v;c .t/f .t/dt;
vD0 I
where
xk
pn;v;c .x/ D .1/k n;c
.k/
.x/ ; x 2 I;
kŠ
with n 2 N; n > maxf0; cg and special cases
1. n;c .x/ D .1 x/n for the interval I D Œ0; 1; with c D 1;
2. n;c .x/ D e nx for the interval I D Œ0; 1/; with c D 0;
3. n;c .x/ D .1 C cx/n=c for the interval I D Œ0; 1/; with c > 0:
T
Let C ŒI L1 ŒI be the set of continuous bounded functions on I . jj:jj1Tdenotes
the supremum norm. The rth modulus of smoothness is defined in C ŒI L1 ŒI
as !r .f; t/ D sup0h<t jjrh f jj1 ; where the forward differences rh f .x/ D
Pr
rk r
kD0 .1/ C .k r=2/h/; if x ˙ .r=2/h 2 I; rh f .x/ D 0; otherwise.
k f .x
The Peetre K-functionals are defined as
Kr .f; t r / D inf g 2 Dr fjjf gjj1 C t r jjgjjDr g;
where the Sobolev space Dr and its norm are defined as Dr D fg 2 C ŒI W g .r1/ 2
A:Cloc ; g .r/ 2 L1 g; and jjgjjDr D jjgjj1 C jjg .r/ jj1 : It is well known that for
f 2 C ŒI ,
M01 !r .f; t/ Kr .f; t r / M0 !r .f; t/; (4.4)
with the constant M0 independent of f and t > 0: Following Heilmann’s methods

[148], Bingzheng [40] representations for the derivatives of Mn W
T used the followingp
LetTf 2 C ŒI L1 ŒI ; .x/ D x.1 C cx/; s 2 N; x 2 I: If f .s/ 2
C ŒI L1 ŒI ; then
1
X Z
.Mn f /.s/ .x/ D .1/s .n c/˛.n; s; c/ pnCcs;k .x/ pncs;kCs .t/f .s/ .t/dt;
kD0 I
Q
with 0 < c 1 ˛.n; s; c/ D js1 D0 .n C cl/=.n cj c/ C; C is independent
of n: In some situations, it is convenient to work with the operators Mn;s given by
1
X Z
.Mn;s f /.x/ D .1/s .n c/˛.n; s; c/ pnCcs;k .x/ pncs;kCs .t/f .t/dt;
kD0 I
T
whereTf 2 C ŒI L1 ŒI : It was observed that .Mn f /.s/ D Mn;s f .s/ if f .s/ 2
C ŒI L1 ŒI : For these operators, the linear combinations take the form
X
r1 \
Mn;r;s .f; x/ D ˛i .n/Mni ;s .f; x/; f 2 C ŒI L1 ŒI : (4.5)
i D0
To prove the direct theorem, the following lemma must be used:

Lemma 4.10 ([40]). For every m 2 N; n > c.s C 2m C 2/ and x 2 I; we have
j.Mn;s ..t x/2m /.x/j C1 ..x/2 C n C 1=n2 /m
j.Mn;s ..t x/2mC1 /.x/j C2 ..x/2 C n C 1=n2 /m .1 C 2cx/=n;
where C1 ; C2 are independent of n:

T
Theorem 4.21 ([40] Direct theorem). Let f .s/ 2 C ŒI L1 ŒI ; s 2 N0 ; r 2 N.
Then
4.3 Another Form of Linear Combinations 131
j.Mn;r .f; x/ f .x//.s/ j MKr .f .s/ ; ..x/2 =n C 1=n2 /r=2 /

M 0 Kr .f .s/ ; ..x/2 =n C 1=n2 /1=2 /;
p
where M; M 0 are constants independent of f; n; x 2 I and .x/ D x.1 C cx/:
Proof. From the definition of combinations and Lemma 4.10, we have
Mn;r;s ..t x/k ; x/ D 0; k D 0; 1; 2; : : : ; r 1:
Let g 2 Dr . By Lemma 4.22 and Holder’s inequality, we have

Z t
jMn;r;s .g; x/ g.x/j Mn;r;s .t u/ g .u/=.r 1/Šd u; x
r1 .r/
x
X
r1
j˛i .n/jMni ;s .jt xjr ; x/jjg .r/ jj1
i D0
X
r1
j˛i .n/jMni ;s ..t x/2r ; x/1=2 jjg .r/ jj1
i D0
A.C1 ..x/2 =n C 1=n2 /r=2 jjg .r/ jj1

D AC1 ..x/2 =n C 1=n2 /r=2 jjg .r/ jj1 :
Thus, we have
j.Mn;r;s .f; x/f .x//.s/ j jMn;r;s .f .s/ g; x/jCjf .s/ gjCjMn;r;s .g; x/g.x/j
X
r1
j˛i .n/j:jMni ;s .f .s/ g; x/j
i D0
CAC1 ..x/2 C n C 1=n2 /r=2 jjg .r/ jj1 C jf .s/ gj

.A C 1/.C0 C 1/.C1 C 1/ jjf .s/ gjj1

C..x/ C n C 1=n /
2 2 r=2
jjg jj1 ;
.r/
where C0 satisfies jjMni ;s .f; x/jj C0 jjf jj1 : By taking the infimum over g 2 Dr ,
we obtain
j.Mn;r .f; x/ f .x//.s/ j MKr .f .s/ ; ..x/2 =n C 1=n2 /r=2 /;

where M is a constant independent of f; x, and using (4.4), we obtain the required

result.
Also, the following inverse result was discussed and proved in [40].
T
Theorem 4.22 ([40] Inverse theorem). Let f .s/ 2 C ŒI L1 ŒI ; .x/ D
p
x.1 C cx/; r 2 N, and s < ˛ < r C s; n > s C 2r C 2: Then
j.Mn;r .f; x/ f .x//.s/ j C..x/2 =n C 1=n2 /.˛s/=2 /;
with constant C independent of n; x, if and only if !.f .s/ ; h/ D O.h˛s /:

Zhou [258] considered this type of combination for the Szász–Durrmeyer operators
Ln .f; x/ D Mn .f; x/ defined in (2.17) and obtained the following results:
Theorem 4.23 ([258] Direct theorem). Let f 2 C Œ0; 1/; r 2 N: Then we have
jLn;r .f; x/ f .x/j CKr .f; .x=n C n2 /r=2 /

p
C 0 !r .f; x=n C n2 /;
where C and C 0 are constants independent of f; n 2 N and x 0:

Theorem 4.24 ([258] Inverse theorem). Let f 2 C Œ0; 1/; r 2 N; 0 < ˛ < r:
Then we have
jLn;r .f; x/ f .x/j C.x=n C n2 /˛=2 ;
with a constant C independent of x and n, if and only if !r .f; h/ D O.h˛ /:
4.4 Combinations of Szász–Baskakov Operators
In this section, we consider the combinations of the Szász–Baskakov operators. This

section is based on the results studied in [129]. Prasad et al. [203] introduced the
Szász–Mirakyan–Baskakov operator as
1
X Z 1
Sn .f; x/ D .n 1/ sn;k .x/ bn;k .t/f .t/dt; x 2 RC Œ0; 1/; (4.6)
kD0 0
k tk tk
kŠ
and bn;k .t/ D nCk1
k .1Ct /nCk
D .n/k
kŠ .1Ct /nCk
, and .n/k
represents the Pochhammer symbol.
Alternatively, the operators (4.6) can be represented as
Z 1
e nx f .t/ nxt
Sn .f .t/; x/ D .n 1/ 1 F1 nI 1I dt;
0 .1 C t/n 1Ct
4.4 Combinations of Szász–Baskakov Operators 133
where the function 1 F1 is known as the Pochhammer–Berens confluent

hypergeometric function.
Lemma 4.11 ([129]). For n > 0 and r 0, we have
.n r 1/.r C 1/
Sn .t r ; x/ D 1 F1 .rI 1I nx/: (4.7)
.n 1/
Furthermore, we have
.n r C 1/.r C 1/
Sn .t r ; x/ D Lr .nx/;
.n 1/
where Lr .nx/ are the Laguerre polynomials.
Proof. Substituting f .t/ D t r in (4.6) and using the definition of the Beta integral,
we have
1
X Z
e nx .nx/k .n/k 1 t kCr
Sn .t r ; x/ D .n 1/ dt
kŠ kŠ 0 .1 C t/nCk
kD0
1
X e nx .nx/k .n/k .k C r C 1/.n r 1/
D .n 1/ :
kŠ kŠ .n C k/
kD0
Using kŠ D .1/k and .k C r C 1/ D .r C 1/.r C 1/k ; we have

1
X
nx .nx/k .n/k .r C 1/.r C 1/k
Sn .t ; x/ D .n 1/e
r
.n r 1/
kŠ .1/k .n/k .n/
kD0
1
e nx
.n r 1/.r C 1/ X .r C 1/k .nx/k
D
.n 1/ .1/k kŠ
kD0
nx
e .n r 1/.r C 1/
D 1 F1 .r C 1I 1I nx/;
.n 1/
which, on using 1 F1 .aI bI x/ D e x 1 F1 .b aI bI x/; leads us to (4.7).
It is obvious that the confluent hypergeometric functions can be related to the
generalized Laguerre polynomials Lm n .x/ with the relation
.m C n/Š
n .x/ D
Lm 1 F1 .nI m C 1I x/ :
mŠnŠ
Thus,
.n r 1/.r C 1/
Sn .t r ; x/ D Lr .nx/;
.n 1/
where Lr .nx/ D L0r .nx/ is the simple Laguerre polynomials.

Remark 4.1. For fixed x 2 I Œ0; 1/, define the function x by x .t/ D t x.
The central moments for the operators Sn are given by
1 C 2x .n C 6/x 2 C 2.n C 3/x C 2

.Sn 0
x /.x/ D 1; .Sn 1
x /.x/ D ; .Sn 2
x /.x/ D :
n2 .n 2/.n 3/
Moreover, let x 2 I be fixed. For r D 0; 1; 2; ::: and n 2 N , the central moments

for the operators Sn satisfy
.Sn r
x /.x/ D O.nŒ.rC1/=2 /:
In view of the above, an application of the Schwarz inequality, for r D 0; 1; 2; :::,

yields
q
.Sn j x j/.x/
r
.Sn 2r
x /.x/ D O.nr=2 /: (4.8)
It is known that the simple generalized Laguerre polynomials Lk .x/ have the
following representation:
!
X k
k xj
Lk .x/ D .1/ j
: (4.9)
j D0
k j jŠ
Therefore, the coefficient of the leading term in (4.9) is .1/k 1

kŠ
: Hence,
.n k 1/kŠ
Sn .t k ; x/ D Lk .nx/
.n 1/
!
.n k 1/kŠ X
k
k nj x j
D
.n 1/ j D0
kj jŠ
!
.nk1/ k .nk1/kŠ X
k1
k nj x j
D x C : (4.10)
.n1/ .n1/ j D0 kj jŠ
We consider the following linear combinations:

X
r
Sn;r D ˛i .n/ Sni ; (4.11)
i D0
where ni ; i D 0; 1; : : : ; r are distinct positive numbers. Determine ˛i .n/ such that

Sn;r p D p for all p 2 Pr . This seems to be natural, as the operators Sn do
not preserve linear functions. The requirement that each polynomial of degree at
most r should be reproduced leads to a linear system of equations:
Sn;r .t k ; x/ D x k ; 0 k r: (4.12)
Therefore, (4.10) and (4.11) imply the system
˛0 .n/ C ˛1 .n/ C C ˛r .n/ D 1

X r
.ni k 1/ k (4.13)
˛i .n/ ni D 1; 1 k r:
i D0
.ni 1/
The unique solution of this system is
.ni 1/ Yr
1
˛i .n/ D ; 0 i r: (4.14)
.ni r 1/ j D0 .ni nj /
j ¤i
To verify this, let us first set k D r in the second equation in (4.13). By using (4.14),
we set the left side of the second equation of (4.13) equal to
X
r Y
r
1
nri D f Œn0 ; n1 ; : : : ; nr ; f .t/ D t r ; (4.15)
i D0 j D0
.ni nj /
j ¤i
where in (4.15) we have used the well-known formula for the representation of the
divided difference f Œn0 ; n1 ; : : : ; nr over the knots n0 ; : : : ; nr for f .t/ D t r . But the
latter is equal to the leading coefficient in the Lagrange interpolation polynomial of
degree r over the knots n0 ; : : : ; nr , which obviously is equal to 1. Furthermore, if
1 k < r in (4.13), then we should verify that
X r
.ni k 1/ k Y
r
1
ni D 1:
i D0
.ni r 1/ j D0
.ni nj /
j ¤i
Consequently,
.ni r 1/.ni r/ .ni k 2/ nki D h.ni / 2 Pr ;
with leading coefficient 1. So in a similar way as earlier, we see that the second
equation in (4.13) holds for all 1 k r. To verify the first equation in (4.13),
we only need to observe that ˛0 .n/ C C ˛r .n/ equals the divided difference
f Œn0 ; : : : ; nr for
f .t/ D .t r 1/.t r/ .t 2/ D t r C ;
and the latter is equal to 1. According to (4.10), by the same method we observe that
! j
X
r
.ni k 1/kŠ k ni x j
˛i .n/ D 0;
i D0
.ni 1/ kj jŠ
for 0 j k 1 and 1 k r. To obtain a direct estimate for approximation by

linear combinations Sn;r , one needs two additional assumptions:
n D n0 < n1 < < nr A n.A D A.r//; (4.16)
X
r
j˛i .n/j C: (4.17)
i D0
The first of these conditions guarantees that

rC1
Sn;r j rC1
x j .x/ D O n 2 ; n ! 1; (4.18)
which follows from (4.8). The second condition is that the sum of the absolute values
of the coefficients should be bounded independent of n. This is due to the fact that
the linear combinations are no longer positive operators. We end this section with
the following example:
Example 4.1. Let n0 D n; n1 D 2n; n2 D 3n. Then, by simple calculations, we
verify that
.n 2/.n 3/ 1 5 1 3
˛0 D D C 2;
.n/.2n/ 2 2 n n
1 1
˛1 D 4 C 106 2;
n n
9 15 1 3
˛2 D C 2:
2 2 n n
The two assumptions on ˛i are fulfilled.
But if we choose ˛0 D n; ˛1 D n C 1; ˛2 D n C 2, it is easy to verify that the
first condition in (4.13) is not satisfied. So we should be careful with the choice of
the coefficients of the linear combination.
The main result in this section is
Theorem 4.25 ([129]). Let f 2 CB Œ0; 1/. Then for every x 2 Œ0; 1/ and for
C > 0; n > r; we have

1
j.Sn;r f /.x/ f .x/j C !rC1 f; p ;
n
where CB Œ0; 1/ is the space of all real-valued continuous bounded functions f

defined on Œ0; 1/:
Proof. The classical Peetre Kr -functional for f 2 CB Œ0; 1/ is defined by
Kr .f; ı r / D inffkf gk C ı r kg.r/ k W g 2 W1

r
g; ı > 0; (4.19)
where W1r
D fg 2 CB Œ0; 1/; g.r/ 2 CB Œ0; 1/g: From the classical book of
DeVore–Lorentz, [60] there exists a positive constant C such that
Kr .f; ı r / C !r .f; ı/: (4.20)
Let g 2 W1
r
. By a Taylor expansion of g, we get
X r
.t x/i .i / .t x/rC1 .rC1/
g.t/ D g.x/ C g .x/ C g .t;x /: (4.21)
i D1
iŠ .r C 1/Š
We apply the operator to both sides of (4.21). Now (4.12) implies

.t x/rC1 .rC1/
Sn;r .g; x/ g.x/ D Sn;r g .t;x /I x :
.r C 1/Š
Therefore,
X
r
jt xjrC1
jSn;r .g; x/ g.x/j j˛i j Sni I x kg .rC1/ k:
i D0
.r C 1/Š
From (4.17) and (4.18), it follows that
jSn;r .g; x/ g.x/j C.r/ n.rC1/=2 kg.rC1/ k:
Consequently,
jSn;r .f; x/ f .x/j jSn;r .f g; x/ .f g/.x/j C jSn;r .g; x/ g.x/j
2kf gk C C.r/ n.rC1/=2 kg.rC1/ k:
Taking the infimum on the right side over all g 2 W1

rC1
and using (4.19) and (4.20),
we get the required result.
Corollary 4.3 ([129]). If f .rC1/ 2 CB Œ0; 1/, then
rC1
1
j.Sn;r f /.x/ f .x/j C p kf .rC1/ kCB Œ0;1/ :
n
Theorem 4.26 ([129]). Let f; f 0 ; : : : ; f .rC2/ 2 CB Œ0; 1/. Then, if r D 2k C

1; k D 0; 1; 2; : : : for x 2 Œ0; 1/, it follows that
lim nkC1 ŒSn;2kC1 .f; x/ f .x/ D P2kC2 .x/ f .2kC2/ .x/;

n!1

where P2kC2 .x/ D lim Sn;2kC1 . 2kC2
x .t/; x/nkC1 :
n!1
Proof. By the Taylor expansion of f; we have
X
2kC2
.t x/i .t x/2kC2
f .t/ f .x/ D f .i / .x/ C R.t; x/; (4.22)
i D1
iŠ .2k C 2/Š
where R.t; x/ is a bounded function for all t; x 2 Œ0; 1/ and lim R.t; x/ D 0. We
t !x
apply Sn;2kC1 to both sides of (4.22) to get
f .2kC2/ .x/
Sn;2kC1 .f; x/ f .x/ D Sn;2kC1 . 2kC2
; x/ C I; (4.23)
.2k C 2/Š x
where
1
I D Sn;2kC1 .t x/2kC2 R.t; x/I x :
.2k C 2/Š
From (4.8), (4.17), and (4.18), we get

jSn;2kC1 . 2kC2
x ; x/j D O nŒ.2kC3/=2 D O n.kC1/ : (4.24)
Let " > 0 be given. Since .t; x/ ! 0 as t ! x, then there exists a ı > 0 such that
when jt xj < ı; we have j.t; x/j < ", and when jt xj ı; we write
.t x/2
j.t; x/j C :
ı2
Thus, for all t; x 2 Œ0; 1/; we can write
.t x/2
j.t; x/j " C C
ı2
and
C ˇˇ ˇ
jI j C " n.kC1/ C 2
Sn;2kC1 ..t x/2kC4 ; x/ˇ
ı
C
C " n.kC1/ C 2 n.kC2/ :
ı
Hence,
C 1
nkC1 jI j C " C :
ı2 n
So
lim nkC1 jI j D 0:
n!1
Combining the estimates (4.22)–(4.24), we get the desired result. This completes
the proof of the theorem.
Chapter 5
Better Approximation
Many well-known approximating operators Ln ; preserve the constant as well as

the linear functions, that is, Ln .e0 ; x/ D e0 .x/ and Ln .e1 ; x/ D e1 .x/ for
ei .x/ D x i .i D 0; 1/: These conditions hold specifically for the Bernstein polyno-
mials, Szász–Mirakjan operators, Baskakov operators, Phillips operators, genuine
Durrmeyer-type operators, and so on. For each of these operators, Ln .e2 ; x/ ¤
e2 .x/, but instead there is a more complicated expression that tends to e2 .x/ for
sufficiently large n. King [172] modified the well-known Bernstein polynomials
Bn .f; x/ in order to preserve e0 and e2 : He considered rn .x/ as
s
1 n 1
rn .x/ D C x2 C ; n D 2; 3; : : : ;
2.n 2/ n1 4.n 1/2
and r1 .x/ D x 2 . The modified form of the Bernstein polynomial becomes
!
X
n
n k
Vn .f; x/ D .rn .x//k .1 rn .x//nk f ;
k n
kD0
with 0 rn .x/ 1; n D 1; 2; : : : ; 0 x 1: Obviously, limn!1 rn .x/ D x:

In [172],
Vn .e0 ; x/ D 1; Vn .e1 ; x/ D rn .x/; Vn .e2 ; x/ D x 2 :
King [172] established quantitative estimates and compared them with estimates of
approximation by Bernstein polynomials. The order of approximation of Vn .f; x/
to f .x/ is at least as good as the order of approximation to f .x/ by the Bernstein
polynomial whenever 0 x < 1=3:
Some other properties for the modified operators Vn have been discussed by
Gonska and Pitul [85]:

142 5 Better Approximation
Since Vn e1 D rn ; it is clear that Vn is not a polynomial operator. Vn interpolates

at the endpoints 0 and 1:
5.1 Bernstein–Durrmeyer-Type Operators
Gupta [96] introduced the following positive linear operators, which modify the
Bernstein–Durrmeyer operators:
X
n Z 1
Pn .f; x/ D pn;k .x/ bn;k .t/f .t/dt; (5.1)
kD0 0
where x 2 Œ0; 1; n 2 N and, for n .x/ D .1 x/n ;

!
n k xk
pn;k .x/ D x .1 x/nk and bn;k .t/ D .1/kC1 n.kC1/ .t/:
k kŠ
Throughout the section, we use the test functions ei as ei .x/ D x i ; i D 0; 1; 2; and

the moment function 'x D t x:
Lemma 5.1. For x 2 Œ0; 1 and n 2 N, we have
nx C 1 n2 x 2 n.x 4/ C 2
(i) Pn .e0 ; x/ D 1; Pn .e1 ; x/ D ; Pn .e2 ; x/ D ;
nC1 .n C 1/.n C 2/
1x 2x 2 .n 1/ C 2x.n 2/x C 2
(ii) Pn .'x ; x/ D ; Pn .'x2 ; x/ D :
nC1 .n C 1/.n C 2/
Also, Gupta and Maheshwari [118] introduced another modification of
Bernstein–Durrmeyer operators and investigated their approximation properties
for functions of bounded variation:
Xn Z 1
Rn .f; x/ D n pn;k .x/ pn1;k1 .t/f .t/dt C .1 x/n f .0/; (5.2)
kD0 0
where x 2 Œ0; 1; n 2 N, and the term pn;k .x/ is given above.
Lemma 5.2. For x 2 Œ0; 1 and n 2 N, we have
nx nx.x.n 1/ C 2/
(i) Rn .e0 ; x/ D 1; Rn .e1 ; x/ D ; Rn .e2 ; x/ D ;
nC1 .n C 1/.n C 2/
x x.1 x/.2n C 1/ .1 3x/x
(ii) Rn .'x ; x/ D ; Rn .'x2 ; x/ D :
nC1 .n C 1/.n C 2/
In [111], Gupta and Duman modified the operators given by (5.1) and (5.2) such that
the linear functions are preserved. They were able to achieve a better approximation
over some compact interval.
5.1 Bernstein–Durrmeyer-Type Operators 143
We start with the operator Pn : Then, by defining
.n C 1/x 1
rn .x/ D ;
n
we replace x in the definition of Pn .f; x/ by So, to get rn .x/ 2 Œ0; 1 for any
rn .x/:
n 2 N, we have to use the restriction x 2 12 ; 1 : Then the following modification
of the operators Pn .f; x/ is defined by (5.1)
X
n Z1
POn .f; x/ D dn;k .x/ bn;k .t/f .t/dt; (5.3)
kD0 0
1
where x 2 2
; 1 ; n 2 N, the term bn;k .t/ is given in (5.1), and
!
n .n C 1/nk ..n C 1/x 1/k .1 x/nk
dn;k .x/ D :
k nn
In a similar manner, defining
.n C 1/x
qn .x/ D ;
n

from the definition of Rn .f; x/ given by (5.2) and using the restriction x 2 0; 12 ;
we have the following positive linear operators at once:
X
n Z1
.n .n C 1/x/n
RO n .f; x/ D n tn;k .x/ pn1;k1 .t/f .t/dt C f .0/; (5.4)
nn
kD0 0

where x 2 0; 12 ; n 2 N, the term pn1;k1 .t/ is given above, and
!
n .n C 1/k x k .n .n C 1/x/nk
tn;k .x/ D :
k nn
The next results follow from Lemmas 5.1 and 5.2.

Lemma 5.3 ([111]). For x 2 12 ; 1 and n 2 N, we have
.n2 1/x 2 C 2.n C 1/x 1
(i) POn .e0 ; x/ D 1; POn .e1 ; x/ D x; POn .e2 ; x/ D ;
n.n C 2/
.1 x/.2nx C x 1/
(ii) POn .'x ; x/ D 0; POn .'x2 ; x/ D :
n.n C 2/

Lemma 5.4 ([111]). For x 2 0; 12 and n 2 N, we have
x..n2 1/x C 2n/
(i) RO n .e0 ; x/ D 1; RO n .e1 ; x/ D x; RO n .e2 ; x/ D ;
n.n C 2/
x.2n.1 x/ x/
(ii) RO n .'x ; x/ D 0; RO n .'x2 ; x/ D :
n.n C 2/
Lemmas 5.3 and 5.4 easily show that the modified operators POn and RO n preserve the
linear functions; that is, for h.t/ D at C b; where a; b are any real constants, we
obtain
POn .h; x/ D RO n .h; x/ D h.x/:
On the other hand, the above lemmas guarantee that the following Korovkin-type
approximation results hold.
Theorem 5.1 ([111]). For all f 2 C Œ0; 1; the sequence fPOn .f; x/gn2N is
uniformly convergent to f .x/ with respect to x 2 Œ1=2; 1:
Theorem 5.2 ([111]). For all f 2 C Œ0; 1; the sequence fRO n .f; x/gn2N is
uniformly convergent to f .x/ with respect to x 2 Œ0; 1=2:
In [111], the rates of convergence of the operators POn and RO n are given by (5.3)
and (5.4), respectively.

Theorem 5.3 ([111]). For every f 2 C Œ0; 1, x 2 12 ; 1 , and n 2 N, we have
ˇ ˇ
ˇO ˇ
ˇPn .f; x/ f .x/ˇ 2!.f; ıx /;
where
s
.1 x/.2nx C x 1/
ıx WD :
n.n C 2/
Remark 5.1 ([111]). For the operator Pn given by (5.1), we may write that, for
every f 2 C Œ0; 1, x 2 Œ0; 1, and n 2 N;
jPn .f; x/ f .x/j 2!.f; ˛x /; (5.5)
where
s
2x 2 .n 1/ C 2x.n 2/x C 2
˛x WD :
.n C 1/.n C 2/
Now we claim that the error estimation

in Theorem 5.3 is better than that of (5.13)
provided f 2 C Œ0; 1 and x 2 12 ; 35 : Indeed, in order to get this better estimation,

we must show that ıx ˛x for appropriate x’s. Using also the restriction x 2 12 ; 1 ;
one can obtain that
5.1 Bernstein–Durrmeyer-Type Operators 145
.1 x/.2nx C x 1/ 2x 2 .n 1/ C 2x.n 2/x C 2

ıx ˛x ,
n.n C 2/ .n C 1/.n C 2/
.1 x/..5n C 1/x .3n C 1//
, 0
n.n C 1/.n C 2/
3n C 1
,x :
5n C 1
Observe now that

3n C 1 3
> for any n 2 N:
5n C 1 5
1
Thus, considering the above inequalities, we can say that if x 2 3
2; 5 , then we have
ıx ˛x ;
which corrects the claim.
A similar idea as in Theorem 5.3 immediately leads us to the following result.

Theorem 5.4 ([111]). For every f 2 C Œ0; 1, x 2 0; 12 , and n 2 N, we have
ˇ ˇ
ˇO ˇ
ˇRn .f; x/ f .x/ˇ 2!.f; ux /;
where
s
x.2n.1 x/ x/
ux WD :
n.n C 2/
Remark 5.2 ([111]). Furthermore, for the operator Rn given by (5.2), we get, for
every f 2 C Œ0; 1, x 2 Œ0; 1 and n 2 N; that
jRn .f; x/ f .x/j 2!.f; vx /;
where
s
x.1 x/.2n C 1/ .1 3x/x
vx WD :
.n C 1/.n C 2/
Now considering Remark

5.2, we see that a similar claim is valid for the operators
RO n on the interval 25 ; 12 : Indeed, in order to get a better estimation, we must show
that ux vx for appropriate x’s. So we may write that
x.2n.1 x/ x/ x.1 x/.2n C 1/ .1 3x/x

ux vx ,
n.n C 2/ .n C 1/.n C 2/
x.x C .5x 2/n/
, 0
n.n C 1/.n C 2/
2n
,x :
5n C 1
However, since
2n 2
< for any n 2 N;
5n C 1 5

the above inequalities yield that if x 2 25 ; 12 , then we have
ux vx ;
which corrects the claim again.
5.2 Phillips Operators
In 2010, Gupta [104] modified the well-known Phillips operators such that the
modified form preserves the test functions e0 and e2 . He was able to achieve a better
approximation over the original Phillips operators.
The Phillips operators are defined as
1
X Z 1
Pn .f; x/ D n sn;v .x/ sn;v1 .t/f .t/dt C e nx f .0/; x 2 Œ0; 1/; (5.6)
vD1 0
v
where sn;v .x/ D exp.nx/ .nx/
vŠ : The operators (5.6) were introduced in [199].
Remark 5.3. It is obvious that for all x 2 Œ0; 1/, we have

(i) Pn .e0 ; x/ D 1;
(ii) Pn .e1 ; x/ D x;
(iii) Pn .e2 ; x/ D nx nC2x :
2
Let frn .x/g be the sequence of real-valued continuous functions defined on the
interval Œ0; 1/, with 0 rn .x/ < 1: If we replace x by rn .x/, which is defined by
p
1 C 1 C n2 x 2
rn .x/ D ;
n
we get the following modification of the Phillips operators defined as
1
X Z 1
nrn .x/ .nr .x//v
Pn .f; x/ D ne n
sn;v1 .t/f .t/dt C e nrn .x/ f .0/: (5.7)
vD1
vŠ 0
One can see that Pn maps CB Œ0; 1/, the space of all bounded and continuous
functions on Œ0; 1/, into itself.
5.3 Szász–Mirakjan–Beta Operators 147
Remark 5.4. For each x 2 Œ0; 1/, we have

(i) Pn .e0 ; x/ D 1; p
(ii) Pn .e1 ; x/ D 1C n1Cn x ;
2 2

(iii) Pn .e2 ; x/ D x :
2
Theorem 5.5 ([104]). For each f 2 CB Œ0; 1/ and x 0, we have
jPn .f; x/ f .x/j 2!.f; ın;x /;

p
where ın;x D 2x.x rn .x/ and !.f; ı/ is the modulus of continuity defined as
!.f; ı/ D supjt xjıIx;t 2Œ0;1/ jf .t/ f .x/j:
Remark 5.5. For the Phillips operators Pn .f; x/ for each f 2 CB Œ0; 1/ and x 0,
we have
jPn .f; x/ f .x/j 2!.f; ˛n;x /;

q
where ˛n;x D 2x
n :
Now by Theorem 5.5 and Remark 5.5, one can easily observe that
2x
2x.x rn .x// ;
n
for all x 0. This implies that ın;x ˛n;x : Thus, by constructing the operators
in the form (5.7), one can say that the error estimation for the modified Phillips
operators (5.7) is better than the original Phillips operators defined by (5.6).
5.3 Szász–Mirakjan–Beta Operators
Gupta and Noor [119] proposed a sequence of mixed summation–integral-type

operators, the so-called Szász–Mirakjan–Beta operators, as
1
X Z 1
nx .nx/k t k1
Un .f; x/ D e f .t/dt C e nx f .0/; (5.8)
kŠB.n C 1; k/ 0 .1 C t/nCkC1
kD1
where f 2 C Œ0; 1/ such that jf .t/j M.1 C t/ for some M > 0; > 0:
Remark 5.6. From [119], we know that
nx 2 C 2x
Un .e0 ; x/ D 1; Un .e1 ; x/ D x; Un .e2 ; x/ D :
n1
Duman et al. [64] modified the operators (5.8) along the lines of King [172] and
observed that their modified operators have a better error estimation on the interval
Œ0; 2:
Let frn .x/g be a sequence of real-valued continuous functions defined on Œ0; 1/
with 0 rn .x/ < 1. Then the operator Un takes the form
1
X Z 1
nrn .x/ .nrn .x//k t k1
Un .f; rn .x//De f .t/dtCe nrn .x/ f .0/;
kŠB.nC1; k/ 0 .1Ct/nCkC1
kD1
where f 2 C Œ0; 1/. Duman et al. [64] replaced rn .x/ by rn .x/, defined as
1 p
rn .x/ D 1 C 1 C n.n 1/x 2 ; x 0; n 2 N:
n
Then they got the following positive linear operators:
X1 Z 1
.nrn .x//k t k1
Un .f; rn .x//De nrn .x/ f .t/dtCe nrn .x/ f .0/:
kŠB.nC1; k/ 0 .1Ct/nCkC1
kD1
(5.9)
The modified form of the operators reproduces the test function e0 and e2 :
Lemma 5.5. For every x 0 and 'x D t x, we have
1 p
Un .'x ; x/ D x C 1 C 1 C n.n 1/x 2
n
and
p !
1 1 C n.n 1/x 2
Un .'x2 ; x/ D 2x x C :
n n
Theorem 5.6 ([64]). For each f 2 CB Œ0; 1/ and x 0 and n > 1, we have
jUn .f; x/ f .x/j 2!.f; ın;x /;

p
where ın;x D 2x.x rn .x/ and !.f; ı/ is the modulus of continuity defined as
!.f; ı/ D supjt xjıIx;t 2Œ0;1/ jf .t/ f .x/j:
Remark 5.7. For the Szász–Mirakjan–Beta operators Un .f; x/ for each f 2
CB Œ0; 1/ and x 0, we have
jUn .f; x/ f .x/j 2!.f; ˛n;x /;

q
x.2Cx/
where ˛n;x D n1
:
5.4 Integrated Szász–Mirakjan Operators 149
According to Duman et al. [64], the error estimation in Theorem 5.6 is better than
that in Remark 5.7 provided f 2 CB Œ0; 1/ and x 2 Œ0; 2. Indeed, for 0 x 2;
2
we have x 2 =2 1. Also, since n 12 n.n 1/ D 14 , we have
" #
1 2
x 2
n n.n 1/ 1:
2
Thus,

1 1p 1 2n 1
C 1 C n.n 1/x 2 C x:
n n n 2n
Using the above inequality, one has
2Cx
x rn .x/
2n
or
x.2 C x/ x.2 C x/
2x.x rn .x// ;
n n1
for x 2 Œ0; 2 and n > 1: This guarantees that ın;x ˛n;x for x 2 Œ0; 2 and n > 1:
5.4 Integrated Szász–Mirakjan Operators
Another integral modification of Szász–Mirakjan operators was proposed in [63]

with a parameter c in the definition of [137] and for c > 0: They proposed the
modified operators as
1
X Z 1
Sn;c .f; x/ D sn;v .x/ bn;v;c .t/f .t/dt; x 2 Œ0; 1/; (5.10)
vD0 0
v . n CvC1/ .ct /v
where sn;v .x/ D e nx .nx/ ; bn;v;c .t/ D c .vC1/.
c
n n : In case c D 1;
vŠ / c .1Cct /. c CvC1/
the above operators reduce to the Szász–Beta operators [137]. These operators are
linear positive operators and reproduce only constant function. The approximation
properties of the operators Sn;c .f; x/ are different from the operators studied by
Duman et al. [64].
Remark 5.8. It can be easily verified that
.1 C nx/
Sn;c .e0 ; x/ D 1; Sn;c .e1 ; x/ D
nc
and
n2 x 2 C 4nx C 2
Sn;c .e2 ; x/ D :
.n c/.n 2c/
For n > c, set
.n c/x 1
rn .x/ D : (5.11)
n
Gupta and Deo [110] replaced x in the definition of Sn;c .f; x/ by rn .x/ with rn .x/ 2
Œ0; 1/ for any n 2 N. Then the modified operators take the form
1
X Z 1
Vn;c .f; x/ D sn;v .rn .x// bn;v;c .t/f .t/dt; (5.12)
vD0 0
where
.nrn .x//v
sn;v .rn .x// D e nrn .x/
vŠ
and x 2 Œ0; 1/ ; n 2 N: The operators Vn;c .f; x/ preserve the constant and linear
functions.
Lemma 5.6 ([110]). For x 2 Œ0; 1/ ; n 2 N, and with 'x D t x; we have
(i) Vn;c .'x I x/ D 0;
c.n c/x 2 C 2.n c/x 1
(ii) Vn;c .'x2 I x/ D :
.n c/.n 2c/
Theorem 5.7 ([110]). Let f 2 CB Œ0; 1/: Then for every x 2 Œ0; 1/ and for n >
2c; C > 0; we have
0 s 1
.n c/ 2 x 2 C 2.n c/x 1
jVn;c .f; x/ f .x/j C !2 @f; A:
.n c/.n 2c/
Theorem 5.8 ([110]). For every f 2 C Œ0; 1/, x 2 Œ0; 1/ ; and n 2 N, we have
jVn;c .f I x/ f .x/j 2!.f; ıx /;
where
s
c.n c/x 2 C 2.n c/x 1
ıx WD :
.n c/.n 2c/
5.5 Beta Operators of the Second Kind 151
Remark 5.9. For the operator Sn;c given by (5.10), we may write that, for every
f 2 C Œ0; 1/, x 2 Œ0; 1/, and n 2 N;
jSn;c .f I x/ f .x/j 2!.f; cx /; (5.13)
where
s
.4cx C 2c 2 x 2 C 2/ C nx.cx C 2/
cx WD :
.n c/.n 2c/
According to [110], the error estimation in Theorem 5.8 is better than that of
Remark 5.9 provided f 2 C Œ0; 1/ and x 2 Œ0; 1/: Indeed, in order to get this
better estimation, one must show that ıx cx : One can obtain
c.n c/x 2 C 2.n c/x 1

ıx cx ,
.n c/.n 2c/
.4cx C 2c 2 x 2 C 2/ C nx.cx C 2/

.n c/.n 2c/
, 3c 2 x 2 C 6cx C 3 0
, .cx C 1/2 0;
which holds. Thus, we have ıx cx ; showing that modified operators give a better
approximation than the original operators.
5.5 Beta Operators of the Second Kind
Stancu [223] introduced Beta operators Ln of the second kind in order to approxi-
mate the Lebesgue integrable functions on the interval .0; 1/ as
Z 1
1 t nx1
.Ln f /.x/ D f .t/dt: (5.14)
B.nx; n C 1/ 0 .1 C t/nxCnC1
Then Abel and Gupta in [5] obtained the rate of convergence via a decomposition
technique.
Lemma 5.7. For all ei .x/ D x i ; i 2 N [ f0g, n 2 N, x > 0, with n > i , we have
.Ln e0 /.x/ D 1, .Ln e1 /.x/ D e1 .x/, and .Ln e2 /.x/ D x 2 C x.1Cx/
n1
: Also, we have
the recurrence relation
nx C i
.Ln ei C1 /.x/ D .Ln ei /.x/; for all n > i:
ni
For a fixed x 2 .0; 1/, if we define the function 'x by 'x .t/ D t x; then
(i) .Ln 'x0 /.x/ D 1;
(ii) .Ln 'x1 /.x/ D 0;
(iii) .Ln 'x2 /.x/ D x.1Cx/
n1 :
The present section deals with the study of Stancu–Beta operators, which preserve
the constant as well as linear functions but not the quadratic ones. In 2011, Gupta
and Yadav [132] applied King’s approach to propose the modified form of these
operators, so that they preserve the quadratic functions, which results in a better
approximation for the modified operators in the compact interval .0; 1/ for these
operators.
Theorem 5.9 ([132]). For the Stancu–Beta operators, we can write that, for every
f 2 CB .0; 1/; x > 0, and n > 1;
j.Ln f /.x/ f .x/j 2!.f; ˛x /;

q
x.1Cx/
where ˛x D n1 :
Let rn .x/ be a sequence of real-valued continuous functions defined on .0; 1/ with

0 < rn .x/ < 1/ and defined by
p
1 C 1 C 4n.n 1/x 2
rn .x/ D :
2n
Then we can define the modified form of the operators (5.14) as
Z 1
1 t nrn .x/1
.Ln f /.x/ D f .t/dt: (5.15)
B.nrn .x/; n C 1/ 0 .1 C t/nrn .x/CnC1
Lemma 5.8. For each x > 0, we have

(i) .Ln 1/.x/ D 1; p
1C 1C4n.n1/x 2
(ii) .Ln t/.x/ D 2n ;
(iii) .Ln t 2 /.x/ D x 2 :
For a fixed x 2 .0; 1/, define the function 'x by 'x .t/ D t x: The first central
moments for the operators Ln are given by
(i) .Ln 'x0 /.x/ D 1; p
1C 1C4n.n1/x 2
(ii) .Ln 'x1 /.x/ D x C ;
p
2n
1C4n.n1/x 2
2
(iii) .Ln 'x /.x/ D 2x x C 1
2n
2n
:
Theorem 5.10 ([132]). For every f 2 CB .0; 1/, x > 0, and n > 1, we have
j.Ln f /.x/ f .x/j 2!.f; ıx /;

5.5 Beta Operators of the Second Kind 153
where

1 1 p
ıx D 2x x C 1 C 4n.n 1/x :
2
2n 2n
Remark 5.10 ([132]). In order to get a better estimation, we must show that ıx <
˛x for appropriate x’s. Indeed, for 0 < x < 1, we have x 2 < 1. Also, since

x 2 .2n 1/2 4n.n 1/ < 1;
or
1 C 4n.n 1/x 2 > .2n 1/2 x 2 ;
which gives
p
1 C 4n.n 1x 2 / > .2n 1/x;
we then obtain
1 1 p 1 2n 1
C 1 C 4n.n 1/x 2 > C x;
2n 2n 2n 2n
and thus we have x rn .x/ < 1Cx

2n ;
that is,
x.1 C x/ x.1 C x/
2x.x rn .x// < < ;
n n1
for x 2 .0; 1/ and n > 1: This guarantees that ıx < ˛x for x 2 .0; 1/ and n > 1,
which corrects our claim.
Chapter 6
Complex Operators in Compact Disks
If f W G ! C is an analytic function in the open set G C, with D1 G

(where D1 D fz 2 C W jzj < 1g), then S. N. Bernstein proved that the complex
Bernstein polynomials converge uniformly to f in D1 (see, e.g., Lorentz [182],
p. 88). The main contributions for the complex operators are due to S. G. Gal; in
fact, several important results have been compiled in his 2009 monograph [77].
Since that publication, several important results on Durrmeyer-type operators and
other extensions of the known operators have been discussed. In this chapter, we
present some of the important results on certain complex operators that were not
discussed in [77].
6.1 Complex Baskakov–Stancu Operators
In this section, we present a Stancu-type generalization of the complex Baskakov

operator studied in [82]. The Baskakov–Stancu operator of the real variable x 2
Œ0; 1/ is defined by
1
X
C˛
Sn˛;ˇ .f; x/ D pn; .x/f ;
D0
nCˇ
x
where pn; .x/ D nC1
.1Cx/nC
and ˛; ˇ are two given parameters satisfying
the conditions 0 ˛ ˇ: For ˛ D ˇ D 0, we recapture the classical Baskakov
operator.
Denoting
1
X
n.n C 1/ : : : :.n C 1/ ˛ ˛C1 ˛C
Vn˛;ˇ .f; x/ D ; ;:::; I f x ;
D0
.n C ˇ/ nCˇ nCˇ nCˇ

156 6 Complex Operators in Compact Disks
[where for j D 0, we take n.n C 1/ : : : .n C j 1/ D 1], according to the method

˛;ˇ ˛;ˇ
in the proof of Theorem 2 in Lupas [184], we have Sn .f; x/ D Vn .f; x/ for all
˛;ˇ
x 0 [under the hypothesis on f that Sn .f; x/ is well defined]. But if x is not
positive (e.g., if x D 1=2), then reasoning exactly as in the case ˛ D ˇ D 0 in
˛;ˇ ˛;ˇ
Gal [77], p. 124, it is easy to see that Sn .f; x/ and Vn .f; x/ do not necessarily
coincide.
Consequently, the corresponding complex versions (namely, replacing x 0 by
˛;ˇ ˛;ˇ
z 2 C), Sn .f; z/ and Vn .f; z/, do not necessarily represent the same operator.
In this section, we deal with the following complex form for the Baskakov–
Stancu operator:
1
X
n.n C 1/ : : : :.n C 1/ ˛ ˛C1 ˛C
Vn˛;ˇ .f; z/ D ; ;:::; I f z ;
D0
which, for ˛ D 0 D ˇ, was studied in Gal [77], pp. 124–134. Here

Œx0 ; x1 ; : : : ; xm I f denotes the divided difference of the function f on the distinct
points x0 ; x1 ; : : : ; xm .
Let H.DR / denote the class of the functions f W ŒR; C1/ [ DR ! C (where
DR D fz 2 C W jzj < Rg) with all its derivatives bounded in Œ0; 1/ by the
same constant, analytic in DR , satisfying an exponential growth condition, namely,
jf .z/j M e Ajzj for all z 2 DR .
Following exactly the steps in Remark 1, pp. 124–125 in Gal [77], Gal et al. [82]
˛;ˇ
found that for the functions f 2 H.DR /, the operator Vn .f; z/ is well defined for
all z 2 C.
The following lemmas are required to prove the main theorems of this section:
Lemma 6.1 ([82]). For all n; k 2 N [ f0g; 0 ˛ ˇ, z 2 C, let us define
1
X
n.n C 1/ : : : :.n C 1/ ˛ ˛C1 ˛C
Vn˛;ˇ .ek ; z/ D ; ;:::; I ek z ;
D0
˛;ˇ
where ek .z/ D zk . Then Vn .e0 ; z/ D 1, and we have the following recurrence
relation:
z.1 C z/ ˛;ˇ nz C ˛ ˛;ˇ

Vn˛;ˇ .ekC1 ; z/ D .Vn .ek ; z//0 C V .ek ; z/: (6.1)
nCˇ nCˇ n
Consequently,
nz C ˛ n.n C 1/z2 nz.1 C 2˛/ ˛2

Vn˛;ˇ .e1 ; z/ D ; Vn˛;ˇ .e2 ; z/ D C C :
nCˇ .n C ˇ/2 .n C ˇ/2 .n C ˇ/2
Lemma 6.2 ([82]). Let ˛; ˇ satisfy 0 ˛ ˇ. Denoting ej .z/ D zj and Vn0;0 .ej /
by Vn .ej /, for all n; k 2 N [ f0g; 0 ˛ ˇ, we have the following recursive
6.1 Complex Baskakov–Stancu Operators 157
˛;ˇ
relation for the images of the monomials ek under Vn in terms of Vn .ej /; j D
0; 1; 2 : : : ; k:
!
X k
k nj ˛ kj
Vn˛;ˇ .ek ; z/ D Vn .ej ; z/:
j D0
j .n C ˇ/k
Lemma 6.3 ([82]). For all n; k 2 N [ f0g; 0 ˛ ˇ and jzj r; r 1, we have
jVn˛;ˇ .ek ; z/j .k C 1/Š r k :
Theorem 6.1 ([82] Upper estimate). For n0 2 N and R > 0 with 3 n0 <
2R < C1, let f W ŒR; C1/ ! C and all its derivatives be bounded P in Œ0; 1/
by the same positive constant, analytic in DR ;, that is, f .z/ D 1 k
kD0 ck z , for all
z 2 DR ;. Additionally, suppose that there exist M > 0 and A 2 . R ; 1/, with the
1
k
property that jck j M AkŠ ; for all k D 0; 1; : : :.
Suppose that 0 ˛ ˇ and 1 r < minf n20 ; A1 g. Then, for all jzj r and
n > n0 , we have
1
˛ C ˇr X Ar .f / ˛Br .f / ˇCr .f /
jVn˛;ˇ .f; z/ f .z/j jck jr k1 C C C ;
nCˇ nCˇ nCˇ nCˇ
kD1
P1 P1
where jck jr k1 < C1, Br .f / D
kD1 P kD1 jck jkr
k1
< C1, and
1
Cr .f / D jck jkr k
< C1 follow from the analyticity of f and
P1 kD1 k
Ar .f / D kD1 jck j.1 C r/k .k C 1/Šr k1
< C1 follows from jck j M AkŠ .
Proof. By using the recurrence (6.1) in Lemma 6.1, we get
z.1 C z/ ˛;ˇ nz C ˛ ˛;ˇ

Vn˛;ˇ .ek ; z/ zk D .Vn .ek1 ; z//0 C V .ek1 ; z/ zk1
nCˇ nCˇ n
nz C ˛ k1
C z zk
nCˇ
and
jzj.1Cjzj/ njzjC˛ ˇˇ ˛;ˇ ˇ

jVn˛;ˇ .ek ; z/zk j j.Vn˛;ˇ .ek1 ; z//0 jC Vn .ek1 ; z/zk1 ˇ
nCˇ nCˇ
˛ ˇ
C jzjk1 C jzjk :
nCˇ nCˇ
˛;ˇ
Clearly, Vn .e0 ; z/ e0 D 0, and
ˇ ˇ ˇ ˇ
ˇ nz C ˇ ˇ ˇ ˛ ˇz ˇ ˛ C ˇr
jVn˛;ˇ .e1 ; z/ ˇ
e1 .z/j D ˇ ˇ ˇ
zˇ D ˇ ˇ :
nCˇ nCˇ ˇ nCˇ
˛;ˇ
Using Lemma 6.3 and Bernstein’s inequality for the polynomial Vn .ek1 ; z/ of
degree k 1, we have
k1
j.Vn˛;ˇ .ek1 ; z//0 j maxfjVn˛;ˇ .ek1 ; z/j W jzj rg
r
k1
kŠ r k1 .k C 1/Š r k2 :
r
Therefore, it follows that
jVn˛;ˇ .ek ; z/ zk j
r.1 C r/ nr C ˛ ˇˇ ˛;ˇ ˇ
.k C 1/Š r k2 C Vn .ek1 ; z/ zk1 ˇ
nCˇ nCˇ
˛ ˇ
C r k1 C rk
nCˇ nCˇ
ˇ ˇ r.1Cr/ ˛ k1 ˇ k
r ˇVn˛;ˇ .ek1 ; z/zk1 ˇ C .kC1/Š r k2 C r C r :
nCˇ nCˇ nCˇ
Taking k D 2 above, we obtain
˛ C ˇr r.r C 1/ ˛ ˇ
jVn˛;ˇ .e2 ; z/ e2 .z/j r C .2 C 1/Šr 0 C r1 C r 2:
nCˇ nCˇ nCˇ nCˇ
Then, for k D 3, it follows that
˛ C ˇr r.r C 1/ ˛ ˇ
jVn˛;ˇ .e3 ; z/ e3 .z/j r 2 C .2 C 1/Šr 1 C r2 C r3
nCˇ nCˇ nCˇ nCˇ
r.r C 1/ ˛ ˇ
C .3 C 1/Šr 1 C r2 C r3
nCˇ nCˇ nCˇ
˛Cˇr r.rC1/ 2˛ 2
D r2 C Œ.2C1/ŠC.3C1/Šr 1 C r
nCˇ nCˇ nCˇ
2ˇ 3
C r :
nCˇ
Reasoning by recurrence, for any k 2, we finally get

2 3
˛ C ˇr r.r C 1/ X k
jVn˛;ˇ .ek ; z/ ek .z/j r k1 C 4 .j C 1/Š5 r k2
nCˇ nCˇ j D2
.k 1/˛ k1 .k 1/ˇ k

C r C r
nCˇ nCˇ
˛ C ˇr r.1 C r/
r k1 C k .k C 1/Š r k2
nCˇ nCˇ
k˛ k1 kˇ k
C r C r :
nCˇ nCˇ
Clearly, this inequality is valid for k D 1, too.

Now, reasoning exactly as in the case of complex Baskakov operators in
Remark 1 in Gal [77], pp. 128–130, we can write (note that here all the hypotheses
on n0 and r are involved in the statement)
1
X
Vn˛;ˇ .f; z/ D ck Vn˛;ˇ .ek ; z/;
kD0
which implies
1
X
jVn˛;ˇ .f; z/ f .z/j jck j jVn˛;ˇ .ek ; z/ zk j
kD1
1 1
˛ C ˇr X X r.1 C r/
jck j r k1 C jck j k .k C 1/Š r k2
nCˇ nCˇ
kD1 kD1
1
X 1
˛ ˇ X
C jck jkr k1 C jck jkr k
nCˇ nCˇ
kD1 kD1
1
X
˛ C ˇr Ar .f / ˛Br .f / ˇCr .f /
D jck j r k1 C C C :
nCˇ nCˇ nCˇ nCˇ
kD1
P
Note here that by the analyticity of f , we clearly get 1
kD1 jck jr
k1
< C1,
k
Br .f / < C1, and Cr .f / < C1, while using the hypothesis jck j M AkŠ , we
easily get
1
X 1
X
Ar .f / D .1Cr/ jck jk .k C1/Šr k2 M.1Cr/ k.k C1/.rA/k < C1;
kD1 kD1
since rA < 1. This proves the theorem.

Theorem 6.2 ([82] Voronovskaja-type asymptotic formula). Let 0 ˛ ˇ.

Suppose that the hypothesis on the function f and that on the constants n0 ; R; M; A
in the statement of Theorem 6.1 hold, and let 1 r < minf n20 ; A1 g be fixed. For all
n > n0 ; jzj r, we have the following Voronovskaja-type result:
ˇ ˇ P6
ˇ ˛;ˇ ˇ M .f /
ˇV .f; z/f .z/ ˛ˇz f 0 .z/ z.1Cz/ f 00 .z/ˇ M1;r .f / C j D2 j;r ;
ˇ n nCˇ 2n ˇ n 2 .nCˇ/2
k
where, from jck j M AkŠ , we get
1
X
M1;r .f / D 16 jck j.k 1/.k 2/2 kŠr k < C1; M2;r .f /
kD0
1
X .k 1/kŠ k2
D ˛2 jck j r < C1;
2
kD2
1
X
M3;r .f / D 2˛ jck jk 2 kŠr k1 < C1; M4;r .f /
kD0
X
1
ˇ2
D C 2ˇ jck jk 2 .k C 1/Šr k < C1;
2
kD0
1
X
M5;r .f / D ˛ˇ jck jk.k 1/r k1 < C1; M6;r .f /
kD0
1
X
D ˇ2 jck jk.k 1/r k < C1:
kD0
Proof. For all z 2 DR , let us consider
˛ ˇz 0 z.1 C z/ 00
Vn˛;ˇ .f; z/ f .z/ f .z/ f .z/
nCˇ 2n
z.1 C z/ 00 ˛ ˇz 0
D Vn .f; z/ f .z/ f .z/ C Vn˛;ˇ .f; z/ Vn .f; z/ f .z/:
2n nCˇ
P1
Taking f .z/ D k
kD0 ck z , we get
˛ ˇz 0 z.1 C z/ 00
Vn˛;ˇ .f; z/ f .z/ f .z/ f .z/
nCˇ 2n
1
X
z.1 C z/
D ck Vn .ek ; z/ z
k
k.k 1/zk2
2n
kD2
1
X
˛ ˇz k1
C ck Vn˛;ˇ .ek ; z/ Vn .ek ; z/ kz :
nCˇ
kD2
To estimate the first sum, we use the Voronovskaja-type result for the Baskakov
operators obtained in [77], Theorem 1.9.3, p. 130:
ˇ ˇ 1
X
ˇ ˇ
ˇVn .f; z/ f .z/ z.1 C z/ f 00 .z/ˇ 16 jck j.k 1/.k 2/2 kŠr k :
ˇ 2n ˇ n2
kD0
Next, to estimate the second sum, by using Lemma 6.2, we obtain
˛ ˇz k1
Vn˛;ˇ .ek ; z/ Vn .ek ; z/ kz
nCˇ
!
X
k1
k nj ˛ kj nk ˛ ˇz k1
D V .e
k n j
; z/ C 1 Vn .ek ; z/ kz
j D0
j .n C ˇ/ .n C ˇ/ k nCˇ
!
X
k2
k nj ˛ kj k nk1 ˛
D Vn .ej ; z/ C Vn .ek1 ; z/
j D0
j .n C ˇ/ k .n C ˇ/k
!
X
k1
k nj ˇ kj ˛ ˇz k1
V .e ; z/
k n k
kz
j D0
j .n C ˇ/ nCˇ
!
X
k2
k nj ˛ kj k nk1 ˛
D V n .e j ; z/ C ŒVn .ek1 ; z/ zk1
j D0
j .n C ˇ/ k .n C ˇ/ k
!
X
k2
k nj ˇ kj
Vn .ek ; z/
j D0
j .n C ˇ/k

k nk1 ˇ nk1 k˛ k1
ŒVn .ek ; z/ z C
k
1 z
.n C ˇ/ k .n C ˇ/ k1 nCˇ

nk1 kˇ k
C 1 z :
.n C ˇ/ k1 nCˇ
Now, if we use the inequalities
X k
nk n kˇ
1 k
1 D ;
.nCˇ/ j D1
nCˇ nCˇ
! !
X
k2
k2 nj ˛ k2j X k2
k2
nj ˛ k2j
D
j D0
j .nCˇ/k2 j D0 j .nCˇ/j .n C ˇ/k2j
k2
nC˛
D 1;
nCˇ
jVn .ej ; z/j r j .j C 1/Š (see Lemma 6.3 for ˛ D ˇ D 0/;
r.1 C r/k.k C 1/Š 2r k k.k C 1/Š
jVn .ek ; z/ zk j
n n
(for this last inequality, take ˛ D ˇ D 0 in the proof of Theorem 6.1)
and
ˇ ! ˇ !
ˇ k2 ˇ k2
ˇX k nj ˛ kj ˇ X k nj ˛ kj
ˇ ˇ
V .e ; z/ˇ jVn .ej ; z/j
ˇ k n j
ˇj D0 j .n C ˇ/ ˇ j D0 j .n C ˇ/
k
!
X
k2
k.k 1/ k 2 nj ˛ kj
D jVn .ej ; z/j
j D0
.k j /.k j 1/ j .n C ˇ/k
!
k.k 1/ ˛2 X
k2
k2 nj ˛ k2j
.k 1/Šr k2
2 .n C ˇ/ 2
j D0
j .n C ˇ/. k 2/
k.k 1/ ˛2
.k 1/Šr k2 ;
2 .n C ˇ/2
it follows that
ˇ ˇ
ˇ ˛;ˇ ˇ
ˇV .ek ; z/ Vn .ek ; z/ ˛ ˇz kzk1 ˇ
ˇ n nCˇ ˇ
ˇ ! ˇ
ˇX ˇ
ˇ k2 k nj ˛ kj ˇ k1
ˇˇ V .e ; z/ ˇ C k n ˛ jVn .ek1 ; z/ zk1 j
n j ˇ .n C ˇ/k
ˇj D0 j .n C ˇ/
k
ˇ
ˇ ! ˇ
ˇX ˇ
ˇ k2 k nj ˇ kj ˇ k1
Cˇ ˇ V .e ; z/ ˇ C k n ˇ jVn .ek ; z/ zk j
n k ˇ
ˇj D0 j .n C ˇ/ ˇ .n C ˇ/
k k
ˇ ˇ ˇ ˇ
ˇ nk1 ˇ k˛ ˇ nk1 ˇ kˇ
C ˇˇ 1 ˇ
ˇ jzj k1
C ˇ 1
ˇ
ˇ
ˇ n C ˇ jzj
k
.n C ˇ/ k1 nCˇ .n C ˇ/ k1
.k 1/kŠ˛ 2 k2 k nk1 ˛ 2r k1 .k 1/kŠ

r C
2.n C ˇ/2 .n C ˇ/k n
!
X
k2
k nj ˇ kj k nk1 ˇ 2r k k.k C 1/Š
Cr k .k C 1/Š C
j D0
j .n C ˇ/k .n C ˇ/k n
k.k 1/˛ˇ k1 k.k 1/ˇ 2 k

C r C r ;
.n C ˇ/2 .n C ˇ/2
.k 1/kŠ˛ 2 k2 2˛k 2 kŠ k1 ˇ 2 k 2 .k C 1/Š k 2k 2 .k C 1/Šˇ k
r C r C r C r
2.n C ˇ/2 .n C ˇ/2 2.n C ˇ/2 .n C ˇ/2
k.k 1/˛ˇ k1 k.k 1/ˇ 2 k
C r C r
.n C ˇ/2 .n C ˇ/2

.k 1/kŠ˛ 2 k2 2˛k 2 kŠ k1 k 2 .k C 1/Š ˇ2
r C r C C 2ˇ r k
2.n C ˇ/2 .n C ˇ/2 .n C ˇ/2 2
k.k 1/˛ˇ k1 k.k 1/ˇ 2 k
C r C r ;
.n C ˇ/2 .n C ˇ/2
which immediately proves the theorem.

Theorem 6.3 ([82] Exact order of approximation). Suppose that the hypothesis
on the function f and that on the constants n0 ; R; M; A in the statement of
Theorem 6.1 hold, and let 1 r < minf n20 ; A1 g be fixed. Let 0 ˛ ˇ, and
suppose that f is not a polynomial of degree 0. Then, for all n > n0 and jzj r,
we have
Cr .f /
jVn˛;ˇ .f; z/ f .z/j ;
n
where the constant Cr .f / depends only on f , ˛, ˇ, and r.

Proof. For all jzj r and n 2 N, we can write

1 n z.1 C z/ 00
Vn˛;ˇ .f; z/ f .z/ D .˛ ˇz/f 0 .z/ C f .z/
n nCˇ 2

1 ˛ˇz 0 z.1Cz/ 00
C n2 Vn˛;ˇ .f; z/f .z/ f .z/ f .z/
n nCˇ 2n

1 z.1 C z/ 00
D .˛ ˇz/f 0 .z/ C f .z/
n 2

1 2 ˛ˇz 0
C n Vn˛;ˇ .f /.z/f .z/ f .z/
n nCˇ

z.1 C z/ 00 ˇ.˛ ˇz/f 0 .z/
f .z/ :
2n n.n C ˇ/
Applying the inequality
kF C Gk j kF k kGk j kF k kGk;
we obtain

1
.˛ ˇe1 /f 0 C e1 .1 C e1 / f 00
kVn˛;ˇ .f / f kr
n 2 r

1 2 ˛ ˇe1 e1 .1 C e1 / 00 ˇ.˛ ˇe1 /f 0 :
n Vn .f / f
˛;ˇ
f
n nCˇ 2n n.n C ˇ/ r

00
Since f is not a polynomial of degree 0 in DR ; we get .˛ˇe1 /f 0 C e1 .1Ce
2
1/
f
r
> 0. Indeed, supposing the contrary gives us
z.1 C z/ 00
.˛ ˇz/f 0 .z/ C f .z/ D 0; for all z 2 Dr :
2
P
Denoting y.z/ D f 0 .z/, seeking y.z/ in the form y.z/ D 1 k
kD0 bk z , and replacing
in the above differential equation, we easily get bk D 0 for all k D 0; 1; : : : (we can
make similar reasonings here with those in Gal [77], pp. 75–76). Thus, we get that
f .z/ is a constant function, which is contradiction.
Now, since by Theorem 6.2 it follows that

2 ˛;ˇ ˛ ˇe1 0 e1 .1 C e1 / 00 ˇ.˛ ˇe1 /f 0
n Vn .f / f f f
nCˇ 2n n.n C ˇ/ r

2 ˛;ˇ ˛ ˇe1 0 e1 .1 C e1 / 00
n Vn .f / f f f C kˇ.˛ ˇe1 /f kr
0
nCˇ 2n r
X
6
Mj;r .f / C ˇ.˛ C ˇr/kf 0 kr ;
j D1
there is an n1 > n0 (depending on f and r only) such that for all n n1 ; we have

.˛ ˇe1 /f 0 C e1 .1 C e1 / f 00
2
r

1 2 ˛;ˇ ˛ ˇe1 0 e1 .1 C e1 / 00 ˇ.˛ ˇe1 /f 0
n Vn .f / f f f

1 e1 .1 C e1 / 00
.˛ ˇe /f 0
C f ;
2
1
2 r
which implies that

1
e1 .1 C e1 / 00
kVn˛;ˇ .f / f kr 0
.˛ ˇe1 /f C f
2n 2
r
for all n n1 .
˛;ˇ
For n 2 fn0 C 1; : : : :; n1 g, we get kVn .f / f kr n1 Ar .f / with Ar .f / D
˛;ˇ ˛;ˇ
n kVn .f /f kr > 0; which implies that kVn .f /f kr Cr n.f / for all n n0 ;
with

1 e1 .1 C e1 / 00
Cr .f / D min Ar;n0 C1 .f /; : : : :; Ar;n1 .f /; .˛ ˇe /f 0
C f ;
2
1
2 r
which proves the theorem.

Theorem 6.4 ([82] Simultaneous approximation). Suppose that the hypotheses
on the function f and on the constants n0 ; R; M; A in the statement of Theorem 6.1
hold, and let 1 r < minf n20 ; A1 g and p 2 N be fixed. Let 0 ˛ ˇ, and suppose
that f is not a polynomial of degree p 1. Then, for all n > n0 and jzj r, we
have
1
kŒVn˛;ˇ .f /.p/ f .p/ kr
;
n
where the constants Cr .f / in the equivalence depend only on f , p, and r.

Proof. Denote by the circle or radius r1 with r < r1 < minfn0 =2; 1=Ag, and
center 0. Since for jzj r and v 2 , we have jv zj r1 r, by Cauchy’s
formula, for all jzj r and n > n0 , we obtain
ˇZ ˇ
ˇ V ˛;ˇ .f; v/ f .v/ ˇ
pŠ ˇ n ˇ
jŒVn˛;ˇ .f; z/.p/ f .p/
.z/j D ˇ dv ˇ
2 ˇ .v z/pC1 ˇ
Cr;r1 ;˛;ˇ pŠ 2 r1
;
n 2 .r1 r/pC1
which proves one of the inequalities in the equivalence.

To prove the converse inequality in the equivalence, we start from the relationship
˛;ˇ
for Vn .f; v/ f .v/ (in the proof of Theorem 6.3, with v instead of z there),
replaced in Cauchy’s formula
Z ˛;ˇ
pŠ Vn .f; v/ f .v/
ŒVn˛;ˇ .f; z/.p/ f .p/ .z/ D dv:
2 i .v z/pC1
By standard reasonings such as those for the case of a classical complex Baskakov
operator (see the proof of Theorem 1.9.6, p. 134 [77]), combined with those for
the Bernstein–Stancu polynomials (see Gal [77], pp. 76–78, the proof of Theorem
1.6.5), the present proof finally reduces to the proof of the fact that kŒ.˛ˇz/f 0 .z/C
z.1Cz/ 00
2 f .z/ kr > 0. But this can be shown by precisely following the steps in Gal
.p/
[77], pp. 77–78 [where it is proved that kŒ.˛ ˇz/f 0 .z/ C z.1z/ 2
f 00 .z/.p/ kr > 0].
Because the methods are standard, we omit the details here.
6.2 Complex Favard–Szász–Mirakjan–Stancu Operators
The Favard–Szász–Mirakjan operators are important and have been studied inten-
sively in connection with different branches of analysis, such as numerical analysis,
approximation theory, and statistics. For a real function f of real variable f W
Œ0; 1/ ! R, the Favard–Szász–Mirakjan operators are defined as follows:
1
X .nz/
Sn .f; x/ D e nx f ; x 2 Œ0; 1/;
D0
Š n
where the convergence of Sn .f; x/ ! f .x/ under the exponential growth condition
on f , that is, jf .x/j C e Bx for all x 2 Œ0; C1/, with C; B > 0, was established
in [66]. The actual construction of the Szász–Mirakyan operators and its various
modifications require estimations of infinite series, which, in a certain sense, restrict
their usefulness from the computational point of view. We deal with the following
complex form for the Favard–Szász–Mirakjan–Stancu operators studied in [130],
which are defined as
1
X
˛ ˛C1 ˛C
Sn˛;ˇ .f; z/ D ; ;:::; I f z ;
D0
nCˇ nCˇ nCˇ
which, for ˛ D 0 D ˇ, was studied in [77]. Here, Œx0 ; x1 ; : : : ; xm I f denotes the

divided difference of the function f on the knots x0 ; x1 ; : : : ; xm . Such a formula was
first established by Lupas [184] for the special case ˛ D ˇ D 0 and for functions
of real variables. This formula holds for a complex setting too, since only algebraic
calculations were used in [184]. To prove the main theorems, we need the following
lemmas:
Lemma 6.4 ([130]). For all n; k 2 N [ f0g; 0 ˛ ˇ, z 2 C, let us define
1
X
˛ ˛C1 ˛C
Sn˛;ˇ .ek ; z/ D ; ;:::; I ek z ;
D0
nCˇ nCˇ nCˇ
˛;ˇ
where ek .z/ D zk . Then Sn .e0 ; z/ D 1, and we have the following recurrence
relation:
z nz C ˛ ˛;ˇ
Sn˛;ˇ .ekC1 ; z/ D .S ˛;ˇ .ek ; z//0 C S .ek ; z/: (6.2)
nCˇ n nCˇ n
Consequently,
nz C ˛ n2 z2 nz.1 C 2˛/ ˛2
Sn˛;ˇ .e1 ; z/ D ; Sn˛;ˇ .e2 ; z/ D C C :
nCˇ .n C ˇ/2 .n C ˇ/2 .n C ˇ/2
6.2 Complex Favard–Szász–Mirakjan–Stancu Operators 167
Lemma 6.5 ([130]). Let ˛; ˇ satisfy 0 ˛ ˇ. Denoting ej .z/ D zj and

Sn0;0 .ej / by Sn .ej / for all n; k 2 N[f0g, we have the following recursive relation for
˛;ˇ
the images of the monomials ek under Sn in terms of Sn .ej /; j D 0; 1; 2 : : : ; k:
!
X k
k nj ˛ kj
Sn˛;ˇ .ek ; z/ D Sn .ej ; z/:
j D0
j .n C ˇ/k
Lemma 6.6 ([130]). For all n; k 2 N [ f0g; 0 ˛ ˇ and jzj r; r 1, we

have
jSn˛;ˇ .ek ; z/j .2r/k :
The main results discussed in [130] follow.

Theorem 6.5 ([130] Upper estimate). For 2 < R < C1, let f W ŒR; P C1/ [
DR ! C be bounded on Œ0; C1/ and analytic in DR ; that is, f .z/ D 1 k
kD0 ck z ,
for all z 2 DR .
(a) Suppose that 0 ˛ ˇ and 1 r < R
2 are arbitrarily fixed. Then, for all
jzj r and n 2 N, we have
1
˛ C ˇr X Ar .f / ˛Br .f / ˇCr .f /
jSn˛;ˇ .f; z/ f .z/j jck jr k1 C C C ;
nCˇ nCˇ nCˇ nCˇ
kD1
P1 P
where kD1 jck jr < C1, Br .f / D 1
k1
jc jkr k1 < C1, Cr .f / D
P1 P1 kD1 k
kD1 jck jkr < C1 and Ar .f / D 2 kD1 jck j.k 1/.2r/ < C1.
k k1
(b) Suppose that 0 ˛ ˇ and 1 r < r1 < 2 . Then for all jzj r and n 2 N,
R
we have
pŠr1 Mr1 .f /
jŒSn˛;ˇ .f; z/.p/ f .p/ .z/j ;
.r1 r/ pC1 nCˇ
P1
where Mr1 .f / D .˛ C ˇr1 / kD1 jck j r1k1 C Ar1 .f / C Br1 .f / C Cr1 .f /.
Proof. (a) Using the recurrence (6.2) in Lemma 6.4, we get
z nz C ˛ ˛;ˇ
Sn˛;ˇ .ek ; z/ zk D .Sn˛;ˇ .ek1 ; z//0 C Sn .ek1 ; z/ zk1
nCˇ nCˇ
nz C ˛ k1
C z zk
nCˇ
and
jzj njzj C ˛ ˇˇ ˛;ˇ ˇ

jSn˛;ˇ .ek ; z/ zk j j.S ˛;ˇ .ek1 ; z//0 j C Sn .ek1 ; z/ zk1 ˇ
nCˇ n nCˇ
˛ ˇ
C jzjk1 C jzjk :
nCˇ nCˇ
˛;ˇ
Clearly, Sn .e0 ; z/ e0 D 0 and
ˇ ˇ ˇ ˇ
ˇ nz C ˇ ˇ ˇ ˛ ˇz ˇ ˛ C ˇr
ˇ
jSn .e1 ; z/ e1 .z/j D ˇ
˛;ˇ ˇ ˇ
zˇ D ˇ ˇ :
nCˇ nCˇ ˇ nCˇ
˛;ˇ
Using Lemma 6.6 and Bernstein’s inequality for the polynomial Sn .ek1 ; z/
of degree k 1, we have
k1
j.Sn˛;ˇ .ek1 ; z//0 j maxfjSn˛;ˇ .ek1 ; z/j W jzj rg
r
k1
.2r/k1 D 2.k 1/.2r/k2 :
r
Therefore, it follows that
jSn˛;ˇ .ek ; z/ zk j
k1 nr C ˛ ˇˇ ˛;ˇ ˇ ˛ ˇ
.2r/k1 C Sn .ek1 ; z/ zk1 ˇ C r k1 C rk
nCˇ nCˇ nCˇ nCˇ
ˇ ˇ k ˛ ˇ
r ˇSn˛;ˇ .ek1 ; z/ zk1 ˇ C .2r/k1 C r k1 C rk:
nCˇ nCˇ nCˇ
Setting k D 2 in the preceding equation, we obtain
˛ C ˇr 1 ˛ ˇ
jSn˛;ˇ .e2 ; z/ e2 .z/j r C .2r/ C r1 C r 2:
nCˇ nCˇ nCˇ nCˇ
Then, for k D 3, it follows that
˛ C ˇr 1 21 2 ˛ ˇ
jSn˛;ˇ .e3 ; z/ e3 .z/j r 2 C r C r2 C r3
nCˇ nCˇ nCˇ nCˇ
2 22 2 ˛ ˇ
C r C r2 C r3
nCˇ nCˇ nCˇ
˛ C ˇr 1
D r2 C Œ.1 21 / C .2 22 /r 2
nCˇ nCˇ
2˛ 2 2ˇ 3
C r C r :
nCˇ nCˇ
Reasoning by recurrence for any k 2, we finally get

2 3
˛ C ˇr 1 X
k1
jSn˛;ˇ .ek ; z/ ek .z/j r k1 C 4 j 2j 5 r k1
nCˇ nCˇ j D1
.k 1/˛ k1 .k 1/ˇ k

C r C r
nCˇ nCˇ
˛ C ˇr 2.k 1/
r k1 C .2r/k1
nCˇ nCˇ
k˛ k1 kˇ k
C r C r :
nCˇ nCˇ
P
Since the formula jk1 D1 j 2
j
D .k 2/2k C 2 can easily be proved by
mathematical induction, this inequality is clearly valid for k D 1 too.
Now, reasoning exactly as in the case of complex Favard–Szász–Mirakjan
operators in Remark 2 in [77], we can write
1
X
Sn˛;ˇ .f; z/ D ck Sn˛;ˇ .ek ; z/;
kD0
which implies
1
X
jSn˛;ˇ .f; z/ f .z/j jck j jSn˛;ˇ .ek ; z/ zk j
kD1
1 1
˛ C ˇr X 2 X
jck j r k1 C jck j.k 1/ .2r/k1
nCˇ nCˇ
kD1 kD1
1
X 1
˛ ˇ X
C jck jkr k1 C jck jkr k
nCˇ nCˇ
kD1 kD1
1
X
˛ C ˇr Ar .f / ˛Br .f / ˇCr .f /
D jck j r k1 C C C :
nCˇ nCˇ nCˇ nCˇ
kD1
P
Note here that by the analyticity of f , we clearly get 1 kD1 jck jr
k1
< C1,
P1
Br .f / < C1, Cr .f / < C1, and Ar .f / D 2 kD1 jck j .k 1/ .2r/k1 <
C1; which proves (a).
(b) Denote by the circle of radius r1 > r with center 0. For any jzj r and v 2 ;
we have jv zj r1 r. By Cauchy’s formula for all jzj r, it follows that
ˇZ ˇ
ˇ S ˛;ˇ .f; z/ f .z/ ˇ
pŠ ˇ n ˇ
jŒSn˛;ˇ .f; z/.p/ f .p/
.z/j D ˇ ˇ
2 ˇ .v z/pC1 ˇ
" 1
#
pŠr1 ˛ C ˇr1 X A r .f / ˛Br .f / ˇC r .f /
jck j r1k1 C 1 C 1
C 1
;
.r1 r/pC1 nCˇ nCˇ nCˇ nCˇ
kD1
which proves (b) and the theorem.

Theorem 6.6 ([130] Asymptotic formula). For 2 < R < C1, let f W
ŒR; C1/P[ DR ! C be bounded on Œ0; C1/ and analytic in DR ; that is,
f .z/ D 1 kD0 ck z , for all z 2 DR . Also, let 1 r < 2 and 0 ˛ ˇ: Then, for
k R
all jzj r and n 2 N, we have the following Voronovskaja-type result:

ˇ ˇ P6
ˇ ˛;ˇ ˇ
ˇS .f; z/ f .z/ ˛ ˇz f 0 .z/ z f 00 .z/ˇ M1;r .f / C j D2 j;r
M .f /
ˇ n ˇ ;
nCˇ 2n n2 .n C ˇ/2
where
1
X
M1;r .f / D 26 jck j.k 1/2 .k 2/.2r/k2 < C1;
kD3
X1
˛2
M2;r .f / D C 2˛ jck j k.k 1/.2r/k2 < C1;
2
kD2
1
2 X
ˇ
M3;r .f / D jck jk.k 1/.2r/k < C1;
2
kD2
1
X
M4;r .f / D ˇ jck jk.k 1/.2r/k1 < C1;
kD2
1
X
M5;r .f / D ˛ˇ jck jk.k 1/r k1 < C1;
kD0
1
X
M6;r .f / D ˇ 2 jck jk.k 1/r k < C1:
kD0
Proof. For all z 2 DR , let us consider
˛ ˇz 0 z 00
Sn˛;ˇ .f; z/ f .z/ f .z/ f .z/
nCˇ 2n
z 00 ˛ ˇz 0
D Sn .f; z/ f .z/ f .z/ C Sn˛;ˇ .f; z/ Sn .f; z/ f .z/:
2n nCˇ
P1
Taking f .z/ D k
kD0 ck z , we get
˛ ˇz 0 z 00
Sn˛;ˇ .f; z/ f .z/ f .z/ f .z/
nCˇ 2n
1
X z
D ck Sn .ek ; z/ zk k.k 1/zk2
2n
kD2
1
X
˛ ˇz k1
C ck Sn˛;ˇ .ek ; z/ Sn .ek ; z/ kz :
nCˇ
kD2
To estimate the first sum, we use the Voronovskaja-type result for the Favard–Szász–
Mirakjan operators obtained in [77], Theorem 1.8.5:
ˇ z 00 ˇˇ 26 X
1
ˇ
ˇSn .f; z/ f .z/ f .z/ˇ 2 jck j.k 1/2 .k 2/.2r/k2 :
2n n
kD3
Next, to estimate the second sum, using Lemma 6.5, we obtain
˛ ˇz k1
Sn˛;ˇ .ek ; z/ Sn .ek ; z/ kz
nCˇ
!
X
k1
k nj ˛ kj nk ˛ ˇz k1
D Sn .ej ; z/ C 1 Sn .ek ; z/ kz
j D0
j .n C ˇ/ k .n C ˇ/ k nCˇ
!
X
k2
k nj ˛ kj k nk1 ˛
D S n .e j ; z/ C Sn .ek1 ; z/
j D0
j .n C ˇ/k .n C ˇ/k
!
X
k1
k nj ˇ kj ˛ ˇz k1
Sn .ek ; z/ kz
j D0
j .n C ˇ/ k nCˇ
!
X
k2
k nj ˛ kj k nk1 ˛
D S n .e j ; z/ C ŒSn .ek1 ; z/ zk1
j D0
!
X
k2
k nj ˇ kj k nk1 ˇ
S n .e k ; z/ ŒSn .ek ; z/ zk
j D0

nk1 k˛ k1 nk1 kˇ k
C 1 z C 1 z :
.n C ˇ/k1 nCˇ .n C ˇ/k1 n C ˇ
Now, using the inequalities
k
X
nk n kˇ
1 1 D ;
.n C ˇ/ k
j D1
nCˇ nCˇ
! !
X
k2
k 2 nj ˛ k2j X
k2
k2 nj ˛ k2j
D
j D0
j .n C ˇ/ k2
j D0
j .n C ˇ/ .n C ˇ/k2j
j
k2
nC˛
D 1;
nCˇ
jSn .ej ; z/j .2r/k (see [77] for ˛ D ˇ D 0/;
k1
jSn .ek ; z/ zk j .2r/k1 ;
n
(for this last inequality, take ˛ D ˇ D 0 in the proof of Theorem 6.5)
and
ˇ ! ˇ
ˇ k2 ˇ
ˇX k nj ˛ kj ˇ
ˇ S .e ; z/ ˇ
ˇ n j ˇ
ˇj D0 j .n C ˇ/
k
ˇ
!
X
k2
k nj ˛ kj
jSn .ej ; z/j
j D0
j .n C ˇ/k
!
X
k2
k.k 1/ k 2 nj ˛ kj
D jSn .ej ; z/j
j D0
.k j /.k j 1/ j .n C ˇ/k
!
k.k 1/ ˛2 X
k2
k 2 nj ˛ k2j
.2r/k2
2 .n C ˇ/2 j D0
j .n C ˇ/.k2/
k.k 1/ ˛2
.2r/k2 ;
2 .n C ˇ/2
it follows that
ˇ ˇ
ˇ ˛;ˇ ˇ
ˇS .ek ; z/ Sn .ek ; z/ ˛ ˇz kzk1 ˇ
ˇ n nCˇ ˇ
ˇ ! ˇ
ˇX ˇ
ˇ k2 k nj ˛ kj ˇ k1
ˇˇ S .e ; z/ ˇ C k n ˛ jSn .ek1 ; z/ zk1 j
n j ˇ
ˇj D0 j .n C ˇ/ ˇ .n C ˇ/
k k
ˇ ! ˇ
ˇX ˇ
ˇ k2 k nj ˇ kj ˇ
C ˇˇ S .e
n k ; z/ ˇ
ˇ
ˇj D0 j .n C ˇ/
k
ˇ
ˇ ˇ
k nk1 ˇ ˇ nk1 ˇ k˛
C jSn .ek ; z/ z j C ˇ
k ˇ 1 ˇˇ jzjk1
.n C ˇ/k .n C ˇ/k1 nCˇ
ˇ ˇ
ˇ nk1 ˇ kˇ
ˇ
Cˇ 1 ˇ jzjk
.n C ˇ/k1 ˇ n C ˇ
k.k 1/˛ 2 k nk1 ˛ .2r/k2 .k 2/
.2r/k2
C
2.n C ˇ/2 .n C ˇ/k n
!
X k nj ˇ kj
k2
C.2r/k
j D0
j .n C ˇ/k
k nk1 ˇ .2r/k1 .k 1/ k.k 1/˛ˇ k1 k.k 1/ˇ 2 k

C C r C r ;
.n C ˇ/k n .n C ˇ/2 .n C ˇ/2
k.k 1/˛ 2 k.k 2/˛ ˇ 2 k.k 1/
.2r/k2
C .2r/ k2
C .2r/k
2.n C ˇ/2 .n C ˇ/2 2.n C ˇ/2
k.k 1/ˇ
C .2r/k1
.n C ˇ/2
k.k 1/˛ˇ k1 k.k 1/ˇ 2 k
C r C r
.n C ˇ/2 .n C ˇ/2

k.k 1/ ˛ 2 ˇ 2 k.k 1/ k.k 1/ˇ
C 2˛ .2r/k2 C .2r/k C .2r/k1
.n C ˇ/ 2 2 2.n C ˇ/2 .n C ˇ/2
k.k 1/˛ˇ k1 k.k 1/ˇ 2 k
C r C r ;
.n C ˇ/2 .n C ˇ/2
which immediately proves the theorem.

Theorem 6.7 ([130] Exact order). For 2 < R < C1; 1 r < R2 , let f W
ŒR; C1/ [ DR ! C be bounded on Œ0; C1/ and analytic in DR ; that is, f .z/ D
P 1
kD0 ck z , for all z 2 DR .
k
Let 0 < ˛ ˇ and suppose that f is not a polynomial of degree 0. Then, for
all n 2 N and jzj r, we have
Cr .f /
jSn˛;ˇ .f; z/ f .z/j ;
n
where the constant Cr .f / depends only on f , ˛, ˇ, and r.

Proof. For all jzj r and n 2 N, we can write
Sn˛;ˇ .f; z/ f .z/

1 n z
D .˛ ˇz/f 0 .z/ C f 00 .z/
n nCˇ 2

1 2 ˛ ˇz 0 z 00
C n Sn .f; z/ f .z/
˛;ˇ
f .z/ f .z/
n nCˇ 2n
1h z
D .˛ ˇz/f 0 .z/ C f 00 .z/
n 2

1 2 ˛;ˇ ˛ˇz 0 z ˇ.˛ˇz/f 0 .z/
C n Sn .f /.z/f .z/ f .z/ f 00 .z/ :
n nCˇ 2n n.nCˇ/
Applying the inequality
kF C Gk j kF k kGk j kF k kGk;
we obtain
1 h
e1
kSn˛;ˇ .f / f kr .˛ ˇe1 /f 0 C f 00
n 2 r

1 ˛ ˇe1 e1 00 ˇ.˛ ˇe1 /f 0
n2 S
n
˛;ˇ
.f / f f :

Since f is not a polynomial of degree 0 in DR ; we get .˛ˇe1 /f 0 C e21 f 00 r > 0.
Indeed, supposing the contrary, we see that
z
.˛ ˇz/f 0 .z/ C f 00 .z/ D 0; for all z 2 Dr :
2
P
Denoting y.z/ D f 0 .z/, seeking y.z/ in the form y.z/ D 1 k
kD0 bk z , and replacing
in the above differential equation, we easily get bk D 0 for all k D 0; 1; : : : (we
can make similar reasonings here with those in [77]). Thus, we get that f .z/ is a
constant function, which is a contradiction.
Now, since by Theorem 6.6 it follows that

˛;ˇ ˛ ˇe1 0 e1 00 ˇ.˛ ˇe1 /f 0
n2 S
n .f / f f f
nCˇ 2n n.n C ˇ/ r

˛;ˇ ˛ ˇe1 0 e1 00
n2 S
n .f / f f f C kˇ.˛ ˇe1 /f 0 kr
nCˇ 2n r
X
6
Mj;r .f / C ˇ.˛ C ˇr/kf 0 kr ;
j D1
6.3 Complex Beta Operators of the Second Kind 175
there is an n1 > n0 (depending on f , ˛; ˇ, and r only) such that for all n n1 ; we

have
e1

.˛ ˇe1 /f 0 C f 00
2 r

1 2 ˛ ˇe 1 0 e 1 00 ˇ.˛ ˇe1 /f 0

n Sn .f / f
˛;ˇ
f f
1 e1
.˛ ˇe1 /f 0 C f 00 ;
2 2 r
which implies that
1
e1
kSn˛;ˇ .f / f kr .˛ ˇe1 /f 0 C f 00
2n 2 r
for all n n1 .
˛;ˇ
For n 2 fn0 C 1; : : : ; n1 g, we get kSn .f / f kr n1 Ar .f / with Ar .f / D
˛;ˇ ˛;ˇ
n kSn .f / f kr > 0; which implies that kSn .f / f kr Cr n.f / for all n n0 ;
with

1 0 e1 00

Cr .f / D min Ar;n0 C1 .f /; : : : ; Ar;n1 .f /; .˛ ˇe1 /f C f ;
2 2 r
which proves the theorem.
6.3 Complex Beta Operators of the Second Kind
The complex Beta operator of the first kind was first introduced in the case of real
variables in Mühlbach [196] and later studied by Lupas [185], Khan [171], and
Abel–Gupta–Mohapatra [11], among others. The complex Beta operators of the first
kind (see [80]) are defined for all n 2 N and 0 < Re.z/ < 1 by
Z 1
1
Fn .f; z/ D t nz1 .1 t/n.1z/1 f .t/dt; z 2 C; 0 < Re.z/ < 1;
B.nz; n.1 z// 0
(6.3)
where B.˛; ˇ/ is Euler’s Beta function, defined by
Z 1
B.˛; ˇ/ D t ˛1 .1 t/ˇ1 ; ˛; ˇ 2 C; Re.˛/; Re.ˇ/ > 0:
0
The results discussed in [80] provided evidence of the overconvergence phe-

nomenon for this complex Beta operator of the first kind, that is, the extensions
of approximation properties with upper and exact quantitative estimates, from the
real interval .0; 1/ to strips in compact disks of the complex plane of the forms
SD r .0; 1/ D fz 2 CI jzj r; 0 < Re.z/ < 1g
and
SD r Œa; b D fz 2 CI jzj r; a Re.z/ bg;
with r 1 and 0 < a < b < 1. For the Beta operators of the first kind, the
upper estimate, exact order, and simultaneous approximation were considered in
[80]. Also, the following asymptotic formula was established.
Theorem 6.8 ([80] Voronovskaja-type result). Let R > 1, and suppose that f W
PR1! Ckis analytic in DR D fz 2 C W jzj < Rg; that is, we can write f .z/ D
D
kD0 ck z , for all z 2 DR . For any fixed r 2 Œ1; R/ and for all jzj r with
0 < Re.z/ < 1 and n 2 N, we have
ˇ ˇ
ˇ 00 ˇ
ˇFn .f; z/ f .z/ z.1 z/f .z/ ˇ Mr .f / ;
ˇ 2n ˇ n2
P1
where Mr .f / D kD2 jck j.1 C r/k.k C 1/.k 1/2 r k1 < 1.
Very recently, Gal and Gupta [81] studied the complex Beta operators of the second
kind. The complex Stancu Beta operators of the second kind will be defined for all
n 2 N and z 2 C satisfying 0 < Re.z/ by
Z 1
1 t nz1
Kn .f; z/ D f .t/dt; (6.4)
B.nz; n C 1/ 0 .1 C t/nzCnC1
where B.˛; ˇ/ is Euler’s Beta function, defined by

Z 1
t ˛1
B.˛; ˇ/ D ; ˛; ˇ 2 C; Re.˛/; Re.ˇ/ > 0;
0 .1 C t/˛Cˇ
and f is supposed to be locally integrable and of polynomial growth on .0; C1/ as

t ! 1. This last hypothesis on f ensures the existence of Kn .f I z/ for sufficiently
large n; that is, there exists n0 depending on f such that Kn .f I z/ exists for all
n n0 and z 2 C with Re.z/ > 0.
Note that because of the well-known formulas B.˛; ˇ/ D .˛/.ˇ/ .˛Cˇ/ and
.˛C1/ D ˛.˛/, Re.˛/ > 0, Re.ˇ/ > 0, where denotes Euler’s Gamma
function, for all z 2 N with Re.z/ > 0 and sufficiently large n, we can easily can
deduce the form
Z
nz.nz C 1/ : : : .nz C n/ 1 t nz1
Kn .f; z/ D f .t/dt; Re.z/ > 0: (6.5)
nŠ 0 .1 C t/nzCnC1
The results in this section will show the overconvergence phenomenon for this
complex Stancu Beta integral operator of the second kind, that is, the extensions
of approximation properties with upper and exact quantitative estimates, from the
real interval .0; r to semidisks of the right half-plane of the form
SD r .0; r D fz 2 CI jzj r; 0 < Re.z/ rg
and to subsets of semidisks of the form
SD r Œa; r D fz 2 CI jzj r; a Re.z/ rg;
with r 1 and 0 < a < r.

Lemma 6.7 ([81]). For all ep D t p ; p 2 N [ f0g, n 2 N, z 2 C with 0 < Re.z/,
we have Kn .e0 ; z/ D 1, Kn .e1 /.z/ D e1 .z/, and
nz C p
Kn .epC1 ; z/ D Kn .ep ; z/; for all n > p:
np
Here ek .z/ D zk .
Theorem 6.9 ([81] Upper estimate). S Let DR D fz 2 CI jzj < Rg, with 1 < SR <
1, and suppose that f W ŒR; 1/ PD R ! C is continuous in ŒR; 1/ D R ,
1
analytic in DR , that is, f .z/ D kD0 ck z , for all z 2 DR , and f .t/ is of
k
polynomial growth on .0; C1/ as t ! 1. In addition, suppose that there exist

1 1 k
M > 0 and A 2 2R ; 2 such that jck j M AkŠ , for all k D 0; 1; 2; : : : [which
implies jf .z/j M e Ajzj for all z 2 DR ].
Let 1 r < 2A1
. There exists n0 2 N (depending only on f ) such that Kn .f; z/
is analytic in SD .0; r for all n n0 , and
r
C
jKn .f; z/ f .z/j ; for all n n1 and z 2 SD r Œa; r;
n
for any a 2 .0; r/. Here C > 0 is independent of n and z but depends on f , r, and
a, and n1 depends on f , r, and a.
Proof. In the definition of Kn .f; z/ in (6.4), for z D x C iy with x > 0, note that it
follows that t nz1 D e .nz1/ln.t / D e .nx1/ln.t / e i nyln.t / and jt nz1 j D t nx1 , which
implies
Z ˇ ˇ
1 C1 ˇ t nz1 ˇ
jKn .f; z/j ˇ ˇ
jB.nz; n C 1/j ˇ .1 C t/nzCnC1 ˇ jf .t/jdt
0
Z C1
1 t nx1
D jf .t/jdt:
jB.nz; n C 1/j 0 .1 C t/nxCnC1
But it is well known that because f .t/ is of polynomial growth as t ! C1, the
last integral exists finitely for sufficiently large n.
Therefore, there exists n0 depending only on f such that Kn .f; z/ is well defined
for sufficiently large n and for z with Re.z/ > 0.
It remains to prove that Kn .f; z/ is, in fact, analytic for Re.z/ > 0 and n
sufficiently large. For this purpose, from a standard result in the theory of improper
integrals depending on a parameter, it suffices to prove that for any ı > 0, the
improper integral
Z 1 0
t nz1
f .t/dt
0 .1 C t/nzCnC1 z
is uniformly convergent for Re.z/ ı > 0 and n sufficiently large.

But by simple calculation, we obtain
0 0
t nz1 e .nz1/ln.t / t nz1
D D nŒln.t/ ln.1 C t/ ;
.1 C t/nzCnC1 z e .nzCnC1/ln.1Ct / z .1 C t/nzCnC1
and since ln.1Ct/ 1Ct for all t 0, it easily follows that it remains to prove that
R1 nz1
the integral 0 .1Ctt /nzCnC1 ln.t/f .t/dt is uniformly convergent for Re.z/ ı > 0
and n sufficiently large.
By ln.t/ < t for all t 1 and by
Z 1 Z 1
t nz1 t nz1
ln.t/f .t/dt D ln.t/f .t/dt
0 .1 C t/ nzCnC1
0 .1 C t/
nzCnC1
Z 1
t nz1
C ln.t/f .t/dt;
1 .1 C t/nzCnC1
we clearly need to prove the uniform convergence, for all Re.z/ ı > 0 and
R1 nz1
n sufficiently large, for the integral 0 .1Ctt /nzCnC1 ln.t/f .t/dt. But this follows
immediately from the estimate
ˇ ˇ
ˇ t nz1 ˇ
ˇ ˇ
ˇ .1 C t/nzCnC1 ˇ jln.t/j jf .t/j C t jln.t/j;
nı1
(see, e.g., [195], p. 19, Exercise 1.51), where jf .t/j C for all t 2 Œ0; 1.
In what follows, we deal
Pn with kthe approximation property. For this purpose, first
let us define Sn .z/ D kD0 ck z if jzj r and Sn .t/ D f .t/ if t 2 .r; C1/,
where 1 r < 2A 1
. Evidently, for each n 2 N, Sn is piecewise continuous on
Œ0; C1/ (more exactly, has a discontinuity point of the first kind at x D r) but
locally integrable on Œ0; C1/ P and of polynomial growth as t ! 1.
1
Clearly, f .z/ Sn .z/ D kDnC1 ck z if jzj r and f .t/ Sn .t/ D 0 if
k
t 2 .r; 1/. Also, it is immediate that Kn .Sn /.z/ is well defined for all n 2 N.
Therefore, for sufficiently large n and for z 2 SD r .0; r, we have
jKn .f; z/ f .z/j jKn .f; z/ Kn .Sn ; z/j C jKn .Sn ; z/ Sn .z/j C jSn .z/ f .z/j
X
n
jKn .f Sn ; z/j C jck j jKn .ek ; z/ ek .z/j C jSn .z/ f .z/j;
kD0
where ek .z/ D zk .
First, we will obtain an estimate for jSn .z/ f .z/j. Let 1 r < 2A
1
< r1 < R.
By the hypothesis, we can make such a choice for r1 .
Denoting Mr1 .f / D maxfjf .z/jI jzj r1 g and D rr1 , by 0 < D rr1 <
2Ar < 1 and by Cauchy’s estimate (see, e.g., [224], p. 184, Lemma 10.5), we get
jck j D jf kŠ.0/j kŠ1 r1r.fk / D rr1k , which implies
.k/ M kŠ M .f /
1 1
1
X X1 X1
Mr1 .f / rk
jSn .z/ f .z/j jck j jzjk k
jzj k
Mr1 .f / k
kDnC1 kDnC1
r1 kDnC1
r1
1
X Mr1 .f / nC1
D Mr1 .f / nC1 k D ;
1
kD0
for all jzj r and n 2 N.

By now using Lemma 6.7 and taking into account the inequalities
1 2.p C 1/ 1 pC1
; ; n p C 1;
np nCp np n
for all z 2 SD r .0; r and n p C 1, we get
jKn .epC1 ; z/ epC1 .z/j

ˇ ˇ
ˇ nz C p nz C p nz C p ˇ
Dˇ ˇ Kn .ep ; z/ ep .z/ C ep .z/ epC1 .z/ˇˇ
np np np
ˇ ˇ
jnz C pj ˇˇ ˇ ˇ nz C p ˇ
ˇ ˇ
Kn .ep ; z/ ep .z/ C jep .z/j ˇ zˇˇ
np np
2.p C 1/ ˇˇ ˇ jp.1 C z/j
jnz C pj Kn .ep ; z/ ep .z/ˇ C r p
nCp np
nr C p r p 2pr .p C 1/
2.p C 1/jKn .ep ; z/ ep .z/j C
nCp n
p
pr
2r.p C 1/ jKn .ep ; z/ ep .z/j C ;
n
for all p D 0; 1; : : : ; n 1.
Therefore, denoting Ep;n .z/ D jKn .ep ; z/ ep .z/j, we have obtained

rp
EpC1;n .z/ r.2p C 2/ Ep;n .z/ C p ;
n
for all p D 0; 1; : : : ; n 1.
Since E0;n .z/ D E1;n .z/ D 0, for p D 1 in the above inequality, we get
h r i 1 r2
E2;n .z/ r.2 1 C 2/ E1;n .z/ C .2 1 C 2/:
n n
In what follows, we will use the obvious inequality p 2.p 1/ C 2, valid for all
p 1.
For p D 2 in the above recurrence inequality, it follows that

r2
E3;n .z/ r.2 2 C 2/ E2;n .z/ C 2
n
r3
Œ.2 2 C 2/.2 1 C 2/ C 2 .2 2 C 2/
n
r3
Œ.2 2 C 2/.2 1 C 2/ C .2 1 C 2/.2 2 C 2/
n
2r 3
.2 2 C 2/.2 1 C 2/:
n
For p D 3 in the above recurrence inequality, we get

r3
E4;n .z/ r.2 3 C 2/ E3;n .z/ C 3
n
3
2r r3
r.2 3 C 2/ .2 1 C 2/.2 2 C 2/ C .2 2 C 2/
n n
3r 4
.2 3 C 2/.2 2 C 2/.2 1 C 2/:
n
By mathematical induction, we easily obtain
.p 1/ r p p1 .p 1/ 2p1 r p p pŠ.2r/p

Ep;n .z/ …i D1 2.i C 1/ D pŠ ;
n n 2n
for all n p C 1 and z 2 SD r .0; r.

Therefore, we obtain
X 1
M X M X
n n
jck j jKn .ek ; z/ ek .z/j k.2Ar/k k.2Ar/k ;
2n 2n
kD0 kD0 kD0
P
where the hypothesis on f obviously implies that 1 kD0 k .2Ar/ < 1.
k
Now, let us estimate jKn .f Sn ; z/j. By the definition of Sn and by (6.5), we

easily get
Z r
nz.nz C 1/ : : : .nz C n/ t nz1
Kn .f Sn ; z/ D .f .t/ Sn .t//dt;
0 .1 C t/
nŠ nzCnC1
for all z 2 SD r Œa; r, z D x C iy, and n 2 N. Passing to the modulus, we see that
ˇ Z ˇ
nr.nrC1/ : : : .nrCn/ ˇ r
t nz1 ˇ
jKn .f Sn ; z/j ˇ ˇ
nŠ ˇ .1Ct/nzCnC1 ˇ jf .t/Sn .t/jdt
0
Z r
nr.nr C 1/ : : : .nr C n/ t nx1
kf Sn kC Œ0;r dt
0 .1 C t/
nŠ nxCnC1
Z r
nC1 nr.nr C 1/ : : : .nr C n/ t nx1
Cr;r1 ;f dt:
0 .1 C t/
nŠ nxCnC1
Rr t nx1
Now, let us estimate the integral 0 .1Ct /nxCnC1 dt. For sufficiently large n (such
that na 1 1), we have
Z r
t nx1
dt
0 .1 C t/
nxCnC1
Z 1 Z r
t nx1 t nx1
D dt C dt
0 .1 C t/ 1 .1 C t/
nxCnC1 nxCnC1
Z 1 Z r
t nx1 t nxCnC1
dt C dt
0 .1 C t/ 1 .1 C t/
nx1 nxCnC1
nx1 nxCnC1
1 r
C .r 1/
2 r C1
nx1 na1
r r
r r ;
r C1 r C1
which immediately implies the estimate for n n0 (with n0 depending only on f

and a) and z 2 SD r Œa; r:
na1
nr.nr C 1/ : : : .nr C n/ r
jKn .f Sn ; z/j Cr;r1 ;f nC1 r :
nŠ r C1
Collecting all of the above estimates, for sufficiently large n and z 2 S r Œa; r, we get
1
M X
jKn .f; z/ f .z/j Cr;r1 ;f nC1 C k.2Ar/k
n
kD0
na1
nr.nr C 1/ : : : .nr C n/ r
C Cr;r1 ;f nC1
r : (6.6)
nŠ r C1
In (6.6), we need to choose n 2=a.

Now, denote
1 nr.nr C 1/ : : : .nr C n/ r .nr C 1/ : : : .nr C n/

an D D :
n2 nŠ n nŠ
We can write
na1 " na1 #
nr.nr C 1/ : : : .nr C n/ r r
nC1
D .n /an n
nC1
:
nŠ r C1 r C1
Note that because 0 < < 1 and 0 < r=.r C 1/ < 1, it is clear that for sufficiently
r na1
large n, we have n nC1 cn1 and n rC1 cn2 , where c1 > 0 and c2 > 0 are
independent of n and z. On the other hand, by simple calculation, we get

anC1 n r r r
D 1 C 1 C : : : 1 C
an .n C 1/2 nr C 1 nr C 2 nr C n
n .nrC1/=r
n r n r 3n
< 1C < 1C 1;
.n C 1/2 nr C 1 .n C 1/2 nr C 1 .n C 1/2
for all n 2 N. We used the inequality e < 3 here. Therefore, the sequence .an /n is
nonincreasing, which implies that it is bounded.
In conclusion, for sufficiently large n, we have
na1
nr.nr C 1/ : : : .nr C n/ r c3
nC1 ;
nŠ r C1 n2
which, coupled with (6.6), immediately implies the order of approximation O.1=n/
in the statement of the theorem.
Theorem 6.10 ([81] Asymptotic formula). Let D SR D fz 2 CI jzj < Rg, with
1 < RS< 1, and suppose that f W ŒR; 1/P D R ! C is continuous in
1
ŒR; 1/ D R , analytic in DR , that is, f .z/ D kD0 ck z , for all z 2 DR , and
k
f .t/ is of polynomial growth on .0; C1/ as t ! 1. In addition, suppose that

1 1 k
there exist M > 0 and A 2 2R ; 2 such that jck j M AkŠ , for all k D 0; 1; 2; : : : ;
[which implies jf .z/j M e Ajzj for all z 2 DR ].
Let 1 r < 2A1
. There exists n1 2 N (depending on f , r, and a) such that for
all n n1 , z 2 SD r Œa; r, and a 2 .0; r/, we have
ˇ ˇ
ˇ 00 ˇ
ˇKn .f; z/ f .z/ z.1 C z/f .z/ ˇ C ;
ˇ 2.n 1/ ˇ n2
where C > 0 is independent of n and z but depends on f , r, and a.

Proof. Keeping the notations in the proof of Theorem 6.9, we can write
ˇ ˇ
ˇ 00 ˇ
ˇKn .f; z/ f .z/ z.1 C z/f .z/ ˇ
ˇ 2.n 1/ ˇ
ˇ
ˇ z.1 C z/Œf .z/ Sn .z/00
D ˇˇ Kn .f Sn ; z/ .f .z/ Sn .z//
2.n 1/
ˇ
z.1 C z/Sn .z/ ˇˇ
00
C Kn .Sn ; z/ Sn .z/ ˇ
2.n 1/
ˇ ˇ
ˇ z.1 C z/Œf .z/ Sn .z/00 ˇˇ
ˇˇKn .f Sn ; z/ .f .z/ Sn .z// ˇ
2.n 1/
ˇ ˇ
ˇ z.1 C z/Sn00 .z/ ˇˇ
C ˇˇKn .Sn ; z/ Sn .z/ WD A C B:
2.n 1/ ˇ
We get
ˇ ˇ
ˇ .z/Sn .z/00 ˇ
A jKn .f Sn ; z/j C jf .z/ Sn .z/j C ˇ z.1Cz/Œf
2.n1/ ˇ
r.1Cr/jf 00 .z/Sn00 .z/j
jKn .f Sn ; z/j C jf .z/ Sn .z/j C 2.n1/ WD A1 C A2 C A3 :
From the proof of Theorem 6.9, for all z 2 SD r Œa; r with a 2 .0; r/ and for
sufficiently large n, we have
C1
A1 and A2 C2 nC1 ;
n2
where C1 > 0, C2 > 0 are independent of n and z but may depend on f , r, and a
and 0 < < 1.
In order to estimate
S A3 , let 0 < a1 < a < r, 1 r < r1 < 2A
1
, and denote by
D a1 ;r1 D S1 L1 the closed curve composed by the segment in C:

q q
S1 D z D x C iy 2 CI x D a1 and r12 a12 y r12 a12 ;
and by the arc
L1 D fz 2 C W jzj D r1 ; Re.z/ a1 g:
Clearly, , together with its interior, is exactly SD r1 Œa1 ; r1 and from r < r1 , we
have SD r Œa; r SD r1 Œa1 ; r1 , the inclusion being strictly.
By Cauchy’s integral formula for derivatives, we have for all z 2 SD r Œa; b and
n 2 N sufficiently large,
Z
2Š f .u/ Sn .u/
f 00 .z/ Sn00 .z/ D d u;
2 i .u z/3
which, by the estimate of jjf Sn ./jjSD r1 Œa1 ;r1 in the proof of Theorem 6.9 and by
the inequality ju zj d D minfr1 r; a a1 g valid for all z 2 SD r Œa; r and
u 2 , implies
2Š l./
jjf 00 .z/ Sn00 ./jjSD r Œa;r
: jjf Sn ./jjSD r1 Œa1 ;r1
2 d 3
Mr1 .f / nC1 Cr1 .f /2Šl./
;
1 2d 3
with D rr1 .
Note that here, by simple geometrical reasoning, for the length l./ of , we get
l./ D l.S1 / C l.L1 /

q
D 2 r12 a12 C 2r1 arccos.a1 =r1 /;
where arccos.˛/ is considered expressed in radians.

Therefore, collecting all of the above estimates, we easily get A nC2 for
sufficiently large n, with C > 0 independent of n and z (but depending on f , r,
and a).
In the last
ˇ part of the proof, we will obtain
ˇ an estimate of the order O.1=n2 /
ˇ z.1Cz/Sn00 .z/ ˇ
for B D ˇKn .Sn ; z/ Sn .z/ 2.n1/ ˇ too, which implies the estimate in the
statement.
Denoting k;n .z/ D Kn .ek /.z/ and
zk1 .1 C z/k.k 1/
Ek;n .z/ D k;n .z/ ek .z/ ;
2.n 1/
we first clearly see that E0;n .z/ D E1;n .z/ D 0. Then we can write
ˇ ˇ X
ˇ 00 ˇ n
ˇKn .Sn ; z/ Sn .z/ z.1 C z/Sn .z/ ˇ jck j jEk;n .z/j;
ˇ 2.n 1/ ˇ
kD2
and so it remains to estimate Ek;n .z/ for 2 k n, by using the recurrence in

Lemma 2.1.
In this sense, a simple calculation based on Lemma 6.7 leads us to the formula
nz C k 1 zk1 .1 C z/k.k 1/
Ek;n .z/ D k1;n .z/ zk
nkC1 2.n 1/

nz C k 1 zk2 .1 C z/.k 1/.k 2/
D Ek1;n .z/ C zk1 C
nkC1 2.n 1/
zk1 .1 C z/k.k 1/
zk
2.n 1/
nz C k 1 .k 1/.k 2/zk2 .1 C z/Œ.1 C z/k C .z 1/
D Ek1;n .z/ C :
nkC1 2.n 1/.n k C 1/
If we take into account the inequalities valid for all 2 k n and r 1,
1 2k 2k nr C k 1
; r;
nk C1 nCk1 nCk nCk1
2.n 1/.n C k/ n2 ; k.1 C r/ C .r 1/ .k C 1/.1 C r/;
this immediately implies, for all 2 k n and jzj r with a Re.z/ r,
jEk;n .z/j
ˇ ˇ ˇ ˇ
ˇ nz C k 1 ˇ ˇ ˇ
ˇ jEk1;n .z/j C ˇ .k 1/.k 2/z .1 C z/Œ.1 C z/k C .z 1/ ˇ
k2
ˇˇ ˇ ˇ ˇ
nkC1 2.n 1/.n k C 1/
nr C k 1 .k 1/.k 2/r k2 .1 C r/Œ.1 C r/k C .r 1/
jEk1;n .z/j C
nkC1 2.n 1/.n k C 1/
2k.nrCk1/ 2k.k1/.k2/r k2 .1Cr/Œ.1Cr/kC.r1/
jEk1;n .z/jC
nCk1 2.n1/.nCk/
2k.k 1/.k 2/r k2 .1 C r/Œ.1 C r/k C .r 1/
2kr jEk1;n .z/j C
2.n 1/.n C k/
r k2 .1 C r/2k.k 1/.k 2/
2rkjEk1;n .z/j C Œk.1 C r/ C .r 1/
n2
r k1 .1 C r/2 k.k 1/.k 2/.k C 1/
2rkjEk1;n .z/j C :
n2
Denoting A.k; r/ D 2.1 C r/2 .k C 1/k.k 1/.k 2/, we have obtained
r k1
jEk;n .z/j 2rkjEk1;n .z/j C A.k; r/:
n2
Obviously, E0;n .z/ D E1;n .z/ D E2;n D 0. Take the last inequality, k D 3; 4; : : : ; n.
2
For k D 3, we obtain jE3;n .z/j nr 2 A.3; r/.
For k D 4, it follows that
r3 r3
jE4;n .z/j r.2 4/ jE3;n .z/j C A.4; r/ .2 4/ ŒA.3; r/ C A.4; r/ :
n2 n2
For k D 5, analogously, we get
r4
jE5;n .z/j r.2 5/ jE4;n .z/j C
A.5; r/
n2

r3 r4
r.2 5/ .2 4/ 2 ŒA.3; r/ C A.4; r/ C 2 A.5; r/
n n
r4
.2 4/.2 5/ŒA.3; r/ C A.4; r/ C A.5; r/:
n2
Reasoning by mathematical induction, we finally easily obtain
r k1 X k
jEk;n .z/j .2 4/.2 5/ : : : .2 k/ A.j; r/
n2 j D3
r k1 2k1 kŠ X
k
D 2 A.j; r/
n2 2 3Š j D3
.2r/k1 X k
D kŠ 2.1 C r/2
.j 2/.j 1/j.j C 1/
24n2 j D3
kŠ.2r/k1
.1 C r/2 .k 2/2 .k 1/k.k C 1/:
12n2
We conclude that
ˇ ˇ
ˇ z.1 C z/Sn00 .z/ ˇˇ X
n
ˇ
B W D ˇKn .Sn ; z/ Sn .z/ jck j jEk;n j
2.n 1/ ˇ
kD2
MA.1 C r/ 2 X
n
.k 2/2 .k 1/k.k C 1/.2rA/k1
12n2
kD2
1
MA.1 C r/2 X
.k 2/2 .k 1/k.k C 1/.2rA/k1;
12n2
kD2
where since 2Ar < 1 by hypothesis, we get

1
X
.k 2/2 .k 1/k.k C 1/.2rA/k1 < C1:
kD2
Indeed, the fact that thePlast series is convergent follows from the uniform
convergence of the series 1 kD0 z and its derivative of order 5, for jzj < 1. This
k
finishes the proof of the theorem.

Theorem 6.11 ([81] Exact order).
S Let DR D fz 2 CI jzj < Rg, with S 1 < R < 1,
and suppose that f W ŒR;P 1/ D R ! C is continuous in ŒR; 1/ D R , analytic
in DR , that is, f .z/ D 1 c
kD0 k zk
, for all z 2 D R , and f .t/ is of polynomial growth
on .0; C1/ as t ! 1. In addition, suppose that there exist M > 0 and A 2 2R 1 1
;2
k
such that jck j M AkŠ , for all k D 0; 1; 2; : : : [which implies jf .z/j M e Ajzj for
all z 2 DR ].
Let 1 r < 2A1
. If f is not a polynomial of degree 1, then there exists n1 2 N
(depending on f , r, and a) such that for all n n1 , z 2 SD r Œa; r, and a 2 .0; r/,
we have
Cr;a .f /
jjKn .f; / f jjSD r Œa;r ;
n
where Cr;a .f / depends only on f , a, and r. Here k kSD r Œa;r denotes the uniform
norm on SD r Œa; r.
Proof. For all jzj r and n > n0 (with n0 depending only on f ), we have

1 z.1 C z/f 00 .z/
Kn .f; z/ f .z/ D
.n 1/ 2

1 z.1 C z/f 00 .z/
C .n 1/2 Kn .f; z/ f .z/ :
.n 1/ 2.n 1/
Also, we have
ˇ ˇ
jjF C GjjSD r Œa;r ˇjjF jjSD r Œa;r jjGjjSD r Œa;r ˇ jjF jjSD r Œa;r jjGjjSD r Œa;r :
It follows that
"
1 e1 .1 C e1 /f 00
jjKn.f; / f jjSD r Œa;r
.n 1/ 2 r
SD Œa;r
( ˇˇ ˇˇ )#
1 ˇˇ e .1 C e /f 00 ˇˇ
.n 1/ ˇˇˇˇKn .f; / f ˇˇ
1 1
2
:
.n 1/ 2.n 1/ ˇˇSD r Œa;r
Taking ˇinto
ˇ accountˇthat, ˇ by hypothesis, f is not a polynomial of degree 1 in DR ,
ˇˇ 00 ˇˇ
we get ˇˇ e1 .1Ce
2
1/
f ˇ ˇ r
> 0.
SD Œa;r
00
Indeed, suppose, to the contrary, that it follows that z.1Cz/2 f .z/ D 0 for all
00
z 2 D R , which implies that f .z/ D 0, for all z 2 D R nf0; 1g. Because f is
analytic, by the uniqueness of analytic functions, we get f 00 .z/ D 0, for all z 2 DR ,
that is, f is a polynomial of degree 1, which contradicts the hypothesis.
Now by Theorem 6.10, for sufficiently large n, we have
ˇˇ ˇˇ
ˇˇ
2 ˇˇ e1 .1 C e1 /f 00 ˇˇˇˇ C.n 1/2
.n 1/ ˇˇKn .f; / f Mr .f /:
2.n 1/ ˇˇSD r Œa;r n2
Therefore, there exists an index n1 > n0 depending only on f , a, and r, such that
for any n n1 , we have

e1 .1 C e1 /f 00

2
SD r Œa;r
( ˇˇ ˇˇ )
1 ˇˇ e .1 C e /f 00 ˇˇ
.n 1/ ˇˇˇˇKn .f; / f ˇˇ
1 1
2
.n 1/ 2.n 1/ ˇˇSD r Œa;r
1
ke1 .1 C e1 /f 00 kSD r Œa;r ;
4
which immediately implies
1
jjKn .f; / f jjSD r Œa;r jje1 .1 C e1 /f 00 jjSD r Œa;r ; 8n n1 :
4n
This completes the proof.
In simultaneous approximation, the following result was stated and proved in
[81], and thus we omit the details here.
Theorem 6.12 ([81] Simultaneous approximation).S Let DR D fz 2 CI jzj < Rg,
with 1 < S R < 1, and suppose that f W ŒR; P1/ DkR ! C is continuous in
ŒR; 1/ D R , analytic in DR , that is, f .z/ D 1 kD0 ck z , for all z 2 DR , and f .t/
is of polynomial growth on .0; C1/ as t ! 1. In addition, suppose that there exist
1 1 k
M > 0 and A 2 2R ; 2 such that jck j M AkŠ , for all k D 0; 1; 2; : : : [which
implies jf .z/j M e Ajzj for all z 2 DR ].
Let 1 r < r1 < 2A 1
, 0 < a1 < a < r, and p 2 N. If f is not a polynomial of
degree maxf1; p 1g, then there exists n1 2 N (depending on f , r, and a) such
that for all n n1 and z 2 SD r Œa; r, we have
6.4 Genuine Durrmeyer–Stancu Polynomials 189
1
jjKn.p/ .f; / f .p/ jjSD r Œa;r
;
n
where the constants in the equivalence depend only on f; r; r1 ; a; a1 , and p.
6.4 Genuine Durrmeyer–Stancu Polynomials
Let ˛ and ˇ be two given real parameters satisfying the conditions 0 ˛ ˇ: For
f W Œ0; 1 ! C continuous on Œ0; 1, Mahmudov and Gupta [187] introduced the
complex genuine Durrmeyer–Stancu operators as follows:

˛ nC˛
Un.˛;ˇ/ .f I z/ D pn;0 .z/ f C pn;n .z/ f
nCˇ nCˇ
X
n1 Z 1
nt C ˛
C .n 1/ pn;k .z/ pn2;k1 .t/ f dt
0 nCˇ
kD1

n k
Here pn;k .z/ D z .1 z/nk ; p1;k D 0. For ˛ D ˇ D 0, they become
k
the genuine Bernstein–Durrmeyer operators Un .f I z/ D Un.0;0/ .f I z/ : Note that
this case is investigated in [78]. Let DR WD fz 2 C W jzj < Rg, H .DR / denote the
set of all analytic functions on DR . For f 2 H .DR /, we assume that f .z/ D
P 1 m
mD0 am z :
First, we describe a method to recursively compute the images of the monomials
.˛;ˇ/
em under Un in terms of Un ej , j D 0; : : : ; m; where em .z/ D zm . Then we
.˛;ˇ/
establish a recurrence formula for the moments Un .emC1 /.
Lemma 6.8 ([187]). For all m; n 2 N[ f0g, 0 ˛ ˇ, and z 2 C, we have
X m
m nj ˛ mj
Un.˛;ˇ/ .em I z/ D m Un ej I z :
j .n C ˇ/
j D0
Lemma 6.9 ([187]). For all m; n 2 N[ f0g, 0 ˛ ˇ, and jzj r; r 1, we

have
ˇ ˇ
ˇ .˛;ˇ/ ˇ
ˇUn .em I z/ˇ r m :
Lemma 6.10 ([187]). For all m; n 2 N, 0 ˛ ˇ, and z 2 C, we have
z .1 z/ n .˛;ˇ/ 0
Un.˛;ˇ/ .emC1 I z/ D Un .em I z/
nCm nCˇ
.m C zn/ n C ˛ .2m C n/ .˛;ˇ/

C Un .em I z/
.n C ˇ/ .n C m/
1 ˛m .˛ C n/ .˛;ˇ/
U .em1 I z/ :
n C m .n C ˇ/2 n
Theorem 6.13 ([187]). Let 0 ˛ ˇ and 1 r < R. Then for all jzj r, we
have
ˇ ˇ A .f /
ˇ .˛;ˇ/ ˇ r;ˇ ˛Br .f /
ˇUn .f I z/ f .z/ˇ C ;
nCˇ n .n C ˇ/
where
1
X
m .m 1/
Ar;ˇ .f / D 2 .1 C r/ C ˇm r m1 ; Br .f /
mD1
2
1
X
D ˛ .1 C r/ m .m 1/ r m2 :
mD2
Proof. Let us start with the recurrence formula:

.˛;ˇ/ z .1 z/ n .˛;ˇ/ 0
Un .em I z/ zm D Un .em1 I z/
nCm1nCˇ
.m 1 C zn/ n C ˛ .m 1 C n/ h .˛;ˇ/ i
C Un .em1 I z/ zm1
.n C ˇ/ .n C m 1/
˛ .m 1/ .˛;ˇ/
C Un .em1 I z/
.n C ˇ/ .n C m 1/
˛ .m 1/ .˛ C n/ .˛;ˇ/
Un .em2 I z/
.n C ˇ/2 .n C m 1/
.m 1/ n .1 z/ C .˛ zˇ/ .n C m 1/ m1
C z : (6.7)
.n C ˇ/ .n C m 1/
.˛;ˇ/
Taking into account that Un .em1 I z/ is a polynomial of degree m 1, by the
well-known Bernstein inequality and Lemma 6.8, we obtain
ˇ 0 ˇˇ m 1 nˇ ˇ o
ˇ .˛;ˇ/ ˇ ˇ
ˇ U .e I z/ ˇ max ˇUn.˛;ˇ/ .em1 I z/ˇ W jzj r .m 1/ r m2 :
ˇ n m1 ˇ r
(6.8)
Using (6.8) from the above recurrence formula (6.7), we get
ˇ ˇ
ˇ .˛;ˇ/ ˇ
ˇUn .em I z/ zm ˇ
r .1 C r/ nr C ˛ ˇˇ .˛;ˇ/ ˇ
ˇ
.m 1/ r m2 C ˇUn .em1 I z/ em1 .z/ˇ
nCˇ nCˇ
˛ .m 1/ .m 1/ .r C 1/ C ˛ C ˇr m1
C .1 C r/ r m2 C r
n .n C ˇ/ nCˇ
ˇ ˇ m1
ˇ ˇ
r ˇUn.˛;ˇ/ .em1 I z/ em1 .z/ˇ C .1 C r/ r m1
nCˇ
˛ .m 1/ .m 1 C ˇ/
C .1 C r/ r m2 C .1 C r/ r m1
n .n C ˇ/ nCˇ
ˇ ˇ .m 1 C ˇ/
ˇ ˇ
r ˇUn.˛;ˇ/ .em1 I z/ em1 .z/ˇ C 2 .1 C r/ r m1
nCˇ
˛ .m 1/
C .1 C r/ r m2 :
n .n C ˇ/
By writing the last inequality for m D 1; 2; : : : ; we easily obtain, step by step, the
following:
ˇ ˇ
ˇ .˛;ˇ/ ˇ
ˇUn .em I z/ em .z/ˇ
ˇ ˇ
ˇ ˇ .m 2 C ˇ/
r r ˇUn.˛;ˇ/ .em2 I z/ em2 .z/ˇ C 2 .1 C r/ r m2
nCˇ

˛ .m 2/
C .1 C r/ r m3
n .n C ˇ/
.m 1 C ˇ/ ˛ .m 1/
C2 .1 C r/ r m1 C .1 C r/ r m2
nCˇ n .n C ˇ/
ˇ ˇ 1 C r m1
ˇ ˇ
D r 2 ˇUn.˛;ˇ/ .em2 I z/ em2 .z/ˇ C 2 r .m 1 C ˇ C m 2 C ˇ/
nCˇ
˛
C .1 C r/ r m2 .m 1 C m 2/
n .n C ˇ/

2 .1 C r/ m .m 1/ ˛ .1 C r/
::: C ˇm r m1 C m .m 1/ r m2 ;
nCˇ 2 n .n C ˇ/
which implies
ˇ ˇ X 1 ˇ ˇ
ˇ .˛;ˇ/ ˇ ˇ ˇ
ˇUn .f I z/ f .z/ˇ jam j ˇUn.˛;ˇ/ .em I z/ em .z/ˇ
mD1
Ar;ˇ .f / ˛Br .f /
C :
nCˇ n .n C ˇ/

Theorem 6.14 ([187]). Suppose that f 2 H .DR / ; 0 ˛ ˇ, and 1 r < R.

Then, for all jzj r, we have
ˇ ˇ
ˇ .˛;ˇ/ ˛ ˇz 0 z .1 z/ 00 ˇˇ
ˇU .f I z/ f .z/ f .z/ f .z/
ˇ n nCˇ nC1 ˇ

M 1 .f / ˛ 2 Mr2 .f / C ˇ 2 C 2ˇ Mr4 .f / C ˛ˇMr5 .f /
r 2 C
n .n C ˇ/2
˛Mr2 .f / C ˇMr6 .f /
C ;
n .n C ˇ/
where
1
X
Mr1 .f / D 16 jam j m .m 1/ .m 2/2 r m ;
mD3
1
1X
Mr2 .f / D jam j m .m 1/ r m2 ;
2 mD2
1
X
Mr3 .f / D 2 jam j m .m 1/ .m 2/ r m2 ;
mD2
1
1X
Mr4 .f / D jam j m .m 1/ r m ;
2 mD2
1
X 1
X
Mr6 .f / D jam j m .m 1/ r m1 ; Mr5 .f / D 2 jam j m2 .m 1/ r m :
mD2 mD2
Proof. For all z 2 DR , we immediately obtain
˛ ˇz 0 z .1 z/ 00
Un.˛;ˇ/ .f I z/ f .z/ f .z/ f .z/
nCˇ nC1
z .1 z/ 00
D Un .f I z/ f .z/ f .z/
nC1
˛ ˇz 0
C Un.˛;ˇ/ .f I z/ Un .f I z/ f .z/
nCˇ
X1
z .1 z/
D am Un .em I z/ em .z/ m .m 1/ zm2
mD2
nC1
1
X
˛ ˇz m1
C am Un.˛;ˇ/ .em I z/ Un .em I z/ mz :
mD1
nCˇ
To estimate the first sum, we use a Voronovskaja-type result for the genuine
Durrmeyer operators obtained in [78, Theorem 2.4], namely,
ˇ ˇ 1
ˇ ˇ X
ˇUn .f I z/ f .z/ z .1 z/ f 00 .z/ˇ 16 jam j m .m 1/ .m 2/2 r m :
ˇ nC1 ˇ n2
mD3
To estimate the second series, we rewrite it as follows:
˛ ˇz m1
Un.˛;ˇ/ .em I z/ Un .em I z/ mz
nCˇ
X m nj ˛ mj
m1

nm

˛ ˇz m1
D m Un ej I z C m 1 Un .em I z/ mz
j .n C ˇ/ .n C ˇ/ nCˇ
j D0
X
m2
m

nj ˛ mj mnm1 ˛
D m Un ej I z C Un .em1 I z/
j D0
j .n C ˇ/ .n C ˇ/m
X
m1
m

nj ˇ mj ˛ ˇz m1
m Un .em I z/ mz
j D0
j .n C ˇ/ nCˇ
X
m2
m

nj ˛ mj mnm1 ˛
D m Un ej I z C Un .em1 I z/ zm1
j D0
j .n C ˇ/ .n C ˇ/m
X
m2
m

nj ˇ mj
Un .em I z/
j D0
j .n C ˇ/m

nm1 ˛ mnm1 ˇ m
C 1 mzm1 C .z Un .em I z//
.n C ˇ/m1 nCˇ .n C ˇ/m

nm1 ˇz
C 1 mzm1 :
.n C ˇ/ m1 nCˇ
Using
k
X
nk n kˇ
1 1 D
.n C ˇ/ j D1
k nCˇ nCˇ
ˇ ˇ
ˇm2 ˇ X j mj
ˇX m nj ˛ mj ˇ m2 m n ˛ ˇ ˇ
ˇ ˇ ˇ ˇ
ˇ m Un ej I z ˇ m Un ej I z
ˇj D0 j .n C ˇ/ ˇ j D0 j .n C ˇ/
X
m2
.m 1/ m m2
D
j D0
.m j 1/ .m j / j
nj ˛ mj ˇˇ ˇ
ˇ
m Un ej I z
.n C ˇ/
m .m 1/ ˛2 X nj ˛ m2j
m2
r m2
2 .n C ˇ/ 2
j D0
.n C ˇ/m2
m .m 1/ ˛2
r m2 ;
2 .n C ˇ/2
we get
ˇ ˇ
ˇ .˛;ˇ/ ˛ ˇz m1 ˇˇ
ˇU .e I z/ U .e I z/ mz
ˇ n m n m
nCˇ ˇ
m .m 1/ ˛ 2 2m .m 1/ .m 2/ ˛ m2 m .m 1/ ˇ 2 m
r m2 C r C r
2 .n C ˇ/ 2 n .n C ˇ/ 2 .n C ˇ/2
m .m 1/ ˛ˇ 2m2 .m 1/ ˇ m m .m 1/ ˇ m
C r m1 C r C r :
.n C ˇ/ 2 n .n C ˇ/ .n C ˇ/2

Theorem 6.15 ([187]). Let R > 1, f 2 H .DR /, and 0 < ˛ ˇ. If f is not a
constant, then for any r 2 Œ1; R/, we have

.˛;ˇ/ 1
Un .f / f Cr .f / ; n 2 N;
r nC1
where the constant Cr .f / depends on f and r but is independent of n:

Proof. For all z 2 DR and n 2 N, we get
Un.˛;ˇ/ .f I z/ f .z/

1 nC1
D .˛ ˇz/ f 0 .z/ C z .1 z/ f 00 .z/
nC1 nCˇ

˛ ˇz 0 z .1 z/ 00
C .n C 1/ Un.˛;ˇ/ .f I z/ f .z/ f .z/ f .z/ :
nCˇ nC1
It follows that

.˛;ˇ/
Un .f / f
r
8 9
nC1
1 < nCˇ .˛e0 ˇe1 / f 0 C e1 .1 e1 / f 00

=
:
r
n C 1 : .n C 1/ Un
.˛;ˇ/
.f / f ˛e0 ˇe1 f 0 e1 .1e1 / f 00 ;
nCˇ nC1 r
Because, by hypothesis, f is not a constant function in DR , it follows that

nC1
.˛e ˇe / f 0
C e .1 e / f 00
n C ˇ 0 1 1 1 > 0:
r
Indeed, if we assume the contrary, it follows that nC1

nCˇ
.˛ ˇz/ f 0 .z/ C
z .1 z/ f 00 .z/ D 0 for all z 2 Dr : Writing the expansion of f 0 .z/ and f 00 .z/
in the last equality, we can see that am D 0 for m D 1; 2; : : : : Thus, f is constant,
which contradicts the hypothesis.
Now, by Theorem 6.14, we have
ˇ ˇ
ˇ ˛ˇz 0 z .1z/ 00 ˇˇ
.nC1/ ˇˇUn.˛;ˇ/ .f I z/ f .z/ f .z/ f .z/ˇ ! 0 as n ! 1:
nCˇ nC1
Moreover,

nC1
0 00 0 00
nCˇ .˛e0 ˇe1 / f Ce1 .1e1 / f ! .˛e0 ˇe1 / f Ce1 .1e1 / f r
r
as n ! 1: Consequently, there exists n1 (depending only on f and r) such that for

all n n1 , we have

nC1
.˛e ˇe / f 0
C e .1 e / f 00
n C ˇ 0 1 1 1
r

.˛;ˇ/ ˛e0 ˇe1 0 e1 .1 e1 / 00
.n C 1/ U
n .f / f f f

nCˇ nC1 r

1 n C 1
.˛e0 ˇe1 / f 0 C e1 .1 e1 / f 00 ;
2 n C ˇ r
which implies

.˛;ˇ/ 1 .˛e0 ˇe1 / f 0 Ce1 .1e1 / f 00 ; for all n n1 :
Un .f / f r
r 2 .nC1/
For 1 n n1 1, we have
1
.˛;ˇ/ 1
Un .f / f .n C 1/ Un.˛;ˇ/ .f / f D Mr;n .f / > 0;
r nC1 r nC1
which finally implies that

.˛;ˇ/ 1
Un .f / f Cr .f / ; for all n;
r nC1
˚
with Cr .f /Dmin Mr;1 .f /; : : : ;Mr;n1 1 .f /; 12 k.˛e0 ˇe1 / f 0Ce1 .1e1 / f 00 kr :

6.5 New Complex Durrmeyer Operators
In 2010, Anastassiou and Gal [28] studied the approximation properties of the
complex Bernstein–Durrmeyer operator defined by
X
n Z 1
Dn .f; z/ D .n C 1/ pn;k .z/ f .t/pn;k .t/dt; z 2 C; (6.9)
kD0 0
where

n k
pn;k .z/ WD z .1 z/nk :
k
We have
1 C nz n.n 1/z2 C 4nz C 2

Dn .1; z/ D 1; Dn .t; z/ D ; Dn .t 2 ; z/ D ;
nC2 .n C 2/.n C 3/
and the following asymptotic formula holds (see [28]):
lim nŒDn .f; z/ f .z/ D Œz.1 z/f 0 .z/0 ;

n!1
uniformly in compact disks jzj r with r 1. Now, if we change the origin

and scale of the above operators and we define rn .x/ D .nC2/x1 , then we get
1 2 n
rn .x/ 2 Œ0; 1 for all x 2 3 ; 3 . Also, by replacing z D x 2 Œ0; 1 in the definition
of Dn .f; z/ by rn .x/, we can define the new Durrmeyer-type operators as
X
n Z 1
1 2
Tn .f; x/ D .n C 1/ mn;k .x/ f .t/pn;k .t/dt; x 2 ; ; (6.10)
0 3 3
kD0
with

n ..n C 1/ .n C 2/x/nk ..n C 2/x 1/k
mn;k .x/ WD ;
k nn
where by simple computation, we now get
Tn .1; x/ D 1; Tn .t; x/ D x;
.n 1/.n C 2/2 x 2 C 2.n2 C 3n C 2/x .n C 1/

Tn .t 2 ; x/ D
n.n C 2/.n C 3/
6.5 New Complex Durrmeyer Operators 197
and the following new asymptotic formula:

1 2
lim nŒTn .f; x/ f .x/ D x.1 x/f 00 .x/; uniformly in ; :
n!1 3 3
Thus, by Korovkin’s theory, the new real operators Tn .f; x/ keep good approx-
imation properties on the interval 13 ; 23 . The aim of this section is to present
approximation results for the complex operator Tn .f; z/, z 2 C, n 2 N. Such
results provide evidence of the overconvergence phenomenon for this new type
of Durrmeyer-type operator, that is, the extensions of approximation
properties
with exact quantitative estimates, from the real interval 13 ; 23 , to compact disks
in the complex plane centered at the origin. To prove the main results, we need the
following lemmas:
Lemma 6.11 ([79]). For all ep D t p ; p 2 N [ f0g, and z 2 C, we have
Œ.n C 2/z 1Œ.n C 1/ .n C 2/z 0

Tn epC1 ; z D Tn e p ; z
n.n C 2/.n C p C 2/
.n C 2/z C p
C Tn ep ; z : (6.11)
nCpC2
Lemma 6.12 ([79]). For all n 2 N and z 2 C, we have Tn .f; z/ D Dn .f; rn .z//.
P
Theorem 6.16 ([79]). Let 1 r < R4 and f .z/ D 1 kD0 ck z for all jzj < R. For
k
all jzj r and n 2 N, we have
Cr .f /
jTn .f; z/ f .z/j
;
n
P P1
where Cr .f / D 2 1 jcp jp.p C 1/.4r/p C pD1 jcp j p .3r/
p
<
P1 pD1
3 pD1 jcp jp.p C 1/.4r/p < 1.
Proof. By Lemma 6.12, we have
jTn .f; z/ f .z/j D jDn .f; rn .z// f .rn .z// C f .rn .z// f .z/j
jDn .f; rn .z// f .rn .z//j C jf .rn .z// f .z/j :
ˇP since for jzj ˇ r and

On the other hand,
P1
r 1 we have jrn .z/j 4r and
ˇ kˇ
jf .rn .z//j D ˇ 1 c .r
kD0 k n .z// ˇ kD0 jck j.4r/
k
< 1, by making the
.nC2/z1
substitution u D n in Corollary 2.2(ii) in [28], we immediately obtain
M4r .f /
jDn .f; rn .z// f .rn .z//j ;
n
P1
where M4r .f / D 2 pD1 jcp jp.p C 1/.4r/p .
Also, by the mean value theorem in complex analysis, for all jzj r, it follows
that
1
3r 0 1X
jf .rn .z// f .z/j jrn .z/ zjkf 0 k3r kf k3r jcp jp.3r/p ;
n n pD1
which proves the theorem. Note here the notation kf kr D supjzjr jf .z/j.
Theorem 6.17 ([79] Voronovskaja-type result). Let R > 4, and suppose that f W
DR ! C is analytic in DR D fz 2 C W jzj <
P Rg; that is, we can write f .z/ D
1
kD0 ck z , for all z 2 DR . For any fixed r 2 1; 4 and for all n 2 N; jzj r, we
k R
have
ˇ ˇ
ˇ 00 ˇ
ˇTn .f; z/ f .z/ z.1 z/f .z/ ˇ Mr .f / ;
ˇ n ˇ n2
P1
where Mr .f / D kD1 jck jkBk;r .4r/k < 1 and
Bk;r D Ak C 5k 3 .r C 1/;
with
Ak D k 3 C 2k 2 C 3k C 2 C 2.k 1/2 .k C 2/ C .k 1/
Œ2k 2 C 4k C 4 C 2.k C 2/.2k C 3/
C.k 1/Œ2.k 1/2 C 1 C .k 1/.k C 2/
C.k 1/2 .k C 2/ C .k 1/.k 2/2 :
Proof. We denote ek .z/ D zk ; k D 0; 1; 2; : : : and k;n .z/ D Tn .ek ; z/. By the

above Lemma 6.12 P and by the proof of Corollary 2.2(ii) in [28], we can clearly
write Tn .f; z/ D 1
kD0 ck k;n .z/. Also, since
1
z.1 z/f 00 .z/ z.1 z/ X
D ck k.k 1/zk2
n n
kD2
1
X
1
D ck Œk.k 1/ k.k 1/zzk1 ;
n
kD1
it follows that
ˇ ˇ
ˇ 00 ˇ
ˇTn .f; z/ f .z/ z.1 z/f .z/ ˇ
ˇ n ˇ
1 ˇ ˇ
X ˇ k.k 1/.1 z/zk1 ˇˇ
ˇ
jck j ˇk;n .z/ ek .z/
n ˇ;
kD1
for all z 2 DR ; n 2 N.
By Lemma 6.11, for all n 2 N; z 2 C, and k D 0; 1; 2; : : :, we have
Œ.n C 2/z 1Œ.n C 1/ .n C 2/z 0 .n C 2/z C k

kC1;n .z/ D k;n .z/ C k;n .z/:
n.n C 2/.n C k C 2/ nCkC2
If we denote
k.k 1/.1 z/zk1

Ek;n .z/ D k;n .z/ ek .z/ ;
n
then, because by Lemma 6.12 we have k;n .z/ D Dn .ek ; rn .z// .z/, it follows by
(2.1) in [28] that Ek;n .z/ is a polynomial of degree less than or equal to k. By simple
computation and by using the above recurrence relation, we are led to
Œ.n C 2/z 1Œ.n C 1/ .n C 2/z 0

Ek;n .z/ D Ek1;n .z/
n.n C 2/.n C k C 1/
.n C 2/z C k 1
C Ek1;n .z/ C Xk;n .z/; (6.12)
nCkC1
where
Œ.n C 2/z 1Œ.n C 1/ .n C 2/z

Xk;n .z/ D
n.n C 2/.n C k C 1/

.k 1/.k 2/2 k3 .k 1/2 .k 2/ k2
.k 1/zk2 C z z
n n

.n C 2/z C k 1 k1 .k 1/.k 2/ k2 .k 1/.k 2/ k1
C z C z z
nCkC1 n n
k.k 1/ k1 k.k 1/ k .n C 2/2 z .n C 2/2 z2 .n C 1/
zk z C z D
n n n.n C 2/.n C k C 1/

.k 1/.k 2/2 k3 .k 1/2 .k 2/ k2
.k 1/zk2
C z z
n n

.n C 2/z C k 1 k1 .k 1/.k 2/ k2 .k 1/.k 2/ k1
C z C z z
nCkC1 n n
k.k 1/ k1 k.k 1/ k zk2

zk z C z D
n n n.n C 2/.n C k C 1/

.k 1/.k 2/2 .k 1/2 .k 2/
.k 1/.n C 2/2 z C .n C 2/2 .n C 2/2 z
n n
.k 1/.k 2/2 .k 1/2 .k 2/
.n C 2/2 .k 1/z2 .n C 2/2 z C .n C 2/2 z2
n n
.k 1/.k 2/2 .k 1/2 .k 2/
.n C 1/.k 1/ .n C 1/ C .n C 1/
nz n
Cn.n C 2/2 z2 C .k 1/.k 2/.n C 2/2 z .k 1/.k 2/.n C 2/2 z2
C.k 1/n.n C 2/z C .k 1/2 .k 2/.n C 2/ .k 1/2 .k 2/.n C 2/z
n.n C 2/.n C k C 1/z2 k.k 1/.n C 2/.n C k C 1/z

Ck.k 1/.n C 2/.n C k C 1/z 2
zk2 .n C 2/
D z .k 1/.n C 2/ .k 1/2 .k 2/
n.n C k C 1/ n
.n C 2/
.k 1/.k 2/2
n

C.k 1/.k 2/.n C 2/ C .k 1/n .k 1/ .k 2/ k.k 1/.n C k C 1/
2
.n C 2/
Cz2 .n C 2/.k 1/ C .k 1/2 .k 2/ C n.n C 2/
n

.k 1/.k 2/.n C 2/ n.n C k C 1/ C k.k 1/.n C k C 1/

.k 2/2 nC1 .n C 1/
C.k 1/ .n C 2/ C .k 1/.k 2/
n nC2 n.n C 2/

C.k 1/.k 2/
zk3
.k 1/.k 2/2 .n C 1/
n2 .n C 2/.n C k C 1/

zk2 .n C 2/
D z.k 1/ 2k C 4k 4 .k 2/.2k 3/
2
n.n C k C 1/ n

.n C 2/
Cz2 k 3 2k 2 C 3k 2 C .k 1/2 .k 2/
n

2 .n C 2/ .n C 1/
C.k 1/ .k 2/ C .k 1/.k 2/
n .n C 2/
zk2
C .k 1/2 .k 2/.n C 1/
n2 .n C 2/.n C k C 1/
zk3
.k 1/.k 2/2 .n C 1/;
n2 .n C 2/.n C k C 1/
for all k 1; n 2 N, and jzj r.

Now, using the estimate in Theorem 6.16 for f .z/ D ek .z/, we get
3.k C 1/2 .4r/k

jk;n .z/ ek .z/j ;
n
for all k; n 2 N; jzj r, with 1 r.

Since for all k; n 2 N; k 1, and jzj r, we have
ˇ ˇ
ˇ Œ.n C 2/z 1Œ.n C 1/ .n C 2/z ˇ Œ.n C 2/r C 1Œ.n C 1/ C .n C 2/r
ˇ ˇ
ˇ n.n C 2/.n C k C 1/ ˇ n.n C 2/.n C k C 1/
.n C 2/2 .r C 1/2 .r C 1/2
;
n.n C 2/.n C k C 1/ n
and
ˇ ˇ
ˇ .n C 2/z C k 1 ˇ .n C 2/r C k 1
ˇ ˇ 3r;
ˇ nCkC1 ˇ nCkC1
from (6.12), it easily follows that
.r C 1/2 0
jEk;n .z/j jEk1;n .z/j C 3rjEk1;n .z/j C jXk;n .z/j:
n
0
Now we shall find the estimation of jEk1;n .z/j for k 1. Taking into account the
fact that Ek1;n .z/ is a polynomial of degree k 1, we have
0 k1
jEk1;n .z/j jjEk1;n jjr
r
ˇˇ ˇˇ
k1 ˇˇ .k 1/.k 2/ek2 Œ1 e1 ˇˇ
jjk1;n ek1 jjr C ˇˇˇˇ ˇˇ
ˇˇ
r n r

k 1 3k 2 .4r/k1 r k2 k 2 .1 C r/
C
r n n

k3 1 C r k1 5k 3 .4r/k1
3.4r/ k1
C r :
n r n
Thus,
.r C 1/2 0 5k 3 .r C 1/.4r/k
jEk1;n .z/j
n n2
and
5k 3 .r C 1/.4r/k
jEk;n .z/j C 3rjEk1;n .z/j C jXk;n .z/j;
n2
where

r k2 2 3
jXk;n .z/j r .k C 2k 2 C 3k C 2 C 2.k 1/2 .k C 2//
n2
Cr.k 1/.2k 2 C 4k C 4 C 2.k C 2/.2k C 3//

C.k 1/.2.k 2/ C 1 C .k 1/.k C 2//
2
r k2 .k 1/2 .k C 2/ r k3 .k 1/.k 2/2 .4r/k

C C Ak ;
n2 n2 n2
for all jzj r; k 1; n 2 N, with
Ak D k 3 C 2k 2 C 3k C 2 C 2.k 1/2 .k C 2/ C .k 1/
Œ2k 2 C 4k C 4 C 2.k C 2/.2k C 3/
C.k 1/Œ2.k 1/2 C 1 C .k 1/.k C 2/
C.k 1/2 .k C 2/ C .k 1/.k 2/2 :
Thus, for all jzj r; k 1; n 2 N,
.4r/k .4r/k
jEk;n .z/j 3rjEk1;n .z/j C Bk;r 4rjE k1;n .z/j C Bk;r ;
n2 n2
where Bk;r is a polynomial of degree 3 in k defined as
Bk;r D Ak C 5k 3 .r C 1/:
But E0;n .z/ D 0, for any z 2 C , and therefore by writing the last inequality for
k D 1; 2; : : :, we easily obtain, step by step, the following:
.4r/k X
k
k.4r/k
jEk;n .z/j Bj;r Bk;r :
n2 j D1 n2
We conclude that
ˇ ˇ X 1 1
ˇ 00 ˇ
ˇTn .f; z/ f .z/ z.1 z/f .z/ ˇ 1 X
ˇ ˇ jck jjE k;n j jck jkBk;r .4r/k :
n n2
kD1 kD1
P
As f .4/ .z/ D 1 kD4 ck k.k1/.k2/.k3/z P1
k4
and the series is absolutely conver-
gent in jzj r, it easily
P1 follows that kD4 jck jk.k 1/.k 2/.k 3/r k4 < 1,
kD1 jck jkBk;r r < 1. This completes the proof of the
k
which implies that
theorem.
Remark 6.1. It is interesting to note that although by Lemma 6.12, the opera-
tor Tn is the Mn operator but taken on the value .nC2/z1 n instead of z, their
asymptotic limits differ essentially. More exactly, while by Theorem 6.17 we have
limn!1 nŒTn .f; z/ f .z/ D z.1 z/f 00 .z/, uniformly for jzj r, by Theorem
2.4 in [28], we have limn!1 nŒMn .f; z/ f .z/ D Œz.1 z/f 0 .z/0 , uniformly for
jzj r.
Theorem 6.18 ([79] Exact order of approximation). Let R > 4, Pand suppose
that f W DR ! C is analytic in DR ; that is, we can write f .z/ D 1 kD0
k
ck z , for
all z 2 DR . If f is not a polynomial of degree 1, then for any r 2 1; 4 , we have
R
Cr .f /
kTn .f; / f kr ; n 2 N;
n
where Cr .f / depends only on f and r.

Proof. For all z 2 Dr and n 2 N, we have
Tn .f; z/ f .z/

1 00 1 z.1 z/f 00 .z/
D z.1 z/f .z/ C n Tn .f; z/ f .z/
2
:
n n n
Also, we have
jjF C Gjjr jjjF jjr jjGjjr j jjF jjr jjGjjr :
It follows that
jjTn .f; / f jjr

ˇˇ ˇˇ
1 1 ˇˇ e1 .1 e1 /f 00 ˇˇˇˇ
jje1 .1 e1 /f 00 jjr n2 ˇˇˇˇTn .f; / f ˇˇ :
n n n r
Taking into account that, by hypothesis, f is not a polynomial of degree 1 in DR ,

we get jje1 .1 e1 /f 00 jjr > 0.
Indeed, suppose to the contrary that it follows that z.1 z/f 00 .z/ D 0 for all
jzj r; that is, f .z/ D az C b for all jzj r with z 6D 0 and z 6D 1. But since f is
analytic in DR and r 1, by the identity theorem on analytic functions, it follows
that f .z/ D az C b for all jzj r, and therefore f .z/ D az C b for all jzj < R,
which contradicts the hypothesis.
Now by Theorem 6.17, we have
ˇˇ ˇˇ
ˇˇ e1 .1 e1 /f 00 ˇˇˇˇ
n2 ˇˇˇˇTn .f; / f ˇˇ Mr .f /:
n r
Therefore, there exists an index n0 depending only on f and r such that for all
n n0 , we have

ˇˇ ˇˇ
00 1 ˇˇ
2 ˇˇ e1 .1 e1 /f 00 ˇˇˇˇ 1
jje1 .1e1 /f jjr n ˇˇTn .f; / f ˇ ˇ jje1 .1e1 /f 00 jjr ;
n n r 2
which immediately implies
1
jjTn .f; / f jjr jje1 .1 e1 /f 00 jjr ; 8n n0 :
2n
M .f /
For n 2 f1; 2; : : : n0 1g, we obviously have jjTn .f; / f jjr r;nn , with
Mr;n .f / D jjTn .f; / f jjr > 0. Indeed, if we had jjTn .f; / f jjr D 0, then
it would follow that Tn .f; z/ D f .z/ for all jzj r, which is valid only for f ,
a linear function, contradicting the hypothesis on f . Therefore, we finally obtain
jjTn .f; / f jjr Cr n.f / for all n, where
1
Cr .f / D minfMr;1 .f /; Mr;2 .f /; : : : ; Mr;n0 1 .f /; jje1 .1 e1 /f 00 jjr g;
2
Theorem 6.19 ([79] Simultaneous approximation).P Let Rk > 4, and suppose that
f W DR ! C is analytic in DR ; that is, f .z/ D 1
kD0 ck z , for all z 2 DR . Also,
let 1 r < r1 < R4 and p 2 N be fixed. If f is not a polynomial of degree
maxf1; p 1g, then we have
1
jjTn.p/ .f; / f .p/ jjr
;
n
where the constants in the equivalence depend only on f; r; r1 , and p.

Proof. Denoting by the circle of radius r1 with its center at 0 (where r1 > r 1),
by Cauchy’s integral formula for derivatives, we have for all jzj < r and n 2 N,
Z
pŠ Tn .f; u/ f .u/
Tn.p/ .f; z/ f .p/
.z/ D d u;
2 i .u z/pC1
which, by Theorem 6.16 and by the inequality ju zj r1 r valid for all jzj r
and u 2 , implies
pŠ 2 r1 pŠr1
jjTn.p/ .f; / f .p/ jjr jjTn .f; / f jjr Cr1 .f / :
2 .r1 r/ pC1 n.r1 r/pC1
.p/
It remains to prove the lower estimation for jjTn .f; / f .p/ jjr :
First, evidently for all u 2 and n 2 N, we can write the identity
Tn .f; u/ f .u/

1 00 1 u.1 u/f 00 .u/
D u.1 u/f .u/ C n Tn .f; u/ f .u/
2
:
n n n
Substituting it in the earlier Cauchy integral formula, we obtain

1
Œz.1 z/f 00 .z/.p/
Tn.p/ .f; z/ f .p/ .z/ D
n

Z n2 Tn .f; u/ f .u/ u.1u/f 00 .u/
1 pŠ n
C du :
n 2 i .u z/pC1
This implies

ˇˇ .p/ ˇˇ
ˇˇT .f; / f .p/ ˇˇ 1 jjŒe1 .1 e1 /f 00 .p/ jjr
n r n
ˇˇ ˇˇ
ˇˇ Z n2 Tn .f; u/ f .u/ u.1u/f 00 .u/ ˇˇ
1 ˇˇˇˇ pŠ n ˇˇ
ˇˇ d uˇˇˇˇ :
n ˇˇ 2 i .u / pC1
ˇˇ
r
Now, applying Theorem 6.17, we get

ˇˇ ˇˇ
ˇˇ Z n2 Tn .f; u/ f .u/ u.1u/f 00 .u/ ˇˇ
ˇˇ pŠ n ˇˇ
ˇˇ d uˇˇˇˇ
ˇˇ 2 i .u / pC1
ˇˇ ˇˇ
r
ˇˇ ˇˇ
ˇˇ 00 ˇˇ
ˇˇTn .f; / f e1 .1 e1 /f ˇˇ Mr1 .f /pŠr1 :
2
pŠ 2 r1 n

2 .r1 r/pC1 ˇˇ n ˇˇ
r .r1 r/pC1
But, by hypothesis on f , we have jjŒe1 .1 e1 /f 00 .p/ jjr > 0.

Indeed, if we suppose the contrary, it would follow that Œz.1 z/f 00 .z/.p/ D 0,
for all jzj r. This would imply that z.1 z/f 00 .z/ D Qp1 .z/, for all jzj r,
where Qp1 .z/ is a polynomial of degree p 1.
Suppose first that p D 1. It would follow that z.1 z/f 00 .z/ D C , where C is a
constant, and because of the analyticity of f 00 in jzj r with r 1, it necessarily
would follow that C D 0; that is, f 00 .z/ D 0, for all jzj r, which is equivalent
to f .z/ D az C b, for all jzj r, contradicting the hypothesis in Theorem 6.19 for
p D 1.
Suppose now that p D 2. It would follow that z.1z/f 00 .z/ D azCb and because
of the analyticity of f 00 in jzj r with r 1, it necessarily would follow that
a D b D 0; that is, f 00 .z/ D 0, for all jzj r, which is equivalent to f .z/ D AzCB,
for all jzj r, again contradicting the hypothesis in Theorem 6.18 for p D 2.
Now, if we suppose that p 3, the analyticity of f 00 would imply that
Qp1 .0/ D Qp1 .1/ D 0 (because otherwise the analyticity of f 00 .z/ for jzj r,
with r 1, would be contradicted). Therefore, after simplification with z.1 z/, we
would obtain that f 00 is a polynomial of degree p 3, namely, that f would be
a polynomial of degree p 1, contradicting the hypothesis.
In conclusion, jjŒe1 .1 e1 /f 00 .p/ jjr > 0, and in continuation, reasoning exactly
as in the proof of Theorem 6.18, we immediately get the desired conclusion.
6.6 Complex q-Durrmeyer-Type Operators
In recent years, applications of q-calculus in the area of approximation theory and

number theory have been an active area of research. In 2008, Gupta and Wang
[131] introduced certain q-Durrmeyer-type operators of the real variable x 2 Œ0; 1
and studied some approximation results in the case of real variables. Agrawal
and Gupta [15] extended this study in 2012 to the complex variable for analytic
functions in compact disks. They established the quantitative Voronovskaja-type
estimate. In this way, we provided evidence of the overconvergence phenomenon for
these q-Durrmeyer polynomials, namely, the extensions of approximation properties
(with quantitative estimates) from the real interval Œ0; 1 to compact disks in the
complex plane.
For ready reference, we begin with some notations and definitions of q-calculus:
For each nonnegative integer k, the q-integer Œkq and the q-factorial Œkq Š are
defined by

ı
.1 q k / .1 q/; q ¤ 1
Œkq WD ;
k; qD1
6.6 Complex q-Durrmeyer-Type Operators 207
and

Œkq Œk 1q Œ1q ; k 1

Œkq Š WD ;
1; kD0
respectively. For the integers n; k; n k 0, the q-binomial coefficients are

defined by

n Œnq Š
WD :
k q Œkq ŠŒn kq Š
In this section, we present approximation results for the complex q-Durrmeyer

operators (introduced and studied in the case of a real variable by Gupta-Wang
[131]), defined by
X
n Z 1
Mn;q .f I z/ D Œn C 1q q 1k pn;k .qI z/ f .t/pn;k1 .qI qt/dq t
kD1 0
Cf .0/pn;0 .qI z/; (6.13)
where z 2 C; n D 1; 2; : : : I q 2 .0; 1/ and .a b/m q D …j D0 .a q b/, q-Bernstein

m1 j
basis functions, are defined as

n
pn;k .qI z/ WD zk .1 z/nk
q I
k q
also, here the q-Beta functions [163] are given as

Z 1
Bq .m; n/ D t m1 .1 qt/n1
q dq t; m; n > 0:
0
Throughout this section, we use the notation DR D fz 2 C W jzj < Rg, and by
H.D
P1 R /, we mean the set of all analytic functions on f W DR ! C with f .z/ D
kD0 ak z for all z 2 DR . The norm kf kr D maxfjf .z/j W jzj rg. We denote
k
p;n .qI z/ D Mn;q .ep I z/ for all ep D t p ; p 2 N [ f0g :

The following main theorems were studied for the operators (6.13).
P
Theorem 6.20 ([15] Upper bound). Let f .z/ D 1 pD0 ap z for all jzj < R, and
p
let 1 r R; then for all jzj r, q 2 .0; 1/ and n 2 N;

ˇ ˇ
ˇMn;q .f I z/ f .z/ˇ Kr .f / ;
Œn C 2q
P1
where Kr .f / D .1 C r/ pD1 jap jp.p C 1/r p1 < 1.
Theorem 6.21 ([15] Voronovskaja-type asymptotic result). Suppose that f 2
H.DR /; R > 1. Then, for any fixed r 2 Œ1; R and for all n 2 N; jzj r and
q 2 .0; 1/, we have

ˇ ˇ 1
ˇ 00 0 ˇ X
ˇMn;q .f I z/ f .z/ z.1 z/f .z/ 2zf .z/ ˇ Mr .f / C2 .1 q/ jak jkr k ;
ˇ Œnq ˇ Œn2q
kD1
P1
where Mr .f / D kD1 jak jkBk;r r k < 1; and
Bk;r D .k 1/.k 2/ .2k 3/ C 8k.k 1/2 C 6 .k 1/ k 2 C 4k.k 1/2 .1 C r/:
Remark 6.2 ([15]). For q 2 .0; 1/ fixed, we have Œn1 q ! 1 q as n ! 1. Thus,

Theorem 6.2 does not provide convergence. But this can be improved by choosing
1 n12 qn < 1 with qn % 1 as n ! 1. Indeed, since in this case Œn1q ! 0 as
n
n ! 1 and 1 qn 1
n2
1
Œn2qn
from Theorem 6.21, we get
ˇ ˇ 1
ˇ 00 0 ˇ X
ˇMn;q .f I z/ f .z/ z.1 z/f .z/ 2zf .z/ ˇ Mr .f / C 2 jak jkr k :
ˇ n
Œnqn ˇ Œn2qn Œn2qn
kD1
Theorem 6.22 ([15] Exact order). Let 1 n12 qn < 1, n 2 N, R > 1, and let
f 2 H.DR /; R > 1. If f is not a polynomial of degree 0, then for any r 2 Œ1; R/;
we have
Cr .f /
kMn;qn .f I / f kr ; n 2 N;
Œnqn
where the constant Cr .f / > 0 depends on f , r, and the sequence .qn /n2N ; but it is
independent of n.
Corollary 6.1 ([15]). Let 1 n12 < qn < 1 for all n 2 N, R > 1, and suppose that
f 2 H.DR /. If f is not a polynomial of degree 0, then for any r 2 Œ1; R/; we have
1
kMn;qn .f I / f kr
; n 2 N;
Œnqn
where the constants in the above equivalence depend on f; r; and.qn /n but are
independent of n.
In 2012, Ren and Zeng [206] extended the studies on such operators. The operators
(6.13) preserve only constant functions. To make the convergence faster, Ren and
Zeng [206] modified the operators (6.13) by changing the scale of reference by
replacing x by Œn C 2q x=Œnq , so that they reproduce constant as well as linear
functions. The operators discussed in [206] take the following form:
6.6 Complex q-Durrmeyer-Type Operators 209
X
n Z 1
Rn;q .f I x/ D Œn C 1q q 1k tn;k .qI x/ f .t/pn;k1 .qI qt/dq t
kD1 0
Cf .0/tn;0 .qI x/; (6.14)
where x 2 Œ0; Œ31q ; n 2 N; q 2 .0; 1/, q-Bernstein basis functions are defined as in
(6.13), and

n Œn C 2q x k Œn C 2q x nk
tn;k .qI x/ WD 1 :
k q Œnq Œnq q
Remark 6.3 ([206]). If ek .x/ D x k ; k D 0; 1; 2; for 0 < q < 1; x 2 Œ0; Œ31q ; n 2

N, one has
Œ2q x Œn 1q Œn C 2q q 2 x 2

Rn;q .e0 I x/; Rn;q .e1 I x/ D x; Rn;q .e2 I x/ D C :
Œn C 3q Œn C 3q Œnq
For the complex operators Rn;q .f I z/; z 2 C; n 2 N; 0 < q < 1, and tn;k .qI z/ WD

n ŒnC2q z k ŒnC2q z nk
Œnq
1 Œnq
; Ren and Zeng [206] obtained the following
k q q
main results:
Theorem 6.23 ([206] Upper bound). Let 0 < q < 1; R > 3; DR D Pfz 2 C W m
jzj <
Rg: Suppose that f W DR ! C is analytic in DR ; that is, f .z/ D 1mD0 cm z for
all z 2 DR . Take 1 r R=3:
(i) For all jzj r and n 2 N; we have
ˇ ˇ
ˇRn;q .f I z/ f .z/ˇ Kr .f / ;
Œnq
P
where Kr .f / D .1 C r/ 1 mD2 jcm jm.m 1/.Œ3q r/
m1
< 1.
(ii) (Simultaneous approximation) If 1 r r1 < R=3 are arbitrary fixed, then for
all jzj r and n; p 2 N; we have
ˇ ˇ
ˇ .p/ ˇ Kr1 .f /pŠr1
ˇRn;q .f I z/ f .p/ .z/ˇ ;
Œnq .r1 r/pC1
where Kr1 .f / is as defined in part (i).

Theorem 6.24 ([206] Voronovskaja-type asymptotic result).PLet 0 < q <
1
1; R > 3, and suppose that f W DR ! C; that is, f .z/ D k
kD0 ck z for all
z 2 DR . For any fixed r 2 Œ1; R=3 and for all n 2 N; jzj r, we have
ˇ ˇ
ˇ 00 ˇ
ˇRn;q .f I z/ f .z/ z.1 z/f .z/ ˇ Mr .f / ;
ˇ Œnq ˇ Œn2q
P1
where Mr .f / D kD2 jck j.k 1/Fk;r .Œ3q r/k < 1; and
Fk;r D .k 1/.k 2/ .2k 3/C6k.k 1/2 C4 .k 1/ k 2 C4.k 2/.k 1/2.1Cr/:
Theorem 6.25 ([206] Exact order). Let 0 < qn < 1 satisfy limn!1 qn D 1; R >
3; DR D fz 2 C W jzj < Rg. Suppose that f W DR ! C is analytic in DR . If f is
not a polynomial of degree 1, then for any r 2 Œ1; R=3/, we have
Cr .f /
kRn;qn .f I / f kr ; n 2 N;
Œnqn
where jjf jjr D maxfjf .z/j W jzj rg and the constant Cr .f / > 0 depends on f; r
and on the sequence fqn gn2N but is independent of n:
6.7 Complex q-Bernstein–Schurer Operators
The approximation properties of a class of complex q-Bernstein–Schurer operators

was studied by Ren and Zeng in 2013 [207]. They obtained the order of simul-
taneous approximation and a Voronovskaja-type result with quantitative estimate
for these complex q-Bernstein–Schurer operators attached to analytic functions
on compact disks. More importantly, their results show the overconvergence phe-
nomenon for these complex operators. The complex q-Bernstein–Schurer operators
defined for any fixed p 2 f0; 1; 2; : : :g by
nCp
X nCp Y
nCpk1
Sn;p .f I qI z/ D zk .1 q s z/f .Œkq =Œnq /; (6.15)
k q
kD0 sD0
where z 2 C; n 2 N; 0 < q < 1; an empty product is taken to be equal to 1:

Obviously, for p D 0; the operators defined by (6.15) reduce to q Bernstein polyno-
mials. Denote by f Œx0 ; x1 ; : : : ; xk the usual divided difference; that is, f Œx0 D
f .x0 /, f Œx0 ; x1 D f .xx11/f
x0
.x0 /
, and f Œx0 ; x1 ; : : : ; xk D f .x1 ;:::;xkx/f .x0 ;:::;xk1 /
k x0
:
Œj
Denote by 4kq the finite difference of order k, that is, 40q fj D fj D f . Œnqq /,
Œj
4kq fj D 4k1
q fj C1 q 4q fj , where xj D Œnqq , fj D f .xj /. The complex
k1 k1
q-Bernstein–Schurer operators given by (6.15) may be expressed in the form
nCp
X nCp
Sn;p .f I qI z/ D 4jq f0 ej .z/;
j
j D0
q
6.7 Complex q-Bernstein–Schurer Operators 211
j
where ej .z/ D zj , 4q f0 is represented as
Œj q Šq j.j 1/=2
4jq f0 D 4jq f .x0 / D j
f Œx0 ; x1 ; : : : ; xj :
Œnq
S
Theorem 6.26 ([207] Upper estimate). Let 0 < q < 1: For fixed p 2 N f0g
and R > p C 1; let us denote DR D fz 2 C W jzj P < Rg and let us suppose that
f W DR ! C is analytic in DR ; that is, f .z/ D 1 c
kD0 k zk
for all z 2 DR : Also,
assume that 1 r and r.p C 1/ < R
(i) For all jzj r and n 2 N, we have
jSn;p .f I qI z/ f .z/j Mr;n

.p;q/
.f /;
where
1
X
2.k 1/Œk 1q

.p;q/
0 < Mr;n D jck j Œ.Œpq C 1/rk
Œnq
kD0

1 rk
C Œ.pq C 1/rk < 1: (6.16)
Œnq Œnq
(ii) If 1 r < r1 r1 .p C 1/ < R, then for all jzj r and n; m 2 N, we have
.p;q/
Mr1 ;n .f /mŠr1
jSn;p
.m/
.f; qI z/ f .m/ .z/j :
.r1 r/mC1
Theorem
S 6.27 ([207] Voronovskaja-type result). Let 0 < q < 1: For fixed p 2
N f0g and R > p C 1; let us denote DR D fz 2 CP W jzj < Rg and let us suppose
that f W DR ! C is analytic in DR ; that is, f .z/ D 1 kD0 ck z for all z 2 DR : For
k
all jzj 1 and n 2 N, we have

ˇ ˇ
ˇ ˇ
ˇSn;p .f I qI z/ f .z/ Œpq z f 0 .z/ z.1 z/ f 00 .z/ˇ
ˇ Œnq 2Œnq ˇ
X 1
Mp;q .f /
2
C .1 q/ kjck j.Œpq C 1/k ;
Œnq
kD1
P1
where 0 < Mp;q .f / D kD1 kjck j.Ak;q C Bk;p;q /.Œpq C 1/
k1
< 1; Ak;q D
2.k 1/Œ2.k 1/Œk 1q C 1; and Bk;q;p D .k 1/fŒpq C Œpq .3k 4 C 2Œk
2
1q / C 2k 2 5k C .k 2/.Œk 2q C Œk 1q /g:

Theorem
S 6.28 ([207] Exact order). Let 1 n12 qn < 1; n 2 N: For fixed p 2
N f0g and R > p C 1; let us denote DR D fz 2 C W jzj < Rg and let us suppose
that f W DR ! C is analytic in DR . Assume that we have 1 r and .p C 1/ < R:
If f is not a function of the form f .z/ D 2Œpcq1 C1 :.z 1/2Œpqn C1 C c2 ; with arbitrary
n
complex constants c1 and c2 , then for any r 2 Œ1; R/, we have
ˇˇ ˇˇ
ˇˇSn;p .f I qI :/ f ˇˇ Cr;p;qn .f / ;
r Œnqn
where jjf jjr D maxfjf .z/j W jzj rg and the constant Cr;p;qn .f / > 0 depends only
on f; p; r and on the sequence fqn gn2N , but it is independent of n:
Theorem 6.29 ([207] Simultaneous approximation). Let 1 n12 qn < 1 2 N
and R > p C 1; let us denote DR D fz 2 C W jzj < Rg, and let us suppose that
f W DR ! C is analytic in DR . Also, let m 2 N; 1 r < r1 r1 .p C 1/ < R:
If f is not a function of the form f .z/ D 2Œpcq1 C1 :.z 1/2Œpqn C1 C c2 C Qm1 .z/;
n
where c1 and P c2 are arbitrary complex constants, Qm1 .z/ D 0 if m D 1 and
k
Qm1 .z/ D m1 kD1 ak z if m 2, then we have
ˇˇ ˇˇ
ˇˇ .m/ ˇˇ 1
ˇˇSn;p .f I qn I :/ f .m/ ˇˇ ; n 2 N;
r Œnqn
where jjf jjr D maxfjf .z/j W jzj rg and the constants in the equivalence depend
on f; r; r1 ; p; m and on the sequence fqn gn2N but are independent of n.
Chapter 7
Rate of Convergence for Functions of Bounded
Variation
By Jordan’s theorem , a function is with bounded variation (BV) if and only if it can
be represented as the difference of two increasing (decreasing) functions. It is well
known that univariate functions of bounded variation possess at most a countable
number of discontinuities, all of the first kind. In particular, for f 2 BV .R/ and
x 2 R, the one-sided limits limh!0 f .x C h/ and limh!0 f .x h/ exist, and for
all x 2 R, except at most a countable number of points f satisfy the one-sided
continuity condition
f .x/ D lim f .x C h/ D lim f .x h/;

h!0C h!0C
respectively. Thus,
1
f .x/ D lim Œf .x C h/ C f .x h/:
h!0C 2
This chapter deals with the rate of convergence for certain sequences of operators.
7.1 Fourier and Fourier–Legendre Series
Let f be a 2-periodic function of bounded variation on Œ; , and let SOn .f; x/
be the nth partial sums of the Fourier series of f . If gx .t/ D f .x C t/ C f .x t/
f .C/ f .x/, then
Z
1 1 n sin n C 12 t
SOn .f; x/ Œf .xC/ C f .x/ D dt: (7.1)
2 0 2 sin 2t
Also, the well-known Dirichlet–Jordan theorem (see [259]) states that

214 7 Rate of Convergence for Functions of Bounded Variation

O 1
lim Sn .f; x/ Œf .xC/ C f .x/ D 0: (7.2)
n!1 2
In 1979, Bojanic [43] estimated the quantitative version of the Dirichlet–Jordan

theorem, by proving the inequality.
Theorem 7.1 ([43]). Let g be a 2-periodic function of bounded variation on
Œ0; with g.0/ D 0. Then
ˇ Z ˇ
ˇ 1 n sin n C 1 t ˇ 3 X n
ˇ ˇ =k
ˇ 2
dt ˇ V0 .g/;
ˇ 0 2 sin 2t ˇ n
kD1
for n D 1; 2; : : : :
By (7.1) and Theorem 7.1, Bojanic [43] concluded that for n 1,
ˇ ˇ X
ˇ ˇ n
ˇSOn .f; x/ 1 Œf .xC/ C f .x/ˇ 3 =k
V0 .gx /; (7.3)
ˇ 2 ˇ n
kD1
y
where V0 .gx / is the total variation of gx on Œ0; y, y 2 Œ0; :
Since gx .t/ is a function of bounded variation on Œ0; , continuous at a point
y
t D 0, the total variation V0 .gx /; y 2 Œ0; is a continuous function at y D 0.
=k
Consequently, V0 .gx / ! 0 as k ! 1; which implies that the right-hand side of
(7.3) converges to zero, and Dirichlet–Jordan’s theorem is thus verified.
Another result related to (7.3) was established by Natanson [198], who proved
that for a 2-periodic continuous function of bounded variation on Œ; , one has
ˇ ˇ Z
ˇO ˇ 2 1
ˇSn .f; x/ f .x/ˇ !V .f / .2t/t 2 dt C V .f /; (7.4)
n 4= n n
t
where !V .f / .ı/ is the modulus of continuity of the total variation V .f /, t 2
Œ; , of f:
As for continuous functions of bounded variation, we have V0ı .gx /
Vxı .f / 2!V .f / .ı/. Thus, (7.3) becomes
xCı
ˇ ˇ 6X n
ˇO ˇ
ˇSn .f; x/ f .x/ˇ !V .f / ;
n k
kD1
which is equivalent to Natanson’s estimate (7.4).

In this continuation, Bojanic and Vuilleumier [47] established the rate of
approximation by Fourier–Legendre series. After that, several researchers began to
obtain the estimates on the rate of convergence for different operators.
Let Pn be the Legendre polynomial of degree n normalized so Pn .1/ D 1, and
let f be a function of bounded variation on Œ1; 1:
7.1 Fourier and Fourier–Legendre Series 215
X
n Z 1
1
Sn .f; x/ D ak .f /Pk .x/; ak D k C Pk .t/f .t/dt:
2 1
kD0
In the last century, E. W. Hobson [154] showed that the Fourier–Legendre series of
a function of bounded variation on Œ1; 1 converges at every point x 2 .1; 1/ to
2 Œf .xC/ C f .x/:
1
In 1981, Bojanic and Vuilleumier [47] represented the polynomials Sn .f; x/ as

Z 1 n
X
1
Sn .f; x/ D Kn .x; t/f .t/dt; Kn .x; t/ D kC Pk .x/Pk .t/;
1 2
kD0
and they established the quantitative estimate and general result on the rate of
convergence for Legendre–Fourier series.
Theorem 7.2 ([47]). Let f be a function of bounded variation on Œ1; 1. Then for
every x 2 .1; 1/ and n 2, one has
ˇ ˇ 3=2 X
ˇ ˇ n
ˇSn .f; x/ 1 .f .xC/ C f .x//ˇ 28.1 x/ xC.1x/=k
Vx.1Cx/=k .gx /
ˇ 2 ˇ n
kD1
1
C jf .xC/ f .x/j;
n.1 x 2 /
where
8
< f .t/ f .x/; ; 1 t < x;
gx .t/ D 0; ; t D x;
:
f .t/ f .xC/; ; x < t 1;
and Vab .gx / is the total variation of gx on Œa; b.

As a special case, if f is a continuous function of bounded variation, Theo-
rem 7.2 becomes
ˇ ˇ 3=2 X
ˇ ˇ n
ˇSn .f; x/ 1 .f .xC/ C f .x//ˇ 28.1 x/ xC.1x/=k
Vx.1Cx/=k .gx /:
ˇ 2 ˇ n
kD1
Also, the right-hand side of Theorem 7.2 converges to 0 as n ! 1 since the

continuity of gx .t/ at t D x implies Vxı
xCı
.gx / ! 0; as ı ! 0.
Theorem 7.3 ([47]). Let Kn .x; t/ be a continuous function of two variables on
Œa; b Œa; b, and let Ln be the operator that transforms a function f of bounded
Rb
variation on Œa; b into the function a Kn .x; t/f .t/dt; x 2 Œa; b: If, for a fixed
x 2 .a; b/ and n 1, the kernel Kn .x; t/ satisfies the conditions
ˇR x ˇ ˇR ˇ
ˇ b ˇ
(i) ˇ a Kn .x; t/dt 12 ˇ A.x/
n and ˇ x Kn .x; t/dt 12 ˇ A.x/
n ;
R xC.bx/=n
(ii) x.xa/=n jKn .x; t/jdt B.x/;
ˇR ˇ
ˇ t ˇ C.x/
(iii) ˇ a Kn .x; t/dt ˇ n.t x/ ; .a t < x < b/;
ˇR ˇ
ˇ b ˇ C.x/
ˇ t Kn .x; t/dt ˇ n.t x/ ; .a < x < t b/;
where A.x/; B.x/, and C.x/ are positive functions on .a; b/, then there exists
a positive number M.f; x/ depending only on f and x such that
ˇ ˇ X
ˇ ˇ n
ˇLn .f; x/ 1 .f .xC/ C f .x//ˇ M.f; x/ xC.bx/=k
Vx.xa/=k .gx /;
ˇ 2 ˇ n
kD1
where
8
< f .t/ f .x/; a t < x;
gx .t/ D 0; t D x;
:
f .t/ f .xC/; x < t b:
7.2 Hermite–Fejér Polynomials
Let f be a function defined on Œ1; 1. The Hermite–Fejér

interpolation polynomial
Hn .f; x/ of f based on the zeros xk n D cos .2k1/
2n ; k D 1; 2; : : : ; n of the
Chebyshev polynomials Tn .x/ D cos.n cos1 x/ is defined by
X
n 2
Tn .x/
Hn .f; x/ D f .xk n /.1 xk n x/ : (7.5)
n.x xk n /
kD1
If f .x/ is a continuous function on Œ1; 1, Fejér [67] proved that the polynomials
Hn .f; x/ converge uniformly to f .x/: The convergence behavior of Hn .f; x/ of a
bounded variation function on Œ1; 1 was studied by Bojanic and Cheng [44].
Theorem 7.4 ([44]). If f 2 BV Œ1; 1 and is continuous at x 2 .1; 1/, then
Hn .f; x/ converges to f .x/ when n tends to 1, and the rate of convergence of
Hn .f; x/ to f .x/ satisfies the inequality
64Tn2 .x/ X xC=k

n
xCŒT .x/=2n
jHn .f; x/ f .x/j Vx=k .f / C 2VxŒTnn.x/=2n .f /;
n
kD1
where Vab .f / is the total variation of f on Œa; b; this estimate cannot be improved
asymptotically.
7.3 Exponential-Type Operators 217
If x is a point of discontinuity of f , where f .xC/ ¤ f .x/, the sequence

.Hn .f; x// is no longer convergent. It follows from the following observation
(see [44]):
sup 1 1
lim Hn .f; x/ D Œf .xC/ C f .x/ ˙ Œf .xC/ f .x/ˇ.x/; (7.6)
n!1 inf 2 2
where ˇ.x/ D 1 if x D cos.˛/ and ˛ is irrational, and

2 1
!
sin.=2q/ X 8qk
ˇ.x/ D 1 ;
=2q .4q k 2 1/2
2
kD1
if x D cos.p=q/: The above equation (7.6) shows that, unlike Fourier series
of 2-periodic functions of bounded variation, which all converge to .f .xC/ C
f .x//=2, the Hermite–Fejér interpolation polynomials of a function of bounded
variation converge only if f .xC/ D f .x/.
Although smoother functions have many applications in various fields, such as
computer vision, CAGD , graphics, and image processing, the asymptotic behavior
of Hermite–Fejér interpolation polynomials for functions smoother than continuous
functions has been studied only for functions with continuous derivatives.
7.3 Exponential-Type Operators
In 1976, May [189] studied some direct, inverse, and saturation results for the linear
combinations of exponential-type operators. He was able to improve the order of
approximation by considering linear combinations in local approximation. In fact,
exponential-type operators include some well-known operators as special cases.
In this section, we present the rate of convergence for BV functions for certain
exponential-type operators.
Let f be a function defined on Œ0; 1. The Bernstein polynomial of degree n is
defined as
X
n
Bn .f; x/ D pn;k .x/f .k=n/; (7.7)
kD0
where the Bernstein basis function is defined by

n
k
Bernstein [37] showed that Bn .f; x/ converges to f .x/ uniformly on the interval
Œ0; 1 if f is continuous. As for discontinuous functions, Herzog and Hill [152]
proved that if f is bounded on Œ0; 1 and x is a point of discontinuity of the first
kind, then
1
lim Bn .f; x/ D Œf .xC/ C f .x/ :
n!1 2
As a special case, if f is of bounded variation on Œ0; 1, then this convergence holds
for every x 2 .0; 1/. Cheng [54] estimated the rate of convergence for Bernstein
polynomials of functions of bounded variation.
Theorem 7.5 ([54]). Let f be a function of bounded variation on Œ0; 1. Then for
every x 2 .0; 1/ and n .3=x.1 x//8 , one has
ˇ ˇ
ˇ ˇ X
n p
ˇBn .f; x/ 1 .f .xC/ C f .x//ˇ 3
V
xC.1x/= k
p .gx /
ˇ 2 ˇ nx.1 x/ xx= k
kD1
18.x.1 x//5=2
C jf .xC/ f .x/j;
n1=6
where
8
< f .t/ f .x/; 0 t < x;
gx .t/ D 0; t D x;
:
f .t/ f .xC/; x < t 1;

In 1989, Guo and Khan [91] observed that the preceding Theorem 7.5 can be
improved considerably. They extended a modified form of this result in three ways:
(i) hold for all n; (ii) be asymptotically sharp; (iii) hold for a general class of
operators, including the classical operators such as Bernstein, Szász, Baskakov,
Gamma , and Weierstrass operators. They considered the following operators due
to Feller [68]. Let fXn ; n 1g be a sequence of independent and identically
distributed random variables with a finite variance such that E.X1 / D x 2 I
R D .1; 1/, Var.X1 / D 2 .x/ > 0. Set Sn D X1 C X2 C : : : C Xn . For a
function f , define the approximation operator as
Z 1
Ln .f; x/ D Eff .Sn =n/g D f .t=n/dFn;x .t/; (7.8)
1
where Fn;x .t/ is the distribution function .df / of Sn and jf j is Fn;x -integrable.
Theorem 7.6 ([91]). Let f 2 BV .1; 1/. Then for every x 2 .1; 1/ and all
n D 1; 2; : : :, for the Feller operator (7.8), we have
ˇ ˇ
ˇ ˇ X
n
ˇLn .f; x/ 1 .f .xC/ C f .x//ˇ P .x/ VIk .gx /
ˇ 2 ˇ n
kD0
Q.x/
C jf .xC/ f .x/j; (7.9)
n1=2
p p
where Ik D Œx 1= k; x C 1= k; k D 1; 2; : : : ; n; I0 D .1; 1/, P .x/ D
2 2 .x/ C 1, Q.x/ D 2EjX1 xj3 = 3 .x/, and
8
< f .t/ f .x/; t < x;
gx .t/ D 0; t D x;
:
f .t/ f .xC/; t > x:
Furthermore, (7.9) is asymptotically sharp when f 2 BV .1; 1/, and F1;x .t/
is either absolutely continuous with respect to the Lebesgue measure or is a lattice
point distribution, and x is a lattice point.
Corollary 7.1. Let Mn D ft W P .Sn =n tg D P .Sn =n t/g: Then by
Theorem 7.6, if x 2 Mn , we have
P .x/ X
n
jLn .f; x/ f .x/j VIk .gx /
n
kD0
regardless of the size of the saltus of f at x.

The special cases of Theorem 7.6 are the following:
1. Bernstein operators
Let P .X1 D 1/ x D 1 P .X1 D 0/; x 2 .0; 1/. Then
n
X n
Ln .f; x/ D Bn .f; x/ D x k .1 x/nk f .k=n/:
k
kD0
Now 2 .x/ D x.1 x/ and EjX1 xj3 D 2 .x/.2x 2 2x C 1/. Therefore,

ˇ ˇ X
n
ˇ ˇ
ˇBn .f; x/ 1 .f .xC/Cf .x//ˇ 2x.1x/C1 VIk .gx /
ˇ 2 ˇ n
kD0
2.2x 2 2xC1/
C p jf .xC/f .x/j: (7.10)
nx.1x/
In [91], the author remarked in passing that Ik D Œx k 1=2 ; x C k 1=2 could

be replaced by Ik D Œx xk 1=2 ; x C .1 x/k 1=2 and that (7.10) would be
modified as
ˇ ˇ
ˇ ˇ X
n
ˇBn .f; x/ 1 .f .xC/Cf .x//ˇ 3
VI .gx /
ˇ 2 ˇ nx.1x/ k
kD0
2.2x 2 2xC1/
C p jf .xC/f .x/j: (7.11)
nx.1x/
2. Szász operators
Let P .X1 D j / D e x x j =.j Š/; j D 0; 1; : : : : Then we obtain the Szász operator
Sn .f; x/
1
X .nx/k
Ln .f; x/ D Sn .f; x/ D e nx f .k=n/;
kŠ
kD0
where f .t/ is defined over Œ0; 1/. Now 2 .x/ D x and
X
Œx
xk
x
EjX1 xj D x C 2e
3
.x k/3 :
kŠ
kD0
Therefore, if f 2 BV Œ0; 1/, then for all x 2 .0; 1/, we have

ˇ ˇ X
ˇ ˇ n
ˇSn .f; x/ 1 .f .xC/Cf .x//ˇ 2xC1 VIk .gx /
ˇ 2 ˇ n
kD0
2EjX1 xj3
C p jf .xC/f .x/j: (7.12)
x nx/
One could use the simple bound for EjX1 xj3 8x 3 C 6x 2 C x to have
ˇ ˇ X
ˇ ˇ n
ˇSn .f; x/ 1 .f .xC/Cf .x//ˇ 2xC1 VIk .gx /
ˇ 2 ˇ n
kD0
2.8x 2 C6xC1/
C p jf .xC/f .x/j: (7.13)
nx
In 1984, Cheng [55] also established the rate of convergence for functions of
bounded variation.
Theorem 7.7 ([55]). Let f be a function of bounded variation on every finite

subinterval of Œ0; 1/, and let f .t/ D O.t ˛t / for some ˛ > 0 as t ! 1. If
x 2 .0; 1/ is irrational, then for n sufficiently large, we have
ˇ ˇ 1 X p
ˇ ˇ n
ˇSn .f; x/ 1 .f .xC/ C f .x//ˇ .3 C x/x V
xCx/= k
p .gx /
ˇ 2 ˇ n xx= k
kD1
1=2
O.x /
C jf .xC/ f .x/j
n1=2
e nx
CO.1/.4x/4˛x .nx/1=2 ;
4
where
8
< f .t/ f .x/; 0 t < x;
gx .t/ D 0; t D x;
:
f .t/ f .xC/; x < t < 1 ;

3. Baskakov operators
Let P .X1 D j / D 1=.1 C x/.x=.1 C x//j ; j D 0; 1; : : : : Then we obtain the
Baskakov operator Vn .f; x/
1
X
nCk 1 xk
Ln .f; x/ D Vn .f; x/ D f .k=n/:
k .1 C x/nCk
kD0
Now, 2 .x/ D x.1 C x/ and
k
2 X
Œx
x
EjX1 xj3 D 2x 3 C 3x 2 C x C .x k/3 :
1Cx 1Cx
kD0
Therefore, if f 2 BV Œ0; 1/, then for all x 2 .0; 1/, we have

ˇ ˇ X
ˇ ˇ n
ˇVn .f; x/ 1 .f .xC/Cf .x//ˇ 2x.1Cx/C1 VIk .gx /
ˇ 2 ˇ n
kD0
2EjX1 xj3
C p jf .xC/f .x/j: (7.14)
.x.1Cx//3=2 n
Again, one could use the bound EjX1 xj3 16x 3 C 9x 2 C x to obtain
ˇ ˇ X
ˇ ˇ n
ˇVn .f; x/ 1 .f .xC/Cf .x//ˇ 2x.1Cx/C1 VIk .gx /
ˇ 2 ˇ n
kD0
2.16x C9xC1/
2
C p jf .xC/f .x/j: (7.15)
.1Cx/3=2 nx
4. Gamma operators
Let X1 have probability density over .0; 1/:

.1=x/e y=x ; y > 0;

fX1 .y/ D
0; y 0:
Then
Z 1
x n
Ln .f; x/ D Gn .f; x/ D f .y=n/y n1 e y=x dy:
.n 1/Š 0
Now, .x/ D x 2 and EjX1 xj3 D 2x 3 .6=e 1/. Hence, for any f 2 BV Œ0; 1/
and x 2 .0; 1/, we have
ˇ ˇ
ˇ ˇ X
n
ˇGn .f; x/ 1 .f .xC/ C f .x//ˇ 2x C 1
2
ˇ ˇ VIk .gx /
2 n
kD0
4.6=e 1/
C p jf .xC/ f .x/j: (7.16)
n
5. Weierstrass operators
Let X1 have probability density defined over .1; 1/ by g .y x/, where
Ry
g .y/ is the derivative of G .y/ D .2/1=2 1 e u =2 d u. Then Ln .f; x/
2
reduces to Weierstrass operators

r Z 1
n
f .x C u/e nu
2 =2
Wn .f; x/ D d u:
2 1
Now, 2 .x/ D 1, and by Corollary 7.1, we have

ˇ ˇ X
ˇ ˇ n
ˇWn .f; x/ 1 .f .xC/ C f .x//ˇ D 3 VIk .gx /;
ˇ 2 ˇ n
kD0
for f 2 BV .1; 1/ and x 2 .1; 1/ regardless of the size of the saltus of

f at x.
7.4 Bernstein–Durrmeyer-Type Polynomials
Durrmeyer [65] introduced the integral modification of the classical Bernstein

polynomials, which was studied in detail by Derriennic [58], who established some
approximation properties of these operators. If f is a function defined on Œ0; 1, the
Durrmeyer operators are defined as
Z 1 X
n Z 1
Dn .f; x/ D Kn .x; t/f .t/dt D .n C 1/ pn;k .x/ pn;k .t/f .t/dt; (7.17)
0 kD0 0
7.4 Bernstein–Durrmeyer-Type Polynomials 223
P
where the kernel Kn .x; t/ D .n C 1/ nkD0 pn;k .x/pn;k .t/ and the Bernstein basis
function pn;k .x/ is given in (7.7).
Guo [88] estimated the rate of convergence for functions of bounded variation.
He used the Berry–Esseen theorem to obtain the upper bound for Bernstein basis
functions. Here are the basic lemmas and rate of convergence for Bernstein–
Durrmeyer operators given in [88]:
Lemma 7.1. For every x 2 .0; 1/ and 0 k n, we have
5
pn;k .x/ p :
2 nx.1 x/
Lemma 7.2. For every 0 j n/ and n sufficiently large, we have

ˇ j ˇ
ˇX Xj ˇ
ˇ ˇ 2
ˇ pn;k .x/ pnC1;k .x/ˇ p :
ˇ ˇ nx.1 x/
kD0 kD0
For n sufficiently large, Guo considered x.1x/

n
Dn ..t x/2 ; x/ 2x.1x/
n
.
Obviously,
Z y
2x.1 x/
Kn .x; t/dt ; 0 y < x; (7.18)
0 n.x y/2
and
Z 1
2x.1 x/
Kn .x; t/dt ; x < z 1: (7.19)
z n.z x/2

subinterval of Œ0; 1, and let Vab .gx / be the total variation of gx on Œa; b. Then
ˇ ˇ
ˇ ˇ Xn p
ˇDn .f; x/ 1 .f .xC/ C f .x//ˇ 5
V
xC.1x/= k
p .gx /
kD1
13.x.1 x//1
C p jf .xC/ f .x/j;
4 n
where the auxiliary function gx is as defined in Theorem 7.2.
Proof. We can write
ˇ ˇ
ˇ ˇ
ˇDn .f; x/ 1 .f .xC/ C f .x//ˇ 1 jf .xC/ f .x/j:jDn .sign.t x/; x/j
ˇ 2 ˇ 2
CjDn .gx ; x/j:

First,
Z 1 Z x
Dn .sign.t x/; x/ D Kn .x; t/dt Kn .x; t/dt
x 0
WD An .x/ Bn .x/:
R1 Pj
Using .n C 1/ x pn;j .t/dt D kD0 pnC1;k .x/, we have
Z 1
An .x/ D Kn .x; t/dt
x
X
n Z 1 X
n X
k
D .n C 1/ pn;k .x/ pn;k .t/dt D pn;k .x/ pnC1;j .x/:
kD0 x kD0 j D0
Pn
Using Lemma 7.2, we have jAn .x/ S j pnx.1x/ 2
; where S D kD0
Pk
pn;k .x/ j D0 pn;j .x/ . If I D .pn;0 .x/ C pn;1 .x/ C pn;2 .x/ C : : : : C
pn;n .x//.pn;0 .x/Cpn;1 .x/Cpn;2 .x/C: : : :Cpn;n .x//. Then with An .x/CBn .x/D1,
we have
X
n
jAn .x/ Bn .x/j D j2An .x/ 1j D 2
pn;k .x/
kD0
X
n
13
pn;k .x/ pn;k .x/ p :
kD0
2 nx.1 x/
Next,
Z Z Z
Dn .gx ; x/ D C C Kn .x; t/gx .t/dt
I1 I2 I3
WD E1 C E2 C E3 ;
p p p
p I1 D Œ0; x x= n; I2 D Œx x= n; x C .1 x/= n; I3 D Œx C .1 C
where
x/= n; 1.
First, we
p
estimate E2 . For t 2 I2 , we have jgx .t/j D jgx .t/ gx .x/j
xC.1x/= n
Vxx=pn .gx /. Therefore,
p Z xC.1x/=pn
xC.1x/= n
E2 D Vxx=pn .gx / p
dt .. n .x; t//;
xx= n
Rt Rb
where n .x; t/ D 0 Kn .x; u/d u. Since a dt . n .x; t// 1 for all Œa; b Œ0; 1,
we have
p
xC.1x/= n
E2 Vxx=pn .gx /:
7.4 Bernstein–Durrmeyer-Type Polynomials 225
p
Next, let y D x x= n. Using Lebesgue–Stieltjes integration by parts, we find
Z y
E1 D gx .t/dt . n .x; t//
0
Z y
VyC
x
.gx / n .x; y/ C n .x; t/dt .Vtx .gx //:
0
Using (7.18), we have

Z
2x.1 x/ 2x.1 x/ 1 y
E1 VyC
x
.gx / C d .Vtx .gx //
2 t
n.x y/2 n 0 .x t/
!
2.1 x/ X
n
4 Xn
V0 .gx / C
x
Vxx= k .gx /
x p x
Vxx=p .gx /:
nx nx.1 x/ k
kD1 kD1
Along similar lines, one has
4 X n p
E3 VxxC.1x/= k .gx /:
nx.1 x/
kD1
Thus,
5 X xC.1x/=pk n
Dn .gx ; x/ D V p .gx /:
nx.1 x/ xx= k
kD1
Combining the estimates of Dn .gx ; x/ and Dn .sign.t x/; x/, we get the desired
result.
There may be several variants of Durrmeyer-type operators, such as
X X
n˛Cˇ Z 1
k
Un;˛;ˇ .f; x/D pn;k .x/f C.n˛C1/ pn;k .x/ pn˛;kˇ .t /f .t /dt;
n 0
k2In kD0
for n ˛, where ˛; ˇ are integers satisfying ˛ ˇ 0 and In f0; 1; 2; : : : ; ng

is a certain index set. For ˛DˇD0, In D 0. This definition reduces to Bernstein–
Durrmeyer operators Dn . An important example is the special case ˛D2; ˇD1; In D
f0; ng, which was introduced by Goodman and Sharma [86]. In 2008, Abel et al. [13]
considered the case ˛ D 0; ˇ D 1; In D f0g, namely, the operators
X
n Z 1
Un;0;1 .f; x/ D Un .f; x/ D .n C 1/ pn;k .x/ pn;k1 .t/f .t/dt C .1 x/n f .0/:
kD1 0
(7.20)
Theorem 7.9 ([13]). Let f be a function of bounded variation on the interval Œ0; 1.
Furthermore, let .ak / be a strictly decreasing sequence of positive numbers so that
a1 D 1. Then for each x 2 .0; 1/ and all n 2 N , the following holds:
ˇ ˇ
ˇ ˇ
ˇUn .f; x/ 1 .f .xC/Cf .x//ˇ Vxxa
xC.1x/an
.gx /
ˇ 2 ˇ n
p
2C1= 8e
Cp jf .xC/f .x/j
nx.1x/
X
n1
CCn .x/.1a22 /1 2
ak2 /Vxak
xC.1x/ak
.akC1 .gx /;
kD1
where the auxiliary function gx is as defined in Theorem 7.2, with
2x.1 x/n C 6x 2
Cn .x/ D maxfx 2 ; .1 x/2 g:
.n C 2/.n C 3/
p
For the special case ak D 1= k, Abel et al. obtained the following corollary.
Corollary 7.2. Let f be a function of bounded variation on the interval Œ0; 1.
Then for each x 2 .0; 1/, any given number " > 0 and all n sufficiently large,
the following holds:
ˇ ˇ p
ˇ 1 ˇ 2 C 1= 8e
ˇUn .f; x/ .f .xC/ C f .x//ˇ p jf .xC/ f .x/j
ˇ ˇ
2 nx.1 x/
4 C " X xC.1x/=pk
n
C V p .gx /:
nx.1 x/ xx= k
kD1
7.5 Szász–Mirakyan–Durrmeyer-Type Operators
The Szász–Mirakyan–Durrmeyer operators are defined as

1
X Z 1
Mn .f; x/ D n sn;k .x/ sn;k .t/f .t/dt; (7.21)
kD0 0
k
kŠ : The rate of convergence for functions of bounded
variation for such operators was obtained in [108] and [208]. Later, in 1999, Gupta
and Pant [120] improved the result by using the Berry–Esseen theorem with better
bounds.
7.5 Szász–Mirakyan–Durrmeyer-Type Operators 227
Lemma 7.3. For every x 2 .0; 1/; we have
32x 2 C 24x C 5
sn;k .x/ p :
2 nx
For n 2, they considered

P1 2x=n Mn ..t x/2 ; x/ .2x C 1/=n. The kernel is
defined by Kn .x; t/ D n kD0 sn;k .x/sn;k .t/: Obviously,
Z y
2x C 1
Kn .x; t/dt ; 0 y < x; (7.22)
0 n.x y/2
and
Z 1
2x C 1
Kn .x; t/dt ; x < z < 1: (7.23)
z n.z x/2

subinterval of Œ0; 1/, and let f .t/ D O.e ˛t / for some ˛ > 0 as t ! 1. If x 2
.0; 1/ and n 4˛, then
ˇ ˇ
ˇ ˇ X
n p
ˇMn .f; x/ 1 .f .xC/ C f .x//ˇ x C 6x C 3
2
xCx= k
V p .gx /
ˇ 2 ˇ nx 2 xx= k
kD1
32x C 24x C 5
2
C p jf .xC/ f .x/j
2 nx
r
2.2x C 1/ e 2˛x e ˛x .2x C 1/
C C ;
n x nx 2
where the auxiliary function is as defined in Theorem 7.7, and Vab .gx / is the total
variation of gx on Œa; b.
Proof. We can write
ˇ ˇ
ˇ ˇ
ˇMn .f; x/ 1 .f .xC/ C f .x//ˇ 1 jf .xC/ f .x/j:jMn .sign.t x/; x/j
ˇ 2 ˇ 2
CjMn .gx ; x/j:
Using the techniques as given in [208], we have

ˇZ Z ˇ
ˇ 1 x ˇ
jMn .sign.t x/; x/j D ˇˇ Kn .x; t/dt Kn .x; t/dt ˇˇ
x 0
WD An .x/ Bn .x/:
Z 1 X
k
Also, by applying the identity n sn;k .t/dt D sn;j .x/, we have
x j D0
Z 1
An .x/ D Kn .x; t/dt
x
1
X Z 1 1
X X
k
Dn sn;k .x/ sn;k .t/dt D sn;k .x/ sn;j .x/
kD0 x kD0 j D0
D sn;0
2 2
.x/Csn;1 2
.x/Csn;2 .x/C : : : :
Csn;0 .x/.sn;1 .x/Csn;2 .x/C : : : :/Csn;1 .x/.sn;2 .x/Csn;3 .x/C : : : :/C : : : :
Let I D .sn;0 .x/ C sn;1 .x/ C sn;2 .x/ C : : : :/.sn;0 .x/ C sn;1 .x/ C sn;2 .x/ C : : : :/.
Then with An .x/ C Bn .x/ D 1, we have
1
X
jAn .x/ Bn .x/j D j2An .x/ 1j D 2
sn;k .x/
kD0
1
X 32x 2 C 24x C 5
sn;k .x/ sn;k .x/ p :
kD0
2 nx
Next,
Z Z Z
Mn .gx ; x/ D C C Kn .x; t/gx .t/dt
I1 I2 I3
WD E1 C E2 C E3 ;
p p p p
where I1 D Œ0; x x= n; I2 D Œx x= n; x Cx= n; andI3 D Œx Cx= n; 1/.
First,
p
we estimate E2 . For t 2 I2 , we have jgx .t/j D jgx .t/ gx .x/j
xCx= n
Vxx=pn .gx /. Therefore,
p Z xCx=pn p Z xCx=pn
xCx= n xCx= n
E2 D Vxx=pn .gx / p
Kn .x; t/dt D Vxx=pn .gx / p
dt .. n .x; t//;
xx= n xx= n
Rt Rb
where n .x; t/ D 0 Kn .x; u/d u. Since a dt . n .x; t// 1 for all Œa; b Œ0; 1/,
we have
1 X xCx=pk
p n
xCx= n
E2 Vxx=pn .gx / V p .gx /:
n xx= k
kD0
7.5 Szász–Mirakyan–Durrmeyer-Type Operators 229
Using (7.22) and proceeding as in [208], we have
2.2x C 1/ X x
n
E1 Vxx=pk .gx /:
nx 2
kD0
Finally,
Z 2x Z 1
E3 D gx .t/dt .Qn .x; t// gx .2x/ Kn .x; u/d u
x 2x
Z 1
C gx .t/dt . n .x; t//
2x
WD E31 C E32 C E33 :
After simple computation, the estimates turn out to be as follows; details can be
found in [208] and [120]:
2.2x C 1/ X xCx=pk
n
jE31 j Vx .gx /:
nx 2
kD0
.2x C 1/ X
n p
jE32 j VxxCx=k
.gx /:
nx 2
kD0
and
ˇ 1 Z 1 ˇ
ˇ X ˇ
ˇ ˇ
jE33 j ˇn sn;k .x/ sn;k .t/gx .t/dt ˇ
ˇ 2x ˇ
kD0
1
X Z 1
n sn;k .x/ sn;k .t/.e ˛t C e ˛x /dt
kD0 2x
1 Z 1
nX
sn;k .x/ sn;k .t/jt xje ˛t dt
x 0
kD0
1 Z
e ˛x X 1
C n sn;k .x/ sn;k .t/.t x/2 dt
x2 0
kD0
1 Z !1=2
1 1=2 X 1
Mn ..t x/2 ; x/ n sn;k .x/ sn;k .t/e 2˛t
dt
x 0
kD0
e ˛x
C Mn ..t x/2 ; x/:
x2
Next, with the assumption that n > 2˛, we have

1
X Z 1
n sn;k .x/ sn;k .t/e 2˛t dt
kD0 0
1
X Z 1
nk n
Dn sn;k .x/ t k e .n2˛/t dt D e 2˛x:n=.n2˛/ 2e 4˛x ;
kŠ 0 n 2˛
kD0
for n 4˛. Therefore,

r
2.2x C 1/ e 2˛x e ˛x 2x C 1
jE33 j C 2: :
n x x n
If we combine the estimates of E1 ; E2 ; E31 E32 , the desired result follows.
The Szász–Durrmeyer operators reproduce only constant functions. There is
another modification of Szász operators [227], namely, Phillips operators, which
reproduce constant as well as linear functions. Thus, Phillips operators are some-
times called genuine Szász–Durrmeyer operators. For f 2 C Œ0; 1/, the Phillips
operators (see [199]) are defined as
1
X Z 1
Pn .f; x/ D n sn;k .x/ sn;k1 .t/f .t/dt C e nx f .0/;
kD1 0
where sn;k .x/ is the Szász basis function is given by
.nx/k
sn;k .x/ D e nx :
kŠ
In this direction, Gupta and Shrivastava in [128] estimated the rate of convergence of
Phillips operators for functions of bounded variation, using a probabilistic approach.
Let BN Œ0; 1/; N 0; be the class of all measurable functions f such that
jf .t/j M e N t for all t 2 Œ0; 1/ and some positive M for which the operators
Pn .f; t/ are well defined.
Theorem 7.11 ([128]). Let f 2 BN Œ0; 1/ be a function of bounded variation on
every finite subinterval of Œ0; 1/; and let
8
< f .t/ f .xC/ if x < t < 1;
gx .t/ D 0 if t D x;
:
f .t/ f .x/ if 0 t < x
We denote by Vab .gx / the total variation of gx on Œa; b: Then for all x > 0 and
n > 4N; we have
7.6 Baskakov–Durrmeyer-Type Operators 231
ˇ ˇ
ˇ ˇ
ˇPn .f; x/ 1 ff .xC/ C f .x/gˇ
ˇ 2 ˇ
7 X xCx=pm
n
32x 2 C 24x C 5
Vxx=pm .gx / C p jf .xC/ f .x/j
nx mD1 4 nx
r
2 1
C 1C p e 2N x :
nx nx
7.6 Baskakov–Durrmeyer-Type Operators
In 1991, Wang and Guo [243] studied the rate of convergence behavior of
Lupas–Durrmeyer (Baskakov–Durrmeyer) operators. Let f be defined on .0; 1/
with bounded variation in each finite interval and f .x/ D O.x r /; x ! 1. Denote
ff g by BVloc;r .0; 1/. The Lupas–Durrmeyer operators are defined as
1
X Z 1
Vn .f; x/ D .n 1/ bn;k .x/ bn;k .t/f .t/dt;
kD0 0
where

nCk1 xk
bn;k .x/ D :
k .1 C x/nCk
If fi g are independent random variables with the same geometric distribution

P .i D k/ D xP k
.1 x/; i D 1; 2; 3; : : :, then Ei D x=.1 x/; Di D
x=.1 x/ ;
n D niD1 i , with
2

nCk1
P .
n D k/ D x k .1 x/n :
k
For the above estimate, we refer to [56]. Then in [243], the following upper bound
for the Baskakov basis function was established:
3=2
nCk1 xk 33 1Cx
p : (7.24)
k .1 C x/nCk n x
The following estimate is based on the bound (7.24).

Theorem 7.12 ([243]). Let f be a function belonging to BVloc;r .0; 1/. Then for
every x 2 .0; 1/ and n sufficiently large,
ˇ ˇ X p
ˇ ˇ n
ˇVn .f; x/ 1 .f .xC/ C f .x//ˇ 5.1 C x/ V
xCx= k
p .gx /
ˇ 2 ˇ nx xx= k
kD1
3=2
50 1Cx
Cp jf .xC/ f .x/j
n x
.1 C x/r
C O.n2 /;
x4
where the auxiliary function is as defined in Theorem 7.7.
Gupta and Srivastava [127] also obtained the rate of convergence for BV functions
of Baskakov–Durrmeyer operators.
Let B˛ Œ0; 1/; ˛ > 0, be the class of all measurable complex-valued functions
satisfying the growth condition jf .t/j M.1 C t/˛ for all y 2 Œ0; 1/ and
some M > 0. The another sequence of Baskakov–Durrmeyer-type positive linear
operators Mn (see [26]) is defined by
1
X Z 1
Mn .f; x/ D .n 1/ bn;k .x/ bn;k1 .t/f .t/dt C .1 C x/n f .0/:
kD1 0
Lemma 7.4 ([99]). For all x 2 .0; 1/ and k 2 N , we have

p
.1 C x/
bn;k .x/ < p :
2e nx
Proof. By Theorem 2 of [246], it follows that

!
nCk1 k 1
t .1 t/n < p ; t 2 .0; 1: (7.25)
k 2e nx
Replacing the variable t by x=.1 C x/ in (7.25), we get

! p
nCk 1 xk .1 C x/
D bn;k .x/ 2 and any
x > 0, there is an integer N. ; x/ > 2 such that
x.1 C x/
Tn;2 .x/ ; for all n 2 N. ; x/:
n
Lemma 7.5 ([99]). If n 2 N; then
(i) For 0 y < x, we have
Z y
x.1 C x/
Wn .x; t/dt :
0 n.x y/2
(ii) For x z < 1, we have

Z 1
x.1 C x/
Wn .x; t/dt :
z n.z x/2
Lemma 7.6 ([99]). Let fi g1i D1 be a sequence of independent random variables

with the same geometric distribution:
k
x 1
P .i D k/ D ; k 2 N; x > 0:
1Cx 1Cx
Then E.1 / D x; 2 D E.1 E1 /2 D x 2 C x and 3 D Ej1 E1 j3
3x.1 C x/2 :
Proof. We have
1
X k
x 1
E.1r / D kr :
1Cx 1Cx
kD0
By direct computation, we can easily check that

1
X k
x 1
k r
D 1; E1 D x; E12 D 2x 2 C x;
1Cx 1Cx
kD0
E13 D 6x 3 C 6x 2 C x; E14 D 24x 4 C 36x 3 C 14x 2 C x:
Hence,
E.1 E1 /2 D x 2 C x and E.1 E1 /4 D 9x 4 C 18x 3 C 10x 2 C x:
Using Holder’s inequality, we obtain

p p
3 D Ej1 E1 j3 E.1 E1 /4 E.1 E1 /2 .x 2 C x/.9x 4 C 18x 3 C 10x 2 C x/
3x.1 C x/2 :

Lemma 7.7 ((See [242].) (Berry–Esseen theorem.)). Let X1 ; X2 ; : : : :Xn be n

independent and identically distributed random variables with zero mean and a
finite absolute third moment. Then
sup jFn .x/ .x/j < .0:82/l3;n ;

x2R
where Fn is the distribution function of .X1 C X2 C : : : : C Xn /.n 2 /1 , is the

standard normal distribution function, and l3;n is the Lyapunov ratio given by
3
l3;n D 3=2 p
; 3 D EjX1 j3 :
2 n
Lemma 7.8 ([99]). For x 2 .0; 1/ and n; k 2 N; we have

ˇ ˇ
ˇ k1 ˇ
ˇX X
k1
ˇ 12 C 13x
ˇ b .x/ b .x/ ˇ p :
ˇ n;j n1;j ˇ
ˇj D0 j D0 ˇ 2 nx.1 C x/
Proof. First,
ˇ ˇ
ˇX X ˇ ˇX Z .knx/=pnx.1Cx/
ˇ k1 k1
ˇ ˇ k1 1
ˇ
I ˇ bn;j .x/ ˇ ˇ
bn1;j .x/ˇ Dˇ bn;j .x/ p e t =2 dt
2
ˇj D0 j D0 ˇ j D0 2 1
Z p
.k.n1/x/= .n1/x.1Cx/
1
e t
2 =2
Cp dt
2 1
Z p ˇ
1 .k.n1/x/= .n1/x.1Cx/ X
k1
ˇ
p p e t 2 =2
dt bn1;j .x/ˇˇ:
2 .knx/= nx.1Cx/ j D0
Now, using Lemma 7.7, we get

ˇ ˇ
ˇ k1 Z .knx/=pnx.1Cx/ ˇ
ˇX 1 ˇ
ˇ
I ˇ bn;j .x/ p e t =2
2
dt ˇˇ
ˇj D0 2 1 ˇ
ˇ ˇ
ˇ k1 Z .k.n1/x/=p.n1/x.1Cx/ ˇ
ˇX 1 ˇ
Cˇ ˇ bn;j .x/ p e t =2
2
dt ˇˇ
ˇj D0 2 1 ˇ
ˇ ˇ
ˇ 1 Z .k.n1/x/=p.n1/x.1Cx/ ˇ
ˇ ˇ
e t =2 dt ˇ
2
C ˇp p
ˇ 2 .knx/= nx.1Cx/ ˇ
2.0:82/ 3 x
3=2 p
Cp :
2 n 2 nx.1 C x/
Now, using Lemma 7.6, we have
6x.1 C x/2 x 12 C 13x

I p Cp p :
Œx.1 C x/3=2 n 2 nx.1 C x/ 2 nx.1 C x/

Theorem 7.13 ([99]). Let f 2 B˛ Œ0; 1/ be a function of bounded variation on
every finite subinterval of Œ0; 1/. Then for a fixed point x 2 .0; 1/; > 2, and
n maxf1 C ˛; N. ; x/g; we have
ˇ ˇ X
n p
ˇ ˇ
ˇMn .f; x/ 1 .f .xC/ C f .x//ˇ 3 C .3 C 1/x V
xCx= k
p .gx /
ˇ 2 ˇ nx xx= k
kD1
27x C 25
C p jf .xC/ f .x/j
4 nx.1 C x/
.1Cx/˛ 2M .1Cx/˛C1
CM.2˛ 1/ 2˛
O.n˛ /C ;
x nx

Proof. Clearly,

f .xC/ C f .x/ f .xC/ f .x/
Mn .f; x/ D Mn .sgnx .t/; x/ CMn .gx ; x/;
2 2
(7.26)
where
8
< 1; 0 t < x;
sgnx .t/ D 0; t D x;
:
C1; t > x:
First, we observe that

Z 1 Z 1 Z x
Mn .sgnx .t/; x/ D sgnx .t/Wn .x; t/dt D Wn .x; t/dt Wn .x; t/dt
0 x 0
WD An .x/ Bn .x/:
R1 P
Using .n 1/ x bn;k .t/dt D kj D0 bn1;j .x/, we have
1
X Z 1 Z 1
An .x/ D .n 1/ bn;k .x/ bn;k1 .t/dt C .1 C x/n ı.t/dt
kD1 x x
1
X X
k1
D bn;k .x/ bn1;j .x/; ı.t/ D 0; as x > 0:
kD1 j D0
Next, using Lemma 7.8, we get

ˇ ˇ ˇ 0 1ˇ
ˇ 1 ˇ ˇX ˇ
ˇ X X
k1
ˇ ˇ1 X
k1 X
k1
ˇ
ˇAn .x/ bn;k .x/ ˇ ˇ
bn;j .x/ˇ D ˇ bn;k .x/ @ bn1;j .x/ bn;j .x/ ˇˇ
A
ˇ
ˇ kD1 j D0 ˇ ˇkD1 j D0 j D0 ˇ
12 C 13x
p : (7.27)
2 nx.1 C x/
Let
1
X X
k1
S D bn;k .x/ bn;j .x/
kD1 j D0
D bn;0 bn;1 C bn;2 .bn;0 C bn;1 / C bn;3 .bn;0 C bn;1 C bn;2 / C : : : ::

2 2
D bn;0 Cbn;1 .bn;0 Cbn;1 /Cbn;2 .bn;0 Cbn;1 Cbn;2 /C : : : :: bn;0 Cbn;1
2
C:::
2
WD S1 bn;0 C bn;1
2
C ::: :
We have
S1 D bn;0
2
Cbn;1
2
Cbn;2
2
C: : :Cbn;0 Œbn;1 C bn;2 C : : :Cbn;1 Œbn;2 C bn;3 C : : :C: : : :
Next, I D .bn;0 C bn;1 C bn;2 C : : :/.bn;0 C bn;1 C bn;2 C : : :/: Hence, by Lemma 7.4,
we have
p
1Cx
2S1 I D bn;0 C bn;1 C bn;2 C : : : p
2 2 2
:
2e nx
Thus, S D S1 .2S1 I / D I S1 :
ˇ ˇ ˇ ˇ p
ˇ ˇ ˇ 1 ˇˇ 1Cx 1Cx
ˇS 1 ˇ D ˇS1 p p : (7.28)
ˇ 2ˇ ˇ 2 ˇ 2 2e nx 4 nx.1 C x/
If we combine (7.27) and (7.28), it follows that

ˇ ˇ
ˇ ˇ 1Cx 27x C 25
ˇAn .x/ 1 ˇ p 1 C 12 C 13x D p :
ˇ 2 ˇ 2 nx.1 C x/ 2 4 nx.1 C x/
R1
Now, as An .x/ C Bn .x/ D 0 Wn .x; t/dt D 1; we have
27x C 25
jAn .x/ Bn .x/j D j2An .x/ I j p : (7.29)
4 nx.1 C x/
Next, we estimate Mn .gx ; x/. By Lebesgue–Stieltjes integral representation,

we have
Z 1 Z Z Z
Mn .gx ; x/D Wn .x; t/gx .t/dtD C C Wn .x; t/gx .t/dt W DE1 CE2 CE3 ;
0 I1 I2 I3
p p p p
where I1 D Œ0; x x=R n, I2 D Œx x= n; x Cx= n, and I3 D Œx Cx= n; 1/: p
t
Suppose ˇn .t; x/ D 0 Wn .x; t/dt: We first estimate E1 . Writing y D x x= n
and using Lebesgue–Stieltjes integration by parts, we have
Z y Z y
E1 D gx .t/dt .ˇn .t; x// D gx .y C /ˇn .y; x/ .ˇn .t; x//dt gx .t/:
0 0
Since jgx .y C /j VyxC .gx /, it follows from Lemma 7.5 that

Z y
jE1 j VyxC .gx /ˇn .y; x/ C ˇn .t; x/dt Vtx .gx /
0
Z
x.1 C x/ x.1 C x/ y
1
VyxC .gx / C dt .VtxC .gx //:
n.x y/ 2 n 0 .x t/2
Integrating the last term by parts, we have, after simple computation,

Z y x
x.1 C x/ V0x .gx / Vt .gx /
jE1 j C2 dt :
x2 0 .x t/
n 3
p
Now, replacing the variable y in the last integral by x x= u, we obtain
2 .1 C x/ X x
n
jE1 j Vxx=pk .gx /: (7.30)
nx
kD1
p p
Next, we estimate E2 . For t 2 Œx x= n; x C x= n, we have
p
xCx= n
jgx .t/j D jgx .t/ gx .x/j Vxx=pn .gx /;
and, therefore,
p Z p
xCx= n
xCx= n 1
jE2 j Vxx=pn .gx / p dt .ˇn .t; x//:
n xx= n
Rb
Since a dt ˇn .t; x/ 1, for .a; b/ Œ0; 1/, we thus have
1 X xCx=pn
p n
xCx= n
jE2 j Vxx=pn .gx / Vxx=pn .gx /: (7.31)
n
kD1
p
Finally, we estimate E3 . By setting z D x C x= n; we have
Z 1 Z 1
E3 D gx .t/Wn .x; t/dt D gx .t/dt .ˇn .t; x//:
z z
We define Qn .x; t/ on Œ0; 2x as
Qn .x; t/ D 1 ˇn .t; x/; 0 t < 2x; and 0; t D 2x:
Thus,
Z 2x Z 1
E3 D gx .t/dt .Qn .x; t// gx .2x/ Wn .x; t/dt
z 2x
Z 1
C gx .t/dt .ˇn .x; t//
2x
WD E31 C E32 C E33 : (7.32)
By partial integration, we get

Z 2x

E31 D gx .z /Qn .x; z / C dt .gx .t//Qn .x; t/;
x
where Qn .x; t/ is the normalized form of Qn .x; t/: Since Qn .x; z / D Qn .x; z/

and jg C x.z /j Vxz .gx /; we have
Z 2x
z
jE31 j D Vx .gz /Qn .x; z/ C dt .Vxt .gx //Qn .x; t/:
z
Applying Lemma 7.5 and the fact that Qn .x; t/ Qn .x; t/ on Œ0; 2x, we get
Z
Vxz .gx / x.1 C x/ x.1 C x/ 2x 1
jE31 j C d .Vxt .gx //
2 t
n.z x/2 n z .x t/
Z 1
1
C V 2x .gx / Wn .x; u/d u
2 2x 2x
Z
Vxz .gx / x.1 C x/ x.1 C x/ 2x 1
dt .Vxt .gx //
n.z x/ 2 n z .x t/2

1 x.1 C x/
C 2x
V .gx / :
2 2x nx 2
Thus, arguing similarly as in the estimate of E1 , we get
2 .1 C x/ X xCx=pk
n
jE31 j Vx .gx /: (7.33)
nx
kD1
7.7 Baskakov–Beta Operators 239
Again by Lemma 7.5, we get
.1 C x/ X xCx=pk
n
x.1 C x/
jE32 j gx .2x/ Vx .gx /: (7.34)
nx 2 nx
kD1
Finally, we estimate E33 as follows:

Z 1
jE33 j M Wn .x; t/Œ.1 C t/˛ C .1 C x/˛ dt; where n > ˛:
2x
For 2x t; we have the inequality

.1 C x/˛
.1 C t/˛ .1 C x/˛ .2˛ 1/ .t x/˛ :
x˛
Thus,
Z 1 Z 1
.1 C x/˛
jE33 j M.2 1/
˛
Wn .t; x/Œ.t x/ dt C 2M ˛
Wn .t; x/dt
x˛ 2x 2x
Z 1 Z 1
.1 C x/˛ .t x/2˛
M.2˛ 1/ Wn .t; x/ dt C 2M Wn .t; x/dt:
x˛ 2x x˛ 2x
Now, using Lemmas 7.5 and 7.6, we obtain
.1 C x/˛ 2M .1 C x/˛C1
jE33 j M.2˛ 1/ ˛
O.n˛ / C : (7.35)
x nx
Finally, collecting the estimates of (7.26), (7.29)–(7.35), we get the required result.
7.7 Baskakov–Beta Operators
In 1994, Gupta observed [92] that by taking the weights of Beta basis functions
in the integral modification of Baskakov operators, we have a better approx-
imation. Also, for the rate of convergence of functions of bounded variation,
some approximation properties become simpler for Baskakov–Beta operators.
The Baskakov–Beta operators [92, 94], for x 2 Œ0; 1/, are defined as
Z 1
Bn .f; x/ D Kn .x; t/f .t/dt
0
1
X Z 1
D bn;k .x/ vn;k .t/f .t/dt;
kD0 0
P1
where the kernel Kn .x; t/ D kD0 bn;k .x/vn;k .t/ and

nCk1 xk 1 tk
bn;k .x/ D ; vn;k .t/ D ;
k .1 C x/nCk B.k C 1; n/ .1 C t/nCkC1
.m 1/Š.n 1/Š
with B.m; n/ D : In 1998, Gupta and Arya [109] used the
.n C m 1/Š
following upper estimate for the Baskakov basis function:
If y is a positive-valued random variable with nondegenerate probability distribu-
tion, then E.y 3 / ŒE.y 2 /E.y 4 /1=2 ; provided E.y 2 /; E.y 3 /; E.y 4 / < 1. Using
this, they got the following upper bound:
p
nCk1 xk 8 1 C 9x.1 C x/ C 2
p : (7.36)
k .1 C x/nCk 5 nx.1 C x/
Using the bound (7.36) and other basic results, Gupta and Arya [109] established
the rate of convergence.
subinterval of Œ0; 1/. If jf .t/j M.1 C t/˛ for t 2 Œ0; 1/, where M > 0; ˛ 2 N0 ,
and we’ll choose a number > 2. Then for n > maxf1 C ˛; N. ; x/g; we have
ˇ ˇ X
n p
ˇ ˇ
ˇBn .f; x/ 1 .f .xC/ C f .x//ˇ 5 C .5 C 1/x V
xCx= k
p .gx /
ˇ 2 ˇ nx xx= k
kD1
4Œ1 C 9x.1 C x/1=2 C 1

C p jf .xC/ f .x/j
5 nx.1 C x/
.1 C x/˛ 2 M.1 C x/˛C1
CM.2˛ 1/ 2˛
O.n˛ / C ;
x nx

Proof. Clearly, we can write
ˇ ˇ
ˇ ˇ
ˇBn .f; x/ f .xC/ C f .x/ ˇ jBn .sgnx .t/; x/j: 1 jf .xC/ f .x/j
ˇ 2 ˇ 2
CjBn .gx ; x/j; (7.37)
where
8
< 1; 0 t < x;
sgnx .t/ D 0; t D x;
:
C1; t > x:
7.7 Baskakov–Beta Operators 241
First, we observe that

Z 1 Z 1 Z x
Bn .sgnx .t/; x/ D sgnx .t/Kn .x; t/dt D Kn .x; t/dt Kn .x; t/dt
0 x 0
WD An .x/ Bn .x/:
R1 Pk
Using the fact x vn;k .t/dt D j D0 bn;j .x/; we have
Z 1 1
X Z 1
An .x/ D Kn .x; t/dt D bn;k .x/ vn;k .t/dt
0 kD0 x
1
X X
k
D bn;k .x/ vn;j .x/:
kD0 j D0
For simplicity, we shall use the notation bk instead of bn;k :
X 1
1 X X 1
1 X 1 X
X 1 1
X
I D bj bk D bj bk C bj bk bk2
kD0 j D0 kD0 j D0 kD0 j Dk kD0
1
X
D 2An .x/ bk2 ;
kD0
because
1
X 1 X
X j 1 X
X k
sum1
kD0 bj bk D bj bk D bk bj D An :
j Dk j D0 kD0 kD0 j D0
Applying the bound (7.36), we get

p 1 p
8 1 C 9x.1 C x/ C 2 X 8 1 C 9x.1 C x/ C 2
j2An .x/ I j p bn;k .x/ p :
5 nx.1 C x/ kD0
5 nx.1 C x/
R1
Because An .x/ Bn .x/ D 0 Kn .x; t/dt D 1; therefore
p
8 1 C 9x.1 C x/ C 2
jAn .x/ Bn .x/j p :
5 nx.1 C x/
The estimate of Bn .gx ; x/ follows along the lines of Theorem 7.13, by using the
moment estimates of Baskakov–Beta operators; we omit the details.
7.8 General Summation–Integral-Type Operators
In 2003, Srivastava and Gupta [218] introduced a general sequence of linear positive
operators Gn;c .f; x/, which, applied to f , are defined as
1
X Z 1
Gn;c .f I x/ D n pn;k .xI c/ pnCc;k1 .tI c/ f .t/ dt C pn;0 .xI c/ f .0/ ;
kD1 0
(7.38)
where
.x/k .k/
pn;k .xI c/ D n;c .x/
kŠ
and
8
ˆ
ˆ e nx ; c D 0;
ˆ
ˆ
ˆ
<
n;c .x/ D .1 C cx/n=c ; c 2 N WD f1; 2; 3; : : : ; g ,
ˆ
ˆ
ˆ
ˆ
:̂
.1 x/n ; c D 1;
where fn;c .x/g1nD1 is a sequence of functions, defined on the closed interval Œ0; b
.b > 0/, that satisfies the following properties for every n 2 N and k 2 N0 WD
N[ f0g W
(i) n;c 2 C 1 .Œa; b/ .b > a 0/ :
(ii) n;c .0/ D 1:
(iii) n;c .x/ is completely monotone, so that .1/k n;c
.k/
.x/ 0 .0 x b/ :
(iv) There is an integer c such that
.k/
.kC1/
n;c .x/ D nnCc;c .x/ .n > max f0; cg I x 2 Œ0; b/ :
The following are the special cases of the operators Gn;c .f I x/ in (7.38), which
have the following forms:
k
1. If c D 0; then by simple computation, one has pn;k .xI 0/ D e nx .nx/kŠ
, and the
operators become the Phillips operators Gn;0 .f I x/, introduced by [199], which,
for x 2 Œ0; 1/, are defined by
1
X Z 1
Gn;0 .f I x/ D n pn;k .xI 0/ pn;k1 .tI 0/ f .t/ dt C pn;0 .xI 0/ f .0/ :
kD1 0
7.8 General Summation–Integral-Type Operators 243

nCk1
2. If c D 1; then by simple computation, one has pn;k .xI 1/ D
k
xk
.1Cx/nCk
, and the operators become the Durrmeyer-type Baskakov operators
Gn;1 .f I x/, which were introduced by [139] and, for x 2 Œ0; 1/, are defined as
1
X Z 1
Gn;1 .f I x/ D n pn;k .xI 1/ pnC1;k1 .tI 1/ f .t/ dt C pn;0 .xI 1/ f .0/ :
kD1 0

n
3. If c D 1; then by simple computation, one has pn;k .xI 1/ D x k .1
k
x/nk , and the operators become the Bernstein–Durrmeyer-type Gn;1 .f I x/
studied in [118] and its q analog that appeared in [87]. In this case, summation
runs from 1 to n, integration from 0 to 1, and x 2 Œ0; 1 is defined as
X
n Z 1
Gn;1 .f I x/ Dn pn;k .xI 1/ pn1;k1 .tI 1/ f .t/ dtCpn;0 .xI 1/ f .0/ :
kD1 0
Later Ispir and Yuksel [158] named the operators (7.38) Srivastava–Gupta
operators. They considered the Bézier variant of these operators and estimated
the rate of convergence, which we will discuss in the next chapter. Some other
approximation properties of these operators were discussed in [57] and [237].
Let H˛ .0; 1/ .˛ 0/ be the class of all locally integrable functions defined on
.0; 1/ and satisfying the growth condition jf .t/j M t ˛ , M > 0; t ! 1.
Theorem 7.15 ([218]). Let f 2 H˛ .0; 1/ .˛ 0/, and suppose that the one-
sided limits f .x/ and f .xC/ exist for some fixed point x 2 .0; 1/. Then for
r 2 N; c 2 N 0 and > 2, there is a positive constant M > 0 independent of n
such that for n sufficiently large,
ˇ ˇ X p
ˇ ˇ n
ˇGn;c .f I x/ 1 .f .xC/Cf .x//ˇ 2 .1Ccx/Cx V p .gx /CM nr
xCx= k
ˇ 2 ˇ nx xx= k
kD1
CAn;c .x/jf .xC/f .x/j;
where the auxiliary function is as defined in Theorem 7.7, Vab .gx / is the total
variation of gx on Œa; b, and
( p
p1Ccx ; c2N
An;c .x/ D 8enx
p1
2 nx
; cD0
Theorem 7.16. Let f be a function of bounded variation on every finite subinterval

of Œ0; 1: Suppose also that the one-sided limits f .x/ and f .xC/ exist for some
fixed point x 2 .0; 1/. Then for > 2 and n sufficiently large,
ˇ ˇ X p
ˇ ˇ n
ˇGn;1 .f I x/ 1 .f .xC/ C f .x//ˇ 5
V
xC.1x/= k
p .gx /
kD1
1
Cp jf .xC/ f .x/j;
8e nx.1 x/
where the auxiliary function gx is as defined in Theorem 7.2.

In response to a question posed by Gupta in private communication to Rogalski,
regarding the better bounds, Bastien and Rogalski [35] established a better bound
for the Baskakov basis function, which can be used in the above Theorem 7.16; this
was also remarked in [218].
7.9 Meyer–König–Zeller Operators
In 1988, Guo [89] introduced certain integral modifications of Meyer–König–Zeller

operators defined on Œ0; 1 as
1 Z
.n C k 2/.n C k 3/ X 1
Mn .f; x/ D pn;kC1 .x/ pn2;k1 .t/f .t/dt;
n2 0
kD1
(7.39)
nCk1
where pn;k .x/ D x k .1 x/n . He obtained the following rate of
k

nCk1
convergence by considering the bound x k .1 x/n pnx
33
3=2 :
k
Theorem 7.17. Let f be a function of bounded variation on Œ0; 1, x 2 .0; 1/. Then
ˇ ˇ X p
ˇ ˇ n
ˇMn .f; x/ 1 .f .xC/ C f .x//ˇ 7 V
xC.1x/= k
p .gx /
ˇ 2 ˇ nx xx= k
kD1
50
C p 3=2 jf .xC/ f .x/j;
nx
where
8
< f .t/ f .x/ ; 0 t < x
gx .t/ D 0 ; t Dx
:
f .t/ f .xC/ ; x < t 1
Later, in 1995, Gupta [93] improved the above result by using a better bound for the
MKZ basis function and obtained the following main result:
7.9 Meyer–König–Zeller Operators 245
ˇ ˇ
ˇ ˇ X
n p
ˇMn .f; x/ 1 .f .xC/ C f .x//ˇ 7 V
xC.1x/= k
p .gx /
ˇ 2 ˇ nx xx= k
kD1
114
C p jf .xC/ f .x/j;
15 nx 3=2
where gx .t/ is as defined in Theorem 7.17.

In 1998, Zeng [246] obtained the optimum bound for the MKZ basis function and
obtained the better approximation. In the preceding Theorem 7.18, he obtained the
coefficient of jf .xC/ f .x/j as p 3 3=2 , but while calculating the estimate, there
8ex
was a mistake. Later Gupta and Kumar [114] gave the correct estimate
of this
theorem and found the coefficient of jf .xC/ f .x/j to be 3 C p1 pnx1 3=2 :
8e
In this continuation, Guo [90] considered another integrated MKZ operator on
Œ0; 1 as
1
X Z
Kn .f; x/ D mn;k .x/ f .t/dt; (7.40)
kD0 Ik

nCkC1
where Ik D k kC1
nCk ; nCkC1and mn;k .x/ D .n C 1/ x k .1 x/n . Guo
k
[90] established the following main result:
ˇ ˇ
ˇ ˇ X
n p
ˇKn .f; x/ 1 .f .xC/ C f .x//ˇ 5 V
xC.1x/= k
p .gx /
ˇ 2 ˇ nx xx= k
kD1
49
C p 3=2 jf .xC/ f .x/j;
nx

Love et al. [183] claimed to have improved the preceding theorem by considering
the correct moment estimation, but the result was still not correct.
Theorem 7.20 ([183]). Let f be a function of bounded variation on Œ0; 1: Then
for 0 < ı x 1 ı and any integer n > 2,
ˇ ˇ
ˇ ˇ
ˇKn .f; x/ 1 .f .xC/ C f .x//ˇ p 5 jf .xC/ f .x/j
ˇ 2 ˇ nx 3=2

1 8x.1 x/ 1ı
C 1C 1 C
n1 ı2 12.n 2/ı
X
n p
xC.1x/= k
V p .gx /;
xx= k
kD1

As above, using the bound of Zeng [246] in the above Theorem 7.20, Gupta
[97]
correctly obtained the coefficient of jf .xC/ f .x/j: It was 3 C
8 p1 p 1
nx 3=2
.
2e
In order to approximate Lebesgue integrable functions on Œ0; 1, Gupta and Abel
[107] proposed the Durrmeyer variant of Meyer–König and Zeller as operators as
1
X Z 1
Dn .f; x/ D pn;k .x/ bn;k .t/f .t/dt; x 2 Œ0; 1; n 2 N;
kD0 0
.nCk/Š k
where pn;k .x/ is given in (7.39) and bn;k .t/ D kŠ.n1/Š t .1 t/n1 : Gupta and Abel
[107] estimated the rate of convergence of these operators for functions of bounded
variation.
Theorem 7.21 ([107]). Let f be a function of bounded variation on Œ0; 1: Then
for each x 2 .0; 1/; K > 12:25, there is a constant N independent of f and n; such
that for all n > N , we have
ˇ ˇ
ˇ ˇ
ˇDn .f; x/ 1 .f .xC/ C f .x//ˇ p 1 jf .xC/ f .x/j
ˇ 2 ˇ
8e nx n
K X xC.1x/=pk
n
C V p .gx /;
nx.1 x/ xx= k
kD1

For f 2 L1 Œ0; 1, Gavrea and Trif [83] introduced another Durrmeyer-type
modification of the Meyer–König and Zeller operators as
X
n Z 1
Tn .f; x/ D pnC1;k .x/ bn;k .t/f .t/dt
kD0 0
X
n Z 1
C pnC1;k .1 x/ mn;k .1 t/f .t/dt; (7.41)
kD0 0
7.9 Meyer–König–Zeller Operators 247
where pnC1;k .x/ and mn;k .t/ can be derived from (7.39) and (7.40), respectively.
They [83] used the identity
X
n X
n
pnC1;k .x/ C pnC1;k .1 x/ D 1; x 2 R;
kD0 kD0
to define the operators (7.41). The probabilistic proof of this identity was given by
Zeilberger [245]. In 2012, Trif [234] estimated the rate of convergence for functions
of bounded variation of the operators (7.41).
Theorem 7.22 ([234]). If f W Œ0; 1 ! R is a function of bounded variation on
Œ0; 1; then for each n 4 and x 2 .0; 1/, one has
ˇ ˇ
ˇ ˇ
ˇTn .f; x/ 1 .f .xC/ C f .x//ˇ p 1 jf .xC/ f .x/j C Vak;x
bk;x
.gx /
ˇ 2 ˇ
2 n'.x/
" #
84 X
n1
bk;x
C V0 .gx / C
1
Vak;x .gx / ;
.n 1/' 2 .x/
kD1
where '.x/ W minfx; 1 xg;
x 1x
ak;x WD x p ; bk;x WD x C p ;
k k
where gx W Œ0; 1 ! R is the auxiliary function as defined in Theorem 7.17.

Chapter 8
Convergence for Bounded Functions
on Bézier Variants
The various Bézier variants (BV) of the approximation operators are important
research topics in approximation theory. They have
close relationships with
n
geometry modeling and design. Let pn;k .x/ D x k .1 x/nk ; .0 k n/
k
be Bernstein basis functions. The Bézier basis functions,
P which were introduced
in 1972 by Bézier [39], are defined as Jn;k .x/ D nj Dk pn;j .x/. For ˛ 1 and a
function f defined on Œ0; 1, the Bernstein–Bézier operators Bn;˛ .f; x/, which were
introduced by Chang, [51] are defined as
X
n
k .˛/
Bn;˛ .f; x/ D f Qn;k .x/; (8.1)
n
kD0
.˛/
where Qn;k .x/ D .Jn;k
˛
.x/ Jn;kC1
˛
.x//; .Jn;nC1 .x/ 0/:
Chang [51] studied the convergence of the operators (8.1) and showed that for
f 2 C Œ0; 1; limn!1 Bn;˛ .f; x/ D f .x/ uniformly on Œ0; 1. In this continuation,
Li and Gong [176] established the rate of convergence in terms of the modulus of
continuity for Bernstein–Bézier operators.
Theorem 8.1 ([176]). For f 2 C Œ0; 1, we have

.1 C ˛=4/!.n1=2 ; f /; ˛ 1;
jjBn;˛ .f; x/ f jjC Œ0;1
M!.n˛=2 ; f / ; 0 < ˛ < 1;
where !.ı; f / is the modulus of continuity f .x/, and M is a constant depending

only on ˛ and f .
In 1986, Liu [177] established an inverse theorem for Bernstein–Bézier
polynomials.

250 8 Convergence for Bounded Functions on Bézier Variants
Theorem 8.2 ([177]). For f 2 C Œ0; 1; ˛ 1 and 0 < ˇ < 1 such that
n p o ˇ
jBn;˛ .f; x/ f j M max n1 ; x.1 x/=n1=2 ;
where M is a constant f 2 Lipˇ.

For f 2 L1 Œ0; 1, the Bernstein–Kantorovich–Bézier operators are defined as
X
n Z
.˛/
Ln;˛ .f; x/ D .n C 1/ Qn;k .x/ f .t/dt; (8.2)
kD0 Ik
.˛/
where Ik D Œk=.n C 1/; .k C 1/=.n C 1/, 0 k n, and Qn;k .x/ is as defined
in (8.1).
Also, in 1991, Liu [178] studied the operators (8.2) in the Lp -norm and estimated
the direct result.
Theorem 8.3 ([178]). Let 1 p < 1. Then for any f 2 Lp .0; 1/, we have
jjLn;˛ .f; :/ f jjp M!.f; n1=2 /p ;
where M is a constant depending only on ˛ and p, and !.f; t/p is the modulus of
continuity of f in Lp Œ0; 1:
Zeng and collaborators (see [247, 248, 253, 255]) have done commendable
work on the Bézier variants of different operators. They established the rate of
convergence for functions of bounded variation for several operators. In this chapter,
we mention some results on the rate of convergence on certain Bézier-type operators
for bounded functions and for functions of BV.
Throughout this chapter, we define a metric form:
x .f; / D sup T jf .t/ f .x/j;

t 2Œx;xC Œ0;1/
where 0: It satisfies each of the following properties:

1. x .f; h/ is monotone nondecreasing with respect to h.
2. limh!1 x .f; h/ D 0 if f is continuous at the point x.
3. If f is a function of bounded variation on Œa; b and Vab .f / denotes the total
variation of f on Œa; b, then
x .f; h/ Vxh
xCh
.f /:
8.1 Bernstein–Bézier-Type Operators
The rate of convergence of the Bézier variant of classical Bernstein polynomials and
Bernstein–Kantorovich operators for functions of bounded variation was studied
first by Zeng and Piriou [255]. They observed [255] that the operators Bn;˛ .f; x/,
8.1 Bernstein–Bézier-Type Operators 251
Ln;˛ .f; x/ defined by (8.1) and (8.2), respectively, are not Feller operators except
for ˛ D 1, namely, Bn;˛ .t; x/ ¤ x and Ln;˛ .t; x/ ¤ x: Zeng and Piriou established
the rate of convergence by considering better bounds. For the auxiliary function gx
used in this section, we refer to Theorem 7.5.
Theorem 8.4 ([255]). Let f be of bounded variation on Œ0; 1. Then for every x 2
Œ0; 1 and n 1, we have
ˇ ˇ
ˇ ˇ
ˇBn;˛ .f; x/ 1 f .xC/ C 1 1 f .x/ ˇ
ˇ 2˛ 2˛ ˇ
3˛ X xC.1x/=pk
n
V p .gx /
nx.1 x/ C 1 xx= k
kD1
2˛
Cp .jf .xC/ f .x/j C en .x/jf .x/ f .x/j/ ;
nx.1 x/ C 1
where

0; x ¤ k=n for all k 2 N;

en .x/ D
1; x D k=n for a k 2 N:
When x D 0 (resp., x D 1), we set 1=2˛ f .xC/ C .1 1=2˛ /f .x/ D f .0/

(resp., f .1/).
Theorem 8.5 ([255]). Let f be of bounded variation on Œ0; 1. Then for every x 2
.0; 1/ and n > 1=3x.1 x/; we have
ˇ ˇ
ˇ ˇ
ˇLn;˛ .f; x/ 1 f .xC/ C 1 1 f .x/ ˇ
ˇ 2 ˛ 2 ˛ ˇ
5˛ X xC.1x/=pk
n
V p .gx /
nx.1 x/ C 1 xx= k
kD1
4˛
Cp jf .xC/ f .x/j:
nx.1 x/ C 1
In 2000, Zeng and Chen [251] extended the studies in this direction, introducing the
Bézier variant of Bernstein–Durrmeyer operators. For a function defined on Œ0; 1
and ˛ 1, the Durrmeyer–Bézier operators Dn;˛ .f; x/ are defined by
X
n Z 1
.˛/
Dn;˛ .f; x/ D .n C 1/ Qn;k .x/ pn;k .t/f .t/dt; (8.3)
kD0 0
where pn;k .t/ is the Bernstein basis function.

Theorem 8.6 ([251]). Let f be of bounded variation on Œ0; 1 and ˛ 1. Then for
every x 2 .0; 1/ and n > 1=.x.1 x//; we have
ˇ ˇ
ˇ 1 ˛ ˇ
ˇDn;˛ .f; x/ f .xC/ C f .x/ ˇ
ˇ ˛C1 ˛C1 ˇ
8˛ X xC.1x/=pk
n
V p .gx /
nx.1 x/ xx= k
kD1
2˛
Cp jf .xC/ f .x/j:
nx.1 x/
8.2 Bleimann–Butzer–Hann–Bézier Operators
Bleimann et al. [41] introduced a sequence of positive linear operators defined on

the space of real functions on the infinite interval Œ0; 1/ by
X
n
k
Ln .f; x/ D pn;k .x/f ; x 2 Œ0; 1/I n 2 N WD f1; 2; 3; : : :g;
nkC1
kD0
(8.4)
where
!
n k nk x 1
pn;k .x/ D p q ; px D I qx D 1 px D :
k x x 1Cx 1Cx
In fact, we can write

Sn;x
Zn;x D ; Sn;x D 1;x C C n;x ;
n Sn;x C 1
where 1;x ; : : : ; n;x are independent random variables having the same Bernoulli
distribution with parameters
x
px D ;
1Cx
that is,
Probfk;x D 1g D px and Probfk;x D 0g D qx D 1 px ;
so that Sn;x has a binomial distribution with parameters n; px . This probabilistic
representation plays an important technical role. Srivastava and Gupta [219]
considered the Bézier variant of the Bleimann–Butzer–Hann operators as follows:
X
n
.˛/ k
Ln;˛ .f; x/ D Qn;k .x/f ; x 2 Œ0; 1/I n 2 N I ˛ 1; (8.5)
nkC1
kD0
8.2 Bleimann–Butzer–Hann–Bézier Operators 253
where
.˛/
Qn;k .x/ D .Jn;k .x//˛ .Jn;kC1 .x//˛ Jn;kC1 .x/ D 0;
and
X
n
Jn;k .x/ D pn;j .x/
j Dk
One can easily verify that Ln;˛ .f; x/ are positive linear operators and that
Ln;1 .f; x/ Ln .f; x/
in terms of the Bleimann–Butzer–Hann operators Ln .f; x/ defined by (8.4).

Some basic properties of Jn;k .x/ are given below:
1. Jn;k .x/ Jn;kC1 .x/ D pn;k .x/ k 2 N0 D N [ f0g:
2. Jn;0 .x/ > Jn;1 .x/ > Jn;k .x/ > Jn;kC1 .x/ > .
3. For k 2 N; 0 < Jn;k .x/ < 1 and Jn;k .x/ increases strictly on Œ0; 1/:
By the Lebesgue–Stieltjes integral representation, we have
Z 1
Ln;˛ .f; x/ D f .t/dt .Kn;˛ .x; t// ;
0
where the kernel Kn;˛ .x; t/ is defined by

(P
.˛/
Qn;k .x/; 0 < t < 1;
Kn;˛ .x; t/ D k<.nkC1/t
0; t D 0:

subinterval of the infinite interval Œ0; 1/: Suppose also that, for some r 2 N;
f .t/ D O.t r /; t ! 1: Then, for x 2 .0; 1/; ˛ 1; and n sufficiently large,
ˇ ˇ
ˇ ˇ
ˇLn;˛ .f; x/ 1 f .xC/ 1 1 f .x/ˇ
ˇ 2 ˛ 2 ˛ ˇ
9˛.1 C x/
p .jf .xC/ f .x/j C "n .x/jf .x/ f .x/j/
nx

7˛.1 C x/2 X
n
x
C x fx ; p C O.n1 /; n ! 1;
.n C 2/x k
kD1
where

1; .n C 1/px 2 N;
"n .x/ D
0; otherwi se;
and fx .t/ is as defined in Theorem 7.7.
8.3 Balazs–Kantorovich–Bézier Operators
Agratini [17] defined the Kantorovich variant of the Bernstein-type rational

operators [33] as
X
n Z
Ln .f; x/ D nan pn;k .x/ f .t/dt; n 2 N; x 0; (8.6)
kD0 In;k
where In;k D Œk=nan ; .k C 1/=nan : For ˛ 1, Gupta and Zeng [135] defined the
Bézier variant of these Balazs–Kantorovich operators (8.6) as
X
n Z
Ln;˛ .f; x/ D nan ˛
Qn;k .x/ f .t/dt
kD0 In;k
Z 1
D Wn;˛ .x; t/f .t/dt;
0
P
where Qn;k˛
.x/ D Jn;k˛
J ˛ .x/, Jn;k .x/ D nj Dk pn;j .x/ is the basis function,
P1 n;kC1
Wn;˛ .x; t/ D nan kD0 Qn;k ˛
.x/n;k .t/; and n;k .t/ is the characteristic function
of the interval In;k with respect to Œ0; 1/:
Let
ˆloc;r D ff W f is bounded in every finite subinterval of Œ0; 1/;

f .t/ D O.t r /; r > 0 as; t ! 1g:
Lemma 8.1 ([135]). For x 2 .0; 1/, we have

ˇ ˇ
ˇ X ˇ
ˇ 1 ˇˇ Œ1 C .an x/2 C 0:5.1 C an x/2
ˇ pn;k .x/ p :
ˇ 2 ˇˇ .1 C an x/Œ1 C nan x
ˇk>nan x=.1Can x/
Lemma 8.2. For all x 0; we have
Ln .1; x/ D 1;
x 1
Ln .t; x/ D C ;
1 C an x 2nan
n1 x2 2x 1
Ln .t 2 ; x/ D C C 2 2:
n .1 C an x/2 nan .1 C an x/ 3n an
Thus,
1 nan 3 x 4 an 2 x 3 an x 2 C x
Ln ..t x/2 ; x/ D C
3n2 an 2 n2 an 2
8.3 Balazs–Kantorovich–Bézier Operators 255
1 C nan x C n2 an 4 x 4
D O..nan /1 /:
n2 an 2
Lemma 8.3 ([135]). Let x 2 .0; 1/: Then, for sufficiently large n, we have
Z
y
˛ 1 C nan x C n2 an 4 x 4
ˇn;˛ .x; y/ D Wn;˛ .x; t/dt ; 0 y < x;
0 .x y/2 n2 an 2
(8.7)
and
Z 1
˛ 1 C nan x C n2 an 4 x 4
1ˇn;˛ .x; z/ D Wn;˛ .x; t/dt ; x z < 1:
z .z x/2 n2 an 2
(8.8)
Theorem 8.8 ([135]). Let f 2 ˆloc;r ; f .xC/ and f .x/ exist at a fixed point x 2
.0; 1/: Then, for ˛ 1; r > 1, and for sufficiently large n, we have
ˇ ˇ
ˇ ˇ
ˇLn;˛ .f; x/ 1 f .xC/ 1 1 f .x/ˇ
ˇ 2 ˛ 2 ˛ ˇ

Œ1 C .an x/2 C 0:5.1 C an x/2 1 C an x
˛ p Cp jf .xC/ f .x/j
.1 C an x/Œ1 C nan x 2e nan x
4˛C4˛nan xCnan 2 x 2 C4˛n2 an 4 x 4 X p
n
C 2 2 2
x .gx ; x= k/CO..nan /r /;
n an x
kD1
where the auxiliary function gx .t/ is defined in Theorem 7.7.

Proof. Since Ln;˛ .ıx ; x/ D 0; we have
ˇ ˇ
ˇ ˇ
ˇLn;˛ .f; x/ 1 f .xC/ 1 1 f .x/ˇ
ˇ 2 ˛ 2 ˛ ˇ
jf .xC/ f .x/j
jLn;˛ .gx ; x/j C Ln;˛ .signx .t/; x/: (8.9)
2˛
Since pn;k p1Can x ,

2enan x
and using Lemma 8.1, we have

Œ1C.an x/2 C0:5.1Can x/2 1Can x
jLn;˛ .signx .t/; x/j ˛2˛ p C p : (8.10)
.1Can x/Œ1C nan x 2e nan x
Next, we estimate Ln;˛ .gx .t/; x/ by decomposing the integral into four parts as
Z Z p Z p Z Z !
˛ xx= n xCx= n 2x 1
gx .t/Wn;˛ .x; t/dt D C p C p C gx .t/Wn;˛ .x; t/dt
0 0 xx= n xCx= n 2x
WD E1 C E2 C E3 C E4 :
First, we estimate E1 . Since x .gx ; / ispmonotone nondecreasing with respect to

, we integrate by parts with y D x x= n to get
ˇZ ˇ Z
ˇ xx=pn ˇ p
xx= n
ˇ ˇ
jE1 j D ˇ gx .t/dt .ˇn;˛ .x; t//ˇ x .gx ; x t/dt .ˇn;˛ .x; t//
ˇ 0 ˇ 0
Z y
x .gx ; x y/.ˇn;˛ .x; y// C ˇOn;˛ .x; t/d.x ; x t/;
0
where ˇOn;˛ .x; t/ is the normalized form of ˇn;˛ .x; t/. Since ˇOn;˛ .x; t/ ˇn;˛ .x; t/
on .0; 1/, using (8.7) and rearranging the last integral, we have

jE1 j ˛ x .gx ; x/
n2 an 2 x 2
Z y
1 C nan x C n2 an 4 x 4 2
C˛ x .gx ; x t/ dt:
2
n an 2
0 .x t/3
p
Now, putting t D x x= u in the last integral, we have
Z p
1 X
y n
2
x .gx ; x t/ dt x gx ; x= k :
0 .x t/3 x2
kD1
So we get
X
n p
jE1 j 2˛ x gx ; x= k : (8.11)
n2 an 2 x 2
kD1
Since gx .x/ D 0; we have

Z p
p
1X
xCx= n n
jE2 j p jgx .t/ gx .x/jdt .ˇn;˛ .x; t// x gx ; x= k : (8.12)
xx= n n
kD1
Along similar lines as estimating E1 , we get

X
n p
jE3 j 2˛ x .gx ; x= k/: (8.13)
n2 an 2 x 2
kD1
Finally, to estimate E4 , let r > 1 be such that f .t/ D O.t 2r /; t ! 1, and for a
certain constant C > 0 depending on f; x; r; we have
1
X Z 1 1
X Z 1
.˛/
jE4 j C nan Qn;k .x/ n;k .t/t 2r dt C nan ˛ pn;k .x/ n;k .t/t 2r dt:
kD0 2x kD0 2x
8.4 Szász–Kantorovich–Bézier Operators 257
By Lemma 8.2, we have
jE4 j D O..nan /r /; n ! 1: (8.14)
Collecting (8.9)–(8.14), we complete the proof of the theorem.

One can observe from the following example that a class of bounded functions
on the interval Œ0; 1/ need not be of bounded variation.
Example 8.1. Consider the function
8
< 0; x D 0;
f .x/ D x sin. x12 /; 0 < x 1 ;
:
sin 1; x 1:
8.4 Szász–Kantorovich–Bézier Operators
Gupta et al. [138] considered the Szász–Kantorovich–Bézier operators Sn;˛ defined

on the space of real functions on the infinite interval I D Œ0; 1/ by
1
X Z kC1
n
.˛/
Sn;˛ .f I x/ D n Qn;k .x/ f .t/dt .n 2 N; ˛ 1; or 0 < ˛ < 1/;
k
kD0 n
(8.15)
where
.˛/
Qn;k .x/ D .Jn;k .x//˛ .Jn;kC1 .x//˛ ;
and
1
X .nx/k
Jn;k .x/ D sn;j .x/; sn;k .x/ D exp.nx/ :
kŠ
j Dk
Some basic properties of Jn;k .x/ are given in [138]. For ˛ 1, we have
.˛/
Qn;k .x/ ˛.Jn;k .x/ Jn;kC1 .x// D ˛sn;k .x/:
For 0 < ˛ < 1; we have

.˛/
˛sn;k .x/ Qn;k .x/ sn;k
˛
.x/:
It is easy to verify that Sn;˛ are positive linear operators and that Sn;1 is just the
Szász–Kantorovich operator studied in [231]. Let the kernel function Kn;˛ .x; t/ be
defined by
1
X .˛/
Kn;˛ .x; t/ D n Qn;k .x/'n;k .t/;
kD0
where 'n;k .t/ denotes the characteristic function of the interval Ik D Œk=n; .k C
1/=n with respect to I D Œ0; 1/. Then, by Lebesgue–Stieltjes integral representa-
tion, we have
Z 1
Sn;˛ .f; x/ D f .t/Kn;˛ .x; t/dt: (8.16)
0
The case ˛ 1 for the rate of convergence was considered in [138].

The case 0 < ˛ < 1 was studied in [136]. We mention here the basic results and
the main results on the rate of convergence that were studied in [136].
Let
ˆB D f f jf is measurable on Œ0; 1/ and is bounded on every finite subinterval

of Œ0; 1/; for some r > 0; f .t/ D O..1 C t/r / as t ! 1g:
For f 2 ˆB , x 2 Œ0; 1/, and

0:
Lemma 8.4. For each fixed x 2 .0; 1/; if Tn;m .x/ D Sn ..t x/m ; x/, then
1 1 C 3nx
Sn .1; x/ D 1; Sn .t x; x/ D and Sn ..t x/2 ; x/ D :
2n 2n2
We define
Tn; .x/ D Sn;1 .jx tj ; x/:
Lemma 8.5 ([136]). Let the kernel function Kn;˛ .x; t/; 0 < ˛ < 1 be defined as in
(8.16). Then
(i) For 0 < y < x, we have
Z y
3nx C 1
Kn;˛ .x; t/dt :
0 2n2 .x y/2
(ii) For z < x < 1, we have

Z 1
21˛ .Tn;2=˛ .x//˛
Kn;˛ .x; t/dt :
z .z x/2
Proof. Choose an integer k 0 2 Œ0; 1/ such that y 2 Œk 0 =n; .k 0 C 1/=n/. Then

0
y D kn C n" with some " 2 Œ0; 1/; and we have
Z y
0 1
kX
.˛/ .˛/
Kn;˛ .x; t/dt D Qn;k .x/ C "Qn;k 0 .x/
0 kD0
D 1 .1 "/Jn;k
˛
0 .x/ "Jn;k 0 C1 .x/
˛
1 .1 "/Jn;k 0 .x/ "Jn;k 0 C1 .x/

0 1
kX Z y
D Qn;k .x/ C "Qn;k 0 .x/ D Kn;1 .x; t/dt
kD0 0
1 3nx C 1
Tn;2 .x/ 2 :
.x y/ 2 2n .x y/2
This completes the proof of (i).

Next,
Z 1 1
X
.˛/ k0 C 1 .˛/
Kn;˛ .x; t/dt D nQn;k 0 .x/ z C Qn;k .x/
z n 0 kDk C1
1
!˛
.˛/ k0 C 1 X
D nQn;k 0 .x/ z C sn;k .x/
n
kDk 0 C1
1
!˛ 1
!˛
X X
sn;k 0 .x/ C
˛
sn;k .x/ 2 1˛
sn;k .x/
kDk 0 C1 kDk 0
1 Z !˛
21˛ X .kC1/=n
nsn;k .x/ jt xj 2=˛
dt
.z x/2 k=n
kDk 0
21˛ ˛
Tn;2=˛ .x/ :
.z x/2
Lemma 8.6 ([136]). For x > 0 and 0 < ˛ < 1; all n sufficiently large,
.˛/ ˛41˛
Qn;k .x/ p
2e nx
holds.
Proof. By using the bound given in [256], for sufficiently large n, we have
1
sn;k .x/ p :
2e nx
Next, by the mean value theorem, we have

.˛/
Qn;k 0 .x/D˛.n;k 0 .x//˛1 ŒJn:k 0 .x/Jn;k 0 C1 .x/D˛.n;k 0 .x//˛1 sn;k 0 .x/; (8.17)
where Jn;k 0 C1 .x/ < n;k 0 .x/ < Jn;k 0 .x/: But in view of Lemma 4 of [138], we have
1
X 1
n;k 0 .x/ > Jn;k 0 C1 .x/ D sn;j .x/ > ; (8.18)
4
j Dk 0 C1
for some n > n0 .x/: Hence, by (8.17) and (8.18), we have
.˛/ ˛41˛
Qn;k 0 .x/ < ˛41˛ sn;j .x/ < p
2enx
:

Lemma 8.7 ([136]). If x belongs to the interval Ik 0 defined in (8.16) for some
nonnegative integer k 0 , then for 0 < ˛ < 1; we have
ˇ 1 ˇ p
ˇX 1 ˇˇ
ˇ 1˛ 0:8 1 C 3x
ˇ s .x/ ˛ ˇ ˛4
˛
p :
ˇ 0 n;k 2 ˇ nx
kDk
Proof. By the mean value theorem, we have

ˇ 1 ˇ ˇ 1 ˇ
ˇX ˇ ˇX 1 ˇˇ
ˇ 1 ˇ ˇ
ˇ ˛
sn;k .x/ ˛ ˇ D ˛.n;k 0 .x//˛1 ˇ sn;k .x/ ˇ; (8.19)
ˇ 0 2 ˇ ˇ 0 2ˇ
kDk kDk
P
where n;k 0 .x/ lies between 12 and 1 kDk 0 sn;k .x/: Using Lemma 2 of [247], we
find that
ˇ 1 ˇ p
ˇX 1 ˇˇ 0:8 1 C 3x
ˇ
ˇ sn;k .x/ ˇ p (8.20)
ˇ 0 2ˇ nx
kDk
P1
As kDk 0 sn;k > 14 ; for all n > n0 .x/: Hence, .n;k 0 .x//˛1 41˛ ; n > n0 .x/:
Therefore, by combining (8.19) and (8.20), we get the desired result.
Theorem 8.9 ([136]). Let 0 < ˛ < 1, and let f 2 ˆB and f .xC/, f .x/ exist at
a fixed point x 2 .0; 1/. Then, for n > 11.1 C 3x/=x, we have
ˇ ˇ
ˇ ˇ Xn p
ˇSn;˛ .f; x/ f .xC/ C .2 1/f .x/ ˇ B˛ 3˛ C 5 C x
˛
ˇ ˛ ˇ x .gx ; x= k/
2 nx
kD1
p
2 1 C 3x jf .xC/ f .x/j
C p C O.nr /;
nx
where B˛ is a constant depending on ˛, f .t/ D O.t r /, and the auxiliary function

gx .t/ is defined in Theorem 7.7.
Proof. For any f 2 ˆB , if f .xC/ and f .x/ exist at x, then by decomposition

(cf. [253], p. 1449),

1 1 f .xC/ f .x/
f .t/ D ˛
f .xC/ C 1 ˛
f .x/ C gx .t/ C sgn˛;x .t/
2 2 2˛

1 1
C
x .t/ f .x/ ˛ f .xC/ 1 ˛ f .x/ ;
2 2
where
8 ˛
< 2 1; t > x;
1; t D x;
sgn˛;x .t/ D 0; t D x;
x .t/ D
: 0; t ¤ x:
1; t < xI
Obviously,
Sn;˛ .
x ; x/ D 0:
Hence, it follows that

ˇ ˇ
ˇ ˇ
ˇSn;˛ .f; x/ 1 f .xC/ 1 1 f .x/ˇ jSn;˛ .gx ; x/j
ˇ 2 ˛ 2 ˛ ˇ
ˇ ˇ
ˇ f .xC/ f .x/ ˇ
C ˇˇ ˛
Sn;˛ .sgnx;˛ ; x/ˇˇ : (8.21)
2
We need to estimate jSn;˛ .sgnx;˛ ; x/j and jSn;˛ .gx ; x/j. Let x 2 Ik 0 [see (8.16)] for
some k 0 . Then
1 0
X .˛/
X
k
.˛/
Sn;˛ .sgnx;˛ ; x/ D .2 1/
˛
Qn;k .x/ Qn;k .x/
kDk 0 kD0

.˛/ k0 C 1 k0
C nQn;k 0 .x/ .2˛ 1/ x x
n n
1
X .˛/ X1
.˛/ k0 C 1
2 ˛
Qn;k .x/ 1 C 2 ˛
nQn;k 0 .x/ x :
0 0
n
kDk kDk
By Lemmas 8.6 and 8.7, we have

ˇ 1 !˛ ˇ
ˇ X 1 ˇˇ
ˇ .˛/
jSn;˛ .sgnx;˛ ; x/j 2 ˇ
˛
sn;k .x/ ˛ ˇ C 2˛ Qn;k 0 .x/:
ˇ 0
2 ˇ
kDk
p p
˛ ˛4
1˛
.0:8 1 C 3x C .2e/1=2 / ˛ 2 1 C 3x
2 p 2 p :
nx nx
(8.22)
Next, we estimate jSn;˛ .gx ; x/j. We write
Z 4 Z
X
Sn;˛ .gx ; x/ D gx .t/Kn;˛ .x; t/dt D gx .t/Kn;˛ .x; t/dt; (8.23)
Œ0;1/ j D1 Aj
where
p p p
A1 WD Œ0; x x= n; A2 WD .x x= n; x C x= n;
p
A3 WD .x C x= n; 2x; A4 WD .2x; 1/:
First, note that gx .x/ D 0. Thus,

ˇZ ˇ
ˇ ˇ p 1X n
p
ˇ ˇ
gx .t/Kn;˛ .x; t/dt ˇ x gx ; x= n x gx ; x= k : (8.24)
ˇ n
A2 kD1
R
To estimate j A1 gx .t/Kn;˛ .x; t/dtj, note that x .gx ;
/ is monotone increasing
with respect to
. Thus, it follows that
p
ˇZ ˇ Z n
ˇ xx=pn
xx=
ˇ
ˇ ˇ
ˇ gx .t/dt Kn;˛ .x; t/ˇ x .gx ; x t/dt Kn;˛ .x; t/:
ˇ 0 ˇ
0
p
Integrating by parts with y D x x= n, we have
p
Z n
xx=
x .gx ; x t/dt Kn;˛ .x; t/ x .gx ; x y/Kn;˛ .x; y/

0
Zy
C KO n;˛ .x; t/d.x ; x t//; (8.25)
0
where KO n;˛ .x; t/ is the normalized form of Kn;˛ .x; t/: Since KO n;˛ .x; t/
Kn;˛ .x; t/ on .0; 1/, from (8.25) and Lemma 8.5, it follows that
ˇZ ˇ
ˇ ˇ 3nx C 1
ˇ gx .t/dt Kn;˛ .x; t/ˇˇ x .gx ; x y/ 2
ˇ 2n .x y/2
A1
Zy
3nx C 1 1
C d.x .gx ; x t//: (8.26)
2n2 .x t/2
0
Since
Zy
1 x .gx ; x y/
d.x .gx ; x t// D
.x t/2 .x y/2
0
Zy
x .gx ; x/ 2
C C x .gx ; x t/ dt:
x2 .x t/3
0
Thus, we have
ˇZ ˇ
ˇ xx=pn ˇ 3nx C 1
ˇ ˇ
ˇ gx .t/dt Kn;˛ .x; t/ˇ x .gx ; x/
ˇ 0 ˇ 2n2 x 2
p
Z n
xx=
3nx C 1 2
C x .gx ; x t/ dt:
2n2 .x t/3
0
p
Putting t D x x= u for the last integral, we get
p
Z n
xx= Zn
2 1 p
x .gx ; x t/ dt D 2 x .gx ; x=x u/d u
.x t/ 3 x
0 1
1 X
n p
x .gx ; x= k/:
x2
kD1
Consequently,
ˇZ ˇ !
ˇ ˇ 3nx C 1 X
n p
ˇ gx .t/Kn;˛ .x; t/dt ˇˇ x .gx ; x/ C x .gx ; x= k/
ˇ 2n2 x 2
A1 kD1
3nx C 1 X
n p
x .gx ; x= k/: (8.27)
n2 x 2
kD1
ˇR ˇ
ˇ ˇ
Using a similar method to estimate ˇ A3 gx .t/Kn;˛ .x; t/dt ˇ, we get
ˇZ ˇ
ˇ ˇ 3˛ C 1 X p
n
ˇ gx .t/Kn;˛ .x; t/dt ˇˇ B˛ x .gx ; x= k/; (8.28)
ˇ nx
A3 kD1
where B˛ is a constant depending only on ˛.

Finally, we estimate
ˇZ ˇ
ˇ ˇ
ˇ gx .t/Kn;˛ .x; t/dt ˇˇ
ˇ
A4
as f .t/ D O.t r /. Then, proceeding along the lines of [4], we have

ˇZ ˇ 1 Z
ˇ ˇ X 1
ˇ gx .t/Kn;˛ .x; t/dt ˇˇ C n
.˛/
Qn;k .x/ 'n;k .t/t 2r dt D O.nr /: (8.29)
ˇ
A4 kD0 2x
The theorem follows by collecting the estimates of (8.21)–(8.24), (8.26)–(8.28), and

(8.29).
8.5 Baskakov–Bézier Operators
In 2002, Zeng and Gupta [253] introduced the Bézier variant of the well-known
Baskakov operators Bn;˛ for ˛ 1 as
1
X .˛/
Bn;˛ .f; x/ D Qn;k .x/f .k=n/ .n 2 N; ˛ 1; or 0 < ˛ < 1/; (8.30)
kD0
1
X
.˛/
where Qn;k .x/ D ˛
Jn;k .x/ ˛
Jn;kC1 .x/; Jn;k .x/ D bn;j .x/;
j Dk
and

nCj 1 xj
bn;j .x/ D
j .1 C x/nCj
is the Baskakov basis function. When ˛ D 1, the operators (8.30) reduce to the
classical Baskakov operators. Some basic properties of Jn;k .x/ mentioned in [253]
are as follows:
1. Jn;k .x/ Jn;kC1 .x/ D bn;k .x/; k D 0; 1; 2; : : : :
0
2. Jn;k .x/ D nbnC1;k1 .x/; k D 1; 2; 3; : : : :
Rx
3. Jn;k .x/ D n 0 bnC1;k1 .t/dt; k D 1; 2; 3; : : : :
4. Jn;0 .x/ > Jn;1 .x/ > > Jn;k .x/ > Jn;kC1 .x/ > ;
8.5 Baskakov–Bézier Operators 265
and for every natural k; 0 Jn;k .x/ < 1 and Jn;k .x/, it increases strictly on Œ0; 1/.
By the Lebesgue–Stieltjes integral representation, one can write
Z 1
Bn;˛ .f; x/ D f .t/dt .Kn;˛ .x; t/ .n 2 N; ˛ 1; or 0 < ˛ < 1/; (8.31)
0
where
(P
.˛/
Qn;k .x/; ; 0 < t < 1;
K;˛ .x; t/ D knt
0; ; t D 0:
R1 .˛/
Obviously, 0 dt .Kn;˛ .x; t// D Bn;˛ .1; x/ D 1, and Qn;k .x/ > 0 for x 2 Œ0; 1/
and k D 0; 1; 2; : : : . Thus, the operator Bn;˛ .f; x/ is an operator of the probabilistic
type. Consider the following class of function IlocB ˆB :
IlocB D f f jf is bounded on every finite subinterval of Œ0; 1/g:
Lemma 8.8 ([253]). For all x 2 Œ0; 1/ and k 2 N ,

p
.˛/ ˛ 1Cx
˛
Jn;k .x/bn;k .x/ Qn;k .x/ ˛bn;k .x/ nx
holds, and for 0 t < x, we have

X .˛/ ˛x.1 C x/
Qn;k .x/ :
n.t x/2
knt
Lemma 8.10 ([253]). For any fixed ˇ > 0, x 2 .0; 1/, and for n sufficiently large,
X k ˇ
bn;k .x/ D ox .n1=2 /
n
k>2nx
holds.
Theorem 8.10 ([253]). Let f be a function belonging to IlocB , and let f .t/ D
O.t ˇ / for some ˇ > 0 as t ! 1. Then, for every ˛ 1, x 2 .0; 1/ in which
f .xC/ and f .x/ exist and n is sufficiently large, we have
ˇ ˇ p
ˇ ˇ Xn p
ˇBn;˛ .f; x/ f .xC/ C .2 1/f .x/ ˇ 5˛ px C 1
˛
ˇ ˛ ˇ x .gx ; x= k/
2 nx kD1
p
3˛ 1 C x
C p jf .xC/ f .x/j C "n .x/jf .xC/ f .x/j C ox .n1=2 /;
nx
where the auxiliary function gx .t/ is defined in Theorem 7.7,
x .f; / D sup jf .t/ f .x/j

t 2Œx ; xC
and

0
1; x D kn ; k 0 2 N;
"n .x/ D
0; x ¤ kn ; k 2 N:
Proof. Note that for all t, we can write

1 1 f .xC/ f .x/
f .t/ D ˛ f .xC/ C 1 ˛ f .x/ C gx .t/ C sgn˛;x .t/
2 2 2˛

1 1
C
x .t/ f .x/ ˛ f .xC/ 1 ˛ f .x/ ;
2 2
where
8 ˛
< 2 1; t > x;
1; t D x;
sgn˛;x .t/ D 0; t D x;
x .t/ D
: 0; t ¤ x:
1; t < xI
Hence,
ˇ ˇ
ˇ ˇ
ˇBn;˛ .f; x/ 1 f .xC/ 1 1 f .x/ˇ
ˇ 2˛ 2˛ ˇ
ˇ
ˇ f .xC/ f .x/
jBn;˛ .gx ; x/j C ˇˇ Bn;˛ .sgnx;˛ ; x/
2˛
ˇ
1 1 ˇ
C f .x/ ˛ f .xC/ 1 ˛ f .x/ Bn;˛ .
x ; x/ˇˇ : (8.32)
2 2
By direct calculation,
X .˛/
X .˛/
Bn;˛ .sgnx;˛ ; x/ D Qn;k .x/ C .2˛ 1/ Qn;k .x/
k<nx k>nx
8.5 Baskakov–Bézier Operators 267
X .˛/ .˛/
2˛ Qn;k .x/ 1 C "n .x/Qn;k 0 .x/
k>nx
!˛
X .˛/
2 ˛
bn;k .x/ 1 C "n .x/Qn;k 0 .x/
k>nx
.˛/
and Bn;˛ .
x ; x/ D "n .x/Qn;k 0 .x/: Thus, by Lemmas 8.8 and 8.9, we have
ˇ
ˇ f .xC/ f .x/
ˇ Bn;˛ .sgnx;˛ ; x/
ˇ 2˛
ˇ
1 1 ˇ
C f .x/ ˛ f .xC/ 1 ˛ f .x/ Bn;˛ .
x ; x/ˇˇ
2 2
p
3˛ 1 C x
p .jf .xC/ f .x/j C "n .x/f .x/ f .x/j/ :
nx
Next, by Lemma 8.10 and using the standard techniques, we have

5˛.1 C x/ X
n
x
jBn;˛ .gx ; x/j x gx ; p C ox .n1=2 /:
nx k
kD1
Combining the above estimates, one can establish the theorem immediately.
Gupta [101] also studied the other case of the rate of convergence of Baskakov–
Bézier operators, that is, 0 < ˛ < 1.
subinterval of Œ0; 1/. Let f .t/ D O.t r / for some r 2 N as t ! 1. Then, for
every 0 < ˛ < 1, x 2 .0; 1/, there exists a constant M.f; ˛; r; x/ such that for n
sufficiently large,
ˇ ˇ p
ˇ ˇ X n p
ˇBn;˛ .f; x/ f .xC/ C .2 1/f .x/ ˇ 5 px C 1
˛
ˇ ˇ x .gx ; x= k/
2˛ nx kD1
p
3 1Cx M.f; ˛; r; x/
C p jf .xC/ f .x/j C "n .x/jf .xC/ f .x/j C ;
nx nm
where x .f; /; "n .x/, and gx .t/ is defined in Theorem 8.10.

8.6 Baskakov–Kantorovich–Bézier Operators
In 2003, Abel and Gupta [4] introduced a Bézier variant of the Baskakov–

Kantorovich operators Vn;˛ defined by
1
X Z
.˛/
Vn;˛ .f; x/ Dn Qn;k .x/ f .t/dt .n 2 N; ˛ 1; or 0 < ˛ < 1/; (8.33)
kD0 Ik
.˛/
where Ik D Œk=n; .k C 1/=n; Qn;k .x/ D Jn;k
˛
.x/ Jn;kC1
˛
.x/; Jn;k .x/ D
1
X
bn;j .x/; and
j Dk

nCj 1 xj
bn;j .x/ D
j .1 C x/nCj
is the Baskakov basis function.

Abel and Gupta [4] studied the rate of convergence of the operators (8.33) for
functions of bounded variation in the case ˛ 1. They considered W .0; 1/ to be
the class of functions f that are locally integrable on .0; 1/ and are of polynomial
growth as t ! 1; that is, for some positive r, f .t/ D O.t r // as t ! 1 holds.
Theorem 8.12 ([4]). Assume that f 2 W .0; 1/ is a function of bounded variation
on every finite subinterval of .0; 1/. Furthermore, let ˛ 1; x 2 .0; 1/ and
> 1 be given. Then for each r 2 N , there exists a constant M.f; ˛; r; x/ such that

for sufficiently large n, the Bézier-type Baskakov–Kantorovich operators Vn;˛ .f; x/
satisfy the estimate
ˇ ˇ
ˇ ˇ Xn p
ˇV .f; x/ f .xC/ C .2 1/f .x/ ˇ 4˛ .1 C x/ C x
˛
xCx= k
V p .gx /
ˇ n;˛ 2 ˛ ˇ nx xx= k
kD1
p
7˛ 1 C x M.f; ˛; r; x/
C p jf .xC/ f .x/j C ;
2 nx nr
where Vab .gx / is the total variation of gx on Œa; b and the auxiliary function gx .t/
is defined in Theorem 7.7.
Since the other case is equally important, recently Zeng–Gupta–Agratini [257]
established the rate of convergence of the Baskakov–Kantorovich–Bézier operators
in the case 0 < ˛ < 1. Consider the following class of functions ˆB :
ˆB D f f jf is integrable and is bounded on every finite subinterval

of Œ0; 1/; for some r 2 N; f .t/ D O.t r / as t ! 1g;
for f 2 ˆB , x 2 Œ0; 1/, and

0:
8.6 Baskakov–Kantorovich–Bézier Operators 269
Let the kernel function Kn;˛ .x; t/ be defined by

1
X .˛/
Kn;˛ .x; t/ D n Qn;k .x/'n;k .t/; (8.34)
kD0
where 'n;k .t/ denotes the characteristic function of the interval Ik D Œk=n; .k C
1/=n with respect to I D Œ0; 1/. Then, by Lebesgue–Stieltjes integral representa-
tion, we have
Z 1

Vn;˛ .f; x/ D f .t/Kn;˛ .x; t/dt: (8.35)
0
Let f be defined on Œ0; 1/, f .t/ D O.t r /, and let f be the bounded variation
on every finite subinterval of Œ0; 1/. Then the function f satisfies the conditions of
Theorem 8.12. Therefore, Theorem 8.13 subsumes the approximation of functions
of bounded variation as a special case.
Lemma 8.11 ([4, Lemma 4]). For each fixed x 2 .0; 1/; let Tn;m .x/ D

Vn;1 ..t x/m ; x/. Then
1
1 C 3nx.1 C x/
Vn;1 .1; x/ D 1; Vn;1 .t x; x/ D ; Vn;1 .t x/2 ; x D ;
2n 3n2
and

Tn;m .x/ D O nb.mC1/=2c .n ! 1/:
Lemma 8.12 ([257]). Let the kernel function Kn;˛ .x; t/; 0 < ˛ < 1 be defined as
in (8.34). Then
(i) For 0 < y < x, we have
Z y
.1 C x/2
Kn;˛ .x; t/dt :
0 n.x y/2
(ii) For z < x < 1, we have

Z 1
C˛
Kn;˛ .x; t/dt ;
z n.z x/2
where C˛ is a constant depending only on ˛.

Proof. Choose an integer k 0 2 Œ0; 1/ such that y 2 Œk 0 =n; .k 0 C 1/=n/. Then
0
y D kn C n" with some " 2 Œ0; 1/; and we have
Z y
0 1
kX
.˛/ .˛/
Kn;˛ .x; t/dt D Qn;k .x/ C "Qn;k 0 .x/
0 kD0
D 1 .1 "/Jn;k
˛
0 .x/ "Jn;k 0 C1 .x/
˛
1 .1 "/Jn;k 0 .x/ "Jn;k 0 C1 .x/

0 1
kX Z y
D Qn;k .x/ C "Qn;k 0 .x/ D Kn;1 .x; t/dt
kD0 0
1 .1 C x/2
Tn;2 .x/ :
.x y/ 2 n.x y/2
This completes the proof of (i).

Next, if z 2 Œk 00 =n; .k 00 C 1/=n/, then
Z 1 1
X
.˛/ k 00 C 1 .˛/
Kn;˛ .x; t/dt D nQn;k 00 .x/ z C Qn;k .x/
z n 00 kDk C1
1
X .˛/
Qn;k .x/
kDk 00
1
!˛
X
D bn;k .x/ :
kDk 00
Now, by applying Lemma 8.11 and the method that was presented in Lemma 7 of
[13], we obtain inequality (ii).
Lemma 8.13 ([257]). Let 0 < ˛ 1. If x belongs to interval Ik 0 for some
144.x C 1/
nonnegative integer k 0 , then for n > ; we have
x
ˇ 1 ˇ p
ˇ X 1 ˇˇ 12˛ x C 1
ˇ
ˇ bn;k .x/ ˛ ˇ ˛ p
˛
:
ˇ 0 2 ˇ 4 nx
kDk C1
Proof. By the mean value theorem, we have

ˇ 1 ˇ ˇ 1 ˇ
ˇ X 1 ˇˇ ˇ X 1 ˇˇ
ˇ ˛1 ˇ
ˇ bn;k .x/ ˛ ˇ D ˛.n;k 0 .x//
˛
ˇ bn;k .x/ ˇ; (8.36)
ˇ 0 2 ˇ ˇ 0 2ˇ
kDk C1 kDk C1
1 P1
where n;k 0 .x/ lies between 2
and kDk 0 C1 bn;k .x/: Using Lemma 5 of [253], it
holds that
ˇ 1 ˇ p
ˇ X 1 ˇˇ 3 x C 1
ˇ
ˇ bn;k .x/ ˇ p : (8.37)
ˇ 0 2ˇ nx
kDk C1
P1 144.xC1/ 1
From (8.37), we get kDk 0 C1 bn;k > 14 ; for n > x : ; for
Thus, n;k 0 .x/ >
4
144.xC1/
n> x : The conclusion of the lemma now holds from (8.36) and (8.37).
Lemma 8.14 ([257]). Let 0 < ˛ 1. If x belongs to the interval Ik 0 for some
144.x C 1/
nonnegative integer k 0 , then for n > ; it holds that
x
p
.˛/ 2˛ x C 1
Qn;k 0 .x/ ˛ p :
4 nx
Proof. By using the bound given in [256], for any k, we have

p
xC1
bn;k .x/ p : (8.38)
2e nx
On the other hand, by the mean value theorem, we have
.˛/
Qn;k 0 .x/ D ˛.n;k 0 .x//˛1 ŒJn:k 0 .x/ Jn;k 0 C1 .x/ D ˛.n;k 0 .x//˛1 bn;k 0 .x/;
(8.39)
where Jn;k 0 C1 .x/ < n;k 0 .x/ < Jn;k 0 .x/: From (8.37), we get
1
X 1
n;k 0 .x/ > Jn;k 0 C1 .x/ D bn;j .x/ > ; (8.40)
4
j Dk 0 C1
144.xC1/
for n > x
. Combining (8.38), (8.39), and (8.40), we get the desired result.
Theorem 8.13 ([257]). Let 0 < ˛ < 1, and let f 2 ˆB and f .xC/, f .x/ exist
144.x C 1/
at a fixed point x 2 .0; 1/. Then, for n > , we have
x
ˇ ˇ
ˇ ˇ Xn p
ˇV .f; x/ f .xC/ C .2 1/f .x/ ˇ 4C˛ C 4 C x
˛
ˇ n;˛ ˛ ˇ x .gx ; x= k/
2 nx
kD1
p
14˛ 1 C x
C p jf .xC/ f .x/j C O.nl /;
4˛ nx
where C˛ is a constant depending only on ˛, l > r, and the auxiliary function gx .t/
is defined in Theorem 7.7.
Proof. As in Theorem 8.9, we have

ˇ ˇ
ˇ ˇ
ˇV .f; x/ 1 f .xC/ 1 1 f .x/ˇ jV .gx ; x/j
ˇ n;˛ 2 ˛ 2 ˛ ˇ n;˛
ˇ ˇ
ˇ f .xC/ f .x/ ˇ
C ˇˇ ˛
V n;˛ .sgn x;˛ ; x/ ˇ:
ˇ (8.41)
2

We need to estimate jVn;˛ .sgnx;˛ ; x/j and jVn;˛ .gx ; x/j.
0
Let x 2 Ik 0 for some k . Direct computation gives
1 0 1
X kX
.˛/ .˛/
Vn;˛ .sgnx;˛ ; x/ D .2 1/
˛
Qn;k .x/ Qn;k .x/
kDk 0 C1 kD0
0
.˛/ ˛ k C1 1
C nQn;k 0 .x/ 2 x
n n
1
X
Qn;k .x/ 1 C 2˛ .k 0 C 1 nx/Qn;k 0 .x/:
.˛/ .˛/
D 2˛
kDk 0 C1
Note that 0 < k 0 C 1 nx < 1. By Lemmas 8.13 and 8.14, we have

ˇ 1 ˇ
ˇ X 1 ˇˇ
˛ˇ .˛/ .˛/
jVn;˛ .sgnx;˛ ; x/j 2 ˇ Qn;k .x/ ˛ ˇ C 2˛ Qn;k 0 .x/
ˇ 0 2 ˇ
kDk C1
ˇ ˇ !˛
ˇ 1
X 1 ˇˇ
ˇ .˛/
D 2˛ ˇ bn;k .x/ ˛ ˇ C 2˛ Qn;k 0 .x/:
ˇ 0
2 ˇ
kDk C1
p p p
12˛ 1 C x 2˛ 1 C x 14˛ 1 C x
˛ p C ˛ p D ˛ p : (8.42)
2 nx 2 nx 2 nx

Next, we estimate jVn;˛ .gx ; x/j. Using Bojanic–Cheng decomposition (see, e.g.,
[45, 54, 55]), one can write
Z 4 Z
X

Vn;˛ .gx ; x/ D gx .t/Kn;˛ .x; t/dt D gx .t/Kn;˛ .x; t/dt; (8.43)
Œ0;1/ j D1 Aj
where
p p p
A1 WD Œ0; x x= n; A2 WD .x x= n; x C x= n;
p
A3 WD .x C x= n; 2x; A4 WD .2x; 1/:
First, note that gx .x/ D 0. Thus,

ˇZ ˇ
ˇ ˇ 1X p
n
p
ˇ gx .t/Kn;˛ .x; t/dt ˇˇ x .gx ; x= n/ x .gx ; x= k/: (8.44)
ˇ n
A2 kD1
Z
To estimate j gx .t/Kn;˛ .x; t/dtj, note that x .gx ;
/ is monotone increasing
A1
with respect to
. Thus, it follows that
p
ˇZ ˇ Z n
ˇ xx=pn
xx=
ˇ
ˇ ˇ
ˇ gx .t/Kn;˛ .x; t/dt ˇ x .gx ; x t/Kn;˛ .x; t/dt:
ˇ 0 ˇ
0
p
Integrating by parts with y D x x= n, we have
p
Z n
xx= Z y
x .gx ; x t/Hn;˛ .x; t/dt x .gx ; x y/ Kn;˛ .x; t/dt
0
0
Zy Z t
C Kn;˛ .x; u/d u d .x .gx ; x t// :
0
0
From the preceding inequality and Lemma 8.12, it follows that

ˇZ ˇ
ˇ ˇ p 3nx C 1 3nx C 1
ˇ gx .t/dt n;˛ .x; t/ˇˇ x gx ; x= n C
ˇ 2n2 .x y/2 2n2
A1
Zy
1
d.x .gx ; x t//: (8.45)
.x t/2
0
Because
Zy
1 x .gx ; x y/ x .gx ; x/
d.x .gx ; x t// D C
.x t/2 .x y/2 x2
0
Zy
2
C x .gx ; x t/ dt;
.x t/3
0
from (8.45), it is obvious that

ˇZ ˇ
ˇ xx=pn ˇ
ˇ ˇ
ˇ gx .t/dt Kn;˛ .x; t/ˇ
ˇ 0 ˇ
p
Z n
xx=
3nx C 1 3nx C 1 2
x .gx ; x/ C x .gx ; x t/ dt:
2
2n x 2 2n2 .x t/3
0
p
Putting t D x x= u for the last integral, we get
p
Z n
xx=
2
x .gx ; x t/ dt
.x t/3
0
Zn
1 X p
n
1 p
D 2 x .gx ; x=x u/d u 2 x .gx ; x= k/:
x x
1 kD1
Consequently,
ˇZ ˇ !
ˇ ˇ 3nx C 1 X
n p
ˇ ˇ
gx .t/Kn;˛ .x; t/dt ˇ x .gx ; x/ C x .gx ; x= k/
ˇ 2n2 x 2
A1 kD1
3nx C 1 X
n p
x .gx ; x= k/: (8.46)
n2 x 2
kD1
ˇR ˇ
ˇ ˇ
Using a similar method to estimate ˇ A3 gx .t/Kn;˛ .x; t/dt ˇ, we get
ˇZ ˇ
ˇ ˇ 3˛ C 1 X p
n
ˇ gx .t/Kn;˛ .x; t/dt ˇˇ C˛ x .gx ; x= k/; (8.47)
ˇ nx
A3 kD1
where C˛ is the constant in Lemma 8.12.

Finally, we estimate
ˇZ ˇ
ˇ ˇ
ˇ gx .t/Kn;˛ .x; t/dt ˇˇ :
ˇ
A4
Because f .t/ D O.t r /, there is a constant M > 0 such that jf .t/j M t r . Thus,
we have
ˇZ ˇ 1
X Z
ˇ ˇ .kC1/=n
ˇ gx .t/Kn;˛ .x; t/dt ˇˇ M n
.˛/
Qn;k .x/ t r dt
ˇ
A4 kDŒ2nx k=n
1
X .˛/ .k C 1/rC1 k rC1
DM Qn;k .x/ :
.r C 1/nr
ŒkD2nx
8.7 Baskakov–Durrmeyer–Bézier Operators 275
By binomial expansion,
X
r
.r C 1/Š
.k C 1/rC1 k rC1 D ki :
i D0
i Š.r C 1 i /Š
Pr .rC1/Š
If we take Mr D M
rC1 i D0 i Š.rC1i /Š , then it follows that
1
X 1
X
.˛/ .k C 1/rC1 k rC1 .˛/
M Qn;k .x/ M r Qn;k .x/.k=n/r :
.r C 1/nr
ŒkD2nx ŒkD2nx
Now by the results of Lemma 8.13 and Equation (11) of [101], we obtain
ˇZ ˇ
ˇ ˇ M.f; ˛; r; x/
ˇ gx .t/Kn;˛ .x; t/dt ˇˇ ; (8.48)
ˇ nl
A4
where M.f; ˛; r; x/ is a constant depending only on f; ˛; r; x. The theorem follows

by combining the estimates of (8.41)–(8.44), (8.46), (8.47), and (8.48).
8.7 Baskakov–Durrmeyer–Bézier Operators
For ˛ 1 and x 2 Œ0; 1/, the Bézier variant of the well-known

Baskakov–Durrmeyer operators was introduced by Gupta and Abel [106]. It is
defined as
1
X Z 1
VQn;˛ .f; x/ D .n 1/
.˛/
Qn;k .x/ bn;k .t/f .t/dt; (8.49)
kD0 0
.˛/ P1
˛
.x/ Jn;kC1
˛
.x/; Jn;k .x/ D j Dk pn;j .x/ and

nCk1 xk
pn;k .x/ D :
k .1 C x/nCk
Obviously, VQn;˛ .1; x/ D 1, and as a special case if ˛ D 1, the operators VQn;˛ .f; x/
reduce to the well-known Baskakov–Durrmeyer operators.
P R1
Remark 8.1. If n;m .x/ D .n 1/ 1 kD0 pn;k .x/ 0 pn;k .t/.t x/ dt; then given
m
any x 2 .0; 1/; > 2 and for all n sufficiently large, we have
x.1 C x/
n;2 .x/ < :
n
1
X .˛/
Lemma 8.15. Given x 2 .0; 1/ and Kn;˛ .x; t/ D .n1/ Qn;k .x/pn;k .t/; then
kD0
for > 2 and n N. ; x/, we have
Z y
˛x.1 C x/
n;˛ .x; y/ D Kn;˛ .x; t/dt ; 0 y < x;
0 n.x y/2
Z 1
˛x.1 C x/
1 n;˛ .x; z/ D Kn;˛ .x; t/dt ; x z < 1;
z n.z y/2
where
Z 1 Z t
Kn;˛ .x; u/d u D 1; and n;˛ .x; t/ D Kn;˛ .x; u/d u:
0 0
Lemma 8.16 ([106]). For all x 2 .0; 1/, and n; k 2 N ,

p
.˛/ 1Cx
˛
Jn;k .x/pn;k .x/ Qn;k .x/ ˛pn;k .x/ ˛ p
2e nx
p
holds, where the constant 1= 2e is the best possible.
Lemma 8.17. For x 2 .0; 1/ and k D 0; 1; 2; : : :,
˛.10 C 11x/
jJn;k
˛
.x/ Jn1;kC1
˛
.x/j p ;
2 nx.1 C x/
˛.10 C 11x/
jJn;k
˛
.x/ Jn1;k
˛
.x/j p :
2 nx.1 C x/
Theorem 8.14 ([106]). Assume that f 2 W .0; 1/ is a function of bounded

variation on every finite subinterval of .0; 1/. Furthermore, let ˛ 1; > 2 and
x 2 .0; 1/ be given. Then, for each r 2 N , there exists a constant M.f; ˛; r; x/
such that for sufficiently large n, we have
ˇ ˇ X p
ˇ ˇ n
ˇVQn;˛ .f; x/ f .xC/ C ˛f .x/ ˇ 2˛ .1 C x/ C x V
xCx= k
p .gx /
ˇ ˛C1 ˇ nx xx= k
kD1
˛.10 C 11x/ M.f; ˛; r; x/

C p jf .xC/ f .x/j C ;
2 nx.1 C x/ nr

Proof. We can easily see that

ˇ ˇ
ˇ ˇ
ˇVQn;˛ .f; x/ f .xC/ C ˛f .x/ ˇ
ˇ ˛C1 ˇ
ˇ ˇ
ˇ ˇ 1 ˇ ˛ 1 ˇˇ
ˇ Q ˇ ˇ Q
Vn;˛ .gx ; x/ C jf .xC/ f .x/j : ˇVn;˛ .sign.t x/; x/ C :
2 ˛ C 1ˇ
(8.50)
First, we estimate
1
X Z 1 Z x
VQn;˛ .sign.t x/; x/ D .n 1/
.˛/
Qn;j .x/ pn;j .t/dt pn;j .t/dt
j D0 x 0
Z x
.˛/
D 1 2.n 1/Qn;j .x/ pn;j .t/dt:
0
Pk R1
Using the identity j D0 pn1;j .x/ D .n 1/ x pn;k .t/dt; we conclude that
1
!
X X
j
VQn;˛ .sign.t x/; x/ D 1 2
.˛/
Qn;j .x/ 1 pn1;k .x/
j D0 kD0
1
X 1
X .˛/
D 1 C 2 pn1;k .x/ Qn;j .x/
kD0 j Dk
1
X
D 1 C 2 ˛
pn1;k .x/Jn;k .x/;
kD0
P1 .˛/
because j D0 Qn;j .x/ D 1: Therefore, we obtain
X 1 1
˛1 2 X .˛C1/
VQn;˛ .sign.t x/; x/ C D2 ˛
pn1;k .x/Jn;k .x/ Qn1;k .x/
˛C1 ˛C1
kD0 kD0
P1 .˛C1/
because kD0 Qn1;k .x/ D 1: By the mean value theorem, it follows that
.˛C1/
Qn1;k .x/ D Jn1;k
˛C1
.x/ Jn1;kC1
˛C1
.x/ D .˛ C 1/pn1;k .x/n;k
˛
.x/;
where Jn1;kC1 .x/ < n;k .x/ < Jn1;k .x/: Hence,
X 1
˛1
VQn;˛ .sign.t x/; x/ C D2 ˛
pn1;k .x/.Jn;k .x/ n;k
˛
.x//;
˛C1
kD0
where
˛
Jn;k .x/ Jn1;k
˛ ˛
.x/ < Jn;k .x/ n;k
˛ ˛
.x/ < Jn;k .x/ Jn1;kC1
˛
.x/:
Lemma 8.17 implies that

ˇ ˇ
ˇ ˇ
ˇVQn;˛ .sign.t x/; x/ C ˛ 1 ˇ ˛.10
p
C 11x/
; x 2 .0; 1/:
ˇ ˛ C 1ˇ nx.1 C x/
Finally, we can write
Z p Z p Z !
xx= n xCx= n 1
VQn;˛ .gx ; x/ D p
C p
Kn;˛ .x; t/gx .t/dt:
0 xx= n xCx= n
Using Remark 8.1, Lemma 8.15, and Lemma 8.16, and applying standard tech-
niques, we have
ˇ ˇ X
n p
ˇVQn;˛ .gx ; x/ˇ 2˛ .1 C x/ C x V p .gx / C O.nr /; n ! 1:
xCx= k
nx xx= k
kD1
The theorem follows immediately by combining the estimates of VQn;˛ .sign.t x/; x/
and VQn;˛ .gx ; x/:
We have seen that by taking the weight function of Beta basis functions, some
approximation properties become simpler. The same holds for the Bézier variant
of Baskakov–Beta operators, which were introduced in [98]. For ˛ 1 and x 2
Œ0; 1/, they are defined as
1
X Z 1
.˛/
Bn;˛ .f; x/ D Qn;k .x/ bn;k .t/f .t/dt; (8.51)
kD0 0
.˛ P1
˛
.x/ Jn;kC1
˛
.x/; Jn;k .x/ D j Dk pn;j .x/, and

nCk1 xk 1 tk
pn;k .x/ D ; bn;k .t/ D ;
k .1 C x/ nCk B.k C 1; n/ .1 C t/nCkC1
with B.m; n/ D .m1/Š.n1/Š

.nCm1/Š : Obviously, Bn;˛ .1; x/ D 1; as a special case if
˛ D 1, the operators Bn;˛ .f; x/ reduce to Baskakov–Beta operators (see, e.g.,
[92, 94]). Actually, the approximation properties for Baskakov–Beta operators
become simpler than those of the usual Baskakov–Durrmeyer operators.
Let
H.0; 1/ D ff W f is locally bounded on.0; 1/ and

jf .t/j M.1 C t/ˇ ; M > 0; ˇ 2 N 0 g:
Theorem 8.15 ([98]). Let f 2 H.0; 1/, and at a fixed point x 2 .0; 1/; let
the one-sided limits f .x˙/ exist. Then, for ˛ 1; > 2; x 2 .0; 1/ and for
n > maxf1 C ˇ; N. ; x/g; we have
ˇ ˇ
ˇ ˇ X
n p
ˇBn;˛ .f; x/ f .xC/ C ˛f .x/ ˇ ˛Œ3 C .1 C 3 /x V
xCx= k
p .gx /
ˇ ˛C1 ˇ nx xx= k
kD1
p
˛ 1Cx
C p jf .xC/ f .x/j
2e nx
.1 C x/ˇ
CM˛.2ˇ 1/ O.nˇ /
x 2ˇ
2M˛ .1 C x/ˇC1
C ;
nx
where gx .t/ is defined in Theorem 7.7.

In 2005, Ispir and Yuksel [158] extended the studies on a general sequence of
summation–integral-type operators that was proposed by Srivastava and Gupta
[218]. They introduced the Bézier variant of (7.38) and called such operators
Srivastava–Gupta operators. Let Br Œ0; 1/ be the class of bounded variation func-
tions satisfying the growth condition jf .t/j M.1 C t/r ; M > 0; r 0; t ! 1.
For f 2 Br Œ0; 1/ and ˛ 1, Ispir and Yuksel [158] proposed the Bézier variant
of Srivastava–Gupta operators as
1
X Z 1
.˛/
Gn;c;˛ .f I x/ D n Qn;k .xI c/ pnCc;k1 .tI c/ f .t/ dt C pn;0 .xI c/ f .0/ ;
kD1 0
(8.52)
.˛/ P1
where Qn;k .xI c/ D ˛
Jn;k .xI c/ ˛
Jn;kC1 .xI c/ and ˛
Jn;k .xI c/ D j Dk pn;j .xI c/:
Theorem 8.16 ([158]). Let f be an element of Br Œ0; 1/. If ˛ 1; r 2 N , and
> 2 are given, then there exists a constant C.f; ˛; r; x/ such that for n sufficiently
large, we have
ˇ ˇ
ˇ ˇ Xn p
ˇGn;c;˛ .f I x/ f .xC/ C ˛f .x/ ˇ 6˛ x.1 C cx/ V
xCx= k
p .gx /
ˇ ˛C1 ˇ nx xx= k
kD1
r
1 C cx .1 C x/r
C 2˛ jf .xC/ f .x/j C C ˛2r O.nr /;
2e nx xr

8.8 MKZ Bézier-Type Operators
For ˛ 1 and a function f defined on the interval Œ0; 1, the Meyer–König–
Zeller–Bézier and integrated Meyer–König–Zeller–Bézier operators Mn;˛ .f; x/ and
MO n;˛ .f; x/ are respectively defined (cf. [248]) by
1
X
.˛/ k
Mn;˛ .f; x/ D Qn;k .x/f (8.53)
nCk
kD0
and
1
X Z
.n C k/.n C k C 1/
MO n;˛ .f; x/ D
.˛/
Qn;k .x/ f .t/dt; (8.54)
n Ik
kD0
.˛/
˛
.x/ Jn;kC1
˛
.x/, Ik D Œk=.n C k/; .k C 1/=.n C k C 1//,
P1
and Jn;k .x/ D j Dk mn;j .x/, with the MKZ basis functions

nCj 1
mn;j .x/ D x j .1 x/n ; j D 0; 1; 2; : : : :
j
For ˛ D 1, the above operators reduce to the operators discussed in [90]. The
pointwise approximation properties of the operators Mn;˛ .f; x/ and MO n;˛ .f; x/ for
˛ 1 have been dealt with in [248].
Theorem 8.17 ([248]). Let f be a function of bounded variation on Œ0; 1 .f 2
BV Œ0; 1/. Then, for x 2 .0; 1/, ˛ 1, and for n sufficiently large, we have
ˇ ˇ
ˇ ˇ
ˇMn;˛ .f; x/ 1 f .xC/ 1 1 f .x/ˇ
ˇ 2 ˛ 2 ˛ ˇ
5˛ X xC.1x/=pk
n
V p .gx /
nx C 1 xx= k
kD1
3˛
Cp .jf .xC/ f .x/j C "n .x/jf .x/ f .x/j/;
nx C 1
where Vab .gx / is the total variation of gx on Œa; b,

8
< f .t/ f .xC/; x < t 1;
gx .t/ D 0; t D x;
:
f .t/ f .x/; 0 t < x;
8.8 MKZ Bézier-Type Operators 281
and
( 0
0
1; x D .nCk
k
0 / for all k 2 N;
"n .x/ D
0; x ¤ .nCk/ for all k 2 N:
k
Theorem 8.18 ([248]). Let f be a function of bounded variation on Œ0; 1 .f 2

BV Œ0; 1/. Then, for x 2 .0; 1/, ˛ 1, and sufficiently large n, we have
ˇ ˇ
ˇ ˇ
ˇMO n;˛ .f; x/ 1 f .xC/ 1 1 f .x/ˇ
ˇ 2 ˛ 2 ˛ ˇ
5˛ X xC.1x/=pk
n
5˛
V p .gx / C p jf .xC/ f .x/j;
nx C 1 xx= k nx C1
kD1
where the auxiliary function gx is defined in Theorem 8.17.

Theorem 8.19 ([248]). Let f be a bounded function on Œ0; 1 and if x 2 .0; 1/ is a
continuous point of the first kind of f , then for ˛ 1, we have

1 1
lim Mn;˛ .f; x/ D f .xC/ 1 f .x/
n!1 2˛ 2˛
and

1 1
lim MO n;˛ .f; x/ D ˛ f .xC/ 1 ˛ f .x/:
n!1 2 2
The above results were proved for the case ˛ 1. The other case [i.e., 0 < ˛ < 1
for the operators MO n;˛ .f; x/] was considered by Zeng and Gupta [254]. Next, we
present this case.
Let
1
X .n C k/.n C k C 1/ .˛/
Kn;˛ .x; t/ D Qn;k .x/k .t/:
n
kD0
We recall the Lebesgue–Stieltjes integral representation

Z 1
MO n;˛ .f; x/ D f .t/Kn;˛ .x; t/dt; (8.55)
0

where k is the characteristic function of the interval Ik D k=.nCk/;

.kC1/=.nCkC1/ with respect to I D Œ0; 1.
The following lemmas are necessary for the proof of the rate of convergence.
Lemma 8.18.
(i) ([246, Theorem 2]). For every k 2 N; x 2 .0; 1, we have
1
mn;k .x/ nx=.1x/
Lemma 8.19. Let 0 < ˛ 1 and x 2 .0; 1/. Then for n > 121=x and k 0 D
Œnx=.1 x/, we have
.˛/
.i/ Qn;k 0 .x/ nx=.1x/ mn;k .x/ 2˛ ˇ
p 4
nxC1
:
Lemma 8.20 ([248]). For all m 2 N , there is a constant Am such that for n 2,
Am
MO n .t x/2m ; x m :
n
Lemma 8.21. Let Kn;˛ .x; t/ be defined by (8.55), 0 < ˛ 1. Then, for sufficiently
large n,
(i) For 0 y < x < 1, it holds that
Z y
2x.1 x/2
Kn;˛ .x; t/dt :
0 n.x y/2
(ii) For 0 x < z 1, it holds that

Z 1
C˛
Kn;˛ .x; t/dt ;
z n.z x/2
where C˛ is a constant dependent only on ˛.

Theorem 8.20 ([254]). Let f be a bounded function on Œ0; 1, and let f .xC/,
f .x/ exist at a fixed point x 2 .0; 1/, 0 < ˛ < 1. Then, for sufficiently large
n, we have
ˇ ˇ
ˇ ˇ
ˇMO n;˛ .f; x/ 1 f .xC/ 1 1 f .x/ˇ
ˇ 2 ˛ 2 ˛ ˇ
4 C 2C˛ X p n
6
p jf .xC/ f .x/j C !x gx ; 1= k ;
nx C 1 nx.1 x/
kD1
where C˛ is a positive constant dependent only on ˛, the auxiliary function gx is as

defined in Theorem 8.17, and !x .f; h/ D sup jf .t/ f .x/j:
t 2Œxh;xCh
Proof. We can write

ˇ ˇ
ˇ ˇ
ˇMn;˛ .f; x/ 1 f .xC/ 1 1 f .x/ˇ
ˇ 2 ˛ 2 ˛ ˇ
ˇ ˇ
ˇ f .xC/ f .x/ ˇ
ˇ
jMn;˛ .gx ; x/j C ˇ Mn;˛ .sgnx;˛ ; x/ˇˇ : (8.56)
2 ˛
h
k0 k 0 C1
Let x 2 nCk 0 ; nCk 0 C1 : Direct calculations give
0 1
kX 1
X
MO n;˛ .sgnx;˛ ; x/ D
.˛/ .˛/
Qnk .x/ C .2˛ 1/ Qnk .x/
kD0 k 0 C1
0 0 0
.n C k /.n C k C 1/ k0 k C1 .˛/
C x C .2 1/
˛
x Qnk 0 .x/
n n C k0 n C k0 C 1
X1
.˛/ .n C k 0 /.n C k 0 C 1/ ˛ k0 C 1 .˛/
D 2˛ Qn;k .x/ 1 C 2 0C1
x Qnk 0 .x/:
0
n n C k
kDk C1
Because
k0 C 1 n
x ;
n C k0 C 1 .n C k 0 /.n C k 0 C 1/
it follows that
ˇ ˇ
ˇ ˇ ˇ 1 ˇ
ˇ O ˇ ˇ ˛ X ˇ .˛/
ˇMn;˛ .sgnx;˛ ; x/ˇ ˇ2 Qn;k .x/ 1ˇ C 2˛ Qnk 0 .x/
˛
ˇ 0
ˇ
kDk C1
ˇ0 1˛ ˇ
ˇ ˇ
ˇ X 1 ˇ
˛ ˇ@
mn;k .x/ ˛ ˇˇ C 2˛ Qnk 0 .x/:
A .˛/
D2 ˇ
ˇ k>nx=.1x/ 2 ˇ
Thus, using Lemma 8.19, we obtain

ˇ ˇ
ˇ f .xC/ f .x/ ˇ
ˇ Mn;˛ .sgnx;˛ ; x/ˇˇ
ˇ 2 ˛
0ˇ0 1˛ ˇ 1
ˇ X ˇ
ˇ 1 ˇ
D jf .xC/ f .x/j @ˇˇ@ mn;k .x/A ˛ ˇˇ C Qnk 0 .x/A :
.˛/
ˇ k>nx=.1x/ 2 ˇ
6 ˇ ˇ
p ˇf .xC/ f .x/ˇ: (8.57)
nx C 1
Next, we estimate MO n;˛ .gx ; x/. Let

Z t
Hn;˛ .x; t/ D Kn;˛ .x; u/d u:
0
Then
Z 1
MO n;˛ .gx ; x/ D gx .t/Kn;˛ .x; t/dt
0
Z 1
D gx .t/dt Hn;˛ .x; t/
0
Z Z Z
D C C gx .t/dt Hn;˛ .x; t/
D1 D2 D3
D W 1 C 2 C 3 ; (8.58)

x x 1x
where D1 D 0; x p ; D2 D x p ; x C p , and D3 D
n n n
1x
x C p ; 1 . Note that gx .x/ D 0. We have
n
Z
j2 j jgx .t/ gx .x/jdt Hn;˛ .x; t/
D2
p 1X n p
!x gx ; x= n !x gx ; x= k : (8.59)
n
kD1
p
To estimate 1 , let y D x x= n. Using Lebesgue–Stieltjes integration by parts,
we have
Z y
ˇ
ˇ1 j !x .gx ; x t/dt Hn;˛ .x; t/
0
Z y
D !x .gx ; x y/Hn;˛ .x; y/ C HO n;˛ .x; t/dt !x .gx ; x t/ ;
0
where HO n;˛ .x; t/ is the normalized form of Hn;˛ .x; t/. Note that HO n;˛ .x; t/
Hn;˛ .x; t/ on Œ0; 1. Using Lemma 8.21(i), we get
Z
ˇ
ˇ1 j !x .gx ; x y/ 2x.1 x/ C 2x.1 x/
2 2 y
1
dt !x .gx ; x t/ :
n.x y/2 n 0 .x t/ 2
(8.60)
Because
Z ˇ Z y
y
1 !x .gx ; x t/ ˇˇyC 2!x .gx ; x t/
d ! .g ; x t/ D C dt;
.x t/2 ˇ0
t x x
0 .x t/2 0 .x t/3
p
from (8.60) and by the change of variable t D x x= u, we get
2 Z xx= n
p
ˇ 2.1 x/ 2
4x.1 x/ !x .gx ; x t/
ˇ1 j !x .gx ; x/ C dt:
n n 0 .x t/3
Z
2.1 x/2 2.1 x/2 n p
D !x .gx ; x/ C !x gx ; x= u d u
n nx 1
4.1 x/2 X p
n
!x gx ; 1= k : (8.61)
nx
kD1
Via a similar method and using Lemma 8.21 (ii) to estimate j3 j, we get
ˇ ˇ 2C˛ X p
n
ˇ3 ˇ !x gx ; 1= k ; (8.62)
n.1 x/
kD1
where C˛ is the constant defined in Lemma 8.21 (ii). Combining the estimates of
(8.59), (8.61), and (8.62) and with easy calculations, we obtain
ˇ ˇ 4 C 2C˛ X
n p
ˇ O ˇ
ˇMn;˛ .gx ; x/ˇ !x gx ; 1= k : (8.63)
nx.1 x/
kD1
The theorem now follows by combining (8.56), (8.57), and (8.63).

Also, Gupta [100] considered the Bézier variant of certain integrated MKZ
operators of the Durrmeyer type. For a function f 2 L1 Œ0; 1 and ˛ 1, the
operators introduced in [100] are defined as
1
X Z
0 .˛/ .n C k 2/.n C k 3/ 1
Mn;˛ .f; x/ D Qn;kC1 .x/ mn2;k1 .t/f .t/dt;
.n 2/ 0
kD1
(8.64)
.˛/
where for Qn;kC1 .x/ and mn2;k1 .t/, we refer to (8.53).
Using some results of probability theory, Gupta [100] established the estimate on
0
the rate of convergence of Mn;˛ .f; x/.
Theorem 8.21 ([100]). Let f be a function of bounded variation on Œ0; 1; ˛ 1

and > 2. Then, for every x 2 .0; 1/ and for sufficiently large n, we have
ˇ ˇ
ˇ 0 ˇ
ˇM .f; x/ f .xC/ C ˛f .x/ ˇ p 3˛ jf .xC/ f .x/j
ˇ n;˛ ˛C1 ˇ nx 3=2
.2˛ C x/ X xC.1x/=pk
n
C V p .gx /;
nx xx= k
kD1

For f 2 L1 Œ0; 1 and ˛ 1, Gupta [102] considered another Durrmeyer-type
modification of MKZ operators as
1
X Z 1
MM n;˛ .f; x/ D
.˛/
Qn;k .x/ f .t/bn;k .t/dt; (8.65)
kD0 0

nCk .˛/
where bn;k .t/ D n t k .1 t/n1 , for Qn;k .x/ [see (8.53)].
k
Theorem 8.22 ([102]). Let ˛ 1, and let f be a function of bounded variation on
Œ0; 1: For each x 2 .0; 1/ and each constant > 2 and each " > 0, there exists an
integer N. ; x/ 3 such that
ˇ ˇ
ˇ ˇ
ˇMM n;˛ .f; x/ f .xC/ C ˛f .x/ ˇ p ˛ jf .xC/ f .x/j
ˇ ˛C1 ˇ 2e nx
.2 ˛.xC"/Cx 2 X xC.1x/=pk
n
C V p .gx /;
nx 2 xx= k
kD1

Corollary 8.1 ([102]). Let f be a function of bounded variation on Œ0; 1, and let
x 2 .0; 1/. If f has a discontinuity of the first kind in x, then we have
f .xC/ C ˛f .x/
lim MM n;˛ .f; x/ D :
n!1 ˛C1
This limit is essentially different from the operators (8.53) and (8.53), which implies
under the corollary’s assumption that

1 1
lim Mn;˛ .f; x/ D lim MO n;˛ .f; x/ D ˛ f .xC/ 1 ˛ f .x/:
n!1 n!1 2 2
Chapter 9
Some More Results on the Rate of Convergence
9.1 Nonlinear Operators
Shaw et al. [210] investigated the problem for the general family of positive linear
operators, which includes Bernstein, Kantorovich, and Durrmeyer operators as
special cases. They investigated their results for the classes of functions BV Œa; b
and DBV Œa; b: Also, Hua and Shaw [156] extended this problem for linear integral
operators with a not necessarily positive kernel. We observed in [166] that the
previous work on this subject has dealt with operators whose kernel functions are
probability measures and do not have singularities at any point. R
Let G be a locally compact abelian group with the Haar measure. By f .t/dt,
G
we mean the Haar integral of an extended real-valued function over G: Let ƒ be a
nonempty set of indices with any topology and 0 an accumulation point of ƒ in this
topology. We take a family K of functions K W G x R ! R; where K .t; 0/ D 0
for all t 2 G and 2 ƒ; such that K .t; u/ is integrable over G in the sense of the
Haar measure, for all values of the second variable and for every 2 ƒ. The family
K will be called a kernel.
In approximation theory, most of the applications are limited to linear integral
operators, because the notion of the singularity of an integral operator is closely
connected with its linearity. In 1981, Musielak [197] used the nonlinear integral
operators, which are defined as
Z
Tw f .s/ D Kw .t s; f .t// dt; s 2 G:
G
The assumption of the linearity of the operators was replaced here by a Lipschitz
condition on Kw with respect to the second variable. This study allows us to use the
classical method for linear integral operators [49] to obtain the convergence of the
nonlinear integral operators, although the notion of the singularity of an integral

288 9 Some More Results on the Rate of Convergence
operator is closely connected with its linearity. In this section, we mention the
results studied in [166]. We extend in three directions the problem of the rate of
convergence of operators acting on functions of bounded variation:
(i) The set N D f1; 2; 3; : : :g of indices is replaced by an abstract set ƒ of indices.
(ii) The stochastic condition is replaced by a limit form (see condition c/ and
Example 9.2).
(iii) The family of linear integral operators is replaced by the family of nonlinear
integral operators T , which are defined as
Zb
T .f I x/ D K .t x; f .t// dt; x 2< a; b >; (9.1)
a
where f 2 BV < a; b > and < a; b > is an arbitrary finite interval in R:

Operators of the type (9.1) and its linear cases have been studied by Karsli
[165] and Karsli and Ibikli [167]. They determined the rate of convergence at the
-generalized Lebesgue points of functions belonging to L1 < a; b > and L1 .R/:
We also mention the study due to Swiderski and Wachnicki [226], who estimated
the pointwise approximation of nonlinear singular convolution integrals, which is
the special case of (9.1), in the class of functions f 2 Lp .; / at the p-Lebesgue
points.
The aim of this section is to present the results studied in [166], that is, the
behavior of the operators T for functions of bounded variation on < a; b >, and
give an estimate for the rate of pointwise convergence of the nonlinear family of
singular integral operators (9.1) to the point x, having a discontinuity of the first
kind of f; as ! 0 :
Throughout this chapter, we assume that G D R; 0 D 1; ˇ > 0, and 1.
First, we assume that the following conditions hold:
(1) There exists an integrable function L .t/, such that
jK .t; u/ K .t; v/j L .t/ ju vj ;
for every t; u; v 2 R and for any 2 ƒ:

R
xC.bx/= =ˇ
(2) L .t/dt B.x/; for x 2< a; b > and for all 2 ƒ:

x.xa/= =ˇ

R
(3) L .t/ dt 1 for sufficiently large :
R
According to condition (1), it is easy to see that K W G x R ! R is a kernel.

In [166], Karsli and Gupta introduced a function f ; which is defined on R; as
f .t/; t 2< a; b >;

f .t/ WD (9.2)
0; t …< a; b > :
9.1 Nonlinear Operators 289
Lemma 9.1. For all x 2 .a; b/ and for each 2 ƒ, let
Zb
L .u x/ ju xjˇ d u B.x/ ; (9.3)
a
where L .t/ is as defined above. Then we have

Zt
1
m .x; t/ WD L .u x/d u B.x/ ; a t < x; (9.4)
.x t/ˇ
a
and
Zb
1
1 m .x; z/ WD L .u x/d u B.x/ ; x < z < b: (9.5)
.z x/ˇ
z
Theorem 9.1 ([166]). Let f be a function of bounded variation on < a; b > :

Then, for every x 2 .a; b/ and sufficiently large, we have
jf .xC/ C f .x/j C jf .xC/ f .x/j

T .f I x/
2
2 3
Œ xC.bx/=k 1=ˇ xC.bx/= =ˇ
_
b X _ _
4 5
B .x/ .fx / C .fx / C B.x/ .fx /;
a kD1 x.xa/=k 1=ˇ x.xa/= =ˇ

C ; (9.6)
2
where Œ is the greatest integer less than or equal to , B .x/ D B.x/

maxf.x a/ˇ ; .b x/ˇ g;
8
< f .t/ f .xC/; x < t b;
fx .t/ D 0; t D x; (9.7)
:
f .t/ f .x/; at <x;
W
b
and .fx / is the total variation of fx on < a; b >.
a
Proof. For any f .t/ 2 BV < a; b >; we can easily verify from (9.7) that

f .t/ D C fx .t/ C sgn.t x/
2 2

f .xC/ C f .x/
Cıx .t/ f .x/ ; (9.8)
2
where

1; x D t;
ıx .t/ D
0; x ¤ t:
Applying the operator (9.1) to (9.8), using (9.2), and from condition (1), we have
Z Z ˇ ˇ
ˇ ˇ
T .f I x/ D K .t x; f .t//dt L .t x/ ˇf .t/ˇˇ dt
ˇ
R R
ˇ ˇZ Z ˇ ˇ
ˇ f .xC/ C f .x/ ˇ ˇ ˇ
ˇˇ ˇ L .t x/ dt C L .t x/
ˇ
ˇf .t/ˇ dt
ˇ x ˇ
2
R R
ˇ ˇZ
ˇ f .xC/ f .x/ ˇ
ˇ
Cˇ ˇ L .t x/ dt
2 ˇ
R
ˇ ˇZ
ˇ f .xC/ C f .x/ ˇˇ
ˇ
C ˇf .x/
2 ˇ L .t x/ jıx .t/j dt:
R
It is obvious that the last term o the right-hand side of the preceding inequality is
zero, because of the definition of ıx .t/. Hence, from (9.2), we have
Z
T .f I x/ L .t x/ dt
2
R
Zb
C L .t x/ jfx .t/j dt:
a
In order to prove our theorem, we write the following inequality:

Z
T .f I x/ L .t x/ dt
2
R
Zb ˇ ˇ ˇ ˇ
ˇ f .xC/ C f .x/ ˇ ˇ f .xC/ C f .x/ ˇ
C ˇ
L .t x/ jfx .t/j dt C ˇ ˇ ˇ ˇ
2 ˇˇ 2 ˇ
a
ˇ ˇ ˇ ˇ
ˇ f .xC/ f .x/ ˇ ˇ f .xC/ f .x/ ˇ
C ˇˇ ˇˇ
ˇ ˇ
ˇ:
ˇ
2 2
Thus, we get

T .f I x/
2
Zb
L .t x/ jfx .t/j dt C
2
a
2 3
Z
4 L .t x/ dt 15 : (9.9)
R
According to condition (3), for sufficiently large ; we have

2 3
Z
4 L .t x/ dt 15 : (9.10)
R
In order to complete the proof of theorem, we need the estimation of
Zb
L .t x/ jfx .t/j dt
a
in (9.9). Now, we split the last integral in three parts as follows:

0 1
Zb Z Z Zb
x.xa/= =ˇ xC.bx/= =ˇ
B C
L .t x/ jfx .t /j dt @ C C A L .t x/ jfx .t /j dt
a a x.xa/= =ˇ xC.bx/= =ˇ
D W jI1 . ; x/j C jI2 . ; x/j C jI3 . ; x/j : (9.11)
We observe that I1 . ; x/ and I3 . ; x/ can be written as a Lebesgue–Stieltjes integral

as follows:
Z
x.xa/= =ˇ
jI1 . ; x/j D jfx .t/j dt .m .x; t//

a
and
Zb
jI3 . ; x/j D jfx .t/j dt .m .x; t// ;
xC.bx/= =ˇ
Rt
where m .x; t/ D L .u x/d u: First, we estimate I2 . ; x/: Since fx .x/ D 0;
a
for t 2 x .x a/ = =ˇ ; x C .b x/ = =ˇ ; we have
Z
xC.bx/= =ˇ
jI2 . ; x/j D jfx .t/ fx .x/j L .t x/dt:

x.xa/= =ˇ
Also, by condition (2), we have
Z
xC.bx/= =ˇ
xC.bx/= =ˇ xC.bx/= =ˇ
_ _
jI2 . ; x/j .fx / L .t x/dt B.x/ .fx /:
x.xa/= =ˇ x.xa/= =ˇ x.xa/= =ˇ
(9.12)
Next, we estimate I1 . ; x/: Using partial Lebesgue–Stieltjes integration, we obtain
Z
x.xa/= =ˇ
jI1 . ; x/j D jfx .t/j dt .m .x; t//

a
ˇ ˇ
D ˇfx .x .x a/ = =ˇ /ˇ m .x; x .x a/ = =ˇ /
Z
x.xa/= =ˇ
m .x; t/dt .jfx .t/j/ :

a
Let y D x .x a/ = =ˇ . By (10.5), it is clear that
m .x; y/ B.x/ .x a/ˇ : (9.13)
Here we note that
ˇ ˇ ˇ ˇ _
x
ˇfx .x .x a/ = =ˇ /ˇ D ˇfx .x .x a/ = =ˇ / fx .x/ˇ .fx /:
x.xa/= =ˇ
Using partial integration and applying (9.13), we obtain
_
x
ˇ ˇ
jI1 . ; x/j .fx / ˇm .x; x .x a/ = =ˇ /ˇ
x.xa/= =ˇ
Z
x.xa/= =ˇ !
_
x
C m .x; t/dt .fx /
a t
_
x
.fx /B.x/ .x a/ˇ
x.xa/= =ˇ
Z
x.xa/= =ˇ !
_
x
ˇ
C B.x/ .x t/ dt .fx /
a t
_
x
D .fx /B.x/ .x a/ˇ
x.xa/= =ˇ
2
6 _
x
C B.x/ 4 .x a/ˇ = .fx /
x.xa/= =ˇ
3
Z
x.xa/= =ˇ
_
x _
x
ˇ 7
C.x a/ˇ .fx / C .fx / dt 5
a t
.x t/ˇC1
a
2 3
Z
x.xa/= =ˇ
6 _
x _
x
ˇ 7
D B.x/ 4.x a/ˇ .fx / C .fx / dt 5 :
a t
.x t/ˇC1
a
Changing the variable t by x .x a/ =u1=ˇ in the last integral, we have
Z Z
x.xa/= =ˇ
_
x
ˇ 1 _
x
.fx / dt D .fx / d u
t
.x t/ˇC1 .x a/ˇ
a 1 x.xa/=u1=ˇ

1 X
Œ
_
x
.fx /:
.x a/ˇ
kD1 x.xa/=k 1=ˇ
Consequently, we obtain
2
3
_
x X
Œ
_
x
jI1 . ; x/j B.x/ .x a/ˇ 4 .fx / C .fx /5 : (9.14)
a kD1 x.xa/=k 1=ˇ
Using a similar method, we can find

2 3
Œ xC.bx/=k 1=ˇ
_
b X _
jI3 . ; x/j B.x/ .b x/ˇ 4 .fx / C .fx /5 : (9.15)
x kD1 x
Combining (9.12), (9.14), and (9.15) in (9.11), we obtain

2 3
Zb _
x X
Œ
_
x
ˇ 4

L .t x/ jfx .t/j dt B.x/ .x a/ .fx / C .fx /5
a a kD1 x.xa/=k 1=ˇ
2 3
Œ xC.bx/=k 1=ˇ
_
b X _
C B.x/ .b x/ˇ 4 .fx / C .fx /5
x kD1 x
xC.bx/= =ˇ
_
C B.x/ .fx /
x.xa/= =ˇ
2 3
Œ xC.bx/=k 1=ˇ
_b X _
B .x/ 4 .fx / C .fx /5
a kD1 x.xa/=k 1=ˇ
xC.bx/= =ˇ
_
C B.x/ .fx /: (9.16)
x.xa/= =ˇ
Collecting (9.10) and (9.16), we get the desired result. This completes the proof of
the theorem.
Example 9.1. A special case of the function K .t; u/ is linearity with respect to the
second variable, namely,
K .t; u/ D Z .t/ u:
This case is widely used in approximation theory [49].

Example 9.2. If we choose ƒ D N and
Kn .t; u/ D Zn .t/ u
and replace condition (3) with

Z
Zn .t x/ dt D 1
R
for every n 2 N; we get the well-known operators such as Gauss–Weierstrass

and Picard operators, among others(see [210]). The rates of convergence of these
operators were investigated for functions of bounded variation (see also [49, 210]).
Example 9.3. G D R: Let the kernel function be defined by

u
C sin 2u ; t 2 Œ0; 1 ;
K .t; u/ D 2 (9.17)
0; t … Œ0; 1 ;
where ƒ D Œ1; 1/ is a set of indices with natural topology, and 0 D 1 is an

accumulation point of ƒ in this topology. According to (9.17), for every u; v 2 R
and t 2 Œ0; 1 ;
ˇ ˇ
ˇ .u v/ .u C v/ ˇˇ
jK .t; u/ K .t; v/j ju vj C 2 ˇˇsin cos ˇ
2 4 4
ˇ ˇ
ˇ .u v/ ˇ
ju vj C 2 ˇˇsin ˇ
ˇ
2 4
ju vj ; (9.18)
and for every u; v 2 R and t … Œ0; 1 ;
jK .t; u/ K .t; v/j D 0: (9.19)
Moreover, K .t; 0/ D 0:Combining (9.18) and (9.19), we find

; t 2 Œ0; 1 ;
L .t/ D
0; t … Œ0; 1 ;
and
Z Z
L .t/dt D dt D 1 < 1:
R Œ0; 1
Furthermore,
2 3 2 3
Z Z
4 L .t/ dt 15 D 6
4
7 1
dt 15 D 0 ;

R Œ0; 1
for every 2 ƒ D Œ1; 1/:

9.2 Chanturiya’s Modulus of Variation
In 1991, using this modulus of variation, Aniol and Pych-Taberska [29] established
approximation properties of the Gamma and Beta operators. Also, Pych-Taberska
[202] estimated the rate of pointwise convergence of the Feller operators. In 1996,
Pych-Taberska [200] estimated the rate of pointwise convergence of partial sums of
Fourier series for some 2-periodic Lebesgue-integrable functions. She estimated
the main results by using Chanturiya’s modulus of variation. In another paper,
Pych-Taberska [201] estimated the rate of pointwise convergence of Bernstein and
Kantorovich polynomials.
Let j be a positive integer, and suppose g is a function bounded on a finite or
infinite interval Y contained in Œ0; 1/. The variation of order j of the function g on
Y is denoted by vj .gI Y / and defined as the upper bound of the set of all numbers
X
j
jg.bk / g.ak /j
kD1
over all systems of the j nonoverlapping intervals .ak ; bk /; k D 1; 2; : : : ; j ,

contained in Y . If j D 0, we take v0 .gI Y / D 0. The sequence fvj .gI Y /g1 j D0
is called the modulus of variation of the function g on Y . For basic properties, we
refer to [52]. In case Y D Œa; b, we usually denote it as vj .gI a; b/ instead of
vj .gI Y /:
Aniol and Taberska [30] obtained the rate of pointwise convergence for a general
sequence of Durrmeyer-type operators. Let I be a finite or infinite interval, and
suppose Mloc .I / is the class of all measurable complex-valued locally bounded
functions on I . Then, for f 2 Mloc .I / and x 2 I , the Durrmeyer-type operators
are defined as
X Z
Ln .f; x/ D qj;n pj;n .x/ pj;n .t/f .t/dt;
j 2Jn I
R
where Jn Z WD Pf0; ˙1; ˙2; : : : :g and I pj;n .t/dt D 1=qj;n : Assume for every
x 2 I n .x/ WD j 2Jn pj;n .x/ 1 ! 0 as n ! 1 and that 2;n .x/ WD Ln ..t
x/2 ; x/ < 1. Then in view of the Shisha–Mond theorem (see [59]), at every point
x of continuity of f 2 M.I / (the class of all measurable complex-valued functions
bounded on I ), with 2;n .x/ ! 0 as n ! 1, we have
lim Ln .f; x/ D f .x/:

n!1
Denote
1 1
s.x/ D Œf .x C 0/ C f .x 0/; r.x/ D Œf .x C 0/ f .x 0/;
2 2
9.2 Chanturiya’s Modulus of Variation 297
and for t 2 I , let

8
< f .t/ f .x C 0/; t x;
gx .t/ D 0; t D x;
:
f .t/ f .x 0/; t < x:
Let f 2 M.I / [or f 2 Mloc .I /] and consider Ix .h/ WD Œx C h; x \ I . If h < 0,

Ix .h/ WD Œx; x C h \ I ; if h > 0, then
Ln .f; x/ s.x/ D Ln .gx ; x/ C r.x/n .x/ C s.x/ n .x/; (9.20)
where
X Z Z
n .x/ WD qj;n pj;n .x/ pj;n .t/dt pj;n t/dt :
j 2Jn t >x t x
In order to estimate Ln .gx ; x/, one may write
X Z Z
Ln .gx ; x/ D qj;n pj;n .x/ C gx .t/pj;n .t/dt
j 2Jn Ix .a/ Ix .b/
X Z
CVx .a; b/ qj;n pj;n .x/ gx .t/pj;n .t/dt; (9.21)
j 2Jn Rx .a;b/
where a > 0; b > 0; Rx .a; b/ D I n Œx a; x C b; Vx .a; b/ D 0 if neither of the

points x a; x C b belongs to I , and Vx .a; b/ D 1 otherwise.
Lemma 9.2 ([30]). Suppose x 2 I and that f is bounded on an interval
Ix .h/; h ¤ 0. Choose a positive null sequence fdn g1
1 such that dn 2 and write
1
m WD Œ1=dn . Then for every n 2 N ,

ˇ ˇ
ˇ Z ˇ
ˇX ˇ
ˇ qj;n pj;n .x/ gx .t/pj;n .t/dt ˇˇ
ˇ
ˇj 2Jn Ix .h/ ˇ
( m1 )
X 1 1
Pn .x; h/ vi .gx I Ix .ihdn // C 2 vm .gx I Ix .h// ;
i D1
i3 m
where Pn .x; h/ WD 1 C n .x/ C 82;n .x/h2 dn2 :

Proof. Let h < 0. Set the points ti D x C ihdn ; i D 1; 2; : : : ; l, where l is the
largest integer such that ti 2 Ix .h/, and denote by tlC1 the left endpoint of the
interval Ix .h/. Put Ti D Œti ; x for i D 1; 2; : : : ; l C 1, and write gx D g. Then
X Z
qj;n pj;n .x/ g.t/pj;n .t/dt
j 2Jn Ix .h/
X Z x
D qj;n pj;n .x/ g.t/pj;n .t/dt
j 2Jn t1
X X
l Z ti
C qj;n pj;n .x/ g.ti / pj;n .t/dt
j 2Jn i D1 ti C1
X l Z
X ti
C qj;n pj;n .x/ .g.t/ g.ti //pj;n .t/dt
j 2Jn i D1 ti C1
WD E1 C E2 C E3 :
Obviously,
X Z x
jE1 j qj;n pj;n .x/ jg.t/ g.x/jpj;n .t/dt .1 C n .x//v1 .gI T1 /:
j 2Jn t1
P R
Next, by applying Abel’s transformation and using j 2Jn qj;n pj;n .x/ jt xjs pj;n
.t/dt s12 2;n .x/; x 2 I; s > 0, we conclude that
( )
2;n .x/ X
l
1
jE2 j 2 2 2 vi .gI Ti / C 2 vi .gI Ti C1 /
h dn i D1
i
and
( )
2;n .x/ X
l
1
jE3 j 2 2 6 vi .gI Ti / C 2 vi .gI Ti C1 / :
h dn i D1
i
Combining the estimates of E1 E3 and observing that l m and Ti Ix .ihdn /,

we get the desired result for h < 0. The result holds well for h > 0; the proof runs
analogously.
P
Theorem 9.2 ([30]). Suppose that for all x 2 I and all n 2 N , j 2Jn pj;n .x/
1 C n .x/ '1 .x/; 2;n .x/ '2 .x/dn2 , where '1 and '2 are positive functions
continuous on I and fdn g1 1 is a null sequence such that 0 < dn 2 . If f 2 M.I /
1
and if at a point x 2 I the one-sided limits f .x ˙ 0/ exist, then for all positive
integers n, we have
( m1 )
X 1 1
jLn .f; x/ s.x/j P .x; a/ vi .gx I Ix .i adn // C 2 vm .gx I Ix .a//
i D1
i3 m
9.2 Chanturiya’s Modulus of Variation 299
( m1 )
X 1 1
CP .x; b/ vi .gx I Ix .i bdn // C 2 vm .gx I Ix .b/
i D1
i3 m
CVx .a; b/'2 .x/c 2 dn2 v1 .gx I I /Cjr.x/n .x/jCjs.x/ n .x/j;
where a > 0; b > 0; c D minfa; bg; m D Œ1=dn ; andP .x; h/ D '1 .x/ C
8'2 .x/= h2 for h ¤ 0.
Theorem
P 9.3 ([30]). Suppose I D Œ0; 1/ or I D .1; 1/, and let
j 2Jn j;n .x/ 1 C n .x/ '1 .x/; 2;n .x/ '2 .x/dn , where '1 and '2
2
p
1
are positive functions continuous on I and fdn g1 is a null sequence such that
0 < dn 12 . If f 2 Mloc .I / satisfy the growth condition jf .x/j .x/; x 2 I
with a positive continuous function such that for all n n0 2 N ,
X Z
qj;n pj;n .x/ 2 .t/pj;n .t/dt '3 .x/; x 2 I; 0 < '3 .x/ < 1: (9.22)
j 2Jn I
If at a point x 2 I the one-sided limits f .x ˙ 0/ exist, and if A is an arbitrary

positive number for which jxj A, then for every integer n n/ , we have
( m1 )
X 1 1
jLn .f; x/ s.x/j 2P .x; a/ vi .gx I Jx .iAdn // C 2 vm .gx I Jx .A//
i D1
i3 m
Cƒ.x; A/dn C jr.x/n .x/j C js.x/ n .x/j;
where Jx .h/ D Ix .h/ [ Ix .h/ Œx h; x C h \ I for h > 0,
1
ƒ.x; A/ WD A1 .'2 .x/'3 .x//1=2 C A2 .x/'2 .x/:
2
Proof. Take A > 0 and write Ln .gx ; x/ in the form (9.21) with a D b D A; in this
case, Rx .a; b/ D I nJx n.A/. In view of jf .x/j .x/; x 2 I ,
ˇ ˇ
ˇX Z ˇ
ˇ ˇ
ˇ q p .x/ g .t/p .t/dt ˇ
ˇ j;n j;n x j;n ˇ
ˇj 2Jn I nJx .A/ ˇ
X Z
qj;n pj;n .x/ f.t/ C .t/gpj;n .t/dt
j 2Jn I nJx .A/
Z
1 X 1
qj;n pj;n .x/ .t/jt xjpj;n .t/dt C 2 .x/2;n .x/
A j 2J I A
n
1 1
.'3 .x/'2 .x//1=2 dn C 2 .x/'2 .x/dn2 ƒ.x; A/dn :
A A
By the Cauchy–Schwarz inequality, 2;n .x/ '2 .x/dn2 and (9.22). The above
inequality, identities (9.20), (9.21), and Lemma 9.2 (with h D A and h D A)
give the assertion immediately.
Remark 9.1. By the properties of the modulus of variation and in view of the
continuity of gx at x, we have
X
m1
1 1
lim 3
vi .gx I Ix .ihdn // D 0; lim 2 vm .gx I Ix .h// D 0; h ¤ 0:
m!1
i D1
i m!1 m
The above result is valid if Ix .ihdn / and Ix are respectively replaced by Jx .ihdn /
and Jx . Thus, for Durrmeyer-type operators Ln , limn!1 n .x/ D 0 at every x 2 I .
Consequently, Theorems 9.2 and 9.3 are convergence results.
Aniol and Taberska [30] discussed the special cases of the above theorems and
obtained explicit estimates for different operators, including Bernstein–Durrmeyer,
Meyer–König–Zeller, Szász–Durrmeyer, and Baskakov–Durrmeyer operators.
In this direction, Gupta and Taberska [121] established the rate of convergence
for Baskakov–Beta operators in terms of Chanturiya’s modulus of variation. Let
I D Œ0; 1/. Then, for f 2 Mloc .I /, the Baskakov–Beta operators are defined as
1
X Z 1
Bn .f; x/ D pn;k .x/ bn;k .t/f .t/dt;
kD0 0
where

nCk1 xk 1 tk
pn;k .x/ D ; bn;k .t/ D :
k .1 C x/ nCk B.k C 1; n/ .1 C t/nCkC1
Theorem 9.4 ([121]). Let f 2 Mloc .I /, and at a fixed point x 2 .0; 1/, let the
one-sided limits f .x˙/ exist. Suppose, moreover, that jf .t/j M.1 C t/˛ ; for
t 2 I , where M > 0; ˛ 2 N 0 , and choose a number > 2. Then, for n
maxf1 C ˛; N. ; x/g; we have
ˇ ˇ
ˇ ˇ
ˇBn .f; x/ 1 .f .xC/ C f .x//ˇ
ˇ 2 ˇ
X vj .gx I x jx=pn/ C vj .gx I x C jx=pn/

m1
Q.x/
j D1
j3

vm .gx I 0; x/ C vm .gx I x; 2x/ .1 C x/˛C1
C 2
C MK˛
m nx
p
4 1 C 9x.1 C x/ C 1
C p jf .xC/ f .x/j;
5 nx.1 C x/
9.3 Functions with Derivatives of Bounded Variation 301
p
where m D Œ n; Q.x/ D 1 C 8 .1 C x/=x;, N. ; x/ > 2, and K˛ is a positive
constant depending only on ˛, in particular, K 0 D 2; K1 D 3; K3 D 5.
The preceding theorem enables us to obtain estimates for the rate of convergence
of Bn .f; x/ for functions f of bounded variation in the Jordan sense or in the gen-
eralized sense, specifically if we choose p 1 and let Vp .gI a; b/ denote the total
pth-power variation of a function g on an interval Œa; b I , defined as the upper
bound of the set of all numbers
!1=p
X
jg.bk / g.ak /j p
over all finite systems of non-overlapping intervals .ak ; bk / Œa; b. Clearly, if
Vp .gI a; b/ < 1, then for every positive integer j ,
vj .gI a; b/ j 11=p Vp .gI a; b/:
Using the above inequality, we get the following corollary.

Corollary 9.1 ([121]). Let f be a function of bounded pth-power variation .p
1/ on every finite subinterval of Œ0; 1/, and let it satisfy the growth jf .t/j M.1 C
t/˛ ; for t 2 I , where M > 0; ˛ 2 N 0 . Then, for every x 2 .0; 1/ and all n
f1 C ˛; N. ; x/g, we have
ˇ ˇ n
ˇ ˇ X 1 11=p
ˇBn .f; x/ 1 .f .xC/ C f .x//ˇ p8Q.x/ p
ˇ 2 ˇ . n/1C1=p
kD1
k
p p
p.gx I x x= k; x C x= k/
.1 C x/˛C1
C MK˛
nx
p
4 1 C 9x.1 C x/ C 1
C p jf .xC/ f .x/j;
5 nx.1 C x/
where ; N. ; x/; Q.x/, and K˛ have the same meanings as in Theorem 9.4.
9.3 Functions with Derivatives of Bounded Variation
The rate of convergence for functions having derivatives of bounded variation

is also an interesting area of research. Bojanic and Cheng [44] investigated
the asymptotic behavior of Hermite–Fejér polynomials Hn .f; x/ [see (7.5)] for
functions defined by
Z x
f .x/ D f .1/ C '.t/dt; x 2 Œ1; 1; (9.23)
1
where ' is a function of bounded variation on Œ1; 1. This class of functions can be
described as the class of differentiable functions whose derivatives are of bounded
variation. Usually, the class is denoted as DBV Œ1; 1 in this case. It is clear that this
class of functions is much more general than functions with continuous derivatives.
Theorem 9.5 ([44]). Let f be a function in DBV Œ1; 1 and ' 2 BV Œ1; 1,
so that (9.23) is satisfied. Then, for x 2 .1; 1/ such that x ¤ xk n for k D
1; 2; 3; : : : ; n, we have
ˇ ˇ
ˇ ˇ
ˇHn .f; x/ f .x/ .1 x / Tn .x/ log n ˇ
2 1=2 2
ˇ n ˇ
C.jj C j j/ jTn .x/j jTn .x/j xCŒTn .x/=n
C VxŒTn .x/=n .'x /
2 n n
12Tn2 .x/ X Vx=k .'x /
n xC=k
C ;
n k
kD1
where Vab .'x / is the total variation of 'x on Œa; b, D '.xC/ '.x/, D
'.xC/ C '.x/, and C D 7 C :
Bojanic and Cheng [45] investigated the asymptotic behavior of Bernstein
polynomials for functions defined as
Z x
f .x/ D f .0/ C .t/dt; x 2 Œ0; 1; (9.24)
0
where is a function of bounded variation on Œ0; 1. This class of functions can be
defined as
DBV Œ0; 1 D ff W f 0 2 BV Œ0; 1g:
For the Bernstein polynomials Bn .f; x/ defined by (7.7), Bojanic and Cheng [45]
estimated the rate of convergence of Bn .f; x/ to f .x/.
Theorem 9.6 ([45]). Let f be a function in DBV Œ0; 1 and 2 BV Œ0; 1, so that
(9.24) is satisfied. Then, for any x 2 .0; 1/ and n 1=x.1 x/, we have
ˇ ˇ
ˇ 2x.1 x/ 1=2 ˇˇ
ˇ
ˇBn .f; x/ f .x/ ˇ
ˇ 2 ˇ
p
2 X xC.1x/=k
Œ n
M
C Vxx=k .‰x /; (9.25)
2 n.x.1 x//1=2 n
kD1
p p
where Œ n is the greatest integer less than or equal to n, Vab .‰x / is the ptotal
5=2 4
variation of ‰x on Œa; b, D f 0 .C/f 0 ./, and M D 2 C 4 C p .
54 2
If f 0 is continuous at x, that is, D 0, then (9.25) can be simplified as
p
2 X xC.1x/=k
Œ n
jBn .f; x/ f .x/j Vxx=k .‰x /;
n
kD1
which is the best possible and cannot be improved any further asymptotically.
Bai et al. [32] also worked in this direction and estimated the rate of convergence
for general operators. Gupta et al. [141] estimated the rate of convergence for
functions having DBV for Beta operators of the second kind. Ispir et al. [159]
estimated the convergence rate for the Kantorovich-type operators. This section
includes additional results on the rate of convergence for functions having deriva-
tives of bounded variations.
1. Stancu–Beta Operators For Lebesgue integrable functions f on the interval
I D .0; 1/, Beta operators Ln of the second kind, introduced in [223], are given by
Z 1
1 t nx1
.Ln f /.x/ D f .t/dt: (9.26)
.nx; n C 1/ 0 .1 C t/nxCnC1
Obviously, the operators Ln are positive linear operators on the space of locally
integrable functions on I of polynomial growth as t ! 1, provided that n is
sufficiently large.
This section discusses the study of operators (9.26). We estimate their rate of
convergence by the decomposition technique for absolutely continuous functions
f of polynomial growth as t ! 1, having a derivative f 0 coinciding a.e. with a
function that is of bounded variation on each finite subinterval of I . For the sake of
convenient notation in the proofs, we rewrite the operators (9.26) as
Z 1
.Ln f /.x/ D Kn .x; t/f .t/dt; (9.27)
0
where the kernel function Kn is given by
1 t nx1
Kn .x; t/ D :
.nx; n C 1/ .1 C t/nxCnC1
Moreover, we put
Z y
n .x; y/ D Kn .x; t/dt; y 0:
0
Note that 0 n .x; y/ 1; y 0: For fixed x 2 I , define the function x by

x .t/ D t x. The central moments for the operators Ln are given by
x.1 C x/
.Ln 0
x /.x/ D 1; .Ln 1
x /.x/ D 0; .Ln 2
x /.x/ D : (9.28)
n1
Moreover, let x 2 I be fixed. For r D 0; 1; 2; : : : and n 2 N , the central moments
for the operators Ln satisfy
.Ln r
x /.x/ D O.nŒ.rC1/=2 /; n ! 1:
In view of this, an application of the Schwarz inequality, for r D 0; 1; 2; : : :, yields

q
.Ln j x j/.x/
r
.Ln 2r
x /.x/ D O.nr=2 /; n ! 1: (9.29)
In particular, by (9.28), we have

r
x.1 C x/
.Ln j x j/.x/ : (9.30)
n1
Lemma 9.3. Let x 2 I be fixed and Kn .x; t/ be defined in (9.27). Then, for n 2,
we have
Z y
x.1 C x/
n .x; y/ D Kn .x; t/dt .0 y < x/;
0 .n 1/.x y/2
Z 1
x.1 C x/
1 n .x; z/ D Kn .x; t/dt .x < z < 1/:
z .n 1/.z x/2
For r 0, let DBr .I / be the class of all absolutely continuous functions f

defined on I
(i) having on I a derivative f 0 coinciding a.e. with a function that is of bounded
variation on each finite subinterval of I ,
(ii) satisfying f .t/ D O.t r / as t ! 1. Note that all functions f 2 DBr .I /
possess, for each a > 0, a representation
Z x
f .x/ D f .a/ C .t/dt; x > a;
a
with a function of bounded variation on each finite subinterval of I:

Theorem 9.7 ([141]). Let r 2 N; x 2 I , and f 2 DBr .I /. Then it holds that
j.Ln f /.x/ f .x/j

r
1 x.1 C x/ 0 x xCx=pn
jf .xC/ f 0 .x/j C p Vxx=pn ..f 0 /x /
2 n1 n
0 p 1
1 C x X xCx=k
Œ n
C @ Vxx=k ..f 0 /x / C x 1 jf .2x/ f .x/j C 2jf 0 .xC/jA
n1
kD1
cr;x Mr;x .x/

C ;
nr=2
Wb
where a f .x/ denotes the total variation of fx on Œa; b; and fx is defined by
8
ˆ
ˆ f .t/ f .x /; 0 t < x;
ˆ
ˆ
ˆ
<
fx .t/ D 0; t D x;
ˆ
ˆ
ˆ
ˆ
:̂
f .t/ f .x C /; x < t < 1;
and the constants cr;x and Mr;x .f / are given by

q
cr;x D sup nr .Ln 2r
x /.x/; Mr;x .f / D 2r sup t r jf .t/ f .x/j:
n2N t 2x
Proof. For x 2 I , we have

Z 1 Z 1 Z t
.Ln f /.x/f .x/ D Kn .x; t/.f .t/f .x//dt D Kn .x; t/ f 0 .u/d udt:
0 0 x
Now we take advantage of the identity
1 1
f 0 .u/ D .f 0 /x .u/ C .f 0 .xC/ C f 0 .x// C .f 0 .xC/ f 0 .x//sign.u x/
2 2

0 1 0 0
C f .x/ .f .xC/ f .x// x .u/;
2
where x .u/ D 1.u D x/ and x .u/ D 0.u ¤ x/. Obviously, we have

Z 1 Z t
1
Kn .x; t/ f 0 .x/ .f 0 .xC/ f 0 .x// x .u/d udt D 0:
0 x 2
Furthermore, by (9.28) and (9.30), respectively, we have

Z 1 Z t
1 0 1
Kn .x; t/ .f .xC/ C f 0 .x//d udt D .f 0 .xC/ C f 0 .x//
0 x 2 2
Z 1
Kn .x; t/.t x/dt D 0;
0
ˇZ Z ˇ
ˇ 1 t
1 0 ˇ
ˇ Kn .x; t/ .f .xC/ C f 0 .x//sign.u x/d udt ˇˇ
ˇ 2
0 x
r
1 x.1 C x/ 0
jf .xC/ C f 0 .x/j:
2 n1
Collecting the above relations, we obtain the estimate
j.Ln f /.x/ f .x/j jAn .f; x/ C Bn .f; x/ C Cn .f; x/j

r
1 x.1 C x/ 0
C jf .xC/ C f 0 .x/j; (9.31)
2 n1
where
Z x Z t
An .f; x/ D Kn .x; t/ .f 0 /x .u/d udt;
0 x
Z 2x Z t
Bn .f; x/ D Kn .x; t/ .f 0 /x .u/d udt;
x x
Z 1 Z t
Cn .f; x/ D Kn .x; t/ .f 0 /x .u/d udt:
2x x
Using integration by parts and applying Lemma 9.3 yields

ˇZ Z ˇ
ˇ x t ˇ
jAn .f; x/j D ˇˇ .f /x .u/d udt n .x; t/ˇˇ
0
0 x
Z p Z !
xx= n x
C p j n .x; t/jVtx ..f 0 /x /dt
0 xx= n
Z p
x.1 C x/ xx= n
x x
.x t/2 Vtx ..f 0 /x /dt C p Vxx=p ..f 0 /x /:
n1 0 n n
By the substitution of u D x=.x t/, we obtain

p
.1 C x/ X x
Œ n
x x
jAn .f; x/j Vxx=k ..f 0 /x /dt C p Vxx=p ..f 0 /x /: (9.32)
n1 n n
kD1
Furthermore, we have
ˇ Z 2x Z t ˇ
ˇ ˇ
jBn .f; x/j ˇˇ .f 0 /x .u/d udt .1 n .x; t//ˇˇ
x x
ˇZ 2x ˇ Z 2x
ˇ ˇ
ˇˇ .f 0 /x .u/d uˇˇ j1 n .x; 2x/j C j.f 0 /x .t/j:j1 n .x; t/jdt
x x
Z xCx=pn
.1 C x/ 0
jf .2x/ f .x/ xf .xC/j C Vxt ..f 0 /x /dt
.n 1/x x
Z
x.1 C x/ 2x
C .t x/2 Vxt ..f 0 /x /dt:
.n 1/ xCx=pn
By the substitution of u D x=.t x/, we obtain

p
.1 C x/ X xCx=k
Œ n
.1 C x/
jBn .f; x/j jf .2x/ f .x/ xf 0 .xC/j C Vx ..f 0 /x /
.n 1/x .n 1/
kD1
x p
C p VxxCx= n ..f 0 /x /: (9.33)
n
Finally, we have
ˇZ ˇ
ˇ 1 ˇ
jCn .f; x/j D ˇˇ Kn .x; t/.f .t/ f .x/ .t x/f .xC//dt ˇˇ 0
2x
Z 1 Z 1
2r Mr;x .f / Kn .x; t/t r dt C jf 0 .xC/j Kn .x; t/jt xjdt:
2x 2x
Using the obvious inequalities t 2.t x/ and x t x for t 2x, and applying
(9.29), we obtain
1Cx 0
jCn .f; x/j Mr;x .f /cr;x nr=2 C jf .xC/j: (9.34)
n1
Combining the estimates (9.31)–(9.34), we get the desired result. This completes
the proof of the theorem.
2. Kantorovich Operators The Kantorovich-type operators discussed in [159]
are defined as
1
X Z
.Gn f /.x/ D n
2
n .0/ Pv .˛n ; n I Kn / f .t/dt; (9.35)
vD0 In;v
where In;v WD Œv=n2 n .0/; .v C 1/=n2 n .0/; n 2 N; v 2 N0 , Pv .˛n ; n I Kn / D

@v v
K .x; t; u/juD˛n n .t /;t D0 .˛n vŠn .0// , and f 2 Mloc Œ0; 1/, the class of all
@uv n
measurable functions on Œ0; 1/ and bounded on every compact subinterval of
Œ0; 1/. The operators (9.35) can be written alternatively as
Z 1
.Gn f /.x/ D Wn .x; t/f .t/dt;
0
P
where Wn .x; t/ D n2 n .0/ 1 vD0 Pv .˛n ; n I Kn /n;v .t/, and n;v is the character-
istic function of the interval In;v with respect to Œ0; 1/.
Theorem 9.8 ([159]). Let r 2 N; x 2 I , and f 2 DBr .0; 1/. Then, for n
sufficiently large, it holds that
j.Gn f /.x/ f .x/j

2 .x C 1/jf 0 .xC/ C f 0 .x/j

n n .0/
s ˇ 0 ˇ
ˇ f .xC/ f 0 .x/ ˇ
C .x C 1/ ˇ ˇ ˇ 1 0
n2 n .0/ 2 ˇ C x jf .xC/j
0p 1
.x C 1/2 @X xCx=v
Œ n
C 2 V ..f 0 /x / C x 1 jf .2x/ f .x/j C jf 0 .xC/jA
n n .0/ vD1 xx=x
x xCx=pn
C p Vxx=pn ..f 0 /x / C T;x .f /k;x n=2 ;
n
p
where T;x .f /D2 supt 2x t jf .t/f .x/j, k;x D supn2N n Gn ..e1 xe0 /2 ; x/,
Vab .f / denotes the total variation of f , and the auxiliary function is as defined in
Theorem 9.7.
9.4 Convergence for Bounded and Absolutely

Continuous Functions
In this section, we present approximation properties on locally bounded functions

and the absolutely continuous functions, which were studied in [249].
Let f be a function defined on Œ0; 1/ and satisfying the following growth
condition:
jf .t/j M e ˇt .M > 0; ˇ 0; t ! 1/: (9.36)

9.4 Convergence for Bounded and Absolutely Continuous Functions 309
Then, for such functions, the Gamma operators Gn .f; x/ are defined as
Z C1
1
Gn .f; x/ D n f .t=n/t n1 e t =x dt: (9.37)
x .n/ 0
The class of locally bounded functions ˆB and the class of absolutely continuous
functions ˆDB are defined as follows:
ˆB D ff W f is bounded on every finite subinterval of Œ0; 1/g;

Z x
ˆDB Dff W f .x/f .0/D h.t/dtI h is bounded on every finite subinterval of Œ0; 1/g:
0
Furthermore, for a function f 2 ˆB ; we introduce the following metric form:
x .f; / D sup jf .t/ f .x/j;

t 2Œx ;xC
where x 2 Œ0; 1/ is fixed, 0: The rate of convergence for functions belonging

to the class of locally bounded functions for Gamma operators is given as follows:
Theorem 9.9 ([249]). Let f 2 ˆB and let f .t/ D O.e ˇt / for some ˇ 0 as
t ! 1. If f .xC/ and f .x/ exist at a fixed point x 2 .0; 1/, then for n > 4ˇx,
we have
ˇ ˇ
ˇ f .x/ ˇˇ
ˇGn .f; x/ f .xC/ C f .x/ C f .xC/ p
ˇ 2 3 2 n ˇ
5X p
n
x .gx ; x= k/ C O.n1 /;
n
kD1
8
< f .t/ f .xC/; x < t < 1;
gx .t/ D 0; t D x;
:
f .t/ f .x/; 0 t < x:
Corollary 9.2 ([249]). Let f be a function of bounded variation on every

subinterval of Œ0; 1/, and let f .t/ D O.e ˇt / for some ˇ 0 as t ! 1.
Then, for x 2 .0; 1/ and n > 4ˇx, we have
ˇ ˇ
ˇ f .x/ ˇˇ
ˇGn .f; x/ f .xC/ C f .x/ C f .xC/
p
ˇ 2 ˇ
3 2 n
p
5X p 5X _ k
n n xCx=
x .gx ; x= k/ C O.n1 / .gx / C O.n1 /:
n n p
kD1 kD1 xx= k
Corollary 9.3 ([249]). Under the conditions of Theorem (9.9), if x .gx ; / D

o. /, then

Gn .f; x/ D C p C o.n1=2 /:
2 3 2 n
The next result on the rate of convergence of Gamma operators is for absolutely
continuous functions.
Theorem 9.10 ([249]). Let f be a function in ˆDB , and let f .t/ M e ˇt for some
M > 0 and ˇ 0 as t ! 1. If h.xC/ and h.x/ exist at a fixed point x 2 .0; 1/,
then for n > 4ˇx, we have
ˇ ˇ
ˇ ˇ
ˇGn .f; x/ f .x/ px ˇ
ˇ 2 n ˇ
p
xX p
Œ n
jjx C 17M.2e/ˇx
x .gx ; x= k/ C ;
n n3=2
kD1
where D h.xC/ h.x/ and

8
< h.t/ h.xC/; x < t < 1;
x D 0; t D x;
:
h.t/ h.x/; 0 t < x:
Remark 9.2. If f is a function with a derivative of bounded variation, then

f 2 ˆDB . Thus, the approximation of functions with derivatives of bounded
variation is a special case of Theorem 9.10.
In 2012, Zeng [250] obtained an exact estimate for the first-order absolute
moment of Stancu–Beta operators using the Stirling formula and established an
estimate on convergence for Stancu–Beta operators for absolutely continuous
functions.
For Lebesgue integrable functions f on the interval .0; 1/, the Stancu–Beta
operators introduced in [223] are defined by
Z 1
1 t nx1
Ln .f; x/ D f .t/dt:
B.nx; n C 1/ 0 .1 C t/nxCnC1
The class of functions ˆDB is defined as

Z x
ˆDB D ff W f .x/ f .0/ D .t/dtI is bounded on
0
every finite subinterval of Œ0; 1/I f .t/ D O.t r /; t ! 1g:

9.4 Convergence for Bounded and Absolutely Continuous Functions 311
Furthermore, for a function f 2 ˆB ; the metric is defined as
!x .f; / D sup jf .t/ f .x/j;

t 2Œx ;xC \Œ0;1/
where x 2 Œ0; 1/ is fixed, 0:

Theorem 9.11 ([250]). Let f be a function in ˆDB : If .xC/ and .x/ exist at a
fixed point x 2 .0; 1/, we write D ..xC/.x//=2: Then for n 2, we have
ˇ ˇ
ˇ 2x.1 C x/ 1=2 ˇˇ
ˇ
ˇLn .f; x/ f .x/ ˇ
ˇ n ˇ
p
3 C 7x X
Œ n
.1 C x/3=2 3=2 .2x/r
!x .gx ; x=k/ C p n C 2m O.nŒ.mC1/=2 /;
n1 72x x
kD1
where
8
< .t/ .xC/; x < t < 1;
x .t/ D 0; t D x;
:
.t/ .x/; 0 t < x:
Chapter 10
Rate of Convergence in Simultaneous
Approximation
In the theory of approximation, the study of the rate of convergence in simultaneous

approximation is also an interesting area of research. Several researchers have
worked in this direction; some of them have obtained the rate of convergence for
bounded/bounded variation functions in simultaneous approximation.
Gupta et al. [142] estimated the rate of convergence for the well-known Szász–
Mirakyan–Durrmeyer operators Mn .f; x/ defined in (2.17). They considered the
class Br;˛ by
.r/
Br;˛ D ff W f .r1/ 2 C Œ0; 1/; f˙ .x/ exist everywhere and are bounded on every
.r/
finite subinterval of Œ0; 1/ and f˙ .t/ D O.e ˛t /.t ! 1/ for some ˛ > 0g:
Theorem 10.1 ([142]). Let f 2 Br;˛ ; r 2 N 0 . Then, for every x 2 .0; 1/ and
n maxfr 2 C 3r C 2; 4˛g; we have
ˇ ˇ
ˇ .r/ ˇ X
n p
ˇM .f; x/ 1 Œf .r/ .x/ C f .r/ .x/ˇ x C 3.1 C 2x/
2
xCx/= k
V p .gr;x /
ˇ n 2 C ˇ nx 2 xx= k
kD1
j2r C 1j .r/
Cp jfC .x/ f.r/ .x/j
8e nx
r
2x C 1
C2 .r1/=2 2˛x
e ;
nx 2
where the auxiliary function is defined as

8 .r/
< f .t/ f .x/; 0 t < x;
.r/
gr;x .t/ D 0; t D x;
: .r/ .r/
f .t/ fC .x/; x < t < 1:
Vab .gr;x .t// is the total variation of gr;x .t/ on Œa; b. In particular, g0;x .t/ D gx .t/:

314 10 Rate of Convergence in Simultaneous Approximation
10.1 Bernstein–Durrmeyer–Bézier-Type Operators
The family of Durrmeyer-type operators discussed in [115] is defined as

8 n Z 1
ˆ X
ˆ
ˆ n p .x/ pn1;k1 .t/f .t/dt C pn;0 .x/f .0/; r D 0;
ˆ
< n;k
kD1 0
Pn;r .f; x/ D Z 1
ˆ
ˆ nr X
nr
ˆ p .x/ pnCr1;kCr1 .t/f .t/dt; r > 0;
:̂ .n C r 1/r1 nr;k
kD0 0
where r; n 2 N0 with r n, and for any a; b 2 N0 , ab D a.a 1/ .a b C 1/,

a0 D 1 is the falling factorial. The operators of this family are linear and positive.
Notice that the family Pn;˛ , as a particular case (r D 0), contains the sequence Pn;0
introduced by Srivastava and Gupta in [218]. For any ˛ 1, the Bézier modification
of the family Pn;r is given by
8 n Z 1
ˆ X .˛/
ˆ
ˆ n Q .x/
.˛/
pn1;k1 .t/f .t/dt C Qn;0 .x/f .0/; r D 0;
ˆ
< n;k
kD1 0
Pn;r;˛ .f; x/ D Z 1
ˆ
ˆ nr Xnr
ˆ Q
.˛/
.x/ pnCr1;kCr1 .t/f .t/dt; r > 0;
:̂ .nCr1/r1 nr;k
kD0 0
.˛/ P
where Qn;k .x/ D Jn;k ˛
.x/ Jn;kC1
˛
.x/ and Jn;k .x/ D nj Dk pn;j .x/:
This new family of Bézier-type operators, for ˛ D 1, again yields the family Pn;r .
In particular, Pn;0;˛ is the sequence introduced by Gupta and Maheshwari in [118].
The aim of this section is to study the approximation properties of the operators
Pn;r;˛ in the space of functions
H D ff W Œ0; 1 ! R W f˙ .x/ exists everywhere and be bounded on Œ0; 1g:
Usually, the rate of approximation for this kind of linear positive operator is
analyzed for the class of continuous functions or, in a more general setting, for
the class of functions of bounded variation (see, for example, [118,252]). We would
like to stress that the space H is larger than the space of bounded variation functions
on Œ0; 1. For instance, the function
8
ˆ
ˆ if x D 0;
< 0;
f .x/ D
ˆ 1
:̂ x sin ; if 0 < x 1;
x2
is not of bounded variation, but f 2 H . Moreover, as a consequence of our results

for Pn;r;˛ ; we will also establish estimates of the simultaneous approximation error
for the operators Pn;r . The operators Pn;r;˛ also admit the integral representation
10.1 Bernstein–Durrmeyer–Bézier-Type Operators 315
Z 1
Pn;r;˛ .f; x/ D Kr;n;˛ .x; t/f .t/dt;
0
where the kernel Kr;n;˛ is given by

8 n
ˆ
ˆ X .˛/
ˆ
ˆ
.˛/
Qn;k .x/pn1;k1 .t/ C Qn;0 .x/ı.t/; r D 0;
<n
Kr;n;˛ .x; t/ D kD1
X
nr
ˆ
ˆ nr
ˆ .˛/
Qnr;k .x/pnCr1;kCr1 .t/; r > 0:
:̂ .n C r 1/r1
kD0
Here, ı.t/ denotes the Dirac delta function. This section is based on [115].
For the class of bounded functions on the interval Œ0; 1, we consider the
following quantities:
x .f; ı1 / D sup jf .t/ f .x/j;

t 2Œxı1 ;x
xC .f; ı2 / D sup jf .t/ f .x/j;

t 2Œx;xCı2
x .f; / D sup jf .t/ f .x/j;

t 2Œxx= ;xC.1x/=
where x 2 Œ0; 1 and 0 ı1 x; 0 ı2 1 x, and 1. We summarize several

properties of these moduli in the following items:
i. x .f; ı1 / and xC .f; ı2 / are monotone nondecreasing with respect to ı1 and
ı2 , respectively. Also, x .f; / is monotone nonincreasing with respect to .
ii. limı1 !0C x .f; ı1 / D 0; limı2 !0C xC .f; ı2 / D 0, and lim !1 x .f; / D
0 if f is continuous on the left, continuous on the right, or continuous at the
point x, respectively.
iii. x .f; ı1 / x .f; x=ı1 / and xC .f; ı2 / x .f; .1 x/=ı2 /:
iv. x .f; ı1 / Vxı x
1
.f /; xC .f; ı2 / VxxCı2 .f /, and x .f; /
xC.1x/=
Vxx= .f /:
All these properties can be found in [252].
In the sequel, to obtain the rate of convergence, we shall need several lemmas.
.nCr/r
Lemma 10.1. For Tn;r;m .x/ D nr Pn;r ..t x/m ; x/, the following claims
hold:
i. For any r; m 2 N0 and x 2 Œ0; 1, the following recurrence relation is satisfied:
.n C m C r C 1/Tn;r;mC1 .x/ D x.1 x/ŒDTn;r;m .x/ C 2mTr;n;m1 .x/

C Œ.m C r/ x.1 C 2m C 2r/Tn;r;m .x/;
where, for m D 0, we denote Tn;r;1 .x/ D 0.

ii. For all r 2 N0 and x 2 Œ0; 1,
r x.1 C 2r/
Tn;r;0 .x/ D 1; Tn;r;1 .x/ D ;
nCr C1
2nx.1 x/ C r.1 C r/ 2rx.2r C 3/ C 2x 2 .2r 2 C 4r C 1/
Tn;r;2 .x/ D :
.n C r C 1/.n C r C 2/
iii. For all r; m 2 N0 and x 2 Œ0; 1,

Tn;r;m .x/ D O nŒ.mC1/=2 :
Lemma 10.2. For any r; s 2 N0 and x 2 Œ0; 1,
D s Pn;r .f; x/ D Pn;rCs .D s f; x/:
Lemma 10.3. The following claims hold:

i. For every x 2 .0; 1/ and k; n1 ; n2 2 N0 , with 0 < k n1 < n2 , we have
Jn1 ;k .x/ < Jn2 ;k .x/:
ii. For every x 2 Œ0; 1, r 2 N ,

ˇ ˇ
ˇ n ˇˇ
ˇX ˛
ˇ JnCr;j .x/ Jn;j
˛
.x/ ˇˇ ˛rx:
ˇ
ˇj D0 ˇ
Proof. Let us first prove claim (i). It is clear that it is sufficient to prove the
inequality for Jn;k and JnC1;k . For this purpose, let’s take into account first
that from the definition of Jn;k , we know that .JnC1;k Jn;k / .0/ D 0 and
.JnC1;k Jn;k / .1/ D 0 and also that
DJn;k .x/ D npn1;k1 .x/ and DJnC1;k .x/ D .n C 1/pn;k1 .x/:
In this case,
D.JnC1;k Jn;k /.x/

! !
n n 1 k1
D .n C 1/ x .1 x/
k1 nkC1
n x .1 x/nk
k1 k1
!
n
D x k1 .1 x/nk .k .n C 1/x/ :
k1
Then it is immediate that

k
(a) for x 2 .0; 1/; D.JnC1;k Jn;k /.x/ D 0 , x D ;
n C 1
k
(b) for x 2 0; ; D.JnC1;k Jn;k /.x/ > 0:
nC1
From (b), it is clear that .JnC1;k Jn;k /. nC1

k
/ > 0, and then (a) together with the
mean value theorem leads us to the conclusion.
To prove claim (ii), we know that, provided ˛ 1, b ˛ a˛ ˛.b a/ whenever
0 a b 1. Then, if we use claim (i),
ˇ ˇ
ˇ n ˇˇ
ˇX ˛
ˇ JnCr;j .x/ Jn;j
˛
.x/ ˇˇ
ˇ
ˇj D0 ˇ
n
X X
n

D JnCr;j .x/ Jn;j .x/ ˛
˛ ˛
JnCr;j .x/ Jn;j .x/
j D0 j D0
0 1
X
nCr X
n
˛@ JnCr;j .x/ Jn;j .x/A D ˛ .1 C .n C r/x .1 C nx// D ˛rx:
j D0 j D0

Since for all n 2 N0 , Jn;0 .x/ D 1, we can conclude from the preceding lemma
that for x 2 Œ0; 1 and 0 k n1 n2 , we have that Jn1 ;k .x/ Jn2 ;k .x/.
Remark 10.1. For every 0 k n; x 2 .0; 1/; ˛ 1, and for all n, if we apply
the mean value theorem, we know that there exists 2 Œ0; 1 with Jn;kC1 .x/
Jn;k .x/ such that
.˛/
Qn;k .x/ D Jn;k
˛
.x/ Jn;kC1
˛
.x/ D ˛ ˛1 .Jn;k .x/ Jn;kC1 .x// ˛pn;k .x/:
Then, considering the results in [246, Theorem 1], we can write the following
inequalities:
.˛/ ˛
Qn;k .x/ ˛pn;k .x/ p :
2e nx.1 x/
As a consequence, we also have Kn;r;˛ .x; t/ ˛Kn;r;1 .x; t/.

Remark 10.2. For a fixed x 2 .0; 1/, when n is sufficiently large, it can be seen
from Lemma 10.1, that
x.1 x/ C x.1 x/
Tn;r;2 .x/ ;
n n
for any C > 2.
Lemma 10.4. Let x 2 .0; 1/ and C > 2; then for n sufficiently large, we have
Z y
C ˛x.1 x/
n;r;˛ .x; y/ D Kn;r;˛ .x; t/dt ; 0 y < x;
0 n.x y/2
Z 1
C ˛x.1 x/
1 n;r;˛ .x; z/ D Kn;r;˛ .x; t/dt ; x < z < 1:
z n.z x/2
Theorem 10.2 ([115]). Let f 2 H , then for ˛ 1, r 2 N0 , x 2 .0; 1/, any C > 2,
and n sufficiently large, we have
ˇ ˇ
ˇ 1 ˇ 5˛.1 C ˛/.r C 1/
ˇPn;r;˛ .f; x/ ŒfC .x/ C ˛f .x/ˇˇ jfC .x/ f .x/j p
ˇ ˛C1 2e.n C r/x.1 x/
jfC .x/ C ˛f .x/j r 2 2C ˛
C C
˛C1 n nx.1 x/
X
n p
x .gx ; k/;
kD1
where the auxiliary function gx is defined as

8
< f .t/ f .x/; 0 t < x;
gx .t/ D 0; t D x;
:
f .t/ fC .x/; x < t 1:
Proof. We can write
fC .x/ C ˛f .x/ fC .x/ f .x/

f .t/ D C gx .t/ C sign˛ .t x/
˛C1 ˛C1

fC .x/ C ˛f .x/
C ıx .t/ f .x/ ; (10.1)
˛C1
where
8
< ˛; t > 0;
sign˛ .t/ D 0; t D 0;
:
1; t < 0;
and

1; t D x;
ıx .t/ D
0; t ¤ x:
Thus, using Remark 10.1, identity (6.10), and the fact that Pn;r;˛ .ıx ; x/ D 0;
we have
ˇ ˇ
ˇ ˇ
ˇPn;r;˛ .f; x/ 1 ŒfC .x/ C ˛f .x/ˇ
ˇ ˛C1 ˇ
jfC .x/ f .x/j

˛Pn;r .jgx j; x/ C Pn;r;˛ .sign˛ .t x/; x/
˛C1
jfC .x/ C ˛f .x/j
CjPn;r;˛ .1; x/ 1j : (10.2)
˛C1
Let us analyze the three summands of the right-side term of this inequality.
For the first summand of (10.2), we have
Z p Z p Z !
xx= n xC.1x/= n 1
Pn;r .jgx j; x/ D C p
C p
jgx .t/jKn;r;˛ .x; t/dt
0 xx= n xC.1x/= n
D E1 C E2 C E3 :
First, we estimate E1 : Note that x .gx ; ı1 / is monotone nondecreasing with

respect to ı1 , and so it follows that
ˇZ ˇ Z
ˇ xx=pn ˇ p
xx= n
ˇ ˇ
jE1 j D ˇ jgx .t/jdt n;r;˛ .x; t/ˇ x .gx ; x t/dt n;r;˛ .x; t/:
ˇ 0 ˇ 0
p
Integrating by parts with y D x x= n; we have
Z p
xx= n
x .gx ; x t/dt n;r;˛ .x; t/
0
Z y
x .gx ; x y/ n;r;˛ .x; y/ C n;r;˛ .x; t/d.x .gx ; x t//:
0
Applying Remark 10.3, we have

Z y
C ˛x.1x/ C ˛x.1x/ 1
jE1 j x .gx ; xy/ C d.x .gx ; xt//:
n.xy/2 n 0 .xt/2
(10.3)
Since
Z y
1
d.x .gx ; x t//
0 .x t/2
Z
x .gx ; x y/ x .gx ; x/ y
2
D C C x .gx ; x t/ dt;
.x y/ 2 x2 0 .x t/3
from (10.3), we obtain

Z p
xx= n
C ˛x.1x/ C ˛x.1x/ 2
jE1 j x .gx ; x/ C x .gx ; xt/ dt:
nx 2 n 0 .xt/3
p
Substituting t D x x= u in the last integral, we get
Z p Z
xx= n
2 1 n p
x .gx ; x t/ dt 2 x .gx ; x= u/d u:
0 .x t/3 x 1
Thus, we have
Z n
C ˛.1 x/ p
jE1 j x .gx ; x/ C x .gx ; x= u/ : (10.4)
nx 1
As gx .x/ D 0,
Z p
xC.1x/= n p
jE2 j p
jgx .t/ gx .x/jdt n;r;˛ .x; t/ x .gx ; n/: (10.5)
xx= n
Using similar methods as in the estimation of E1 ; we obtain

Z n
C ˛x p
jE3 j xC .gx ; 1 x/ C xC .gx ; .1 x/= u/ : (10.6)
n.1 x/ 1
Combining the estimates (10.4)–(10.6) with property (iii) of the modulus x , which
we can find on p. 315, we get
E1 C E2 C E3
Z
p .1 x/ x n p
x .gx ; n/ C C ˛ C x .gx ; 1/ C x .gx ; u/ :
nx n.1 x/ 1
By the monotonocity of x .gx ; / and the facts .1x/2 Cx 2 1 and 1

n1 C˛
nx.1x/
for n > 1, we have
Pn;r .jgx j; x/ D E1 C E2 C E3
1 X p
n
x .gx ; k/
n1
kD2
C˛ C˛ X
n1 p
C x .gx ; 1/ C x .gx ; k/
nx.1 x/ nx.1 x/
kD1
2C ˛ X p
n
x .gx ; k/: (10.7)
nx.1 x/
kD1
To estimate the second summand of (10.2), we proceed as follows: For r > 0,
Pn;r;˛ .sign˛ .t x/; x/

Z 1 Z x !
nr X .˛/
nr
D Qnr;k .x/ ˛pnCr1;kCr1 .t/dt pnCr1;kCr1 .t/dt
.nCr1/r1 x 0
kD0
X .˛/
nr Z 1
nr
D Q .x/ ˛pnCr1;kCr1 .t/dt
.n C r 1/r1 nr;k
0
kD0
Z x
.1 C ˛/ pnCr1;kCr1 .t/dt :
0
Rx PkCr1
Using the identity .nCr/ 0 pnCr1;kCr1 .t/dt D 1 j D0 pnCr;j .x/, we have
Pn;r;˛ .sign˛ .t x/; x/

0 0 11
nr X
nr X
kCr1
D @˛ .1 C ˛/ Qnr;k .x/ @1
.˛/
pnCr;j .x/AA
.n C r/r j D0
kD0
0 1
nr X
nr X
kCr1
D @.1 C ˛/ .˛/
Qnr;k .x/ pnCr;j .x/ 1A :
.n C r/r j D0
kD0
For r D 0, if we follow the same steps, we obtain
X
n
.˛/
X
k1 X
n
Pn;0;˛ .sign˛ .tx/; x/ D .1C˛/ Qn;k .x/ pn;j .x/ Qn;k .x/Qn;0 .x/
kD1 j D0 kD1
X
n
.˛/
X
k1
D .1 C ˛/ Qn;k .x/ pn;j .x/ 1:
kD1 j D0
Therefore, for r 0, we can write

0 1
nr X
nr X
kCr1
Pn;r;˛ .sign˛ .t x/; x/ D @.1 C ˛/ .˛/
Qnr;k .x/ pnCr;j .x/ 1A :
.n C r/r j D0
kD0
Now, if we use Remark 10.1, we have

ˇ ˇ
ˇ .n C r/r ˇ
ˇ ˇ
ˇ nr Pn;r;˛ .sign˛ .t x/; x/ˇ
ˇ ˇ
ˇ ˇ
ˇ X
nr X k
ˇ
ˇ
ˇ.1 C ˛/
.˛/
Qnr;k .x/ pnCr;j .x/ 1ˇˇ
ˇ kD0 j D0 ˇ
ˇ 0 1ˇ
ˇ ˇ
ˇ X
nr X
kCr1
ˇ
ˇ
C ˇ.1 C ˛/
.˛/
Qnr;k .x/ @ pnCr;j .x/ ˇˇ
A
ˇ kD0 j DkC1 ˇ
ˇ ˇ
ˇ ˇ
ˇ X
nr X k
ˇ jr 1j.1 C ˛/
ˇˇ.1 C ˛/ pnCr;j .x/ 1ˇˇ C p
.˛/
Qnr;k .x/
ˇ kD0 j D0 ˇ 2e.n C r/x.1 x/
ˇ ˇ
ˇ ˇ
ˇ X
nr X
nr
ˇ jr 1j.1 C ˛/
ˇ
D ˇ.1 C ˛/ pnCr;j .x/ Qnr;k .x/ 1ˇˇ C p
.˛/
ˇ j D0 kDj ˇ 2e.n C r/x.1 x/

ˇ ˇ
ˇ ˇ
ˇ X
nr
ˇ jr 1j.1 C ˛/
ˇ
D ˇ.1 C ˛/ pnCr;j .x/Jnr;j .x/ 1ˇˇ C p
˛
: (10.8)
ˇ j D0 ˇ 2e.n C r/x.1 x/
Using Lemma 10.3, we can write

ˇ ˇ
ˇ X ˇ
ˇ nr
ˇ
ˇ.1 C ˛/ p .x/J ˛
.x/ 1 ˇ
ˇ nCr;j nr;j ˇ
ˇ j D0 ˇ
ˇ ˇ
ˇ X ˇ
ˇ nr
ˇ
ˇ
ˇ.1 C ˛/ pnCr;j .x/JnCr;j .x/ 1ˇˇ
˛
ˇ j D0 ˇ
X
nr
C.1 C ˛/ ˛
pnCr;j .x/ JnCr;j .x/ Jnr;j
˛
.x/
j D0
ˇ ˇ
ˇ X ˇ
ˇ nr
ˇ
ˇˇ.1 C ˛/ ˛
pnCr;j .x/JnCr;j .x/ 1ˇˇ
ˇ j D0 ˇ
nr
X
1C˛
Cp ˛
JnCr;j .x/ Jnr;j
˛
.x/
2e.n C r/x.1 x/ j D0
ˇ ˇ
ˇ X ˇ
ˇ nCr
ˇ
ˇ
ˇ.1 C ˛/ pnCr;j .x/JnCr;j .x/ 1ˇˇ
˛
ˇ j D0 ˇ
2.1 C ˛/r ˛.1 C ˛/rx

Cp Cp
2e.n C r/x.1 x/ 2e.n C r/x.1 x/
ˇ ˇ
ˇ ˇ
ˇ X
nCr X
nCr
ˇ
ˇˇ.1 C ˛/ QnCr;j .x/ˇˇ
.˛/
˛
pnCr;j .x/JnCr;j .x/
ˇ j D0 j D0 ˇ
3˛.1 C ˛/r
Cp : (10.9)
2e.n C r/x.1 x/
By the mean value theorem, we have
.˛C1/
QnCr;j .x/ D JnCr;j
˛C1
.x/ JnCr;j
˛C1
C1 .x/ D .˛ C 1/pnCr;j .x/nCr;j .x/;
˛
where JnCr;j C1 .x/ < nCr;j .x/ < JnCr;j .x/: Therefore, for n sufficiently large,
we have
X
nCr X
nCr
.˛/
.1 C ˛/ ˛
pnCr;j .x/JnCr;j .x/ QnCr;j .x/
j D0 j D0
X
nCr
D .1 C ˛/ ˛
pnCr;j .x/ JnCr;j .x/ nCr;j
˛
.x/
j D0
X
nCr
.˛/
.1 C ˛/ pnCr;j .x/QnCr;j .x/
j D0
1C˛ X
nCr
.˛/ 1C˛
p QnCr;j .x/ D p : (10.10)
2e.n C r/x.1 x/ j D0 2e.n C r/x.1 x/
Then, if we put together (10.8)–(10.10), we finally obtain
jPn;r;˛ .sign˛ .t x/; x/j

!
nr jr1j.1C˛/ 3˛.1C˛/r 1C˛
p Cp Cp
.nCr/r 2e.nCr/x.1x/ 2e.nCr/x.1x/ 2e.nCr/x.1x/
5˛.1 C ˛/.r C 1/
p : (10.11)
2e.n C r/x.1 x/
With respect to the third summand of (10.2), we have

ˇ ˇ
ˇ nr ˇ nr r2
ˇ
jPn;r;˛ .1; x/ 1j D ˇ 1 ˇD1 : (10.12)
.n C r/r ˇ .n C r/r n
To prove the last inequality, first notice that for n r 2 , it is immediate (take into
account that we always have r n). For the rest of the cases, we can consider the
equivalent inequality .n r 2 /.n C r/r nnr , which can be written in the form
Y
r
1 Y
r
1
.n r 2 / r .n C s/ n r .n .r s//:
sD1 sD1
1 1
Now, for any s D 1; : : : ; r, we only need to prove that .n r 2 / r .n C s/ n r .n
.r s//, or analogously, .n r 2 /.n C s/r n.n .r s//r . But it is clear that
limn!1 Œ.n r 2 /.n C s/r =Œn.n .r s//r D 1, and by simple differentiation,
it is possible to check that, for n r 2 , Œ.n r 2 /.n C s/r =Œn.n .r s//r is an
increasing function of n.
Finally, combining (10.7), (10.11), and (10.12), we get the desired result. This
completes the proof of the theorem.
In particular, for the operators Pn;0;˛ , the preceding result yields
ˇ ˇ
ˇ ˇ
ˇPn;0;˛ .f; x/ 1 ŒfC .x/C˛f .x/ˇ jfC .x/f .x/j p 2.1C˛/
ˇ ˛C1 ˇ
2e.nCr/x.1x/
2C ˛ X p
n
C1 x .gx ; k/:
nx.1x/
kD1
More precisely, we have again considered inequality (10.11), which for ˛ D 0

provided us with a slight refinement of the inequality of Theorem 10.2.
Corollary 10.1 ([115]). Let f W Œ0; 1 ! R be such that D r1 f 2 C Œ0; 1 and
.r/
D r f˙ .x/ exists everywhere and is bounded on Œ0; 1. Then, for x 2 .0; 1/, r; s 2
N0 , C > 2, and n large enough, we have
ˇ ˇ
ˇ s ˇ
ˇD Pn;r .f; x/ 1 ŒD s fC .x/ C ˛D s f .x/ˇ
ˇ 2 ˇ
10.r C s C 1/
jD s fC .x/ D s f .x/j p
2e.n C r C s/x.1 x/
jD s fC .x/ C ˛D s f .x/j .r C s/2 2C X p

n
C C x .gs;x ; k/;
˛C1 n nx.1 x/
kD1
where the auxiliary function gs;x is defined as

8 s
< D f .t/ D s f .x/; 0 t < x;
gs;x .t/ D 0; t D x;
: s
D f .t/ D s fC .x/; x < t 1:
10.2 General Class of Operators for DBV 325
10.2 General Class of Operators for DBV
In 1967, Durrmeyer [65] introduced an integral modification of the well-known

Bernstein polynomials with the purpose of approximating Lebesgue integrable
functions on Œ0; 1: Later, in 1989, Heilmann [149] considered a general sequence
of Durrmeyer operators defined on Œ0; 1/ for n > c and x 2 Œ0; 1/ as
8 1 Z 1
ˆ
ˆ X
ˆ .n c/
ˆ p .x/ pn;k .t/f .t/dt; r D 0;
< n;k
0
Vn;r .f; x/ D kD0
1 Z 1
ˆ
ˆ X
ˆ .n c/ˇ.n; r; c/ pnCcr;k .x/ pncr;kCr .t/f .t/dt; r > 0;
:̂ 0
kD0
k .k/ Qr1 nCcl

where r; n 2 N0 ; pn;k .x/ D .x/ kŠ n .x/, and ˇ.n; r; c/ D lD0 nc.lC1/ :
The special cases of these operators are as follows:
For c D 0; we get the Szász–Durrmeyer operators when n .x/ D e nx :
For c > 0; we get the Baskakov–Durrmeyer operators when n .x/ D .1 C
cx/n=c : The special case c D 1 and r D 0 was considered in [215]. The family of
operators Vn;r .f; x/ is linear and positive.
The operators Vn;r can also be written in the form of a kernel as
Z 1
Vn;r .f; x/ D Kn;r .x; t/f .t/dt;
0
where the kernel Kr;n is given by

8 1
ˆ
ˆ X
ˆ
ˆ .n c/ pn;k .x/pn;k .t/; r D 0;
<
Kn;r .x; t/ D kD0
1
X
ˆ
ˆ
ˆ .n c/ˇ.n; r; c/ pnCcr;k .x/pncr;kCr .t/; r > 0:
:̂
kD0
In this section, we present the rate of convergence for the operators Vn;r .f; x/ for
functions having derivatives of bounded variation that were studied by Gupta et al.
[144].
In the sequel, the following lemmas are necessary.
Lemma 10.5 ([149]). Let m; r 2 N0 ; n > cr C c; x 2 Œ0; 1/, and suppose
1
X
KO n;r .x; t/ D .n cr c/ pnCcr;k .x/pncr;kCr .t/;
kD0
and then
Z 1
Tn;r;m .x/ D KO n;r .x; t/.t x/m dt;
0
p
With .x/ D x.1 C cx/ and for n > c.r C m C 2/; we have the recurrence
formula
.n c.r C m C 2/Tn;r;mC1 .x/ D 2 .x/ŒTn;r;m

.1/
.x/ C 2mTr;n;m1 .x/
C .r C m C 1/.1 C 2cx/Tr;n;m .x/; m 2 N:
Also,
.r C 1/.1 C 2cx/
Tn;r;0 .x/ D 1; Tn;r;1 .x/ D ;
n c.r C 2/
2x.1 C cx/.n c/ C .r C 1/.r C 2/.1 C 2cx/2
Tn;r;2 .x/ D :
Œn c.r C 2/Œn c.r C 3/
For all r; m 2 N0 and x 2 Œ0; 1/,

Tn;r;m .x/ D O nŒ.mC1/=2 :
Remark 10.3. For n sufficiently large, c 0, and x 2 .0; 1/, it can be seen from
Lemma 10.5 that
2x.1 C cx/ C x.1 C cx/

Tn;r;2 .x/ ;
n n
for any C > 2.
Remark 10.4. If we use the Cauchy–Schwarz inequality, it follows from
Lemma 10.5 that for n sufficiently large, c 0, and x 2 .0; 1/,
Z r
1
C x.1 C cx/
KO n;r .x; t/jt xjdt ŒTn;r;2 .x/ 1=2
;
0 n
for any C > 2.

Lemma 10.6. Let x 2 .0; 1/ and C > 2. Then for n sufficiently large, we have
Z y
C x.1 C cx/
n;r .x; y/ D KO n;r .x; t/dt ; 0 y < x;
0 n.x y/2
Z 1
C x.1 C cx/
1 n;r .x; z/ D KO n;r .x; t/dt ; x < z < 1:
z n.z x/2
The proof of the preceding lemma follows easily by using Remark 10.3.
Lemma 10.7. Suppose f is s-times differentiable on Œ0; 1/ such that f .s1/ .t/ D
O.t ˛ /, for some ˛ > 0 as t ! 1: Then, for any r; s 2 N0 and n > ˛ C cs, we have
D s Vn;r .f; x/ D Vn;rCs .D s f; x/:
Using the identity [see, e.g., (3.5) of [148]] Dpn;k .x/ D nŒpnCc;k1 .x/pnCc;k .x/;
and applying integration by parts, we see that the result follows by mathematical
induction.
Let DB .0; 1/; 0, be the class of absolutely continuous functions f defined
on .0; 1/ satisfying
(i) f .t/ D O.t /; t ! 1.
(ii) We have a derivative f 0 on the interval .0; 1/ coinciding a.e. with a function
that is of bounded variation on every finite subinterval of .0; 1/: It can be
observed that all functions f 2 DB .0; 1/ possess for each c > 0 the
representation
Z x
f .x/ D f .c/ C .t/dt; x c:
c
Theorem 10.3 ([144]). Let f 2 DB .0; 1/, > 0, and x 2 .0; 1/. Then, for
C > 2 and n sufficiently large, we have
ˇ ˇ
ˇ Œn c.r C 1/ ˇ
ˇ ˇ
ˇ .n c/ˇ.n; r; c/ Vn;r .f; x/ f .x/ˇ
0p p 1
C.1 C cx/ @ X _
Œ n xCx=k
x _
xCx= n
..f 0 /x / C p ..f 0 /x /A
n n p
kD1 xx=k xx= n
C.1 C cx/
C .j f .2x/ f .x/ xf 0 .x C / j C j f .x/ j/
nx
r
C x.1 C cx/

C C 2 O.n 2 /C j f 0 .x C / j
n
r
1 C x.1 C cx/
C j f 0 .x C / f 0 .x / j
2 n
1 .r C 1/.1 C 2cx/
C j f 0 .x C / C f 0 .x / j ;
2 Œn c.r C 2/
Wb
8
ˆ
ˆ f .t/ f .x /; 0 t < x;
ˆ
ˆ
ˆ
<
fx .t/ D 0; t D x;
ˆ
ˆ
ˆ
ˆ
:̂
f .t/ f .x C /; x < t < 1:
Proof. Using the mean value theorem, we can write

ˇ ˇ
ˇ Œn c.r C 1/ ˇ
ˇ ˇ
1
X Z 1
Œn c.r C 1/ pnCcr;k .x/ pncr;kCr .t/jf .t/ f .x/jdt
kD0 0
Z 1 Z t
D j KO n;r .x; t/f 0 .u/d ujdt:
0 x
Also, using the identity
f 0 .x C / C f 0 .x / f 0 .x C / f 0 .x /
f 0 .u/ D C .f 0 /x .u/ C sgn.u x/
2 2

f 0 .x C / C f 0 .x /
C f 0 .x/ x .u/;
2
where
8
< 1; u D x;
x .u/ D
:
0; u ¤ x;
we obviously have
Z 1 Z t
f 0 .x C / C f 0 .x /
0
f .x/ x .u/d u KO n;r .x; t/dt D 0:
0 x 2
Thus, using above identities, we can write
ˇ ˇ
ˇ Œn c.r C 1/ ˇ
ˇ ˇ
Z 1 Z t Z x Z t
j 0 O
. .f /x .u/d u/Kn;r .x; t/dt C . .f 0 /x .u/d u/KO n;r .x; t/dt j
x x 0 x
1 1
C j f 0 .x C / f 0 .x / j ŒTn;r;2 .x/1=2 C j f 0 .x C / C f 0 .x / j Tn;r;1 .x/
2 2
1
Dj An;r .f; x/ C Bn;r .f; x/ j C j f 0 .x C / f 0 .x / j ŒTn;r;2 .x/1=2
2
1
C j f 0 .x C / C f 0 .x / j Tn;r;1 .x/: (10.13)
2
Applying Remarks 10.2 and 10.4, in (10.13), we have
ˇ ˇ
ˇ Œn c.r C 1/ ˇ
ˇ ˇ
r
1 C x.1 C cx/
jAn;r .f; x/j C jBn;r .f; x/j C j f 0 .x C / f 0 .x / j
2 n
1 .r C 1/.1 C 2cx/
C j f 0 .x C / C f 0 .x / j : (10.14)
2 Œn c.r C 2/
In order to complete the proof of the theorem, we need to estimate the terms
x/ and Bn;r .f; x/. Applying integration by parts and Lemma 10.6, with y D
An;r .f;p
x x= n, we have
ˇZ Z ˇ
ˇ x t ˇ
j Bn;r .f; x/ j D ˇˇ .f 0 /x .u/d udt . n;r .x; t//ˇˇ
0 x
Z x Z y Z x
0
n;r .x; t/.f /x .t/dt C j .f 0 /x .t/ jj n;r .x; t/ j dt
0 0 y
Z y_
x
C x.1 C cx/ 1
..f 0 /x / dt
n 0 t
.x t/2
Z x_
x
C ..f 0 /x /dt
y t
Z y_
x
C x.1 C cx/ 1
..f 0 /x / dt
n 0 t
.x t/2
x _
x
Cp ..f 0 /x /:
n px
x n
Let u D x
xt . Then we have
Z y_
x Z p
_
x
C x.1 C cx/ 0 1 C x.1 C cx/ n
..f /x / dt D ..f 0 /x /d u
n 0 .x t /
2 n 1
t x xu
p
C .1 C cx/ X _
xŒ n
..f 0 /x /:
n x
kD1 x k
Thus,
p
C.1 C cx/ X _ x _
Œ n x x
j Bn;r .f; x/ j ..f 0 /x / C p ..f 0 /x /: (10.15)
n x n px
kD1 x k x n
On the other hand, we have

ˇ ˇ ˇZ 1 Z t ˇ
ˇ ˇ ˇ ˇ
ˇAn;r .f; x/ˇ D ˇ . .f 0 /x .u/d u/KO n;r .x; t/dt ˇ
x x
ˇZ 1 Z t
ˇ
Dˇ . .f 0 /x .u/d u/KO n;r .x; t/dt
2x x
Z 2x Z t ˇ
ˇ
C . .f 0 /x .u/d u/dt.1 n;r .x; t//ˇdt
x x
ˇZ 1 ˇ ˇ ˇˇ Z 1 ˇ
ˇ O ˇ ˇ 0 C ˇˇ ˇ
ˇ .f .t/f .x//Kn;r .x; t/dt ˇCˇf .x /ˇˇ .tx/KO n;r .x; t/dt ˇ
2x 2x
ˇZ 2x ˇˇ ˇ
ˇ ˇˇ ˇ
Cˇ .f 0 /x .u/d u/ˇˇ.1 n;r .x; 2x/ˇ
x
Z 2x ˇˇ ˇ
ˇˇ ˇ
C j .f 0 /x .t/ˇˇ.1 n;r .x; t/ˇdt
x
ˇ ˇ
Z ˇ ˇ ˇ ˇZ
1 ˇf .x/ ˇ 1
C O ˇ ˇ
Kn;r .x; t/t ˇt x ˇdt C KO n;r .x; t/.t x/2 dt
x 2x x2 2x
ˇ ˇZ 1 ˇ
ˇ ˇ ˇ
C ˇf 0 .x C /ˇ KO n;r .x; t/ˇ.t x/ jdt
2x
C.1 C cx/ ˇˇ ˇ
ˇ
C .ˇf .2x/ f .x/ xf 0 .x C /ˇ
nx
p x xC px
Œ n xC
C.1 C cx/ X _k x _
n
C ..f 0 /x / C p ..f 0 /x /: (10.16)

n n
kD1 x x
Next, applying Hölder’s inequality, we proceed as follows for the estimation of

the first two terms on the right-hand side of (10.16):
Z 1 Z
C j f .x/ j 1 O
KO n;r .x; t/t j t x jdt C Kn;r .x; t/.t x/2 dt
x2x x2 2x
Z 1 Z 1 1
C O 1
O
2
. 2
Kn;r .x; t/t dt/ . 2 Kn;r .x; t/.t x/ dt/
2
x 2x 0
Z
j f .x/ j 1 O
C . Kn;r .x; t/.t x/2 dt/:
x2 2x
R1
In order to estimate the integral 2x KO n;r .x; t/t 2 dt, we proceed as follows:
Z 1 Z 1
KO n;r .x; t/t 2 dt 22 KO n;r .x; t/.t x/2 dt
2x 2x
Z
22 KO n;r .x; t/.t x/2 dt; on choosing 0 < ı x
jt xjı
Z 1
22
KO n;r .x; t/.t x/2m dt m being a positive integer >
ı 2m2 0
22 22
D 2m2
O.nm / D O.n /:
ı ı 2m2
Hence, in view of Lemma 10.5,
Z 1 ˇ ˇ Z
C O ˇ ˇ j f .x/ j 1 O
Kn;r .x; t/t ˇt x ˇdt C Kn;r .x; t/.t x/2 dt
x 2x x2 2x
p
=2 C x.1 C cx/ ˇˇ ˇ C.1 C cx/
ˇ
C 2 O.n

/ p C ˇf .x/ˇ : (10.17)
n nx
By using the Schwarz inequality and Remark 10.3, we estimate the third term on
the right side of (10.16) as follows:
ˇ ˇZ 1 ˇ ˇ ˇ ˇZ 1
ˇ 0 C ˇ O ˇ ˇ ˇ 0 C ˇ
ˇf .x /ˇ Kn;r .x; t/ˇt x ˇdt ˇf .x /ˇ KO n;r .x; t/j t x jdt
2x 0
ˇ ˇZ 1 1 Z 1 1
ˇ ˇ 2 2
ˇf 0 .x C /ˇ. KO n;r .x; t/.t x/2 dt/ . KO n;r .x; t/dt/
0 0
ˇ ˇp
ˇ 0 C ˇ C x.1 C cx/
D ˇf .x /ˇ p : (10.18)
n
By using (10.16)–(10.18), we have

j An;r .f; x/ j
p p
=2 C x.1Ccx/ C.1Ccx/ 0 C C x.1Ccx/
C 2 O.n

/ p Cj f .x/ j C j f .x / j p
n nx n
p x
Œ n xC
C.1 C cx/ C.1 C cx/ X _k
C .j f .2x/ f .x/ xf 0 .x C / j C ..f 0 /x /
nx n x kD1
xC px n
x _
Cp ..f 0 /x /: (10.19)
n x
By collecting the estimates (10.14), (10.15), and (10.19), we get the required result.
This completes the proof of Theorem 10.3.
Remark 10.5. For r D 0 and c D 0; we can easily obtain the result, which was
established by Gupta et al. in 2008 [143]
Furthermore, if we apply Lemma 10.7, we immediately have the following result
for the derivatives of the operators Vn;r .
Theorem 10.4 ([144]). Let f .s/ 2 DB .0; 1/, > 0, and x 2 .0; 1/. Then for
C > 2 and for n sufficiently large, we have
ˇ ˇ
ˇ Œn c.r C s C 1/ s ˇ
ˇ ˇ
ˇ .n c/ˇ.n; r C s; c/ D Vn;r .f; x/ f .x/ˇ
.s/
p p
C.1 C cx/ X _ x _
Œ n xCx=k xCx= n
. ..D sC1 f /x / C p ..D sC1 f /x //
n n p
kD1 xx=k xx= n
C.1 C cx/
C .j D s f .2x/ D s f .x/ xD sC1 f .x C / j C j D s f .x/ j/
nx
r
C x.1 C cx/

C C 2 O.n 2 /C j D sC1 f .x C / j
n
r
1 C x.1 C cx/
C j D sC1 f .x C / D sC1 f .x / j
2 n
1 .r C s C 1/.1 C 2cx/
C j D sC1 f .x C / C D sC1 f .x / j ;
2 Œn c.r C s C 2/
Wb
10.3 Baskakov–Beta Operators for DBV 333
8
ˆ
ˆ D sC1 f .t/ D sC1 f .x /; 0 t < x;
ˆ
ˆ
ˆ
<
D sC1 fx .t/ D 0; t D x;
ˆ
ˆ
ˆ
ˆ
:̂ sC1
D f .t/ D sC1 f .x C /; x < t < 1:
10.3 Baskakov–Beta Operators for DBV
We [134] studied the Baskakov–Beta operators in generalized form as
1 Z1
.n C r 1/Š .n r 1/Š X
Vn;r .f; x/ D pnCr;k .x/ bnr;kCr .t/f .t/dt;
..n 1/Š/2 kD0 0
(10.20)
where n 2 N; r 2 N 0 ; n > r, and the Baskakov and Beta basis functions are
respectively defined as

nCk1 xk 1 tk
pn;k .x/ D ; b n;k .t/ D ;
k .1 C x/nCk B.k C 1; n/ .1 C t/nCkC1
and B.m; n/ D .m1/Š.n1/Š

.nCm1/Š :
The class of absolutely continuous functions f defined on .0; 1/ is defined by
Bq .0; 1/; q > 0, and satisfies
.i / jf .t/j C1 t q ; C1 > 0;
.i i / having a derivative f 0 on the interval .0; 1/ that coincides a.e. with a function
that is of bounded variation on every finite subinterval of .0; 1/. It can be
observed that all functions f 2 Bq .0; 1/ possess for each C > 0 the
representation
Z x
c
Theorem 10.5 ([134]). Let f 2 Bq .0; 1/,q > 0, and x 2 .0; 1/. Then for C > 2
and n sufficiently large, we have
ˇ ˇ
ˇ ..n 1/Š/2 ˇ
ˇ ˇ
ˇ Vn;r .f; x/ f .x/ˇ
ˇ .n C r 1/Š.n r 1/Š ˇ
p p
C.1 C x/ X _ x _
Œ n xCx=k xCx= n
..f 0 /x / C p ..f 0 /x /
nr 2 n p
kD1 xx=k xx= n
C.1 C x/ ˇˇ ˇ
0 ˇ
C ˇf .2x/ f .x/ xf .x C /ˇ C jf .x/j C O.nq /
.n r 2/x
r
0 C C.1 C x/ 1 C x.1 C x/ ˇˇ 0 C ˇ
ˇ
C jf .x /j C ˇf x f 0 .x / ˇ
nr 2 2 nr 2
1 ˇˇ 0 C ˇ .1 C r/ C x.1 C 2r/
ˇ
C ˇf x C f 0 .x / ˇ ;
2 nr 1
W
where ba f .x/ denotes the total variation of fx on Œa; b; and the auxiliary function
fx is defined by Theorem 10.3.
Corollary 10.2 ([134]). Let f .s/ 2 DBq .0; 1/, q > 0, and x 2 .0; 1/. Then, for
C > 2 and for n sufficiently large, we have
ˇ ˇ
ˇ ..n 1/Š/2 ˇ
ˇ ˇ
ˇ D Vn;r .f; x/ f .x/ˇ
s .s/
ˇ .n C r 1/Š.n r 1/Š ˇ
p p
C .1 C x/ X _ x _
Œ n xCx=k xCx= n
..D sC1 f /x / C p ..D sC1 f /x /
nr 2 n p
kD1 xx=k xx= n
C .1Cx/
C .j D s f .2x/D s f .x/xD sC1 f .x C / j C j D s f .x/ j/CO.nq /
x .nr2/
r
C.1Cx/ C 1 C x .1Cx/
C j D f .x / j C
sC1
j D sC1 f .x C /D sC1 f .x / j
nr2 2 n
1 .1 C r/ C x.1 C 2r/
C j D sC1 f .x C / C D sC1 f .x / j ;
2 nr 1
W
where ba f .x/ denotes the total variation of fx on Œa; b; and fx is defined by
Theorem 10.4.
10.4 Szász–Mirakian–Stancu–Durrmeyer Operators
Let ˛ and ˇ be two nonnegative parameters satisfying the condition 0 ˛ ˇ. For

any nonnegative integer n,
f 2 C Œ0; 1/ ! Sn.˛;ˇ/ f;
10.4 Szász–Mirakian–Stancu–Durrmeyer Operators 335
the Stancu-type Szász–Mirakian–Durrmeyer operators recently introduced in [147]

are defined by
1
X Z 1
nt C ˛
.˛;ˇ/
Sn;r .f; x/ D n sn;k .x/ sn;kCr .t/f dt; (10.21)
0 nCˇ
kD0
where
.nx/k
sn;k .x/ D e nx :
kŠ
For ˛ D ˇ D r D 0, these operators become the well-known Szász –Mirakian–

.0;0/
Durrmeyer operators Sn .f; x/ D Sn .f; x/ introduced by Mazhar and Totik
[191]. We need the following basic results to obtain the rate of convergence:
Lemma 10.8 ([147]). For r; m 2 N [ f0g ; 0 ˛ ˇ, let us consider
1
X Z 1 m
nt C ˛
n;m;r .x/ D Sn;r ..t x/ ; x/ D n
.˛;ˇ/ x
.˛;ˇ/ m
sn;k .x/ sn;kCr .t/ dt:
0 nCˇ
kD0
We get
.˛;ˇ/ .˛;ˇ/ ˛ C r C 1 ˇx
n;0;r .x/ D 1; n;1;r .x/ D ;
nCˇ
.˛;ˇ/ ˇ 2 x 2 C 2.n ˛ˇ ˇ ˇr/x C .˛ C r C 1/.˛ C r C 2/ ˛
n;2;r .x/ D ;
.n C ˇ/2
and
.˛;ˇ/ 0
.n C ˇ/n;mC1;r .x/ D xŒ.˛;ˇ/
n;m;r .x/ C .m C ˛ C r C 1 ˇx/n;m;r .x/
.˛;ˇ/

2.n C ˇ/x ˛ .˛;ˇ/
Cm n;m1;r .x/:
nCˇ
Remark 10.6 ([147]). From Lemma 10.8, for n ˇ 2 C .˛ C r/2 C 3r C 2˛ C 2

and any x 2 .0; 1/; we have
.˛;ˇ/ .x C 1/2
n;2;r .x/ :
nCˇ
Remark 10.7 ([147]). Applying the Cauchy–Schwarz inequality and Remark 10.6,
for n ˇ 2 C .˛ C r/2 C 3r C 2˛ C 2; we have
h i 12 xC1
.˛;ˇ/
.˛;ˇ/
Sn;r .jt xj; x/ n;2;r .x/ p :
nCˇ
Lemma 10.9 ([147]). Suppose that x 2 .0; 1/. Then for n r 2 C 3r C 2, we have
1
X Z y
.x C 1/2
n;r .x; y/ D n sn;k .x/ sn;kCr .t/dt ; 0 y < x;
0 n.x y/2
kD0
1
X Z 1
.x C 1/2
1 n;r .x; z/ D n sn;k .x/ sn;kCr .t/dt ; x < z < 1:
z n.z x/2
kD0
Proof. The proof follows directly from Remark 10.6 in the case ˛ D ˇ D 0. As for
the first inequality, we have
1
X Z y
n;r .x; y/ D n sn;k .x/ sn;kCr .t/dt
kD0 0
.0;0/
Sn;r .t x/2 ; x .x C 1/2
D :
.y x/ 2 n.x y/2
We can prove the second inequality similarly.

Lemma 10.10 ([147]). Let us consider that f is s-times differentiable on Œ0; 1/
such that f .s1/ .t/ D O.t q /; as t ! 1, where q is a positive integer. Then, for any
r; s 2 N 0 and n > maxfq; r C s C 1g; we have
s
n .˛;ˇ/ d
D s .˛;ˇ/
Sn;r .f; x/ D Sn;rCs .D s f; x/; D :
nCˇ dx
Proof. First, by simple computation, we have
D Œsn;k .x/ D n Œsn;k1 .x/ sn;k .x/ : (10.22)
The identity (10.22) is true even for the case k D 0, as we observe for r <
0; sn;r .x/ D 0: We shall prove the result by using a principle of mathematical
induction. Using (10.22), we have
1
X Z1
.˛;ˇ/ nt C ˛
D Sn;r .f; x/ D n Dsn;k .x/ sn;kCr .t/f dt
nCˇ
kD0 0
1
X Z1
nt C ˛
Dn n Œsn;k1 .x/ sn;k .x/ sn;kCr .t/f dt
nCˇ
kD0 0
1
X Z 1
nt C ˛
D n2 sn;k .x/ Œsn;kCrC1 .t/ sn;kCr .t/ f dt:
0 nCˇ
kD0
Using (10.22) and integrating by parts, we have

1
X Z 1
D Œsn;kCrC1 .t/ nt C ˛
.˛;ˇ/
DSn;r .f; x/ Dn 2
sn;k .x/ f dt
0 n nCˇ
kD0
1 Z 1
n2 X .1/ nt C ˛
D sn;k .x/ sn;kCrC1 .t/f dt
nCˇ 0 nCˇ
kD0
n .˛;ˇ/
D S .Df; x/ ;
n C ˇ n;rC1
which means that the identity is satisfied for s D 1: Let us suppose that the result
holds for s D l; that is,
l
n .˛;ˇ/
D l .˛;ˇ/
Sn;r .f; x/ D Sn;rCl D l f; x
nCˇ
l X1 Z 1
n nt C ˛
Dn sn;k .x/ sn;kCrCl .t/D l f dt:
nCˇ 0 nCˇ
kD0
Now,
l X
1 Z 1
n nt C ˛
D lC1 Sn;r
.˛;ˇ/
.f; x/ D n Dsn;k .x/ sn;kCrCl .t/D l f dt
nCˇ 0 nCˇ
kD0
l X
1
n
Dn n Œsn;kCrCl1 .x/ sn;kCrCl .x/
nCˇ
kD0
Z 1
nt C ˛
sn;kCrCl .t/D l f dt
0 nCˇ
l X
1
n
Dn 2
sn;k .x/
nCˇ
kD0
Z 1
nt C ˛
Œsn;kCrClC1 .t/ sn;kCrCl .t/ D l f dt
0 nCˇ
l X
1
n
Dn 2
sn;k .x/
nCˇ
kD0
Z 1
D Œsn;kCrClC1 .t/ l nt C ˛
Df dt:
0 n nCˇ
Integrating by parts the last integral, we get

lC1 X
1 Z 1
.˛;ˇ/ n ntC˛
D lC1 Sn;r .f; x/Dn sn;k .x/ sn;kCrClC1 .t/D lC1 f dt:
nCˇ 0 nCˇ
kD0
Therefore,
lC1
n .˛;ˇ/
D lC1 .˛;ˇ/
Sn;r .f; x/ D Sn;rClC1 D lC1 f .x/ :
nCˇ
Thus, the result is true for s D l C 1, and hence, by mathematical induction, the
proof of the lemma is complete.
The class of absolutely continuous functions f defined on .0; 1/ is defined by
Bq .0; 1/; q > 0, and satisfies
.i / jf .t/j C1 t q ; C1 > 0;
.i i / having a derivative f 0 on the interval .0; 1/ that coincides a.e. with a function
that is of bounded variation on every finite subinterval of .0; 1/. It can be
observed that for all functions f 2 Bq .0; 1/ possess for each C > 0 the
representation
Z x
c
Theorem 10.6 ([147]). Let f 2 Bq .0; 1/, q > 0, and x 2 .0; 1/. Then for n
sufficiently large, we have
p p
ˇ .˛;ˇ/ ˇ .x C 1/2 ŒX _
n xCx=k
x _
xCx= n
ˇS .f; x/ f .x/ ˇ ..f 0
/ x / C p ..f 0 /x /
n;r
nx n p
kD1 xx=k xx= n
.1 C 1=x/ 2
0
C .j f .2x/ f .x/ xf .x C / j
n
.x C 1/2
C jf .x/j/ C O.nq / C jf 0 .x C /j
n
1 xC1
C p j f 0 x C f 0 .x / j
2 nCˇ
˛ C r C 1 ˇx
C j f 0 x C C f 0 .x / j;
2.n C ˇ/
W
where ba f .x/ denotes the total variation of fx on Œa; b; and the auxiliary function
fx is defined by
8
ˆ
ˆ f .t/ f .x /; 0 t < x;
ˆ
ˆ
ˆ
<
fx .t/ D 0; t D x;
ˆ
ˆ
ˆ
ˆ
:̂
f .t/ f .x C /; x < t < 1:
Proof. We’ll use the identity

0 0
f 0 x C C f .x / f 0 x C f .x /
f 0 .u/ D .f 0 /x .u/ C C sg n.u x/
2 2
" 0
#
f 0 x C C f .x /
C f 0 .x/ x .u/; (10.23)
2
where

1; u D x;
x .u/ D
0; u ¤ x:
On applying the mean value theorem, we get

Z t
0
.˛;ˇ/
Sn;r .f; x/ f .x/ D .˛;ˇ/
Sn;r f .u/d u; x : (10.24)
x
˛;ˇ
Now,
R by using above identity (10.23) in (10.24) and the fact that Sn;r
t
x x .u/d u; x D 0, after simple computation, we have
ˇZ Z X
ˇ ˛;ˇ ˇ ˇ 1 t 1
ˇS .f; x/ f .x/ˇ ˇˇ .f 0
/ x .u/d u n sn;k .x/sn;kCr .t/dt
n;r
ˇ x x kD0
ˇ
Z tx Z X 1 ˇ
0 ˇ
C .f /x .u/d u n sn;k .x/sn;kCr .t/dt ˇ
0 x ˇ
kD0
ˇ ˇ
ˇ 0 C 0 ˇ
ˇf x C f .x /ˇ .˛;ˇ/
C n;1;r .x/
2
ˇ ˇ
ˇ 0 C 0 ˇ
ˇf x f .x /ˇ
.˛;ˇ/
C Œn;2;r .x/1=2
2
ˇ ˇ
ˇ 0 C 0 ˇ
ˇf x C f .x /ˇ .˛;ˇ/
Dj An;r .f; x/ C Bn;r .f; x/ j C n;1;r .x/:
2
ˇ ˇ
ˇ 0 C 0 ˇ
ˇf x f .x /ˇ .˛;ˇ/
C Œn;2;r .x/1=2 : (10.25)
2
Applying Remarks 10.6 and 10.7 in (10.25), we have
ˇ ˛;ˇ ˇ
ˇS .f; x/ f .x/ˇ jAn;r .f; x/j C jBn;r .f; x/j
n;r
ˇ ˇ
ˇ 0 C 0 ˇ
ˇf x f .x /ˇ x C 1
C p
2 nCˇ
ˇ ˇ
ˇ 0 C 0 ˇ
ˇf x C f .x /ˇ ˛ C r C 1 ˇx
C : (10.26)
2 .n C ˇ/
Estimating the terms An;r .f; x/ and Bn;r .f; x/ will lead to proof of the theorem.
First,
ˇZ Z X ˇ
ˇ 1 t 1 ˇ
ˇ 0 ˇ
j An;r .f; x/ j D ˇ .f /x .u/d u n sn;k .x/sn;kCr .t/dt ˇ
ˇ x x ˇ
kD0
ˇZ
ˇ 1 Z t 1
X
ˇ
Dˇ . .f 0 /x .u/d u/n sn;k .x/sn;kCr .t/dt
ˇ 2x x
kD0
Z Z ˇ
2x t ˇ
C . .f /x .u/d u/dt .1 n;r .x; t//ˇˇ
0
x x
ˇ 1 Z 1 ˇ
ˇ X ˇ
ˇ ˇ
ˇn sn;k .x/ .f .t/ f .x//sn;kCr .t/dt ˇ
ˇ 2x ˇ
kD0
ˇ 1 Z 1 ˇ
ˇ 0 C ˇ ˇˇ X ˇ
ˇ
C ˇf x ˇ ˇn sn;k .x/ sn;kCr .t/.t x/dt ˇ
ˇ 2x ˇ
kD0
ˇZ 2x ˇ
ˇ ˇ
Cˇˇ .f /x .u/d uˇˇ j 1 n;r .x; 2x/ j
0
x
Z 2x
C j .f 0 /x .t/ j j 1 n;r .x; t/ j dt:
x
Applying Remark 10.6, with ˛ D ˇ D 0, we have

1
X Z 1
j An;r .f; x/ j n sn;k .x/ sn;kCr .t/C1 t 2q dt
kD0 2x
1 Z
j f .x/ j X 1
C n sn;k .x/ sn;kCr .t/.t x/2 dt
x2 2x
kD0
Z 1
X
1
C j f 0 xC j n sn;k .x/sn;kCr .t/ j t x jdt
2x kD0
.1 C 1=x/2
C j f .2x/ f .x/ xf 0 .x C / j
n
p x xC px
Œ n xC
.x C 1/2 X _k x _
n
C ..f 0 /x / C p ..f 0 /x /: (10.27)

nx n
kD1 x x
1
X Z 1
To estimate the integral n sn;k .x/ sn;kCr .t/C1 t 2q dt in (10.27), we proceed
kD0 2x
as follows:
Obviously, t 2x implies that t 2.t x/, and it follows from Lemma 10.8
that
1
X Z 1 1
X Z 1
n sn;k .x/ sn;kCr .t/t 2q dt 22q sn;k .x/ sn;kCr .t/.tx/2q dt
kD0 2x kD0 0
n;2q;r .x/DO.nq /.n

2q .˛;ˇ/
D2 ! 1/:
Applying the Schwarz inequality and Remark 10.1 (˛ D ˇ D 0), we can estimate
the third term on the right-hand side of (10.27) as follows:
1
X Z 1

j f 0 xC j n sn;k .x/ sn;kCr .t/j t x jdt
kD0 2x
1 Z 1
jf 0 x C j X .x C 1/2
n sn;k .x/ sn;kCr .t/.t x/2 dt D jf 0 x C j :
x 0 nx
kD0
Thus, by Lemma 10.8 and Remark 10.6 (˛ D ˇ D 0), we have
.x C 1/2
j An;r .f; x/ j O.nq /C j f 0 x C j :
nx
.1 C 1=x/2
C .j f .2x/ f .x/ xf 0 .x C / j Cjf .x/j/
n
p x xC px
Œ n xC
.x C 1/2 X _k x _
n
C ..f 0 /x / C p ..f 0 /x /: (10.28)

nx n
kD1 x x
On applying Lemma 10.9 with y D x px ,

n
and integrating by parts, we have
ˇZ x Z t ˇ
ˇ ˇ
ˇ
j Bn;r .f; x/ j D ˇ .f /x .u/d udt . n;r .x; t//ˇˇ
0
0 x
Z x Z y Z x
D n;r .x; t/.f 0 /x .t/dt C j .f 0 /x .t/ jj n;r .x; t/ j dt
0 0 y
2Z y _
x Z x_
x
.x C 1/ 0 1
..f /x / dt C ..f 0 /x /dt
n 0 t
.x t/2 y t
2Z y _
x _
x x
.x C 1/ 1
..f 0 /x / dt C p ..f 0 /x /:
n 0 t
.x t/2 n px
x n
Let u D x
xt
. Then we have
Z y_
x Z p
_
x
.x C 1/2 0 1 .x C 1/2 n
..f /x / dt D ..f 0 /x /d u
n 0 .x t/2 n 1
t x xu
p
.x C 1/2 X _
Œ n x
..f 0 /x /:
nx x
kD1 x k
Thus,
p
.x C 1/2 X _ x _
Œ n x x
0
j Bn;r .f; x/ j ..f /x / C p ..f 0 /x /: (10.29)
nx x n px
kD1 x k x n
The required result is obtained on combining (10.26), (10.28), and (10.29).

As a consequence of Lemma 10.10, we have the following corollary:
Corollary 10.3 ([147]). Let f .s/ 2 DBq .0; 1/, q > 0, and x 2 .0; 1/. Then, for
n sufficiently large, we have
p
ˇ s .˛;ˇ/ ˇ .x C 1/2 ŒX _
n xCx=k
ˇD S .f; x/ f .s/
.x/ ˇ ..D sC1 f /x /
n;r
nx
kD1 xx=k
p
x _
xCx= n
Cp ..D sC1 f /x /
n p
xx= n
.1C1=x/2
C .j D s f .2x/D s f .x/xD sC1 f .x C / j
n
C j D s f .x/ j/ C O.nq /
.x C 1/2
C j D sC1 f .x C / j
nx
1 xC1
C p j D sC1 f .x C / D sC1 f .x / j
2 nCˇ
1 ˛Cr C 1 ˇx
C j D sC1 f .x C /CD sC1 f .x / j ;
2 nCˇ
Wb
8
ˆ
ˆ D sC1 f .t/ D sC1 f .x /; 0 t < x;
ˆ
ˆ
ˆ
<
D fx .t/ D 0;
sC1
t D x;
ˆ
ˆ
ˆ
ˆ
:̂ sC1
D f .t/ D sC1 f .x C /; x < t < 1:
If we consider the class LŒ0; 1/ of all measurable functions defined on Œ0; 1/

such that

Z 1
LŒ0; 1/ WD f W e nt f .t/dt < 1 for some positive integer n ;
0
we can observe that this class is bigger than the class of all integrable functions on
Œ0; 1/.
Further, we consider
˚
L˛ Œ0; 1/ WD f 2 LŒ0; 1/ W f .t/ D O.e ˛t /; t ! 1; ˛ > 0 :
We have the following asymptotic formula by using Lemma 10.8.

Theorem 10.7 ([147]). Let f 2 L˛ Œ0; 1/, and suppose it is bounded on every
finite subinterval of Œ0; 1/ having a derivative of order r C 2 at a point x 2 .0; 1/.
Then we have
/ .f; x/ f .r/ .x/ D .˛ C r C 1 ˇx/f .rC1/ .x/ C xf .rC2/ .x/:

.˛;ˇ/ .r/
lim nŒ.Sn;r
n!1
Chapter 11
Future Scope and Open Problems
In 1983, based on two parameters ˛; ˇ satisfying the conditions 0 ˛ ˇ, Stancu

[222] proposed a generalization of the classical Bernstein polynomials. In more
recent papers, some approximation properties of the Stancu-type generalization on
different operators were discussed (see, e.g., [50, 133, 187, 238]). Future studies
could address defining the Stancu-type generalization of other operators and the
convergence behavior, asymptotic formulas, and rate of convergence for functions
of BV and for functions having derivatives of BV.
Lenze [175] studied the multivariate functions of bounded variation. In future
studies, one can find the results on the rate of convergence for BV functions for
multivariate operators. To the best of our knowledge, this problem has not been
done to date, and there may be a future scope in this direction.
It has been observed that Bernstein polynomials reproduce constant as well as
linear functions. To make the convergence faster, King [172] modified the well-
known Bernstein polynomials to preserve the test functions e0 and e2 , where
ei D t i . Gupta and Duman [111] modified the Bernstein–Durrmeyer polynomials,
to preserve the test functions e0 and e1 . In [111], the authors achieved a better
approximation on some compact interval. Thus, one can study in this direction for
analogous results presented in Gupta and Duman [111], that is, direct, inverse results
in ordinary and simultaneous approximation and in the rate of approximation for
functions of BV and DBV.
Also, in order to study the overconvergence phenomenon by considering the
operators in a complex domain, one can extend the studies for the other mixed
summation–integral-type operators, as mentioned in Chap. 2. As of this publication,
no result has been available for MKZ operators and mixed summation–integral-type
operators. For MKZ operators, there is a recurrence formula available for moments,
which is required in analysis; one can find some other techniques to overcome this
difficulty.
The approximation properties of Durrmeyer-type mixed operators have been
found to hold well for direct, inverse, and saturation results in ordinary and
simultaneous approximation. We can even easily define their q analog and Bézier
variants. But the rate of convergence on functions of bounded variation for such

346 11 Future Scope and Open Problems
mixed operators have difficulties in analysis. For example, if we consider the

Baskakov–Szász operators (see [117]), which for x 2 Œ0; 1/ are defined by
1
X Z 1
BSn .f; x/ D n bn;k .x/ sn;k .t/f .t/dt; (11.1)
kD0 0
where
1
X
nx .nx/
k
nCk1 xk
sn;k .x/ D e ; bn;k .x/ D ;
kŠ k .1 C x/nCk
kD0
the main problem is in obtaining the value of sign˛ .t x/ as it is needed in analysis

to relate summation and integration basis functions. If they are of the same type,
then one can relate the integral with the summation of the basis function.R1 As for
Szász–Durrmeyer operators in Theorem 7.10, we use the equality n x sn;k .t/dt D
Pk
j D0 sn;j .x/. Also, for Baskakov–Durrmeyer operators, in the proof of Theo-
R1 Pk
rem 7.12, we need the equality .n 1/ x bn;k .t/dt D j D0 bn1;j .x/. Even
for Baskakov–Beta
R1 operators
Pk (8.51), whose bases are of a similar type, we have the
relation x vn;k .t/dt D b
j D0 n;j .x/. But for the mixed operators of the form
(11.1), it is not possible to have an equality that relates different basis functions. We
raised this problem in earlier papers, but to date, this has not been resolved. Thus,
one can consider as an open problem the rate of convergence for bounded variation
functions for the mixed operators, such as Szász–Baskakov, Szász–Beta, and Beta–
Szász . We have observed that there may not be any problem in obtaining the results
on the rate of convergence for functions having derivatives of bounded variation on
mixed operators.
In 1972, Jain [161] introduced the following operators:
1
X .ˇ/
Jnˇ .f; x/ D hn;k .x/f .k=n/; (11.2)
kD0
where 0 ˇ < 1, and the basis function is defined as

hn;k .x/ D e :
kŠ
P
Jain observed [161] that 1
.ˇ/
kD0 hn;k .x/ D 1: As a special case when ˇ D 0, the
operators (11.2) reduce to the well-known Szász–Mirakyan operators.
Also, Lupas [186] introduced the operator Ln .f; x/ for f 2 Œ0; 1/ ! R as
1
X
k
Ln .f; x/ D ln;k .x/f ; (11.3)
n
kD0
11 Future Scope and Open Problems 347
where
!
nx nx C k 1 k
ln;k .x/ D 2 2 :
k
In order to approximate the integral functions, Agratini [16] introduced the

Kantorovich and Durrmeyer variant of Lupas operators defined by (11.3).
These operators have interesting approximation properties; to date we have not
found much on such operators, so one can study the convergence properties of these
operators in local and global settings. Also, integral modifications of Kantorovich
and Durrmeyer types can be defined, and some results for functions of bounded
variation for the operators (11.2) and (11.3) may be one of the open problems for
the readers.
Another problem is to study the rate of convergence for the q operators on
functions of bounded variation. In fact, in q-calculus, continuity is required; no
result is available for point of discontinuity. Thus, it is difficult to study analogous
results of the book for q operators. Many q operators are available in the literature;
their inverse theorems can be discussed in future studies.
References
1. U. Abel, The complete asymptotic expansion for the Meyer–König and Zeller operators.
J. Math. Anal. Appl. 208, 109–119 (1997)
2. U. Abel, Asymptotic approximation with Kantorovich polynomials. Approx. Theory Appl.
14(3), 106–116 (1998)
3. U. Abel, Asymptotic approximation by Bernstein–Durrrmeyer operators and their derivatives.
Approx. Theory Appl. 16(2), 1–12 (2000)
4. U. Abel, V. Gupta, An estimate of the rate of convergence of a Bézier variant of the Baskakov–
Kantorovich operators for bounded variation functions. Demonstr. Math. 36(1), 123–136
(2003)
5. U. Abel, V. Gupta, Rate of convergence of Stancu Beta operators for functions of bounded
variation. Rev. Anal. Numér. Théor. Approx. 33(1), 3–9 (2004)
6. U. Abel, M. Ivan, On a generalization of an approximation operator defined by A. Lupaş.
Gen. Math. 15(1), 21–34 (2007)
7. U. Abel, V. Gupta, M. Ivan, On the rate of convergence of a Durrmeyer variant of the Meyer–
König and Zeller operators. Arch. Inequal. Appl. 1, 1–10 (2003)
8. U. Abel, V. Gupta, M. Ivan, The complete asymptotic expansion for Baskakov–Szász–
Durrmeyer operators. Ann. Tiberiu Popoviciu Semin. Funct. Equat. Approx. Convex. 1, 3–15
(2003)
9. U. Abel, V. Gupta, M. Ivan, The complete asymptotic expansion for a general Durrmeyer
variant of the Meyer–König and Zeller operators. Math. Comput. Model. 40, 807–875 (2004)
10. U. Abel, V. Gupta, M. Ivan, Asymptotic approximation of functions and their derivatives by
generalized Baskakov–Szász–Durrmeyer operators. Anal. Theory Appl. 21(1), 15–26 (2005)
11. U. Abel, V. Gupta, R.N. Mohapatra, Local approximation by beta operators. Nonlinear Anal.
Theory Methods Appl. Ser. A: Theory Methods 62(1), 41–52 (2005)
12. U. Abel, M. Ivan, X.M. Zeng, Asymptotic expansion for Szász–Mirakyan operators. AIP
Conf. Proc. 936, 779–782 (2007)
13. U. Abel, V. Gupta, R.N. Mohapatra, Local approximation by a variant of Bernstein–
Durrmeyer operators. Nonlinear Anal. Theory Methods Appl. Ser. A: Theory Methods 68(11),
3372–3381 (2008)
14. T. Acar, A. Aral, V. Gupta, On approximation properties of a new type Bernstein–Durrmeyer
operators. Math. Slovaca (to appear)
15. R.P. Agarwal, V. Gupta, On q-analogue of a complex summation-integral type operators in
compact disks. J. Inequal. Appl. 2012, 1–13 (2012). Article 111
16. O. Agratini, On a sequence of linear and positive operators. Facta Univ. Ser. Math. Inform.
14, 41–48 (1999)
17. O. Agratini, An approximation process of Kantorovich type. Math. Notes Miskolc 2(1), 3–10
(2001)

DOI 10.1007/978-3-319-02765-4, © Springer International Publishing Switzerland 2014
350 References
18. O. Agratini, B.D. Vecchia, Mastroianni operators revisited. Facta Univ. Ser. Math. Inform.
19, 53–63 (2004)
19. P.N. Agrawal, Simultaneous approximation by Micchelli combination of Bernstein polyno-
mials. Demonstr. Math. XXV(3), 513–523 (1992)
20. P.N. Agrawal, V. Gupta, Lp -approximation by iterative combination of Phillips operators.
Publ. Inst. Math. Nouv. Sér. 52, 101–109 (1992)
21. P.N. Agrawal, V. Gupta, On convergence of derivatives of Phillips operators. Demonstr. Math.
27, 501–510 (1994)
22. P.N. Agrawal, H.S. Kasana, On the iterative combinations of Bernstein polynomials. Demon-
str. Math. XVII(3), 777–783 (1984)
23. P.N. Agrawal, H.S. Kasana, On simultaneous approximation by modified Bernstein polyno-
mials. Boll. Unione Mat. Ital. VI. Ser. A 6(3-A), 267–273 (1984)
24. P.N. Agrawal, A.J. Mohammad, On Lp approximation by a linear combination of a new
sequence of linear positive operators. Turk. J. Math. 27, 389–405 (2003)
25. P.N. Agrawal, G. Prasad, Degree of approximation to integrable functions by Kantoorovic
polynomials. Boll. Unione Mat. Ital. VI. Ser. A 6(4-A), 323–326 (1985)
26. P.N. Agrawal, K.J. Thamar, Approximation of unbounded function by a new sequence of
linear positive operators. J. Math. Anal. Appl. 225, 660–672 (1998)
27. P.N. Agrawal, V. Gupta, A. Sahai, On convergence of derivatives of linear combinations of
modified Lupas operators. Publ. Inst. Math. Nouv. Sér. 45(59), 147–154 (1989)
28. G.A. Anastassiou, S.G. Gal, Approximation by complex Bernstein–Durrmeyer polynomials
in compact disks. Mediterr. J. Math. 7(4), 471–482 (2010)
29. G. Aniol, P. Pych-Taberska, Appproximation properties of the Gamma and Beta operators.
Fasc. Math. 22, 43–51 (1991)
30. G. Aniol, P. Pych-Taberska, On the rate of pointwise convergence of the Durrmeyer type
operators. Approx. Theory Appl. 11(2), 94–102 (1995)
31. A. Aral, V. Gupta, R.P. Agrawal, Applications of q Calculus in Operator Theory, xii (Springer,
New York, 2013), p. 262. ISBN:978-1-4614-6945-2/hbk; 978-1-4614-6946-9/ebook
32. G.D. Bai, Y.H. Hua, S.Y. Shaw, Rate of approximation for functions with derivatives of
bounded variation. Anal. Math. 28(3), 171–196 (2002)
33. K. Balazs, J. Szabodos, Approximation by Bernstein type rational functions II. Acta Math.
Hung. 40(3–4), 331–337 (1982)
34. V.A. Baskakov, Primer posledovatel’nosti lineinyh polozitel’nyh operatorov v prostranstve
neprerivnyh funkeil (An example of a sequence of linear positive operators in the space of
continuous functons). Dokl. Akad. Nauk SSSR 113, 249–251 (1957)
35. G. Bastien, M. Rogalski, Convexité, complete monotonie et inégalités sur les fonctions zéta
et gamma, sur les fonctions des opérateurs de Baskakov et sur des fonctions arithmétiques.
Can. J. Math. 54, 919–944 (2002)
36. M. Becker, Global approximation theoorems for Szász–Mirakjan and Baskakov operators in
polynomial weight spaces. Indiana Univ. Math. J. 27, 127–142 (1978)
37. S. Bernstein, Demonstration du theoreme de Weierstrass, fonde sur le probabilities. Commun.
Soc. Math. Kharkow 13, 1–2 (1912–13)
38. S. Bernstein, Complement a l’ article de E. Voronovskaya “Determination de la forme
asymptotique de l’approximation des fonctions par les polynomes de M. Bernstein”. C. R.
Acad. Sci. URSS 1932, 86–92 (1932)
39. P. Bézier, Numerical Control-Mathematics and Applications (Wiley, London, 1972)
40. L. Bingzheng, Direct and converse results for linear combinations of Baskakov–Durrmeyer
operators. Approx. Theory Appl. 9(3), 61–72 (1993)
41. G. Bleimann, P.L. Butzer, L. Hann, A Bernstein-type operator approximating continuous
functions on the semi-axis. Indag. Math. 42, 255–262 (1980)
42. H. Bohman, On approximation of continuous and analytic functions. Ark. Math. 2, 43–57
(1952)
43. R. Bojanic, An estimate of the rate of convergence for Fourier series of functions of bounded
variation. Publ. Inst. Math. Nouv. Sér. 26(40), 57–60 (1979)
References 351
44. R. Bojanic, F. Cheng, Estimates for the rate of approximation of functions of bounded
variation by Hermite-Fejér polynomials [Second Edmonton Conference on Approximation
Theory (1982)]. Can. Math. Soc. Conf. Proc. 3, 5–17 (1983)
45. R. Bojanic, F. Cheng, Rate of convergence of Bernstein polynomials of functions with
derivative of bounded variation. J. Math. Anal. Appl. 141, 136–151 (1989)
46. R. Bojanic, O. Shisha, Degree of L1 approximaton to integrable functions by modified
Bernstein polynomials. J. Approx. Theory 13, 66–72 (1975)
47. R. Bojanic, M. Vuilleumier, On the rate of convergence of Fourier–Legendre series of
functions of bounded variation. J. Approx. Theory 31, 67–79 (1981)
48. P.L. Butzer, Linear combinations of Bernstein polynomials. Can. J. Math. 5, 559–567 (1953)
49. P.L. Butzer, R.J. Nessel, Fourier Analysis and Approximation, vol. 1 (Academic, New York,
1971)
50. I. Büyükyazici, C. Atakut, On Stancu type generalization of q-Baskakov operators. Math.
Comput. Model. 52(5–6), 752–759 (2010)
51. G. Chang, Generalized Bernstein–Bézier polynomials. J. Comput. Math. 4(1), 322–327
(1983)
52. Z.A. Chanturiya, Modulus of variation of function and its application in the theory of Fourier
series. Dokl. Akad. Nauk SSSR 214, 63–66 (1974) (in Russian)
53. W. Chen, On the integral type Meyer–König and Zeller operators. Approx. Theory Appl.
2, 7–18 (1986)
54. F. Cheng, On the rate of convergece of Bernstein polynomials of functions of bounded
variation. J. Approx. Theory 39, 259–274 (1983)
55. F. Cheng, On the rate of convergece of the Szász–Mirakyan operator for functions of bounded
56. Y.S. Chow, H. Teicher, Probability Theory (Springer, Heidelberg, 1978)
57. N. Deo, Faster rate of convergence on Srivastava Gupta operators. Appl. Math. Comput. 218,
10486–10491 (2012)
58. M.-M. Derriennic, Sur l’approximation de functions integrable sur Œ0; 1 par des polynomes
de Bernstein modifies. J. Approx. Theory 31, 323–343 (1981)
59. R. A. DeVore, The Approximation of Continuous Functions by Positive Linear Operators.
Lecture Notes in Mathematics, vol. 293 (Springer, New York, 1972)
60. R.A. DeVore, G.G. Lorentz, Constructive Approximation (Springer, Berlin, 1993)
61. Z. Ditzian, Direct estimate for Bernstein polynomials. J. Approx. Theory 79, 165–166 (1994)
62. Z. Ditzian, V. Totik, Moduli of Smoothness (Springer, Berlin, 1987)
63. D.K. Dubey, V.K. Jain, Rate of approximation for integrated Szász–Mirakyan operators.
Demonstr. Math. XLI(4), 879–886 (2008)
64. O. Duman, M.A. Ozarslan, H. Aktuglu, Better error estimation for Szász–Mirakjan–Beta
operators. J. Comput. Anal. Appl. 10(1), 53–59 (2008)
65. J.L. Durrmeyer, Une formule d’ inversion de la Transformee de Laplace: Applications a la
Theorie des Moments. These de 3e Cycle, Faculte des Sciences de l’ Universite de Paris
(1967)
66. J. Favard, Sur les multiplicateurs d’interpolation. J. Math. Pures Appl. Ser. 9(23), 219–247
(1944)
67. L. Fejér, Über interpolation, Nachrichten der Gesellschaft für Wissenschaften su Göttingen.
Math. Phys. Kl. 66–91 (1916)
68. W. Feller, An Introduction to Probability Theory and Its Applications II (Wiley, New York,
1966)
69. M. Felten, direct and inverse estimates for Bernstein polynomials. Constr. Approx. 14,
459–468 (1998)
70. G. Feng, Direct and inverse approximation theorems for Baskakov operators with the Jacobi-
type weight. Abstr. Appl. Anal. 2011, 13 (2011). Article ID 101852
71. Z. Finta, On converse approximation theorems. J. Math. Anal. Appl. 312(1), 159–180 (2005)
72. Z. Finta, V. Gupta, Direct and inverse estimates for Phillips type operators. J. Math. Anal.
Appl. 303(2), 627–642 (2005)
352 References
73. Z. Finta, N.K. Govil, V. Gupta, Some results on modified Szász–Mirakyan operators. J. Math.
Anal. Appl. 327(2), 1284–1296 (2007)
74. M.S. Floater, On convergence of derivatives of Bernstein approximation. J. Approx. Theory
134, 130–135 (2005)
75. A.D. Gadzjiv, Theorems of the type of P.P. Korovkin type theorems. Math. Zametki 20(5),
781–786 (1976); English Translation, Math. Notes 20(5–6), 996–998 (1976)
76. S.G. Gal, On the lower pointwise estimate by Bernstein polynomials. Math. Anal. Approx.
Theory 103–108 (2002). ISBN:973-85647-4-3
77. S.G. Gal, Approximation by Complex Bernstein and Convolution-Type Operators (World
Scientific Publishing Co., Singapore, 2009)
78. S.G. Gal, Approximation by complex genuine Durrmeyer type polynomials in compact disks.
Appl. Math. Comput. 217, 1913–1920 (2010)
79. S.G. Gal, V. Gupta, Quantitative estimates for a new complex Durrmeyer operator in compact
disks. Appl. Math. Comput. 218(6), 2944–2951 (2011)
80. S.G. Gal, V. Gupta, Approximation by complex Beta operators of first kind in strips of
compact disks. Mediterr. J. Math. 10(1), 31–39 (2013)
81. S.G. Gal, V. Gupta, Approximation by complex Stancu Beta operators of second kind in
semidisks. Rev. Anal. Numér. Théor. Approx. (to appear)
82. S. Gal, V. Gupta, D.K. Verma, P.N. Agrawal, Approximation by complex Baskakov–Stancu
operators in compact disks. Rend. Circ. Mat. Palermo 61, 153–165 (2012)
83. I. Gavrea, T. Trif, The rate of convergence by cerain new Meyer–König and Zeller operators
of finite type. Rend. Circ. Mat. Palermo (2) Suppl. 76, 375–394 (2005)
84. S. Goldberg, V. Meir, Minimum moduli of ordinary differential operators. Proc. London Math.
Soc. 23(3), 1–15 (1971)
85. H. Gonska, P. Pitul, Remarks on an article of J.P. King. Commentat. Math. Univ. Carol. 46(4),
654–652 (2005)
86. T.N.T. Goodman, A. Sharma, A Bernstein-type operator on the simplex. Math. Balk. New
Ser. 5(2), 129–145 (1991)
87. N.K. Govil, V. Gupta, Some approximation properties of integrated Bernstein operators. In
Advances in Mathematics Research, Chapter 8, vol. 11, ed. by R. Baswell (Nova Science
Publishers, Inc., New York, 2009)
88. S. Guo, On the rate of convergence of the Durrmeyer operators for functions of bounded
89. S. Guo, Degree of approximation to functions of bounded variation by certain operators.
90. S. Guo, On the rate of convergence of the integrated Meyer–König and Zeller operators for
functions of bounded variation. J. Approx. Theory 56, 245–255 (1989)
91. S. Guo, M.K. Khan, On the rate of convergence of some operators on functions of bounded
variation. J. Approx Theory 58, 90–101 (1989)
92. V. Gupta, A note on modified Baskakov type operators. Approx. Theory Appl. 10(3), 74–78
(1994)
93. V. Gupta, A sharp estimate on the degree of approximation to functions of bounded variation
by certain operators. Approx. Theory Appl. 11(3), 106–107 (1995)
94. V. Gupta, Rate of convergence by Baskakov–Beta operators. Mathematica 37(60)(1–2),
109–117 (1995)
95. V. Gupta, Simultaneous approximation by Szász–Durrmeyer operators. Math. Stud. 64(1–4),
27–36 (1995)
96. V. Gupta, A note on the rate of convergence of Durrmeyer type operators for function of
bounded variation. Soochow J. Math. 23, 115–118 (1997)
97. V. Gupta, A note on Meyer–König and Zeller operators for functions of bounded variation.
98. V. Gupta, Rate of convergence on Baskakov–Beta–Bézier operators for bounded variation
functions. Int. J. Math. Math. Sci. 32(8), 471–479 (2002)
References 353
99. V. Gupta, Rate of approximation by new sequence of linear positive operators. Comput. Math.
Appl. 45(12), 1895–1904 (2003)
100. V. Gupta, Degree of approximation to function of bounded variation by Bézier variant of
MKZ operators. J. Math. Anal. Appl. 289, 292–300 (2004)
101. V. Gupta, An estimate on the convergence of Baskakov–Bézier operators. J. Math. Anal. Appl.
312, 280–288 (2005)
102. V. Gupta, On bounded variation functions by general MKZD operators. Acta Math. Sinica
Eng. Ser. 23(8), 1457–1462 (2007)
103. V. Gupta, Approximation for modified Baskakov Durrmeyer operators. Rocky Mt. J. Math.
29(3), 825–841 (2009)
104. V. Gupta, A note on modified Phillips operators. Southeast Asian Bull. Math. 34, 847–851
(2010)
105. V. Gupta, A new class of Durrmeyer operators. Adv. Stud. Contemp. Math. 23(2), 219–224
(2013)
106. V. Gupta, U. Abel, Rate of convergence of bounded variation function by a Bézier Durrmeyer
variant of Baskakov operators. Int. J. Math. Math. Sci. 2004(9), 459–468 (2004)
107. V. Gupta, U. Abel, The rate of convergence by a new type of Meyer–König and Zeller
operators. Fasc. Math. 34, 15–23 (2004)
108. V. Gupta, P.N. Agrawal, An estimate of the rate of convergence for modified Szász–Mirakyan
operators of functions of bounded variation. Publ. Inst. Math. Nouv. Sér. (N.S.) 49(63),
97–103 (1991)
109. V. Gupta, K.V. Arya, On the rate of pointwise convergence of modified Baskakov type
operators for functions of bounded variation. Kyungpook Math. J. 38(2), 283–291 (1998)
110. V. Gupta, N. Deo, A note on improved estimates for integrated Szász–Mirakyan operators.
Math. Slovaca 61(5), 799–806 (2011)
111. V. Gupta, O. Duman, Bernstein Durrmeyer type operators preserving linear functions. Math.
Vesniki 62(4), 259–264 (2010)
112. V. Gupta, P. Gupta, Direct theorem in simultaneous approximation for Szász–Mirakyan
Baskakov type operators. Kyungpook Math. J. 41(2), 243–249 (2001)
113. V. Gupta, N. Ispir, On simultaneous approximation for some modified Bernstein type
operators. Int. J. Math. Math. Sci. 2004(71), 3951–3958 (2004)
114. V. Gupta, N. Kumar, A note on integral modification of the Meyer–König and Zeller operators.
Int. J. Math. Math. Sci. 2003(31), 2003–2009 (2003)
115. V. Gupta, A.J. Lopez-Moreno, Jose-Manuel Latorre-Palacios, On simultaneous approxima-
tion of the Bernstein Durrmeyer operators. Appl. Math. Comput. 213(1), 112–120 (2009)
116. V. Gupta, A. Lupas, Direct results for mixed Beta–Szász type operators. Gen. Math. 13(2),
83–94 (2005)
117. V. Gupta, P. Maheshwari, On Baskakov–Szász type operators. Kyungpook Math. J. 43(3),
315–325 (2003)
118. V. Gupta, P. Maheshwari, Bézier variant of a new Durrmeyer type operators. Rivista di
Matematica della Università di Parma 7(2), 9–21 (2003)
119. V. Gupta, M.A. Noor, Convergence of derivatives for certain mixed Szász Beta operators.
J. Math. Anal. Appl. 321(1), 1–9 (2006)
120. V. Gupta, R.P. Pant, Rate of convergence for the modified Szász–Mirakyan operators on
functions of bounded variation. J. Math. Anal. Appl. 233, 476–483 (1999)
121. V. Gupta, P. Pych-Taberska, On the rate of pointwise convergence of modified Baskakov type
operators. Funct. Approx. 24, 59–67 (1996)
122. V. Gupta, C. Radu, Statistical approximation properties of q-Baskakov–Kantorovich opera-
tors. Cent. Eur. J. Math. 7(4), 809–818 (2009)
123. V. Gupta, A. Sahai, On linear combination of Phillips operators. Soochow J. Math.
19, 313–323 (1993)
124. V. Gupta, J. Sinha, Simultaneous approximation for generalized Baskakov–Durrmeyer-type
operators. Mediterr. J. Math. 4, 483–495 (2007)
354 References
125. V. Gupta, G.S. Srivastava, Simultaneous approximation by Baskakov–Szász type operators.

Bull. Math. Soc. Sci. de Roumanie (N.S.) 37(85)(3–4), 73–85 (1993)
126. V. Gupta, G.S. Srivastava, On convergence of derivatives by Szász–Mirakyan–Baskakov type
operators. Math. Stud. 64(1–4), 195–205 (1995)
127. V. Gupta, G.S. Srivastava, An estimate of the rate of convergence of modified Baskakov
operators for functions of bounded variation. Kyungpook Math. J. 36, 237–247 (1996)
128. V. Gupta, G.S. Srivastava, On the rate of convergence of Phillips operators for functions of
bounded variation. Comment. Math. XXXVI, 123–130 (1996)
129. V. Gupta, G. Tachev, Approximation by Szász–Mirakyan–Baskakov operators. J. Appl. Funct.
Anal. 9(3–4), 308–309 (2014)
130. V. Gupta, D.K. Verma, Approximation by complex Favard–Szász–Mirakjan–Stancu operators
in compact disks. Math. Sci. 6(25), pp. 8 (2012)
131. V. Gupta, H. Wang, The rate of convergence of q-Durrmeyer operators for 0 < q < 1. Math.
Meth. Appl. Sci. 31, 1946–1955 (2008)
132. V. Gupta, R. Yadav, Better approximation by Stancu Beta operators. Rev. Anal. Numér. Théor.
Approx. 40(2), 149–155 (2011)
133. V. Gupta, R. Yadav, Direct estimates in simultaneous approximation for BBS operators. Appl.
Math. Comput. 218(22), 11290–11296 (2012)
134. V. Gupta, R. Yadav, Rate of convergence for generalized Baskakov operators. Arab J. Math.
Sci. 18(1), 39–50 (2012)
135. V. Gupta, X.M. Zeng, Rate of convergence for the Bézier variant of Balazs–Kantorovich
operators. Math. Slovaca 57, 349–358 (2007)
136. V. Gupta, X.M. Zeng, Approximation by Bézier variant of the Szász–Kantorovich operator in
case 0 < ˛ < 1. Georgian Math. J. 17, 253–260 (2010)
137. V. Gupta, G.S. Srivastava, A. Sahai, On simultaneous approximation by Szász–Beta operators.
Soochow J. Math. 11(1), 1–11 (1995)
138. V. Gupta, V. Vasishtha, M.K. Gupta, Rate of convergence of the Szász–Kantorovich–Bézier
operators for bounded variation functions. Publ. Inst. Math. Nouv. Sér. 72(86), 137–143
(2002)
139. V. Gupta, M.K. Gupta, V. Vasishtha, Simultenaous approximations by summation-integral
type operators. Nonlinear Funct. Anal. Appl. 8, 399–412 (2003)
140. V. Gupta, R.N. Mohapatra, Z. Finta, On certain family of mixed summation integral type
operators. Math. Comput. Model. 42, 181–191 (2005)
141. V. Gupta, U. Abel, M. Ivan, Rate of convergence of Beta operators of second kind for
functions with derivatives of bounded variation. Int. J. Math. Math. Sci. 2005(23), 3827–3833
(2005)
142. V. Gupta, M.A. Noor, M.S. Beniwal, Rate of convergence in simultaneous approximation for
Szász–Mirakyan Durrmeyer operators. J. Math. Anal. Appl. 322(2), 964–970 (2006)
143. M.K. Gupta, M.S. Beniwal, P. Goel, Rate of convergence for Szász–Mirakyan–Durrmeyer
operators with derivatives of bounded variation. Appl. Math. Comput. 199(2), 828–832 (2008)
144. V. Gupta, P.N. Agrawal, A.R. Gairola, On the integrated Baskakov type operators. Appl.
Math. Comput. 213(2), 419–425 (2009)
145. V. Gupta, D.K. Verma, P.N. Agrawal, Simultaneous approximation by certain Baskakov–
Durrmeyer–Stancu operators. J. Egyptian Math. Soc. 20(3), 183–187 (2012)
146. V. Gupta, R.P. Agarwal, D.K. Verma, Approximation for a new sequence of summation-
integral type operators. Adv. Math. Sci. Appl. 23(1), 35–42 (2013)
147. V. Gupta, N. Deo, X.M. Zeng, Simultaneous approximation for Szász–Mirakian–Stancu–
Durrmeyer operators. Anal. Theory Appl. 29(1), 86–96 (2013)
148. M. Heilmann, Direct and converse results for operators of Baskakov–Durrmeyer type.
149. M. Heilmann, On simultaneous approximation by the method of Baskakov–Durrmeyer
operators. Numer. Funct. Anal. Optim. 10, 127–138 (1989)
150. H. Heilmann, M.W. Muller, Direct and converse results on weighted simultaneous approxi-
mation by the method of operators of Baskakov–Durrmeyer type. Result. Math. 16, 228–242
(1989)
References 355
151. M. Heilmann, G. Tachev, Commutativity, direct and strong converse results for Phillips
operators. East J. Approx. 17 (3), 299–317 (2011)
152. F. Herzog, J.D. Hill, The Bernstein polynomials for discontinuous functions. Amer. J. Math.
68, 109–124 (1946)
153. E. Hewitt, K. Stromberg, Real and Abstract Analysis (McGraw Hill, New York, 1956)
154. E.W. Hobson, On a general convergence theorem and the theory of the representation of a
function by series of normal functions. Proc. London Math. Soc. 6, 349–395 (1908)
155. W. Hoeffding, The L1 norm of the approximation error for Bernstein-type polynomials.
J. Approx. Theory 4, 347–356 (1971)
156. Y.H. Hua, S.Y. Shaw, Rate of approximation for functions of bounded variation by integral
operators. Period. Math. Hungar. 46(1), 41–60 (2003)
157. M. Ismail, P. Simeonov, On a family of positive linear integral operators. Notions of Positivity
and the Geometry of Polynomials. Trends in Mathematics (Springer, Basel, 2011), pp.
259–274
158. N. Ispir, I. Yuksel, On the Bézier variant of Srivastava–Gupta operators. Appl. Math. E-Notes
5, 129–137 (2005)
159. N. Ispir, A. Aral, O. Dogru, On Kantorovich process of a sequence of generalized linear
operators. Nonlinear Funct. Anal. Optim. 29(5–6), 574–589 (2008)
160. D. Jackson, The Theory of Approximation. American Mathematical Society Colloquium
Publications, vol. 11 (American Mathematical Society, New York, 1930)
161. G.C. Jain, Approximation of functions by a new class of linear operators. J. Austral. Math.
Soc. 13(3), 271–276 (1972)
162. C. Jordan, Calculus of Finite Differences (Chelsea, New York, 1965)
163. V. Kac, P. Cheung, Quantum Calculus (Springer, New York, 2002)
164. L.V. Kantorovich, Sur certains developpments suivant les polynomes de la forme de S.
Bernstein, I, II. C. R. Acad. Sci. USSR 20, 563–568 (1930)
165. H. Karsli, Convergence and rate of convergence by nonlinear singular integral operators
depending on two parameters. Appl. Anal. 85(6,7), 781–791 (2006)
166. H. Karsi, V. Gupta, Rate of convergence by nonlinear integral operators for functions of
bounded variation. Calcolo 45, 87–97 (2008)
167. H. Karsli, E. Ibikli, Approximation properties of convolution type singular integral operators
depending on two parameters and of their derivatives in L1 .a; b/. Proc. 16th Int. Conf.
Jangjeon Math. Soc. 16, 66–76 (2005)
168. H.S. Kasana et al., Modified Szász operators. In Proceedings of International Conference on
Mathematical Analysis and Applications, Kuwait (Pergamon, Oxford, 1985), pp. 29–41
169. H.S. Kasana, P.N. Agrawal, Approximation by linear combination of Szász–Mirakian opera-
tors. Colloquium Math. 80(1), 123–130 (1999)
170. H.S. Kasana, P.N. Agrawal, V. Gupta, Inverse and saturation theorems for linear combination
of modified Baskakov operators. Approx. Theory Appl. 7 (2), 65–81 (1991)
171. M.K. Khan, Approximation properties of beta operators. In Progress in Approximation Theory
(Academic, New York, 1991), pp. 483–495
172. J.P. King, Positive linear operstors which preserve x 2 . Acta Math. Hungar. 99, 203–208 (2003)
173. H.B. Knoop, X.L. Zhou, The lower estimate for linear positive operators (II). Result. Math.
25, 315–330 (1994)
174. P.P. Korovkin, Linear Operators and Approximation Theory (Hindustan Publ. Corp., India,
1960)
175. B. Lenze, On the points of regularity of multivariate functions of bounded variation. Real
Anal. Exch. 29(2), 647–656 (2003/2004)
176. P. Li, Y.H. Gong, The order of approximation by the generalized Bernstein Bézier polynomi-
als. J. China Univ. Sci. Technol. 15(1), 15–18 (1985)
177. Z. Liu, Approximation of continuous functions by the generalized Bernstein Bézier polyno-
mials. Approx. Theory Appl. 4(2), 105–130 (1986)
178. Z. Liu, Approximation of the Kantorovich–Bézier operators in Lp .0; 1/. Dongbey Shuxue
7(2), 199–205 (1991)
356 References
179. M. Loéve, Probability Theory I, 4th edn. (Springer, New York, 1977)
180. G.G. Lorentz, Zur Theoorie der Polynome von S. Bernstein. Mat. Sb. 2, 543–556 (1937)
181. G.G. Lorentz, Bernstein Polynomials (University of Toronto Press, Toronto, 1953)
182. G.G. Lorentz, Bernstein Polynomials, 2nd ed. (Chelsea Publisher, New York, 1986)
183. E.R. Love, G. Prasad, A. Sahai, An improved estimate of the rate of convergence of the
integrated Meyer–König and Zeller operators for functions of bounded variation. J. Math.
Anal. Appl. 187(1), 1–16 (1994)
184. A. Lupas, Some properties of the linear positive operators, II. Mathematica (Cluj) 9(32),
295–298 (1967)
185. A. Lupas, Die Folge der Beta-Operatoren. Dissertation, University of Stuttgart, Stuttgart,
1972
186. A. Lupas, The approximation by means of some linear positive operators. In Approximation
Theory, ed. by M.W. Muller, M. Felten, D.H. Mache. Proceedings of the International Doort-
mund Meeting IDoMAT 95, held in Witten, Germany, 13–17 March 1995. Mathematical
Research, vol. 86 (Akadamie Verlag, Berlin, 1995), pp. 201–229
187. N.I. Mahmudov, V. Gupta, Approximation by genuine Durrmeyer–Stancu polynomials in
compact disks. Math. Comput. Model. 55, 278–285 (2012)
188. G. Mastroianni, Su un operatore lineare e positivo. Rend. Acc. Sc. Fis. Mat. Napoli 46(4),
161–176 (1979)
189. C.P. May, Saturation and inverse theorems for combinations of a class of exponential type
opertors. Can. J. Math. XXVIII, 1224–1250 (1976)
190. C.P. May, On Phillips operators. J. Approx. Theory 20, 315–322 (1997)
191. S.M. Mazhar, V. Totik, Approximation by modified Szász operators. Acta Sci. Math. 49,
257–269 (1985)
192. W. Meyer-König, K. Zeller, Bernsteinsche Potenzreihen. Stud. Math. 19, 89–94 (1960)
193. C.A. Micchelli, Saturation classes and iterates of operators. Ph.D. Thesis, Stanford University,
1969
194. G.M. PMirakjan, Approximation des fonctions continues au moyen de polynomes de la forme
e nx k D 0mn CP k
k;n x [Approximation of continuous functions with the aid of polynomials
of the form e nx k D 0mn Ck;n x k ]” (in French). Comptes rendus de l’Acad. des Sci. de
l’URSS 31, 201–205 (1941)
195. Gh. Mocica, Problems of Special Functions (Romanian) (Edit. Didact. Pedag., Bucharest,
1988)
196. G. Mühlbach, Verallgemeinerungen der Bernstein-und der Lagrangepolynome. Rev.
Roumaine Math. Pures et Appl. 15(8), 1235–1252 (1970)
197. J. Musielak, On some approximation problems in modular spaces. In Constructive Function
Theory 1981. Proceedings of International Conference, Varna, 1–5 June 1981 (Publishing
House Bulgarian Academy of Sciences, Sofia, 1983), pp. 455–461
198. G.I. Natanson, On Fourier series of continuous functions of bounded variation (in Russian).
Vest. Leningrad. Univ. 7, 54–155 (1972)
199. R.S. Phillips, An inversion formula for semi-groups of linear operators. Ann. Math. (Ser.2)
59, 352–356 (1954)
200. P. Pych-Taberska, Pointwise approximation by partial sums of Fourier series and conjugate
series. Funct. Approx. XV, 231–244 (1986)
201. P. Pych-Taberska, On the rate of pointwise convergence of Bernstein and Kantorovic
polynomials. Funct. Approx. XVI, 63–76 (1988)
202. P. Pych-Taberska, On the rate of pointwise convergence of the Feller operators. Ann. Soc.
Math. Pol. Ser I, Commentat Math. 31, 147–156 (1991)
203. G. Prasad, P.N. Agrrawal, H.S. Kasana, Approximation of functions on Œ0; 1 by a new
sequence of modified Szász operators. Math. Forum. 6(2), 1–11 (1983)
204. Q. Qi, Y. Zhang, Pointwise approximation for certain mixed Szász–Beta operators. Further
Progress in Analysis, ed. by H.G.W. Begehr, A.O. Celebi, R.P. Gilbert. Proceedings of 6th
International ISAAC Congress (World Scientific Co., Singapore, 2009), pp. 152–163
References 357
205. R.K.S. Rathore, Linear combinations of linear positive operators and generating relations in
special functions. Ph.D. Thesis, IIT Delhi, 1973
206. M.Y. Ren, X.M. Zeng, Approximation by a kind of complex modified q-Durrmeyer type
operators in compact disks. J. Inequal. Appl. 2012 ART, 122 (2012)
207. M.Y. Ren, X.M. Zeng, Approximation by complex q-Bernstein–Schurer operators in compact
disks. Georgian Math. J. 20(2) 377–395 (2013)
208. A. Sahai, G. Prasad, On the rate of convergence for modified Szász–Mirakyan operators on
functions of bounded variation. Publ. Inst. Math. Nouv. Sér. (N.S.) 53(67), 73–80 (1993)
209. F. Schurer, On linear positive operators in approximation theory. Ph.D. Thesis, Technical
University of Delft, 1965
210. S.Y. Shaw, W.C. Liaw, Y.L. Lin, Rates for approximation of functions in BV Œa; b and
DBV Œa; b by positive linear operators. Chinese J. Math. 21(2), 171–193 (1993)
211. O. Shisha, B. Mond, The degree of approximation to periodic functions by linear positive
operators. J. Approx. Theory 1, 335–339 (1968)
212. O. Shisha, B. Mond, The degree of convergence of sequences of linear positive operators.
Proc. Natl. Acad. Sci. 60(4), 196–200 (1968)
213. S.P. Singh, On the degree of approximation by Szász operators. Bull. Austral. Math. Soc. 24,
221–225 (1981)
214. T.A.K. Sinha, P.N. Agrawal, A. Sahai, V. Gupta, Improved Lp approximation by linear
combination of modified Lupas operators. Bull. Inst. Math. Acad. Sinica 17(3), 106–114
(1989)
215. R.P. Sinha, P.N. Agrawal, V. Gupta, On simultaneous approximation by modified Baskakov
operators. Bull. Soc. Math. Belg. Ser. B 43(2), 217–231 (1991)
216. T.A.K. Sinha, V. Gupta, P.N. Agrawal, A. R. Gairola, Inverse theorem for an iterative
combinations of Bernstein–Durrmeyer operators. Studia Univ. Babes Bolyai Mat. LIV(4),
153–164 (2009)
217. T.A.K. Sinha, P.N. Agrawal, A.R. Gairola, On Lp -approximation by iterative combination of
Bernstein–Durrmeyer polynomials. ISRN Math. Anal. 2011, 11 (2011). Article 184374
218. H.M. Srivastava, V. Gupta, A certain family of summantion-integral type operators. Math.
Comput. Model. 37, 1307–1315 (2003)
219. H.M. Srivastava, V. Gupta, Rate of convergence for Bézier variant of the Bleimann–Butzer–
Hahn operators. Appl. Math. Lett. 18(8), 849–857 (2005)
220. D.D. Stancu, Approximation of functions by a new class of linear polynomial operators. Rev.
Roumanie Math. Pure. Appl. 13, 1173–1194 (1968)
221. D.D. Stancu, Use of probabilistic methods in the theory of uniform approximation of
continuous functions. Rev. Roumanie Math. Pures Appl. 14, 673–691 (1969)
222. D.D. Stancu, Approximation of functions by means of a new generalized Bernstein operator.
Calcolo 20, 211–229 (1983)
223. D.D. Stancu, On the beta approximating operators of second kind. Rev. Anal. Numér. Théor.
Approx. 24(1–2), 231–239 (1995)
224. I. Stewart, D. Tall, Complex Analysis (Cambridge University Press, Cambridge, 1983)
225. X.H. Sun, On the simultaneous approximation of functions and their derivatives by the Szász–
Mirakian operators. J. Approx. Theory 55, 279–288 (1988)
226. T. Swiderski, E. Wachnicki, Nonlinear singular integrals depending on two parameters.
Comment. Math. Prace Mat. 40, 181–189 (2000)
227. O. Szász, Generalizations of S. Bernstein’s polynomial to the infinite interval. J. Res. Nat.
Bur. Standards 45, 239–245 (1950)
228. S. Tarabie, On Jain-Beta linear operators. Appl. Math. Inform. Sci. 6(2), 213–216 (2012)
229. V. Totik, Approximation by Szász–Mirakjan–Kantorovich operators in Lp .p > 1/. Anal.
Math. 9, 147–167 (1983)
230. V. Totik, Uniform approximation by Baskakov and Meyer–König Zeller operators. Period.
Math. Hungar. 14(3–4), 209–228 (1983)
231. V. Totik, Uniform approximation by Szász–Mirakyan type operators. Acta Math. Hungar.
41(3–4), 291–307 (1983)
358 References
232. V. Totik, Approximation by Bernstein polynomials. Amer. J. Math. 114, 995–1018 (1994)
233. L.N. Trefthen, Approximation Theory and Approximation Practice, Siam 2013/viii, ISBN
978-1-611972-39-9
234. T. Trif, Approximation of functions of bounded variation by integrated Meyer–König and
Zeller operators of finite type. Studia Sci. Math. Hungar. 49(2), 254–268 (2012)
235. S. Umar, Q. Razi, Approximation of function by a generalized Szász operators. Commun.
Fac. Sci. L’Univ D’Ankara 34, 45–52 (1985)
236. J. De La Vallée-Poussin, Sur ĺ approximation des fonctions d́ une variable réelle et de leurs
dérivées par des polynómes et des suites de Fourier. Bull. Acad. de Sci. Belgique, 193–254
(1908)
237. D.K. Verma, P.N. Agrawal, Convergence in simultaneous approximation for Srivastava–
Gupta operators. Math. Sci. 6(22) (2012)
238. D.K. Verma, V. Gupta, P.N. Agrawal, Some approximation properties of Baskakov–
Durrmeyer–Stancu operators. Appl. Math. Comput. 218(11), 6549–6556 (2012)
239. E. Voronovskaja, Determination de la forme asyptotique de approximation des fonctions par
les polynomes de M. Bernstein. C. R. Acad. Sci. URSS 1932, 79–85 (1932)
240. Z. Walczak, On certain linear positive operators in polynomial weighted spaces. Acta. Math.
Hungar. 101(3), 179–191 (2003)
241. Z. Walczak, V. Gupta, Uniform convergence with certain linear operators. Indian J. Pure.
Appl. Math. 38(4), 259–269 (2007)
242. Z. Wang, Foundations of the Theory of Probability and Its Applications (Beijing, 1979)
243. Y. Wang, S. Guo, Rate of approximation of functions of bounded variation by modified Lupas
operators. Bull. Austral. Math. Soc. 44, 177–188 (1991)
244. P.C. Xun, D.X. Zhou, Rate of convergence for Baskakov operators with Jacobi-weights. Acta
Math. Appl. Sinica 18, 127–139 (1995)
245. D. Zeilberger, On an identity of Daubechies. Amer. Math. Monthly 100, 487 (1993)
246. X.M. Zeng, Bounds for Bernstein basis functions and Meyer-König and Zeller basis functions.
J. Math. Anal. Appl. 219, 364–376 (1998)
247. X.M. Zeng, On the rate of convergence of the generalized Szász type operators for functions
of bounded variation. J. Math Anal. Appl. 226, 309–325 (1998)
248. X.M. Zeng, Rates of Approximation of bounded variation functions by two generalized
Meyer-König–Zeller type operators. Comput. Math. Appl. 39, 1–13 (2000)
249. X.M. Zeng, Approximation properties of Gamma operators. J. Math. Anal. Appl. 11,
389–401 (2005)
250. X.M. Zeng, Approximation of absloutely continuous function by Stancu Beta operators.
Ukrainian Math. J. 63(11), 1787–1794 (2012)
251. X.M. Zeng, W. Chen, On the rate of convergence of the generalized Durrmeyer type operators
for functions of bounded variation. J. Approx. Theory 102, 1–12 (2000)
252. X.M. Zeng, F. Cheng, On the rate of approximation of Bernstein type operators. J. Approx.
Theory 109(2), 242–256 (2001)
253. X.M. Zeng, V. Gupta, Rate of convergence of Baskakov–Bézier type operators for locally
bounded functions. Comput. Math. Appl. 44, 1445–1453 (2002)
254. X.M. Zeng, V. Gupta, Approximation by the Bézier variant of the MKZ–Kantorovich
operators in the case ˛ < 1. Cent. Eur. J. Math. 7(3), 550–557 (2009)
255. X.M. Zeng, A. Piriou, On the rate of convergence of two Bernstein–Bézier type operators for
bounded variation functions. J. Approx. Theory 95, 369–387 (1998)
256. X.M. Zeng, J.N. Zhao, Exact bounds for some basis functions of appoximation operators.
J. Inequal. Appl. 6, 563–575 (2001)
257. X.M. Zeng, V. Gupta, O. Agratini, Approximation by Bézier variant of the Baskakov–
Kantorovich operators in the case 0 < ˛ < 1. Rocky Mt. J. Math. (to appear)
258. D.X. Zhou, On a paper of Mazhar and Totik. J. Approx. Theory 72(3), 290–300 (1993)
259. A. Zygmund, Trigonometric Series (Cambridge University Press, Cambridge, 1959)
Index
Symbols Beta operators, 151, 175

Kfunctional, 65 Beta-Szász, 346
Lp -norm, 117 Better Approximation, 141
p-Lebesgue point, 288 Big-O , 8
q-Bernstein polynomials, 17 binomial, 40
q-calculus, 206 Bleimann–Butzer–Hann operators, 252
Bounded variation, 15
bounded variation, 16, 28, 213, 216, 267, 301,
A 346
absolutely continuous, 15 Bunyakovaki’s inequality, 14
absolutely continuous functions, 308, 338
asymptotic expansion, 97
Asymptotic formula, 170 C
auxiliary operators, 69 CAGD, 217
Cauchy’s integral formula, 204
Cauchy-Schwarz’s inequality, 13
B
Chanturiya’s modulus of variation, 296
Bézier, 29, 243, 249, 278
Chebyshev polynomials, 216
Balazs–Kantorovich operators, 254
commutativity, 29
Baskakov, 232
complex Bernstein–Durrmeyer, 196
Baskakov operator, 24, 26
complex operators, 155
Baskakov operators, 77
convergence, 32, 218
Baskakov–Bézier operators, 267
Converse result, 35
Baskakov–Beta operators, 74, 300
convex, 28
Baskakov–Durrmeyer operators, 275
Baskakov–Durrmeyer–Stancu, 77
Baskakov–Kantorovich operators, 28 D
Bernoulli distribution, 252 degree of convergence, 23
Bernstein, 5 direct theorems, 61
Bernstein inequality, 11 discontinuity of first kind, 217
Bernstein polynomial, 217 Discretely Defined Operators, 17
Bernstein polynomials, 18 Ditzian–Totik modulus of smoothness, 19
Bernstein–Durrmeyer operators, 31 Durrmeyer, 17, 29, 347
Bernstein-Schurer operators, 210
Berry–Esseen, 15
Bessel’s function, 23 E
best approximation, 1 Error bound, 20
Beta, 239 Error estimation, 48, 54, 117

DOI 10.1007/978-3-319-02765-4, © Springer International Publishing Switzerland 2014
360 Index
Exact order, 163, 187, 208 Legendre polynomial, 214

Exact order of approximation, 203 Linear Combinations, 109
exponential-type operator, 8 linear positive operator, 1
exponential-type operators, 217 Lipschitz condition, 9, 287
Local approximation, 66
local approximation, 53
F Lower bound, 20
falling factorial, 14
Favard, 166, 169
forward difference, 9 M
Fourier–Legendre series, 215 Mathematical induction, 38
mean value theorem, 260
Meyer–König–Zeller operators, 25, 244
G Meyer-König Zeller operators, 100
Gamma, 218 Minkowski’s inequality, 14
Generalized Bernstein-Durrmeyer operators, Mixed sequence, 36
64 Mixed summation–integral operators, 89
genuine Durrmeyer–Stancu, 189 modulus of continuity, 8, 34, 54, 79
geometric distribution, 231 modulus of smoothness, 68
global, 19, 54, 68 moment, 232
Global approximation, 69
N
H nondegenerate probability distribution, 240
Hölder’s inequality, 13 nonlinear integral operator, 287
Haar measure, 287
hypergeometric function, 14, 64
O
Order of Approximation, 8
I overconvergence, 175, 197
image processing, 217
infimum, 45, 51 P
Inverse result, 116 Peetre’s K-functional, 10
Iterative Combinations, 118 Pfaff–Kummer transformation, 73
Iterative combinations, 119 Phillips, 32
Phillips operators, 52, 53, 59, 141, 230
Pochhammer symbol, 14, 47
J point of discontinuity, 347
Jackson theorem, 10 Pointwise convergence, 19
Jain operators, 60 polynomial, 1, 199
Jensen’s inequality, 14 positive linear operators, 252
Jordan’s theorem, 213 probability measures, 287
K R
Kantorovich, 17, 27, 60 rate of approximation, 61
Korovkin, 144 rate of convergence, 220
Korovkin’s theorem, 2 rising factorial, 15
L S
Laguerre polynomials, 133 Saturation result, 116
Lebesgue, 13, 60, 64, 151 Schwarz inequality, 41
Lebesgue integrable, 28 Simultaneous approximation, 19, 48, 118, 165,
Lebesgue-Stieltjes integral, 237 188, 204
Index 361
small-o, 8 total variation, 214, 250

Sobolev space, 130 Trigonometric polynomials, 7, 10
Srivastava–Gupta operators, 243, 279
Stancu, 21, 74, 335, 345
statistical convergence, 29 U
Steklov, 80, 116, 124 uniform convergence, 8
Steklov mean, 9 uniformly continuous, 23
Stirling number, 93, 97 Upper estimate, 157, 167
Stone–Weierstrass theorem, 7
summation–integral, 60 V
Szász, 23 Vandermonde determinant, 110
Szász Mirakyan, 21 Voronovskaja-type asymptotic formula, 160
Szász operators, 21 Voronovskaja-type theorem, 60
Szász–Baskakov operators, 132 Voronowskaja’s asymptotic formula, 19
Szász–Beta, 61
Szász–Durrmeyer operators, 230
Szász–Kantorovich–Bézier operators, W
257 Weierstrass, 4, 18, 218
Szász–Mirakyan–Baskakov, 91 Weighted approximation theorem, 62
Szász-Beta, 36 weighted modulus of continuity, 51
Z
T Zygmund, 116
Taylor, 71, 86, 122 Zygmund class, 12
topology, 287 Zygmund theorem, 12

Convergence Estimates in Approximation Theory

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Convergence Estimates in Approximation Theory

Uploaded by

Copyright:

Available Formats

Vijay

Gupta · Ravi P. Agarwal

ISBN 978-3-319-02764-7 ISBN 978-3-319-02765-4 (eBook)

Mathematics Subject Classification (2010): 41A36, 41A25, 41A17, 30E10

© Springer International Publishing Switzerland 2014

Printed on acid-free paper

Springer is part of Springer Science+Business Media (www.springer.com)

New Delhi, India Vijay Gupta

5 Better Approximation .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 141

10.3 Baskakov–Beta Operators for DBV . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . 333

Approximation theory has been an established field of mathematics in the past

where n is a nonnegative integer and a0 ; a1 ; : : : ; an are real numbers. The degree of

.P / D max jP .x/ f .x/j:

En D En .f / D inf f.P /g;

L.af C bg/ D aL.f / C bL.g/:

4. If f 2 D and f .x/ 0, for all x 2 T , then L.f .x// 0, for all x 2 T .

V. Gupta and R.P. Agarwal, Convergence Estimates in Approximation Theory, 1

In order to decide the uniform convergence of a sequence of linear positive

1.1 Korovkin’s Theorem

For a linear positive operator Ln , Korovkin [174] established the following

2M < f .t/ f .x/ < 2M (1.1)

 < f .t/ f .x/ <  (1.2)

Next, by the linearity of Ln .f; x/, we have

Ln . ; x/ D Ln .t 2 2tx C x 2 ; x/ D Ln .t 2 ; x/ 2xLn .t; x/ C x 2 Ln .1; x/

where ın .x/ converges uniformly to zero in the interval Œa; b.

2 < Ln .f; x/ f .x/Ln .1; x/ < 2

Ln .f; x/ f .x/Ln .1; x/

is called a trigonometric polynomial of order n if an2 C bn2 ¤ 0, and the series

is called a trigonometric series.

jjf Ln .f /jj  jjf jj:jjLn .1/ 1jj C jjLn .1/ C 1jj!.n /;

jjf Ln .f /jj  2!.n /:

jjf Ln .f /jj  jjf jj:jjLn .1/ 1jj C jjLn .1/ C 1jj!.n /;

jjf Ln .f /jj  2!.n /:

1.2 Weierstrass Approximation Theorems

The theory of approximation on linear positive operators P .x/ concerns how

The first three moments are calculated as

Next, the first-order moment is given by

The second-order moment of the Bernstein polynomial is given by

.y/ D f Œa C y.b a/:

jP .y/ .y/j < ; y 2 Œ0; 1:

jT .x/ f .x/j < ;  < x < 

Theorem 1.7. If Vn .x/ denotes the De La Vallée-Poussin singular integral

lim Vn .x/ D f .x/

1.3 Order of Approximation

en D max jPn .x/ f .x/j:

where p.x/ is a polynomial of degree  2; p.x/ > 0 on .a; b/.

where a.n/ is a rational function of n; a.n/ ! 1 as n ! 1.

Definition 1.6. The modulus of continuity of f is defined as

!f .ı/  !.f; ı/ D sup jf .t/ f .x/j :

!k .f; ı; a; b/ D supfj4kh f .x/j W jhj  ı; x; x C kh 2 Œa; bg;

!f .nı/  n!f .ı/:

• If > 0, where is any positive real number, then

• If !f .ı/ is an increasing function of ı and if we let 0 < ı1 < ı2 , then we have

Definition 1.7. A function f defined on an interval Œa; b is said to satisfy the

jf .x/ f .y/j  M jx yj˛ ; ˛ > 0:

En .f / D jjTn .f; :/ f jj  6!.f; n1 /

holds, where Tn .f; x/ is a trigonometric polynomial of degree m  n, which

En;0 .f 0 / D jjTn;0 .f 0 ; :/ f 0 jj D max jTn;0 .f 0 ; x/ f 0 .x/j;

For algebraic polynomials, Jackson gave the following theorems:

En .f / D jjPn .f; :/ f jj  6!.f; n1 /;

holds, where n > m.

1.4 Differential Properties of Function

be an nth-order trigonometric polynomial. Then for jTn .x/j  M , the inequality

jPn.m/ .x/j  Dnm M; a0  x  b 0 ;

< f .t/ f .x/ < (1.2)

2 < Ln .f; x/ f .x/Ln .1; x/ < 2

jjf Ln .f /jj jjf jj:jjLn .1/ 1jj C jjLn .1/ C 1jj!.n /;

jjf Ln .f /jj 2!.n /:

jjf Ln .f /jj jjf jj:jjLn .1/ 1jj C jjLn .1/ C 1jj!.n /;

jjf Ln .f /jj 2!.n /:

.y/ D f Œa C y.b a/:

jP .y/ .y/j < ; y 2 Œ0; 1:

jT .x/ f .x/j < ; < x <

where p.x/ is a polynomial of degree 2; p.x/ > 0 on .a; b/.

!f .ı/ !.f; ı/ D sup jf .t/ f .x/j :

!k .f; ı; a; b/ D supfj4kh f .x/j W jhj ı; x; x C kh 2 Œa; bg;

!f .nı/ n!f .ı/:

jf .x/ f .y/j M jx yj˛ ; ˛ > 0:

En .f / D jjTn .f; :/ f jj 6!.f; n1 /

holds, where Tn .f; x/ is a trigonometric polynomial of degree m n, which

En .f / D jjPn .f; :/ f jj 6!.f; n1 /;

be an nth-order trigonometric polynomial. Then for jTn .x/j M , the inequality

jPn.m/ .x/j Dnm M; a0 x b 0 ;

kf kL1 Œa;b D inffM W jf .x/j M a.e. on Œa; bg:

(vii) Jensen’s inequality for integration: If is a convex function and f is

a1 < b1 a2 < b2 a3 < b3 an < bn :

!2 .f; ı/ WD sup sup jf .x .x/h/ 2f .x/ C f .x C .x/h/j;

in which W Œ0; 1 ! R is the step-weight function.

where for an absolute constant K, !. ı/ K 2 !.ı/; 1. He obtained the

jj' 2.1 / .Vn .f; :/ f /jjw MK' .f; n1 /w; :

Ln ..t x/2 ; x/ maxfun; jn;1 jan1 g.x 2 C x/ WD vn .x 2 C x/;