{"title":"Convergence analysis of Picard–SP iteration process for generalized $$\\alpha $$ –nonexpansive mappings","authors":"Bashir Nawaz, Kifayat Ullah, Krzysztof Gdawiec","doi":"10.1007/s11075-024-01859-z","DOIUrl":null,"url":null,"abstract":"<p>In this manuscript, we introduce a novel hybrid iteration process called the Picard–SP iteration process. We apply this new iteration process to approximate fixed points of generalized <span>\\(\\alpha \\)</span>–nonexpansive mappings. Convergence analysis of our newly proposed iteration process is discussed in the setting of uniformly convex Banach spaces and results are correlated with some other existing iteration processes. The dominance of the newly proposed iteration process is exhibited with the help of a new numerical example. In the end, the comparison of polynomiographs generated by other well-known iteration processes with our proposed iteration process has been presented to make a strong impression of our proposed iteration process.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":"1 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11075-024-01859-z","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
In this manuscript, we introduce a novel hybrid iteration process called the Picard–SP iteration process. We apply this new iteration process to approximate fixed points of generalized \(\alpha \)–nonexpansive mappings. Convergence analysis of our newly proposed iteration process is discussed in the setting of uniformly convex Banach spaces and results are correlated with some other existing iteration processes. The dominance of the newly proposed iteration process is exhibited with the help of a new numerical example. In the end, the comparison of polynomiographs generated by other well-known iteration processes with our proposed iteration process has been presented to make a strong impression of our proposed iteration process.
期刊介绍:
The journal Numerical Algorithms is devoted to numerical algorithms. It publishes original and review papers on all the aspects of numerical algorithms: new algorithms, theoretical results, implementation, numerical stability, complexity, parallel computing, subroutines, and applications. Papers on computer algebra related to obtaining numerical results will also be considered. It is intended to publish only high quality papers containing material not published elsewhere.