Search

In this article, weak and strong convergence theorems of the M-iteration method for 𝒢-nonexpansive mapping in a uniformly convex Banach space with a directed graph were established. Moreover, weak convergence theorem without making use of Opial’s condition is proved. The rate of convergence between the M-iteration and some other iteration processes in the literature was also compared. Specifically, our main result shows that the M-iteration converges faster than the Noor and SP iterations. Finally, the numerical examples to compare convergence behavior of the M-iteration with the three-step Noor iteration and the SP-iteration were given. As application, some numerical experiments in real-world problems were provided, focused on image deblurring and signal recovering problems.

This work proposes a novel Noor iterative scheme, called CT‐iteration, to approximate the fixed points in the new context of generalized nonexpansive mappings with property (E)$$ (E) $$. We establish the strong and weak convergence results in a uniformly convex Banach space. Additionally, numerical examples of the iterative technique are demonstrated using a signal recovery application in a compressed sensing situation. Furthermore, we show the use of the proposed method to generate polynomiographs. The proposed algorithm has been implemented and tested via numerical simulation in MATLAB. The simulation results show the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

For solving a common fixed point of a finite family of G-nonexpansive mappings, we propose a parallel inertial SP-iteration monotone hybrid algorithm (PISPMHA). Weak convergence theorem is established for PISPMHA in Hilbert spaces endowed with graphs. Convergence behavior of PISPMHA is analyzed and discussed. As applications, we apply PISPMHA to solve linear system, differential, and signal recovery problems. [ABSTRACT FROM AUTHOR]

This paper presents a two inertial technique with a projection Mann forward-backward splitting algorithm for solving variational inclusion problems that exhibit weak convergence under suitable conditions in Hilbert spaces. Furthermore, we provide a numerical example in infinitely dimensional spaces to support the main result. Finally, we provide an application for data classification using an extreme learning machine. According to data provided by theWorld Health Organization (WHO), stroke is recognized as the predominant contributor to mortality and disability on a global scale. To appraise the efficacy of our algorithm, we procured a dependable dataset for stroke prediction from the Kaggle website. The best algorithm that performed this task is ours compared to other machine learning methods. [ABSTRACT FROM AUTHOR]

In this paper, using sunny nonexpansive retractions, which are different from the metric projection in Banach spaces, a new type of study regarding the iterative methods in view of two quasi‐nonexpansive nonself mappings is presented. We also give the convergence analysis for the proposed method in the background of uniformly convex Banach spaces. Moreover, we apply our results to find solutions of common zeros of accretive operators, convexly constrained least square problems, and convex minimization problems. Furthermore, we also discuss novel applications of these methods to differential problems, image deblurring, and signal recovering problems. [ABSTRACT FROM AUTHOR]

A deferred correction method is utilized to increase the order of spatial accuracy of the Crank-Nikolson scheme for the numerical solution of the one-dimensional heat equation. Numerical examples are given for both Neumann and Dirichlet initial boundary value problems. The fourth-order methods proposed are compared with high-order compact schemes. The set of methods proposed demonstrate a better performance compared with high-order compact schemes in the case of the Neumann boundary conditions. [ABSTRACT FROM AUTHOR]