Stability of the F∗ Algorithm on Strong Pseudocontractive Mapping and Its Application

Abstract

This paper investigates the stability of the F∗ iterative algorithm applied to strongly pseudocontractive mappings within the context of uniformly convex Banach spaces. The study leverages both analytic and numerical methods to demonstrate the convergence and stability of the algorithm. In comparison to previous works, where weak-contraction mappings were utilized, the strongly pseudocontractive mappings used in this study preserve the convergence property, exhibit greater stability, and have broader applicability in optimization and fixed point theory. Additionally, this work shows that the type of mapping employed converges faster than those in earlier studies. The results are applied to a mixed-type Volterra–Fredholm nonlinear integral equation, and numerical examples are provided to validate the theoretical findings. Key contributions of this work include the following: (i) the use of strongly pseudocontractive mappings, which offer a more stable and efficient convergence rate compared to weak-contraction mappings; (ii) the application of the F∗ algorithm to a wider range of problems; and (iii) the proposal of future directions for improving convergence rates and exploring the algorithm’s behavior in Hilbert and reflexive Banach spaces.