High order approximation by sublinear and max-product operators using convexity
Abstract
Here we consider quantitatively using convexity the approximation of a function by general positive sublinear operators with applications to Max-product operators. These are of Bernstein type, of Favard–Szász–Mirakjan type, of Baskakov type, of Meyer–Köning and Zeller type, of sampling type, of Lagrange interpolation type and of Hermite–Fejér interpolation type. Our results are both: under the presence of smoothness and without any smoothness assumption on the function to be approximated which fulfills a convexity property. It follows Anastassiou (Approximation by Sublinear and Max-product Operators using Convexity, 2017, [6]).
Publication Title
Studies in Systems, Decision and Control
Recommended Citation
Anastassiou, G. (2018). High order approximation by sublinear and max-product operators using convexity. Studies in Systems, Decision and Control, 147, 229-241. https://doi.org/10.1007/978-3-319-89509-3_10
