Mathematicians have introduced a new class of enriched generalized demimetric mappings and developed an iterative algorithm to find a common fixed point for these mappings and a common solution to a finite family of monotone inclusion problems in complete CAT(0) spaces.
The theoretical investigation established that, under suitable mathematical assumptions, the sequence generated by the iterative scheme achieves strong convergence toward the desired common solution.
To evaluate computational performance, the authors conducted numerical experiments that demonstrated the applicability of the proposed scheme. The tests showed that the iterative algorithm achieved a lower average iteration count than the existing methods evaluated, while successfully satisfying the prescribed residual tolerance.
The study also presented an application of the method to equilibrium problems, illustrating the practical utility of the proposed mapping framework for resolving structured nonlinear problems.
The analytical framework operates by connecting the approximation of common fixed points with the resolution of monotone inclusion problems. Within the complete space under consideration, the iterative procedure systematically tracks points that satisfy the conditions imposed by the family of enriched generalized demimetric mappings. At the same time, the algorithm incorporates the requirements of a finite collection of monotone inclusion problems, ensuring that the generated points remain compatible with every member of the family. By formulating the process to handle both types of nonlinear conditions concurrently, the mathematical structure provides a unified path for resolving complex operator relations without separating the individual component tasks.
The mathematical analysis confirms that the generated sequence possesses reliable stability properties when the specified baseline conditions are fulfilled. Under these suitable assumptions, the theoretical sequence does not merely approach the solution set in an approximate manner, but achieves strong convergence directly to the intended common solution. This strong convergence ensures that successive approximations progressively reduce the distance to the target point where all mapping and inclusion requirements are simultaneously satisfied. Establishing this degree of convergence demonstrates that the proposed algorithm maintains consistent trajectory behavior throughout the iteration process, thereby validating the underlying analytical design.
In computational assessments, the numerical experiments confirmed the practical viability of the iterative scheme across structured nonlinear problems. When tested against established existing methods, the algorithm consistently required a lower average iteration count to reach the prescribed residual tolerance. Furthermore, applying the method to equilibrium problems demonstrated that the mapping framework effectively handles structured nonlinear problems, providing a reliable computational tool for resolving desired common solutions across interconnected mathematical systems.
Subject of Research: Iterative algorithms for common fixed points in CAT(0) spaces
Article Title: Algorithm for approximating common fixed points of a family of enriched generalized demimetric mappings and monotone inclusion problems in CAT(0) spaces
Article References: Agwu, I. K., Ezugorie, G. I., Ugwunnadi, G. C., Narain, O. K., & Onukwube, O. G. (2026). Algorithm for approximating common fixed points of a family of enriched generalized demimetric mappings and monotone inclusion problems in CAT(0) spaces. Fixed Point Theory and Algorithms for Sciences and Engineering. https://doi.org/10.1186/s13663-026-00857-1
Image Credits: AI Generated
DOI: 10.1186/s13663-026-00857-1
Keywords: fixed point theory, iterative algorithms, enriched generalized demimetric mappings, monotone inclusion problems, CAT(0) spaces, strong convergence, numerical experiments, residual tolerance, iteration count, equilibrium problems, structured nonlinear problems, common fixed points, complete CAT(0) spaces, nonlinear analysis, generalized demimetric mappings, mapping framework
News Source: William Thompson. (November 16, 2026). New Algorithm Approximates Common Fixed Points in Complete CAT(0) Spaces. Scienmag.



