Efficient iterative procedures for approximating fixed points of contractive-type mappings with applications

IF 1.7 3区 数学 Q2 MATHEMATICS, APPLIED Numerical Algorithms Pub Date : 2024-07-01 DOI:10.1007/s11075-024-01869-x
Puneet Sharma, Higinio Ramos, Vinay Kanwar, Ramandeep Behl, Mithil Rajput
{"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.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
近似收缩型映射定点的高效迭代程序及其应用
本文介绍并分析了一些用于逼近收缩型映射定点的新型高效迭代程序。本文探讨了所提方案的稳定性、数据依赖性、强收敛性和性能。数值示例表明,新引入的方案产生的近似精度非常高,可与文献中出现的其他类似稳健方案相媲美。尽管如此,本文开发的所有方案都比用于比较的其他鲁棒方案更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Numerical Algorithms
Numerical Algorithms 数学-应用数学
CiteScore
4.00
自引率
9.50%
发文量
201
审稿时长
9 months
期刊介绍: 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.
期刊最新文献
Numerical solution of nonclassical boundary value problems A posteriori error estimates for the exponential midpoint method for linear and semilinear parabolic equations Communication in multiplex transportation networks Homogeneous multigrid method for hybridizable interior penalty method A note on generalized Floater–Hormann interpolation at arbitrary distributions of nodes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1