Abstract
The aim of this paper is to approximate fixed points of nonexpansive type mappings in Banach spaces when the set of fixed points is nonempty. We study the general Picard–Mann (GPM) algorithm, obtaining the weak and strong convergence theorems. We provide an example to illustrate the convergence behaviour of the GPM algorithm. We compare the GPM algorithm with other existing (well known) algorithms numerically (under different parameters and initial guesses).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.