IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0315271.html
   My bibliography  Save this article

A study of Mandelbrot and Julia Sets via Picard–Thakur iteration with s-convexity

Author

Listed:
  • Bashir Nawaz
  • Krzysztof Gdawiec
  • Kifayat Ullah
  • Maggie Aphane

Abstract

Nowadays, many researchers are employing various iterative techniques to analyse the dynamics of fractal patterns. In this paper, we explore the formation of Mandelbrot and Julia sets using the Picard–Thakur iteration process, extended with s-convexity. To achieve this, we establish an escape criterion using a complex polynomial of the form xk+1+c, where k ≥ 1 and x, c ∈ ℂ. Based on our proposed algorithms, we provide graphical illustrations of the Mandelbrot and Julia sets. Additionally, we extend our research to examine the relationship between the sizes of Mandelbrot and Julia sets and the iteration parameters, utilising some well-known methods from the literature.

Suggested Citation

  • Bashir Nawaz & Krzysztof Gdawiec & Kifayat Ullah & Maggie Aphane, 2025. "A study of Mandelbrot and Julia Sets via Picard–Thakur iteration with s-convexity," PLOS ONE, Public Library of Science, vol. 20(3), pages 1-34, March.
    • Handle: RePEc:plo:pone00:0315271
    DOI: 10.1371/journal.pone.0315271
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0315271
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0315271&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0315271?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    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:plo:pone00:0315271. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.