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

Let \(Q_c(z)=z^{k+1}+c\). The filled Julia set of \(Q_c\) is the set of all complex numbers \(z_0\) for which the sequence \((z_n)\) defined by \(z_{n+1}=Q_c(z_n)\) does not tend to \(\infty\). It is shown that \(|z_n|\to\infty\) if \(|z_0|>\max\{|c|,2^{1/k}\}\). Besides the recursion \(z_{n+1}=Q_c(z_n)\), the authors also consider the recursions \(z_{n+1}=(1-\alpha)z_n+\alpha Q_c(z_n)\) as well as \(z_{n+1}=Q_c(w_n)\) with \(w_n=(1-\alpha)^s z_n+\alpha^s Q_c(z_n)\), where \(\alpha,s\in (0,1]\). They give lower bounds for \(|z_0|\) which imply that \(|z_n|\to\infty\). Besides these modified filled Julia sets they also consider modified Mandelbrot sets. Many pictures help the reader to follow the results.