一种新的更快的四步迭代算法的收敛性分析与应用

U. Udofia, A. Ofem, D. Igbokwe
{"title":"一种新的更快的四步迭代算法的收敛性分析与应用","authors":"U. Udofia, A. Ofem, D. Igbokwe","doi":"10.30538/psrp-oma2021.0097","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a four step iterative algorithm which converges faster than some leading iterative algorithms in the literature. We show that our new iterative scheme is \\(T\\)-stable and data dependent. As an application, we use the new iterative algorithm to find the unique solution of a nonlinear integral equation. Our results are generalizations and improvements of several well known results in the existing literature.","PeriodicalId":52741,"journal":{"name":"Open Journal of Mathematical Analysis","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Convergence analysis for a new faster four steps iterative algorithm with an application\",\"authors\":\"U. Udofia, A. Ofem, D. Igbokwe\",\"doi\":\"10.30538/psrp-oma2021.0097\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce a four step iterative algorithm which converges faster than some leading iterative algorithms in the literature. We show that our new iterative scheme is \\\\(T\\\\)-stable and data dependent. As an application, we use the new iterative algorithm to find the unique solution of a nonlinear integral equation. Our results are generalizations and improvements of several well known results in the existing literature.\",\"PeriodicalId\":52741,\"journal\":{\"name\":\"Open Journal of Mathematical Analysis\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Open Journal of Mathematical Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.30538/psrp-oma2021.0097\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Open Journal of Mathematical Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30538/psrp-oma2021.0097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文介绍了一种四步迭代算法,该算法的收敛速度比文献中一些领先的迭代算法快。我们证明了我们的迭代方案是\(T\) -稳定的和数据相关的。作为一个应用,我们使用新的迭代算法求非线性积分方程的唯一解。我们的结果是对现有文献中几个著名结果的概括和改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Convergence analysis for a new faster four steps iterative algorithm with an application
In this paper, we introduce a four step iterative algorithm which converges faster than some leading iterative algorithms in the literature. We show that our new iterative scheme is \(T\)-stable and data dependent. As an application, we use the new iterative algorithm to find the unique solution of a nonlinear integral equation. Our results are generalizations and improvements of several well known results in the existing literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
10
审稿时长
8 weeks
期刊最新文献
Multiplicity results for a class of nonlinear singular differential equation with a parameter Floquet Exponent of Solution to Homogeneous Growth-Fragmentation Equation Some new results of ostrowski type inequalities using 4-step quadratic kernel and their applications An Introduction to the Construction of Subfusion Frames Upper Estimates For Initial Coefficients and Fekete-Szegö Functional of A Class of Bi-univalent Functions Defined by Means of Subordination and Associated with Horadam Polynomials
×
引用
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