Better degree of approximation by modified Bernstein-Durrmeyer type operators
Mathematical Foundations of Computing · 2022 · 5 (2) · 75
DOI: 10.3934/mfc.2021024 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Foundations of Computing, 2022. Verfasst von Purshottam Narain Agrawal und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 16 Literaturangaben.
Abstract (Originalsprache)
In the present article we investigate a Durrmeyer variant of the generalized Bernstein-operators based on a function \begin{document}$ \tau(x), $\end{document} where \begin{document}$ \tau $\end{document} is infinitely differentiable function on \begin{document}$ [0, 1], \; \tau(0) = 0, \tau(1) = 1 $\end{document} and \begin{document}$ \tau^{\prime }(x)>0, \;\forall\;\; x\in[0, 1]. $\end{document} We study the degree of approximation by means of the modulus of continuity and the Ditzian-Totik modulus of smoothness. A Voronovskaja type asymptotic theorem and the approximation of functions with derivatives of bounded variation are also studied. By means of a numerical example, finally we illustrate the convergence of these operators to certain functions through graphs and show a careful choice of the function \begin{document}$ \tau(x) $\end{document} leads to a better approximation than the generalized Bernstein-Durrmeyer type operators considered by Kajla and Acar [11].
Zitieren
APA
Agrawal, P. N., Güngör, Ş. Y., & Kumar, A. (2022). Better degree of approximation by modified Bernstein-Durrmeyer type operators. Mathematical Foundations of Computing, 5(2), 75. https://doi.org/10.3934/mfc.2021024
Vancouver
Agrawal PN, Güngör ŞY, Kumar A. Better degree of approximation by modified Bernstein-Durrmeyer type operators. Mathematical Foundations of Computing. 2022;5(2):75. doi:10.3934/mfc.2021024
BibTeX
@article{Agrawal2022,
author = {Agrawal, Purshottam Narain and Güngör, Şule Yüksel and Kumar, Abhishek},
title = {Better degree of approximation by modified Bernstein-Durrmeyer type operators},
journal = {Mathematical Foundations of Computing},
year = {2022},
volume = {5},
number = {2},
pages = {75},
doi = {10.3934/mfc.2021024}
}
EUVIMED