We study the split fixed point problem with multiple output sets in nonlinear spaces, particularly in CAT(0) spaces. We modify the existing self-adaptive algorithm for solving the split common fixed point problem with multiple output sets in the settings of generalized structures. We also present the consequences of our main theorem in terms of the split feasibility problem and the split common fixed point problem.

In this article, we consider a wider class of nonexpansive mappings (locally related quasi-nonexpansive) than monotone nonexpansive mappings. We obtained the convergence of fixed point for quasi -preserving locally related quasi-nonexpansive mappings in hyperbolic space. An iterative process is also used to obtain the convergence results for this mapping. Fixed point is approximated numerically in a nontrivial example by using Matlab.

In this article, we consider an extensive class of monotone nonexpansive mappings and introduce a new iteration algorithm to approximate the fixed point for monotone total asymptotically nonexpansive mappings in the framework of hyperbolic space. Faster convergence and stability results are proved for that iteration; also, fixed point is approximated numerically in a nontrivial example by using MATLAB.

This paper is dedicated to the advancement of fixed-point results for multi-valued asymptotically non-expansive maps regarding convergence criteria in complete uniformly convex hyperbolic metric spaces that are endowed with a graph. The famous fixed-point theorems of Goebel and Kirk, Khamsi and Khan, along with other recent results in the literature can be obtained as corollaries of these main results. A nice graph and an interesting example are also provided in support of the hypothesis of the main results.

Iterative procedures have been proved as a milestone in the generation of fractals. This paper presents a novel approach for generating and visualizing fractals, specifically Mandelbrot and Julia sets, by utilizing complex polynomials of the form $Q_{\mathbb{C}}\left(p\right)=a{p}^n+mp+c$, where $n\ge 2$. It establishes escape criteria that play a vital role in generating these sets and provides escape time results using different iterative schemes. In addition, the study includes the visualization of graphical images of Julia and Mandelbrot sets, revealing distinct patterns. Furthermore, the study also explores the impact of parameters on the deviation of dynamics, color, and appearance of fractals.

Numerous strong and weak convergence results on variational inequality problems are known in the literature. We here study a variational inequality problem by using the viscosity approximation method in the nonlinear CAT(0) space, where some novel theorems are established for strong and $\Delta$-convergent sequences.