The Picard-Mann iteration with s-convexity in the generation of Mandelbrot and Julia sets

In recent years, researchers have studied the use of different iteration processes from fixed point theory in the generation of complex fractals. For instance, the Mann, Ishikawa, Noor, Jungck-Mann and Jungck-Ishikawa iterations have been used. In this paper, we study the use of the Picard-Mann iterationwith s-convexity in the generation of Mandelbrot and Julia sets. We prove the escape criterion for the (k + 1)st degree complex polynomial. Moreover, we present some graphical and numerical examples regarding Mandelbrot and Julia sets generated using the proposed iteration.

Automated summary

This paper explores the application of Picard-Mann iteration with s-convexity in generating Mandelbrot and Julia sets, proving the escape criterion for complex polynomials and presenting graphical and numerical examples of the generated sets.