Mandelbrot and Julia Sets via Jungck–CR Iteration With $s$ –Convexity

In today’s world, fractals play an important role in many fields, e.g., image compression or encryption, biology, physics, and so on. One of the earliest studied fractal types was the Mandelbrot and Julia sets. These fractals have been generalized in many different ways. One of such generalizations is the use of various iteration processes from the fixed point theory. In this paper, we study the use of Jungck-CR iteration process, extended further by the use of <inline-formula> <tex-math notation="LaTeX">$s$ </tex-math></inline-formula>-convex combination. The Jungck-CR iteration process with <inline-formula> <tex-math notation="LaTeX">$s$ </tex-math></inline-formula>-convexity is an implicit three-step feedback iteration process. We prove new escape criteria for the generation of Mandelbrot and Julia sets through the proposed iteration process. Moreover, we present some graphical examples obtained by the use of escape time algorithm and the derived criteria.