Convergence Behavior of the F∗ Algorithm: Strong and Weak Results for Nonexpansive Mappings

Anju Panwar, Poonam Yadav and Mohammad Sajid

Journal of Mathematics, 2026, vol. 2026, 1-11

Abstract: This study examines the strong and weak convergence of the F∗ iterative approach to the fixed point of a nonexpansive mapping in the context of a Banach space. This work shows improved rate and efficiency of convergence. Furthermore, we proved that F∗ iterative algorithm converges to a fixed point faster than Picard, Mann, S, and Varat iterative algorithms. Finally, we provide numerical examples to support the main results and provide numerical and graphical representations through MATLAB.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2026/2587338.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2026/2587338.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:2587338

DOI: 10.1155/jom/2587338

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().