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 iteration with s-convexity in the generation of Mandelbrot and Julia sets. We prove the escape criterion for the $$(k+1)$$ ( k + 1 ) st degree complex polynomial. Moreover, we present some graphical and numerical examples regarding Mandelbrot and Julia sets generated using the proposed iteration.

Approximating Common Fixed Points of an Evolution Family on a Metric Space via Mann Iteration

In this article, we present the set of all common fixed points of a subfamily of an evolution family in terms of intersection of all common fixed points of only two operators from the family; that is, for subset M of L , we have F M = F Y ϱ 1 , 0 ∩ F Y ϱ 2 , 0 , where ϱ 1 and ϱ 2 are positive and ϱ 1 / ϱ 2 is an irrational number. Furthermore, we approximate such common fixed points by using the modified Mann iteration process. In fact, we are generalizing the results from a semigroup of operators to evolution families of operators on a metric space.

On the robust Newton’s method with the Mann iteration and the artistic patterns from its dynamics

There are two main aims of this paper. The first one is to show some improvement of the robust Newton’s method (RNM) introduced recently by Kalantari. The RNM is a generalisation of the well-known Newton’s root finding method. Since the base method is undefined at critical points, the RNM allows working also at such points. In this paper, we improve the RNM method by applying the Mann iteration instead of the standard Picard iteration. This leads to an essential decrease in the number of root finding steps without visible destroying the sharp boundaries among the basins of attractions presented in polynomiographs. Furthermore, we investigate visually the dynamics of the RNM with the Mann iteration together with the basins of attraction for varying Mann’s iteration parameter with the help of polynomiographs for several polynomials. The second aim of this paper is to present the intriguing polynomiographs obtained from the dynamics of the RNM with the Mann iteration under various sequences used in this iteration. The obtained polynomiographs differ considerably from the ones obtained with the RNM and are interesting from the artistic perspective. Moreover, they can easily find applications in wallpaper or fabric design.

On Convergence Theorems for Generalized Alpha Nonexpansive Mappings in Banach Spaces

The present paper seeks to illustrate approximation theorems to the fixed point for generalized α -nonexpansive mapping with the Mann iteration process. Furthermore, the same results are established with the Ishikawa iteration process in the uniformly convex Banach space setting. The presented results expand and refine many of the recently reported results in the literature.

Cascading Operators in CAT(0) Spaces

In this work, we introduce the notion of cascading non-expansive mappings in the setting of CAT(0) spaces. This family of mappings properly contains the non-expansive maps, but it differs from other generalizations of this class of maps. Considering the concept of Δ-convergence in metric spaces, we prove a principle of demiclosedness for this type of mappings and a Δ-convergence theorem for a Mann iteration process defined using cascading operators.

Weak and strong convergence of inertial algorithms for solving split common fixed point problems

In this paper, we propose two iterative schemes for approximating solutions of split common fixed point problems in multiple linear operators case. The first algorithm implements the Krasnosel’skiĭ–Mann iteration with an inertial effect for which the weak convergence is established under mild assumptions. With the tool of nearly contractive mappings, we introduce a viscosity-type iteration which ensures strong convergence. We apply our results to solve a multiple split monotone variational inclusion problem. A numerical example is given to demonstrate the efficiency of the proposed algorithms.