{"title":"Efficient iterative procedures for approximating fixed points of contractive-type mappings with applications","authors":"Puneet Sharma, Higinio Ramos, Vinay Kanwar, Ramandeep Behl, Mithil Rajput","doi":"10.1007/s11075-024-01869-x","DOIUrl":null,"url":null,"abstract":"<p>This paper introduces and analyzes some new highly efficient iterative procedures for approximating fixed points of contractive-type mappings. The stability, data dependence, strong convergence, and performance of the proposed schemes are addressed. Numerical examples demonstrate that the newly introduced schemes produce approximations of great accuracy and comparable to other similar robust schemes appeared in the literature. Nevertheless, all the schemes developed here are more efficient than other robust schemes used for comparison.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":"91 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-07-01","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-01869-x","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
This paper introduces and analyzes some new highly efficient iterative procedures for approximating fixed points of contractive-type mappings. The stability, data dependence, strong convergence, and performance of the proposed schemes are addressed. Numerical examples demonstrate that the newly introduced schemes produce approximations of great accuracy and comparable to other similar robust schemes appeared in the literature. Nevertheless, all the schemes developed here are more efficient than other robust schemes used for comparison.
期刊介绍:
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.