IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-981-13-3077-3_6.html
   My bibliography  Save this book chapter

Bivariate Szász-Type Operators Based on Multiple Appell Polynomials

In: Advances in Summability and Approximation Theory

Author

Listed:
  • Ruchi Chauhan

    (Indian Institute of Technology Roorkee, Department of Mathematics)

  • Behar Baxhaku

    (University of Prishtina, Department of Mathematics)

  • P. N. Agrawal

    (Indian Institute of Technology Roorkee, Department of Mathematics)

Abstract

We introduce bivariate case of the Szász-type operators based on multiple Appell polynomials introduced by Varma (Stud. Univ. Babeş -Bolyai Math. 58, 361–369 (2013)). We establish a uniform convergence theorem and determine the degree of approximation in terms of the partial moduli of continuity of the approximated function. We estimate the error in simultaneous approximation of the function by the bivariate operators by using finite differences. We investigate the degree of approximation of the bivariate operators by means of the Peetre’s K-functional. The rate of convergence of these operators is determined for twice continuously differentiable functions by Voronovskaja-type asymptotic theorem. The weighted approximation properties are derived for unbounded functions with a polynomial growth. Lastly, we introduce the associated generalized boolean sum (GBS) of the bivariate operators to study the approximation of Bögel-continuous and Bögel-differentiable functions and establish the approximation degree with the aid of the Lipschitz class of Bögel-continuous functions and the mixed modulus of smoothness.

Suggested Citation

  • Ruchi Chauhan & Behar Baxhaku & P. N. Agrawal, 2018. "Bivariate Szász-Type Operators Based on Multiple Appell Polynomials," Springer Books, in: S. A. Mohiuddine & Tuncer Acar (ed.), Advances in Summability and Approximation Theory, pages 103-124, Springer.
    • Handle: RePEc:spr:sprchp:978-981-13-3077-3_6
    DOI: 10.1007/978-981-13-3077-3_6
    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-981-13-3077-3_6. 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.