Application of CR Iteration Scheme in the Generation of Mandelbrot Sets of \(z^p + \log c^t\) Function

Mandelbrot set is one of the most fascinating objects in mathematics, so in the literature, one can find many studies related to this set. Moreover, there are many different extensions and generalizations of the classical Mandelbrot set. The two most popular extensions are the use of various kinds of functions and iterations. In this paper, firstly, we replace the constant c in the classical \(z^p + c\) $z^p+c$ function used in the definition of Mandelbrot set with \(\log c^t\) $log{c}^t$ , where \(t \in \mathbb {R}\) $t\in \mathbb{R}$ and \(t \ge 1\) $t\ge 1$ . Secondly, we replace the Picard iteration with the CR iteration scheme. For this combination of function and iteration, we prove the escape criterion for the escape-time algorithm used to generate some images of the proposed sets. Moreover, we study the dependency between the iteration’s parameters and two numerical measures (average number of iterations and generation time). We show that this dependency is complex and non-linear.