\documentclass[10pt]{studiamnew}
\usepackage{graphicx}
\usepackage{amsmath}
\usepackage{amssymb}
\sloppy

\newtheorem{theorem}{Theorem}[section]
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{axiom}[theorem]{Axiom}
\newtheorem{case}[theorem]{Case}
\newtheorem{condition}[theorem]{Condition}
\newtheorem{conjecture}[theorem]{Conjecture}
\newtheorem{criterion}[theorem]{Criterion}
\newtheorem{definition}[theorem]{Definition}

\theoremstyle{definition}
\newtheorem{remark}[theorem]{Remark}
\newtheorem{algorithm}[theorem]{Algorithm}
\newtheorem{problem}[theorem]{Problem}
\newtheorem{example}[theorem]{Example}
\newtheorem{exercise}[theorem]{Exercise}
\newtheorem{solution}[theorem]{Solution}
\newtheorem{notation}[theorem]{Notation}

\renewcommand{\theequation}{\thesection.\arabic{equation}}
\numberwithin{equation}{section}

\begin{document}
%
\setcounter{page}{1} \setcounter{firstpage}{1}
\setcounter{lastpage}{11}
\renewcommand{\currentvolume}{56}
\renewcommand{\currentyear}{2011}
\renewcommand{\currentissue}{2}
%
\title{Quantitative results for the convergence
of the iterates of some King type operators}
\author{Marius Mihai Birou}
\address{Technical University of Cluj Napoca, \\ Faculty of Automatics and Computer Sciences\\
28, Memorandumului Street,\\
400114 Cluj-Napoca,\\
Romania} \email{Marius.Birou@math.utcluj.ro}

\subjclass{41A17, 41A25, 41A36} \keywords{King type operators,
\textit{q}-operators, convergence, modulus of smoothness}
\begin{abstract}
In this article we construct three \textit{q}-King type operators which fix the functions $e_0$ and $e_2+\alpha e_1$, $\alpha>0$. We study the rates of convergence for the iterates of these operators using the first and the second order modulus of continuity. We show that the convergence is faster in the case of \textit{q} operators ($q<1$) than in the classical case ($q=1$).
\end{abstract}
\maketitle

\section{Introduction}

In \cite{card} the authors introduced the operators $B_{n,\alpha
}:C[0,1]\rightarrow C[0,1],$ $n>1,$
given by%
\begin{equation}
B_{n,\alpha }f(x)=\sum_{k=0}^{n}\binom{n}{k}(u_{n,\alpha
}(x))^{k}(1-u_{n,\alpha }(x))^{n-k}f\left( \frac{k}{n}\right),
\end{equation}%
where $\alpha \in \lbrack 0,\infty )$ and
\begin{equation*}
u_{n,\alpha }(x)=-\frac{n\alpha +1}{2(n-1)}+\sqrt{\frac{(n\alpha +1)^{2}}{%
4(n-1)^{2}}+\frac{n(\alpha x+x^{2})}{n-1}}.
\end{equation*}%
The operators $B_{n,\alpha }$ preserve the functions $e_{0}$ and $%
e_{2}+\alpha e_{1},$ where $e_{i}(x)=x^{i}$, $i=0,1,2.$ For $\alpha =0$ the operator $%
B_{n,\alpha }$ reduces to the King operator (see \cite{king}).

In this article we consider three \textit{q}-operators of King type which
fix the functions $e_{0}$ and $e_{2}+\alpha e_{1}$. We study the convergence
of the iterates of these operators. Rates of convergence are obtained by using
the first and the second order modulus of smoothness, i.e.%
\begin{equation*}
\omega _{1}(f,\delta )=\sup \left\{ |f(x+h)-f(x)|:x,x+h\in \lbrack 0,1],\
0\leq h\leq \delta \right\} ,
\end{equation*}%
\begin{equation*}
\omega _{2}(f,\delta )=\sup \left\{ |f(x+h)-2f(x)+f(x-h)|:x,x\pm h\in
\lbrack 0,1],\ 0\leq h\leq \delta \right\} ,
\end{equation*}%
where $f\in C[0,1]$ and $\delta \geq 0.$ We get better results in the case
of the considered \textit{q}-operators ($q<1$) than in the classical case ($%
q=1$).

Other quantitative results related to the convergence of the iterates of some positive linear operators may be found in \cite{alto}, \cite{birou2017}, \cite{birou2018}, \cite{gons}, \cite{mahm2010}, \cite{mahm2011}, \cite{rasa}.

We remind some notations from \textit{q}-calculus which we use in the
construction of the operators. For $q\in (0,1)$ we have:

$\bullet$ \textit{q}-integer:%
\begin{equation*}
\lbrack n]_{q}=\frac{1-q^{n}}{1-q},\ n\in
%TCIMACRO{\U{2115} }%
%BeginExpansion
\mathbb{N}
%EndExpansion
,
\end{equation*}

$\bullet$ \textit{q}-factorial:%
\begin{equation*}
\lbrack n]_{q}!=[n]_{q}[n-1]_{q}...[1]_{q},\ n=1,2,...,\ [0]_{q}!=1,
\end{equation*}

$\bullet$ \textit{q}-binomial coefficients:%
\begin{equation*}
\left[
\begin{array}{c}
n \\
k%
\end{array}%
\right] _{q}=\frac{[n]_{q}!}{[k]_{q}![n-k]_{q}!},
\end{equation*}%

$\bullet$ \textit{q}-integral
\begin{equation*}
\int_{0}^{1}f(x)d_{q}x=(1-q)\sum_{n=0}^{\infty }f(q^{n})q^{n}.
\end{equation*}

\section{Convegence of the iterates of the positive linear operators which
preserve some functions}

Let $\tau :[0,1]\rightarrow \lbrack 0,1]$ a continuous strictly increasing
functions satisfying the conditions $\tau (0)=0$ and $\tau (1)=1.$

Let $P:C[0,1]\rightarrow C[0,1]$ the operator given by%
\begin{equation}
Pf(x)=\left( 1-\tau (x)\right) f(0)+\tau (x)f(1).  \label{oplim1}
\end{equation}

The following theorem is a direct consequence of Theorem 3.1 from \cite{gavr}.

\begin{theorem}\label{th1}
Let $L:C[0,1]\rightarrow C[0,1]$ a positive linear
operator which preserves the functions $e_{0}$, $\tau $ and has the set of interpolation points $\{0,1\}$.
 If there exists
$\varphi \in C[0,1]$
such that %\lessgtr
\begin{equation*}
L\varphi \gtrless \varphi \ \text{on }(0,1),
\end{equation*}%
then
\begin{equation*}
\lim_{m\rightarrow \infty }L^{m}f=Pf,
\end{equation*}%
uniformly on $[0,1]$.
\end{theorem}

\begin{theorem}\label{th2}
\cite{birou2018} Let $\tau :[0,1]\rightarrow \lbrack 0,1],$ $\tau
\in C^{1}[0,1]$, strictly increasing, $\tau (0)=0,$ $\tau (1)=1$,
$\tau ^{\prime }(0)\neq 1,$ $\tau ^{\prime }(1)\neq 1$ and $\tau
(x)\neq x$, $x\in (0,1)$.

Let $L:C[0,1]\rightarrow C[0,1]$ be a linear positive operator which
preserves $e_{0}$ and $\tau $ and let
\begin{equation}\label{const}
c=\sup_{0\leq x\leq 1}\frac{\tau (x)-2x\tau (x)+x^{2}}{\left\vert
x-\tau (x)\right\vert }
\end{equation}%
and
\begin{equation}\label{delta}
\delta _{m}(x)=\left\vert L^{m}e_{1}(x)-\tau (x)\right\vert,\
x\in[0,1].
\end{equation}

If
\begin{equation*}
0<\delta _{m}(x)<1/4,\ x\in (0,1),
\end{equation*}
then we have, for every $x\in \lbrack 0,1]$,
\begin{equation*}
\left\vert L^{m}f(x)-Pf(x)\right\vert \leq \sqrt{\delta _{m}(x)}\omega
_{1}(f,\sqrt{\delta _{m}(x)})+\left( 1+\frac{c}{2}\right) \omega _{2}(f,%
\sqrt{\delta _{m}(x)})
\end{equation*}%
and%
\begin{equation*}
\left\vert L^{m}f(x)-Pf(x)\right\vert \leq 2\delta
_{m}(x)\left\Vert f\right\Vert +\left( \frac{3}{2}\sqrt{\delta
_{m}(x)}+\frac{7+c}{2}\right) \omega _{2}(f,\sqrt{\delta
_{m}(x)}).
\end{equation*}
\end{theorem}

If we take%
\begin{equation*}
\tau =\frac{e_{2}+\alpha e_{1}}{1+\alpha },
\end{equation*}%
with $\alpha \geq 0,$ then the operator $P$ from (\ref{oplim1})
becomes
\begin{equation}\label{oplim}
Pf(x)=\frac{(1-\alpha )(1+x+\alpha )}{1+\alpha }f(0)+\frac{x(x+\alpha )}{%
1+\alpha }f(1),\ x\in[0,1],\ f\in C[0,1]
\end{equation}%
and for the constant $c$ from (\ref{const}) we get
\begin{equation*}
c=\alpha +2.
\end{equation*}

In the next sections we obtain estimations for $\delta _{m}(x)$, $
x\in
\lbrack 0,1]$ given by (\ref{delta}) for three new operators which preserve $e_{0}$ and $%
e_{2}+\alpha e_{1},$ $\alpha \geq 0.$ Using Theorem \ref{th2} we
get quantitative results for the convergence of the iterates of
these operators.

\section{The King modified \textit{q}-Bernstein operator}

The classical Berstein operator is given by

\begin{equation*}
B_{n}f(x)=\sum_{k=0}^{n}p_{n,k}(x)f\left( \frac{k}{n}\right) ,\ f\in
C[0,1],\ x\in \lbrack 0,1],
\end{equation*}
where%
\begin{equation*}
p_{n,k}(x)=\binom{n}{k}x^{k}(1-x)^{n-k}.
\end{equation*}

In \cite{phil} Phillips constructed the \textit{q}-Bernstein operator:
\begin{equation*}
B_{n,q}f(x)=\sum_{k=0}^{n}p_{n,k}(q;x)f\left( \frac{[k]_{q}}{[n]_{q}}\right)
,\ q\in (0,1],\ f\in C[0,1],\ x\in \lbrack 0,1],
\end{equation*}%
where%
\begin{equation*}
p_{n,k}(q;x)=\left[
\begin{array}{c}
n \\
k%
\end{array}%
\right] _{q}x^{k}\prod\limits_{s=0}^{n-k-1}(1-q^{s}x).
\end{equation*}

The King modified \textit{q}-Bernstein operator is given by%
\begin{equation*}
K_{n,q,\alpha }^{1}f(x)=B_{n}f(u_{n,q,\alpha }(x)),\ f\in C[0,1],\ x\in
\lbrack 0,1],
\end{equation*}%
where $u_{n,q,\alpha }:[0,1]\rightarrow \lbrack 0,1],$ $n> 1$ are
continuous and strictly increasing functions having the properties $%
u_{n,q,\alpha }(0)=0,$ $u_{n,q,\alpha }(1)=1.$

From properties of the the \textit{q}-Bernstein operator we have%
\begin{equation*}
\begin{array}{c}
K_{n,q,\alpha }^{1}e_{0}(x)=1,\\
K_{n,q,\alpha }^{1}e_{1}(x)=u_{n,q,\alpha }(x), \\
K_{n,q,\alpha }^{1}e_{2}(x)=\displaystyle\left( u_{n,q,\alpha }(x)\right) ^{2}+\frac{%
u_{n,q,\alpha }(x)(1-u_{n,q,\alpha }(x))}{[n]_{q}}.%
\end{array}%
\end{equation*}

Imposing that the operator $K^{1}_{n,q,\alpha }$ preserves the function $e_{2}+\alpha e_{1}$, $\alpha \geq 0$ we get
\begin{equation*}
u_{n,q,\alpha }(x)=-\frac{[n]_{q}\alpha +1}{2([n]_{q}-1)}+\sqrt{\frac{%
([n]_{q}\alpha +1)^{2}}{4([n]_{q}-1)^{2}}+\frac{[n]_{q}(\alpha x+x^{2})}{%
[n]_{q}-1}}.
\end{equation*}

Particular cases:

$\bullet$ $q=1$ - the operator constructed in \cite{card}

$\bullet$ $q=1$, $\alpha =0$ - the King operator (see \cite{king})

$\bullet $ $\alpha =0$ - the \textit{q}-Bernstein King operator
(see \cite{mahm2011})

\begin{theorem}
The sequence of the iterates of the operator $K^{1}_{n,q,\alpha }$ converges
uniformly to the operator $P$ given by (\ref{oplim}).
\end{theorem}

\begin{proof}
For every $x\in[0,1]$ we have%
\begin{eqnarray}\label{dif}
K_{n,q,\alpha }^{1}e_{1}(x)-x &=&u_{n,q,\alpha }(x)-x \\
&=&\frac{x(x-1)}{[n]_{q}-1}\cdot \frac{1}{\frac{[n]_{q}\alpha +1}{%
2([n]_{q}-1)}+\sqrt{\frac{([n]_{q}\alpha +1)^{2}}{4([n]_{q}-1)^{2}}+\frac{%
[n]_{q}(\alpha x+x^{2})}{[n]_{q}-1}}+x} \nonumber
\end{eqnarray}%
It follows that
\begin{equation*}
K_{n,q,\alpha }^{1}e_{1}(x)-x\leq 0,\ x\in \lbrack 0,1],
\end{equation*}%
with equality if and only if $x\in \{0,1\}.$ The conclusion follows
from Theorem \ref{th1} by taking $\varphi =e_{1}$.
\end{proof}

\begin{theorem}\label{thd}
If%
\begin{equation*}
\delta _{m,n,q,\alpha }^{1}(x)=\left( K_{n,q,\alpha }^{1}\right)
^{m}e_{1}(x)-\frac{x^{2}+\alpha x}{1+\alpha },\ x\in \lbrack 0,1],
\end{equation*}%
then we have the estimation%
\begin{equation}\label{d1}
\delta _{m,n,q,\alpha }^{1}(x)\leq \left( \frac{\left( \alpha +2\right)
([n]_{q}-1)}{\left( \alpha +2\right) [n]_{q}-1}\right) ^{m}\frac{x(1-x)}{%
1+\alpha }=\lambda _{m,n,q,\alpha }^{1}(x),\ x\in \lbrack 0,1].
\end{equation}%
\end{theorem}

\begin{proof} For $x\in \{0,1\}$ we get $\delta _{m,n,q,\alpha }^{1}(x)=0$ and (\ref{d1}) holds.

For $x\in (0,1),$ using (\ref{dif}) we get%
\begin{equation*}
\frac{K_{n,q,\alpha }^{1}e_{1}(x)-x}{x(1-x)}\leq
\frac{-1}{[n]_{q}\alpha +2[n]_{q}-1}.
\end{equation*}%
We observe that%
\begin{equation*}
\frac{K_{n,q,\alpha
}^{1}e_{1}(x)-x^{2}}{x(1-x)}=\frac{K_{n,q,\alpha
}^{1}e_{1}(x)-x}{x(1-x)}+1\leq \frac{[n]_{q}\alpha +2[n]_{q}-2}{%
[n]_{q}\alpha +2[n]_{q}-1}.
\end{equation*}%
It follows that%
\begin{eqnarray*}
K_{n,q,\alpha }^{1}e_{1}(x)-\frac{x^{2}+\alpha x}{1+\alpha }
&=&K_{n,q,\alpha }^{1}e_{1}(x)-x^{2}+x^{2}-\frac{x^{2}+\alpha
x}{1+\alpha }
\\
&=&K_{n,q,\alpha }^{1}e_{1}(x)-x^{2}-\frac{\alpha }{\alpha +1}x(1-x) \\
&\leq &\left( \frac{[n]_{q}\alpha +2[n]_{q}-2}{[n]_{q}\alpha +2[n]_{q}-1}-%
\frac{\alpha }{\alpha +1}\right) x(1-x) \\
&=&\frac{\left( \alpha +2\right) ([n]_{q}-1)}{\left( \alpha
+2\right) [n]_{q}-1}\cdot \left( x-\frac{x^{2}+\alpha x}{1+\alpha
}\right)
\end{eqnarray*}%
Taking into account that the operator $K_{n,q,\alpha }^{1}$ preserves $%
\left( e_{2}+\alpha e_{1}\right) /(1+\alpha )$ we obtain%
\begin{equation*}
\left( K_{n,q,\alpha }^{1}\right) ^{m}e_{1}(x)-\frac{x^{2}+\alpha x}{%
1+\alpha }\leq \left( \frac{\left( \alpha +2\right)
([n]_{q}-1)}{\left(
\alpha +2\right) [n]_{q}-1}\right) ^{m}\cdot \left( x-\frac{x^{2}+\alpha x}{%
1+\alpha }\right)
\end{equation*}%
and the conclusion follows.
\end{proof}

\begin{theorem}\label{thb}
We have the following estimations:
\begin{equation}\label{ineq1}
\left\vert (K_{n,q,\alpha }^{1})^{m}f(x)-Pf(x)\right\vert \leq
\end{equation}%
\begin{equation*}
\sqrt{\lambda _{m,n,q,\alpha }^{1}(x)}\omega _{1}\left( f,\sqrt{\lambda
_{m,n,q,\alpha }^{1}(x)}\right) +\left( 2+\frac{\alpha }{2}\right) \omega
_{2}\left( f,\sqrt{\lambda _{m,n,q,\alpha }^{1}(x)}\right) ,\ x\in \lbrack
0,1]
\end{equation*}%
and%
\begin{equation}\label{ineq2}
\left\vert (K_{n,q,\alpha }^{1})^{m}f(x)-Pf(x)\right\vert \leq
\end{equation}%
\begin{equation*}
2\lambda _{m,n,q,\alpha }^{1}(x)\left\Vert f\right\Vert +\left( \frac{3}{2}%
\sqrt{\lambda _{m,n,q,\alpha }^{1}(x)}+\frac{9+\alpha }{2}\right) \omega
_{2}(f,\sqrt{\lambda _{m,n,q,\alpha }^{1}(x)}),\ x\in \lbrack 0,1].
\end{equation*}%
\end{theorem}

\begin{proof} The conclusion follows using Theorem \ref{th2} and
Theorem \ref{thd}.
\end{proof}

For $\alpha =0$ the estimations (\ref{ineq1}) and (\ref{ineq2})
were obtained in \cite{birou2017}.

The function $h_{m,\alpha }^{1}:[1,\infty )\rightarrow
%TCIMACRO{\U{211d} }%
%BeginExpansion
\mathbb{R}
%EndExpansion
,m\geq 1$ defined by%
\begin{equation*}
h_{m,\alpha }^{1}(t)=\left( \frac{(2+\alpha )(t-1)}{t(2+\alpha )-1}\right)
^{m}
\end{equation*}%
is strictly increasing. If $0<q_{1}<q_{2}\leq 1$ then $%
[n]_{q_{1}}<[n]_{q_{2}}$ and therefore $h_{m,\alpha }^{1}([n]_{q_{1}})<h_{m,\alpha }^{1}([n]_{q_{2}}) $, $m\geq 1.$ From Theorem
\ref{thb} it follows that the estimation $\left\vert
(K_{n,q_{1},\alpha }^{1})^{m}f(x)-Pf(x)\right\vert ,$ $x\in
\lbrack 0,1]$ is smaller than the estimation $\left\vert
(K_{n,q_{2},\alpha }^{1})^{m}f(x)-Pf(x)\right\vert ,$ $x\in
\lbrack 0,1].$ Taking $q_{1}=q\in (0,1)$ and $q_{2}=1$ we get that the
$\textit{q}$-operator $K_{n,q,\alpha }^{1}$ provides better convergence of
the iterates than the classical operator $K_{n,1,\alpha }^{1}$.

\section{The King modified \textit{q}-Stancu operator}

The \textit{q}-Stancu operator constructed by Nowak in \cite{nowa} is given
by%
\begin{equation*}
P_{n}^{q,a}f(x)=\sum_{k=0}^{n}w_{n,k}^{q,a}(x)f\left( \frac{[k]_{q}}{[n]_{q}}%
\right) ,\ a\geq 0,\ q\in (0,1],\ f\in C[0,1],\ x\in \lbrack 0,1],
\end{equation*}%
where%
\begin{equation*}
w_{n,k}^{q,a}(x)=\left[
\begin{array}{c}
n \\
k%
\end{array}%
\right] _{q}\frac{\prod\limits_{i=0}^{k-1}(x+a[i]_{q})\prod%
\limits_{i=0}^{n-1-k}(1-q^{i}x+a[i]_{q})}{\prod%
\limits_{i=0}^{n-1}(1+a[i]_{q})}.
\end{equation*}

Particular cases:

$\bullet$ $q=1$ - the Stancu operator (see \cite{stan})

$\bullet$ $a=0$ - the \textit{q}-Bernstein operator (see
\cite{phil})

We consider the King modified \textit{q}-Stancu operator%
\begin{equation*}
K_{n,q,a,\alpha }^{2}f(x)=P_{n}^{q,a}f(u_{n,q,a,\alpha }(x)),
\end{equation*}%
where $u_{n,q,a,\alpha }:[0,1]\rightarrow \lbrack 0,1],$ $n>1$ are
continuous and strictly increasing functions having the properties $%
u_{n,q,a,\alpha }(0)=0,$ $u_{n,q,a,\alpha }(1)=1.$

From \cite{nowa} we have%
\begin{equation*}
\begin{array}{c}
K_{n,q,a,\alpha }^{2}e_{0}(x)=1, \\
K_{n,q,a,\alpha }^{2}e_{1}(x)=u_{n,q,a,\alpha }(x), \\
K_{n,q,a,\alpha }^{2}e_{2}(x)=\frac{1}{a+1}\left( \frac{u_{n,q,a,\alpha
}(x)(1-u_{n,q,a,\alpha }(x))}{[n]_{q}}+u_{n,q,a,\alpha
}(x)(x+u_{n,q,a,\alpha }(x))\right) .%
\end{array}%
\end{equation*}

If
\begin{equation*}
u_{n,q,a,\alpha }(x)=-\beta _{n,q,a,\alpha }+\sqrt{\beta _{n,q,a,\alpha
}^{2}+\frac{[n]_{q}(1+a)(\alpha x+x^{2})}{[n]_{q}-1}},
\end{equation*}%
where%
\begin{equation*}
\beta _{n,q,a,\alpha }=\frac{1+[n]_{q}(a+\alpha +a\alpha
)}{2([n]_{q}-1)},
\end{equation*}
then the operator $K^{2}_{n,q,a,\alpha }$ fixes the functions $%
e_{0}$ and $e_{2}+\alpha e_{1}$, $\alpha\geq 0$.


\begin{theorem} The sequence of the iterates of the operator $%
K_{n,q,a,\alpha }^{2}$ converges uniformly to the operator $P$
given by (\ref{oplim}).
\end{theorem}

\begin{proof} We use Theorem \ref{th1} with $\varphi =e_{1}.$
Indeed, we have
\begin{equation*}
K_{n,q,a,\alpha }^{2}e_{1}(x)-x=u_{n,q,a,\alpha }(x)-x
\end{equation*}
and therefore
\begin{equation}\label{dif2}
K_{n,q,a,\alpha }^{2}e_{1}(x)-x=\frac{x(x-1)}{%
[n]_{q}-1}\cdot \frac{1+[n]_{q}a}{\beta _{n,q,a,\alpha }+\sqrt{\beta
_{n,q,a,\alpha }^{2}+\frac{[n]_{q}(1+a)(\alpha
x+x^{2})}{[n]_{q}-1}}+x}\leq 0,
\end{equation}%
 for all $x\in \lbrack 0,1]$, with equality only for $x\in \{0,1\}.$
\end{proof}

\begin{theorem}\label{thd2} If%
\begin{equation*}
\delta _{m,n,q,a,\alpha }^{2}(x)=\left( K_{n,q,a,\alpha }^{2}\right)
^{m}e_{1}(x)-\frac{x^{2}+\alpha x}{1+\alpha },\ x\in \lbrack 0,1],
\end{equation*}%
then we have the estimation%
\begin{equation*}
\delta _{m,n,q,a,\alpha }^{2}(x)\leq \left( \frac{\left( \alpha +2\right)
([n]_{q}-1)}{\left( a\alpha +\alpha +a+2\right) [n]_{q}-1}\right) ^{m}\frac{%
x(1-x)}{1+\alpha }=\lambda _{m,n,q,a,\alpha }^{2}(x),
\end{equation*}
for all $x\in \lbrack 0,1]$.
\end{theorem}

\begin{proof} From (\ref{dif2}) it follows that
\begin{equation*}
\frac{\left( K_{n,q,a,\alpha }^{2}\right) ^{m}e_{1}(x)-x}{x(1-x)}\leq -\frac{%
1+[n]_{q}a}{2\left( [n]_{q}-1\right) (1+\beta _{n,q,a,\alpha })},\ x\in(0,1),
\end{equation*}%
Using the same steps as in  Theorem \ref{thd} we get the conclusion.
\end{proof}

\begin{theorem}\label{thest2} We have the following estimations:
\begin{equation*}
\left\vert (K_{n,q,a,\alpha }^{2})^{m}f(x)-Pf(x)\right\vert \leq \sqrt{%
\lambda _{m,n,q,a,\alpha }^{2}(x)}\omega _{1}\left( f,\sqrt{\lambda
_{m,n,q,a,\alpha }^{2}(x)}\right)
\end{equation*}%
\begin{equation*}
+\left( 2+\frac{\alpha }{2}\right) \omega _{2}\left( f,\sqrt{\lambda
_{m,n,q,a,\alpha }^{2}(x)}\right) ,\ x\in \lbrack 0,1]
\end{equation*}%
and%
\begin{equation*}
\left\vert (K_{n,q,a,\alpha }^{2})^{m}f(x)-Pf(x)\right\vert \leq 2\lambda
_{m,n,q,a,\alpha }^{2}(x)\left\Vert f\right\Vert
\end{equation*}%
\begin{equation*}
+\left( \frac{3}{2}\sqrt{\lambda _{m,n,q,a,\alpha }^{2}(x)}+\frac{9+\alpha }{%
2}\right) \omega _{2}(f,\sqrt{\lambda _{m,n,q,a,\alpha }^{2}(x)}),\ x\in
\lbrack 0,1].
\end{equation*}
\end{theorem}

\begin{proof} The conclusion follows from Theorem \ref{th2} and Theorem \ref{thd2}.
\end{proof}

The function $h_{m,a,\alpha }^{2}:[1,\infty )\rightarrow
%TCIMACRO{\U{211d} }%
%BeginExpansion
\mathbb{R}
%EndExpansion
,m\geq 1$ defined by%
\begin{equation*}
h_{m,a,\alpha }^{2}(t)=\left( \frac{(2+\alpha )(t-1)}{t(2+\alpha +a+a\alpha
)-1}\right) ^{m}
\end{equation*}%
is strictly increasing. If $0<q_{1}<q_{2}\leq 1$ then $%
h_{m,a,\alpha }^{2}([n]_{q_{1}})<h_{m,a,\alpha }^{2}([n]_{q_{2}})$, $m\geq 1.$ From Theorem \ref{thest2} it
follows that the estimation $\left\vert (K_{n,q_{1},a,\alpha
}^{2})^{m}f(x)-Pf(x)\right\vert ,$ $x\in \lbrack 0,1]$ is smaller than the
estimation $\left\vert (K_{n,q_{2},a,\alpha }^{2})^{m}f(x)-Pf(x)\right\vert ,
$ $x\in \lbrack 0,1].$ In particular, taking $q_{1}=q\in (0,1)$ and $q_{2}=1$ we get that the
\textit{q}-operator $K_{n,q,a,\alpha }^{2}$ has a better rate of convergence for the
iterates than the operator $K_{n,1,a,\alpha }^{2}$.

\section{The King modified \textit{q}-genuine Bernstein-Durrmeyer operator}

The \textit{q}-genuine Bernstein-Durrmeyer operator introduced in \cite%
{mahm2010} is given by%
\begin{equation}
U_{n,q}f(x)=p_{n,0}(q;x)f(0)+p_{n,n}(q;x)f(1)
\end{equation}
\begin{equation*}
+[n-1]_{q}\sum_{k=1}^{n-1}q^{1-k}p_{n,k}(q;x)%
\int_{0}^{1}p_{n-2,k-1}(q;qt)f(t)d_{q}t,
\end{equation*}%
for every $f\in C[0,1]$ and every $x\in \lbrack 0,1].$ For $q=1$ we get the
classical genuine Bernstein-Durrmeyer operator.

We consider the King modification of the \textit{q}-genuine Bernstein-Durrmeyer operator
\begin{equation*}
K_{n,q,\alpha }^{3}f(x)=U_{n,q}f(u_{n,q,\alpha }(x)),
\end{equation*}%
where $u_{n,q,\alpha }:[0,1]\rightarrow \lbrack 0,1],$ $n> 1$ are
continuous and strictly increasing functions having the properties $%
u_{n,q,\alpha }(0)=0,$ $u_{n,q,\alpha }(1)=1.$

From \cite%
{mahm2010} we have%
\begin{equation*}
\begin{array}{c}
K_{n,q,\alpha }^{3}e_{0}(x)=1, \\
K_{n,q,\alpha }^{3}e_{1}(x)=u_{n,q,\alpha }(x), \\
K_{n,q,\alpha }^{3}e_{2}(x)=\displaystyle\left( u_{n,q,\alpha }(x)\right) ^{2}+\frac{%
[2]_{q}u_{n,q,\alpha }(x)(1-u_{n,q,\alpha }(x))}{[n+1]_{q}}.%
\end{array}%
\end{equation*}

If
\begin{equation}
u_{n,q,\alpha }(x)=-\frac{[n+1]_{q}\alpha +[2]_{q}}{2([n+1]_{q}-[2]_{q})}+%
\sqrt{\frac{([n+1]_{q}\alpha +[2]_{q})^{2}}{4([n+1]_{q}-[2]_{q})^{2}}+\frac{%
[n+1]_{q}(\alpha x+x^{2})}{[n+1]_{q}-[2]_{q}}},
\end{equation}
then the operator $K_{n,q,\alpha }^{3}$ preserves the functions $e_{0}$ and $%
e_{2}+\alpha e_{1}$, $\alpha>0$.


\begin{theorem}
The sequence of the iterates of the operator $K_{n,q,\alpha }^{3}$ converges
uniformly to the operator $P$ given by (\ref{oplim}).
\end{theorem}

\begin{proof} We have%
\begin{eqnarray*}
K_{n,q,\alpha }^{3}e_{1}(x)-x &=&u_{n,q,\alpha }(x)-x \\
&=&\frac{x(x-1)}{[n+1]_{q}-[2]_{q}}\cdot \frac{\lbrack 2]_{q}}{\gamma_{n,q,\alpha }+\sqrt{\gamma_{n,q,\alpha }^2+\frac{[n+1]_{q}(\alpha x+x^{2})}{%
[n+1]_{q}-[2]_{q}}}+x},
\end{eqnarray*}
where
\begin{equation*}
\gamma_{n,q,\alpha }=\frac{[n+1]_{q}\alpha +[2]_{q}}{2([n+1]_{q}-[2]_{q})}.
\end{equation*}
It follows that
\begin{equation*}
K_{n,q,\alpha }^{3}e_{1}(x)-x \leq 0,\ x\in \lbrack 0,1],
\end{equation*}
with equality only for $x\in \{0,1\}.$ Using Theorem \ref{th1} with $%
\varphi =e_{1}$ we get the conclusion.
\end{proof}

\begin{theorem}\label{thd3} If
\begin{equation*}
\delta _{m,n,q,\alpha }^{3}(x)=(K_{n,q,\alpha }^{3})^{m}e_{1}(x)-\frac{%
x^{2}+\alpha x}{1+\alpha },\ x\in[0,1],
\end{equation*}
then we get
\begin{equation*}
\delta _{m,n,q,\alpha }^{3}(x)\leq \left( \frac{\left( \alpha +2\right)
([n+1]_{q}-[2]_{q})}{\left( \alpha +2\right) [n+1]_{q}-[2]_{q}}\right) ^{m}%
\frac{x(1-x)}{1+\alpha }=\lambda _{m,n,q,\alpha }^{3}(x),
\end{equation*}
for all $x\in[0,1]$.
\end{theorem}

\begin{proof} We get the conclusion using the same steps as in Theorem \ref{thd} and
taking into account the inequality%
\begin{equation*}
\frac{\left( K_{n,q,\alpha }^{3}\right) ^{m}e_{1}(x)-x}{x(1-x)}\leq -\frac{%
[2]_{q}}{(\alpha +1)[n+1]_{q}-[2]_{q}},\ x\in(0,1).
\end{equation*}
\end{proof}

\begin{theorem}\label{thest3}
We have the following estimations:
\begin{equation}
\left\vert (K^{3}_{n,q,\alpha })^m f(x)-Pf(x)\right\vert \leq  \label{ineq3}
\end{equation}
\begin{equation*}
\sqrt{\lambda _{m,n,q,\alpha }^{3}(x)}\omega _{1}\left( f,\sqrt{\lambda
_{m,n,q}^{2}(x)}\right) +\left( 2+\frac{\alpha }{2}\right) \omega _{2}\left(
f,\sqrt{\lambda _{m,n,q,\alpha }^{3}(x)}\right) ,\ x\in \lbrack 0,1]
\end{equation*}%
and%
\begin{equation}
\left\vert (K^{3}_{n,q,\alpha })^m f(x)-Pf(x)\right\vert \leq  \label{ineq4}
\end{equation}
\begin{equation*}
2\lambda _{m,n,q,\alpha }^{2}(x)\left\Vert f\right\Vert +\left( \frac{3}{2}%
\sqrt{\lambda _{m,n,q,\alpha }^{3}(x)}+\frac{9+\alpha }{2}\right) \omega
_{2}(f,\sqrt{\lambda _{m,n,q,\alpha }^{3}(x)}),\ x\in \lbrack 0,1].
\end{equation*}
\end{theorem}

\begin{proof} The conclusion follows from Theorem \ref{th2} and Theorem \ref{thd3}.
\end{proof}

For $\alpha =0$ the estimations (\ref{ineq3}) and (\ref{ineq4}) were
obtained in \cite{birou2018}.

The function $h_{m,n,\alpha }^{3}:(0,1]\rightarrow
%TCIMACRO{\U{211d} }%
%BeginExpansion
\mathbb{R}
%EndExpansion
$, $m\geq 1$ defined by%
\begin{equation*}
h_{m,n,\alpha }^{3}(q)=\left( \frac{(\alpha +2)(q^{2}-q^{n+1})}{(\alpha
+2)(1-q^{n+1})-1+q^{2}}\right) ^{m}
\end{equation*}%
is strictly increasing. From Theorem \ref{thest3} it follows that if $0<q_1<q_2\leq 1$ then the estimation $%
\left\vert (K_{n,q_{1},\alpha }^{3})^{m}f(x)-Pf(x)\right\vert ,$ $x\in
\lbrack 0,1]$ is smaller than the estimation $\left\vert (K_{n,q_{2},\alpha
}^{3})^{m}f(x)-Pf(x)\right\vert ,$ $x\in \lbrack 0,1].$  Taking $q_{1}=q\in
(0,1)$ and $q_{2}=1$ we get that the convergence of the iterates of the \textit{q}-operator $K_{n,q,\alpha }^{3}$
is better than that of the operator $%
K_{n,1,\alpha }^{3}$.


\begin{thebibliography}{99}

\bibitem{alto} Altomare, F., Cappelletti Montano, M., Leonessa, V., Rasa, I., \emph{Markov operators,
positive semigroups and approximation process}, De Gruyter Studies in
Mathematics, Vol. 61 (2015).

\bibitem{birou2017} Birou, M.M., \emph{New Rates of Convergence for the Iterates of
Some Positive Linear Operators}, Mediterr. J. Math,
\textbf{14}(2017), Issue: 3, Article Number: UNSP 129.

\bibitem{birou2018} Birou, M.M., \emph{New quantitative results for the convergence
of the iterates of some positive linear operators}, Positivity, \textbf{32}(2019),
no. 2, 315-326.

\bibitem{card} Cardenas-Morales, D.,  Garrancho, P.,  Mu\~noz-Delgado, F.J.,
\emph{Shape preserving approximation by Bernstein-type operators
which fix polynomials}, Appl. Math. Comput., \textbf{182}(2006),
no. 2, 1615-1622.

\bibitem{gavr} Gavrea, I., Ivan, M., \emph{Asymptotic behaviour of the iterates of
positive linear operators}, Abstr. Appl. Anal., 2011, Art. ID
670509, 11 pp.

\bibitem{gons} Gonska, H., Ra\c sa, I., \emph{On infinite products of positive
linear operators reproducing linear functions}, Positivity,
\textbf{17}(2013), 67-79.

\bibitem{king}  King, J.P, \emph{Positive linear operators which preserve $x%
\sp 2$}, Acta Math. Hungar., \textbf{99}(2003), no. 3, 203-208.

\bibitem{mahm2011} Mahmudov, N.I., \emph{Asymptotic properties of powers of linear
positive operators which preserve $e_2$}, Comput. Math. Appl.,
\textbf{62}(2011), 4568-4575.

\bibitem{mahm2010} Mahmudov, N.I., Sabancigil, P., \emph{On genuine \textit{q}%
-Bernstein-Durrmeyer operators}, Publ. Math. Debrecen,
\textbf{76}(2010), no. 4, 221-229.

\bibitem{nowa} Nowak, G., \emph{Approximation properties for generalized \textit{q}%
-Bernstein polynomials}, J. Math. Anal. Appl., \textbf{350}(2009),
50-55.

\bibitem{phil}  Philips, G.M., \emph{Bernstein polynomial based on \textit{q}%
-integers}, Ann. Numer. Math., \textbf{4}(1997), 511-518.

\bibitem{rasa} Ra\c sa, I., \emph{$C_{0}$-semigroups and iterates of positive
linear operators: asymptotic behaviour}, Rend. Circ. Mat. Palermo,
Ser. II, Suppl., \textbf{82}(2010), 1-20.

\bibitem{stan} Stancu, D.D., \emph{Approximation of functions by a new class of
linear polynomial operators}, Rev. Roum. Math. Pures Appl.,
\textbf{13}(1968), no. 8, 1173-1194.
\end{thebibliography}

\end{document}
