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

Bashir Nawaz, Krzysztof Gdawiec, Kifayat Ullah and Maggie Aphane

PLOS ONE, 2025, vol. 20, issue 3, 1-34

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.

Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0315271 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 15271&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0315271

DOI: 10.1371/journal.pone.0315271

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().