Banach空间中的高阶Traub–Steffensen型方法及其收敛性分析

IF 1.4 4区 工程技术 Q2 ENGINEERING, MULTIDISCIPLINARY
Deepak Kumar, J. Sharma, Harmandeep Singh
{"title":"Banach空间中的高阶Traub–Steffensen型方法及其收敛性分析","authors":"Deepak Kumar, J. Sharma, Harmandeep Singh","doi":"10.1515/ijnsns-2021-0202","DOIUrl":null,"url":null,"abstract":"Abstract In this paper, we consider two-step fourth-order and three-step sixth-order derivative free iterative methods and study their convergence in Banach spaces to approximate a locally-unique solution of nonlinear equations. Study of convergence analysis provides radius of convergence, error bounds and estimates on the uniqueness of the solution. Such estimates are not provided in the approaches that use Taylor expansions using higher order derivatives. Furthermore, in quest of fast algorithms, a generalized q-step scheme with increasing convergence order 2q + 2 is proposed and analyzed. Novelty of the q-step algorithm is that, in each step, order of convergence is increased by an amount of two at the cost of only one additional function evaluation. To maximize the computational efficiency, the optimal number of steps is calculated. Theoretical results regarding convergence and computational efficiency are verified through numerical experimentation.","PeriodicalId":50304,"journal":{"name":"International Journal of Nonlinear Sciences and Numerical Simulation","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2022-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Higher order Traub–Steffensen type methods and their convergence analysis in Banach spaces\",\"authors\":\"Deepak Kumar, J. Sharma, Harmandeep Singh\",\"doi\":\"10.1515/ijnsns-2021-0202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this paper, we consider two-step fourth-order and three-step sixth-order derivative free iterative methods and study their convergence in Banach spaces to approximate a locally-unique solution of nonlinear equations. Study of convergence analysis provides radius of convergence, error bounds and estimates on the uniqueness of the solution. Such estimates are not provided in the approaches that use Taylor expansions using higher order derivatives. Furthermore, in quest of fast algorithms, a generalized q-step scheme with increasing convergence order 2q + 2 is proposed and analyzed. Novelty of the q-step algorithm is that, in each step, order of convergence is increased by an amount of two at the cost of only one additional function evaluation. To maximize the computational efficiency, the optimal number of steps is calculated. Theoretical results regarding convergence and computational efficiency are verified through numerical experimentation.\",\"PeriodicalId\":50304,\"journal\":{\"name\":\"International Journal of Nonlinear Sciences and Numerical Simulation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2022-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Nonlinear Sciences and Numerical Simulation\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1515/ijnsns-2021-0202\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Nonlinear Sciences and Numerical Simulation","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1515/ijnsns-2021-0202","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 1

摘要

摘要在本文中,我们考虑了两步四阶和三步六阶无导数迭代方法,并研究了它们在Banach空间中的收敛性,以逼近非线性方程的局部唯一解。收敛性分析的研究提供了收敛半径、误差界和对解的唯一性的估计。在使用高阶导数的泰勒展开的方法中没有提供这样的估计。此外,为了寻求快速算法,提出并分析了一种收敛阶为2q+2的广义q步格式。q步算法的新颖性在于,在每一步中,收敛阶数都增加了两个,而只需要进行一次额外的函数评估。为了最大限度地提高计算效率,计算了最佳步数。通过数值实验验证了收敛性和计算效率的理论结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Higher order Traub–Steffensen type methods and their convergence analysis in Banach spaces
Abstract In this paper, we consider two-step fourth-order and three-step sixth-order derivative free iterative methods and study their convergence in Banach spaces to approximate a locally-unique solution of nonlinear equations. Study of convergence analysis provides radius of convergence, error bounds and estimates on the uniqueness of the solution. Such estimates are not provided in the approaches that use Taylor expansions using higher order derivatives. Furthermore, in quest of fast algorithms, a generalized q-step scheme with increasing convergence order 2q + 2 is proposed and analyzed. Novelty of the q-step algorithm is that, in each step, order of convergence is increased by an amount of two at the cost of only one additional function evaluation. To maximize the computational efficiency, the optimal number of steps is calculated. Theoretical results regarding convergence and computational efficiency are verified through numerical experimentation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.80
自引率
6.70%
发文量
117
审稿时长
13.7 months
期刊介绍: The International Journal of Nonlinear Sciences and Numerical Simulation publishes original papers on all subjects relevant to nonlinear sciences and numerical simulation. The journal is directed at Researchers in Nonlinear Sciences, Engineers, and Computational Scientists, Economists, and others, who either study the nature of nonlinear problems or conduct numerical simulations of nonlinear problems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信