Abstract
Recently, Mursaleen et al. (On $(p,q)$ -analogue of Bernstein operators, arXiv:1503.07404 ) introduced and studied the $(p,q)$ -analog of Bernstein operators by using the idea of $(p,q)$ -integers. In this paper, we generalize the q-Bernstein-Schurer operators using $(p,q)$ -integers and obtain a Korovkin type approximation theorem. Furthermore, we obtain the convergence of the operators by using the modulus of continuity and prove some direct theorems.
Highlights
Introduction and preliminariesIn, Bernstein [ ] introduced the following sequence of operators Bn : C[, ] → C[, ] defined for any n ∈ N and f ∈ C[, ]: n Bn(f ; x) =n xk( – x)n–kf k, x ∈ [, ]. k n ( . ) k=By applying the idea of q-integers, the q-Bernstein operators were introduced by Lupaş [ ] and later by Philip [ ]
We investigate some approximation properties of these operators and obtain the rate of convergence by using the modulus of continuity
Proof The proof is based on the well-known Korovkin theorem regarding the convergence of a sequence of linear and positive operators, so it is enough to prove the conditions
Summary
In order to obtain the convergence results of the operator Bpm,q, , we take a sequence qm ∈ ( , ) and pm ∈ Such that limm→∞ pm = and limm→∞ qm = , so we get limm→∞[m]pm,qm = ∞. Proof The proof is based on the well-known Korovkin theorem regarding the convergence of a sequence of linear and positive operators, so it is enough to prove the conditions. (e ; By making a simple calculation we get lim [m + ]pm,qm = , m→∞ [m]pm,qm as < qm < pm ≤.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.