Use of Ishikawa and Picard–Ishikawa iterations with s-convexity in the generation of Mandelbrot and Julia sets: A comparative analysis
Subhadip Roy,
Krzysztof Gdawiec,
Parbati Saha and
Binayak S. Choudhury
Mathematics and Computers in Simulation (MATCOM), 2026, vol. 241, issue PB, 739-757
Abstract:
In this paper, we consider a two-step Ishikawa iteration and a three-step Picard–Ishikawa iteration extended with s-convexity for complex polynomials of the form zp+1+c for the generation of sequences in the complex plane which lead to the formation of Mandelbrot and Julia sets. Various patterns that emerge from these processes of generation are displayed, analyzed and their variations with the change in the various parameters of the iteration processes are discussed. The outcomes highlight the notable differences in the images obtained by the two iterations. Additionally, we examine the relationship between the iteration parameters and two numerical measures, the average escape time, and the non-escaping area index. The numerical examples demonstrate that this dependency is nonlinear and often differs significantly between the two iterations.
Keywords: Escape criterion; Fractals; Ishikawa iteration; Julia set; Mandelbrot set (search for similar items in EconPapers)
Date: 2026
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475425004720
Full text for ScienceDirect subscribers only
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:eee:matcom:v:241:y:2026:i:pb:p:739-757
DOI: 10.1016/j.matcom.2025.11.007
Access Statistics for this article
Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens
More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().