High Order Approximation by Sublinear and Max-Product Operators Using Convexity

Chapter
Part of the Studies in Systems, Decision and Control book series (SSDC, volume 147)

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]).

References

  1. 1.
    G. Anastassiou, Moments in Probability and Approximation Theory, Pitman Research Notes in Mathematics Series (Longman Group UK, New York, 1993)Google Scholar
  2. 2.
    G. Anastassiou, Approximation by Sublinear Operators (2017, submitted)Google Scholar
  3. 3.
    G. Anastassiou, Approximation by Max-Product Operators (2017, submitted)Google Scholar
  4. 4.
    G. Anastassiou, Approximation of Fuzzy Numbers by Max-Product Operators (2017, submitted)Google Scholar
  5. 5.
    G. Anastassiou, Approximated by Multivariate Sublinear and Max-Product Operators Under Convexity (2017, submitted)Google Scholar
  6. 6.
    G. Anastassiou, Approximation by Sublinear and Max-product Operators Using Convexity (2017, submitted)Google Scholar
  7. 7.
    B. Bede, L. Coroianu, S. Gal, Approximation by Max-Product Type Operators (Springer, Heidelberg, 2016)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Mathematical SciencesUniversity of MemphisMemphisUSA

Personalised recommendations