IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i8p809-d532164.html
   My bibliography  Save this article

A Novel Numerical Method for Computing Subdivision Depth of Quaternary Schemes

Author

Listed:
  • Aamir Shahzad

    (Department of Mathematics, University of Sargodha, Sargodha 40100, Pakistan)

  • Faheem Khan

    (Department of Mathematics, University of Sargodha, Sargodha 40100, Pakistan)

  • Abdul Ghaffar

    (Department of Mathematics, Ghazi University D G Khan, D G Khan 32200, Pakistan)

  • Shao-Wen Yao

    (School of Mathematics and Information Science, Henan Polytechnic University, Jiaozuo 454000, China)

  • Mustafa Inc

    (Department of Computer Engineering, Biruni University, Istanbul 34096, Turkey
    Department of Mathematics, Science Faculty, Firat University, Elazig 23119,Turkey
    Department of Medical Research, China Medical University Hospital, China Medical University, Taichung 40402, Taiwan)

  • Shafqat Ali

    (Department of Mathematics, The Islamia University of Bahawalpur, Bahawalpur 63100, Pakistan)

Abstract

In this paper, an advanced computational technique has been presented to compute the error bounds and subdivision depth of quaternary subdivision schemes. First, the estimation is computed of the error bound between quaternary subdivision limit curves/surfaces and their polygons after k th-level subdivision by using l 0 order of convolution. Secondly, by using the error bounds, the subdivision depth of the quaternary schemes has been computed. Moreover, this technique needs fewer iterations (subdivision depth) to get the optimal error bounds of quaternary subdivision schemes as compared to the existing techniques.

Suggested Citation

  • Aamir Shahzad & Faheem Khan & Abdul Ghaffar & Shao-Wen Yao & Mustafa Inc & Shafqat Ali, 2021. "A Novel Numerical Method for Computing Subdivision Depth of Quaternary Schemes," Mathematics, MDPI, vol. 9(8), pages 1-20, April.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:8:p:809-:d:532164
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/8/809/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/8/809/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Faheem Khan & Ghulam Mustafa & Aamir Shahzad & Dumitru Baleanu & Maysaa M. Al-Qurashi, 2020. "A Computational Method for Subdivision Depth of Ternary Schemes," Mathematics, MDPI, vol. 8(5), pages 1-22, May.
    2. Ghulam Mustafa & Faheem Khan, 2009. "A New 4-Point Quaternary Approximating Subdivision Scheme," Abstract and Applied Analysis, Hindawi, vol. 2009, pages 1-14, June.
    3. Deng, Chongyang & Jin, Wenbiao & Li, Yajuan & Xu, Huixia, 2017. "A formula for estimating the deviation of a binary interpolatory subdivision curve from its data polygon," Applied Mathematics and Computation, Elsevier, vol. 304(C), pages 10-19.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Samsul Ariffin Abdul Karim & Faheem Khan & Ghulam Mustafa & Aamir Shahzad & Muhammad Asghar, 2023. "An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision Schemes," Mathematics, MDPI, vol. 11(11), pages 1-12, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Samsul Ariffin Abdul Karim & Faheem Khan & Ghulam Mustafa & Aamir Shahzad & Muhammad Asghar, 2023. "An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision Schemes," Mathematics, MDPI, vol. 11(11), pages 1-12, May.
    2. Sardar Muhammad Hussain & Aziz Ur Rehman & Dumitru Baleanu & Kottakkaran Sooppy Nisar & Abdul Ghaffar & Samsul Ariffin Abdul Karim, 2020. "Generalized 5-Point Approximating Subdivision Scheme of Varying Arity," Mathematics, MDPI, vol. 8(4), pages 1-25, March.
    3. Faheem Khan & Ghulam Mustafa & Aamir Shahzad & Dumitru Baleanu & Maysaa M. Al-Qurashi, 2020. "A Computational Method for Subdivision Depth of Ternary Schemes," Mathematics, MDPI, vol. 8(5), pages 1-22, May.

    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:gam:jmathe:v:9:y:2021:i:8:p:809-:d:532164. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.