IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-34189-7_8.html
   My bibliography  Save this book chapter

Approximations by Max-Product Sampling Operators

In: Approximation by Max-Product Type Operators

Author

Listed:
  • Barnabás Bede

    (DigiPen Institute of Technology, Department of Mathematics)

  • Lucian Coroianu

    (University of Oradea, Department of Mathematics and Computer Science)

  • Sorin G. Gal

    (University of Oradea, Department of Mathematics and Computer Science)

Abstract

In this chapter we introduce and study the max-product sampling operators, which have applications to signal theory. Due to the fact that for bounded functions with positive values, the max-product sampling operators attached to them have nice properties, all the approximation results in this chapter are stated and proved under this restriction. But as it was already mentioned in Subsection 1.1.3 , Property C, this restriction can easily be dropped by considering the construction used for the max-product Bernstein operator in Theorem 2.9.1 . More precisely, if 𝒮 W , φ ( M ) $$\mathcal{S}_{W,\varphi }^{(M)}$$ is any max-product sampling operator defined in this chapter and f : ℝ → ℝ $$f: \mathbb{R} \rightarrow \mathbb{R}$$ is bounded and of variable sign, then it is easy to see that the new operators P W , φ ( M ) ( f ) ( x ) = 𝒮 W , φ ( M ) ( f − a ) ( x ) + a $$P_{W,\varphi }^{(M)}(f)(x) = \mathcal{S}_{W,\varphi }^{(M)}(f - a)(x) + a$$ , where a

Suggested Citation

  • Barnabás Bede & Lucian Coroianu & Sorin G. Gal, 2016. "Approximations by Max-Product Sampling Operators," Springer Books, in: Approximation by Max-Product Type Operators, chapter 0, pages 327-392, Springer.
  • Handle: RePEc:spr:sprchp:978-3-319-34189-7_8
    DOI: 10.1007/978-3-319-34189-7_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-34189-7_8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.