求解有内存和无内存非线性方程的高效参数迭代方案

IF 1.8 2区 数学 Q1 MATHEMATICS Journal of Complexity Pub Date : 2024-09-11 DOI:10.1016/j.jco.2024.101896
Raziyeh Erfanifar, Masoud Hajarian
{"title":"求解有内存和无内存非线性方程的高效参数迭代方案","authors":"Raziyeh Erfanifar,&nbsp;Masoud Hajarian","doi":"10.1016/j.jco.2024.101896","DOIUrl":null,"url":null,"abstract":"<div><p>Many practical problems, such as the Malthusian population growth model, eigenvalue computations for matrices, and solving the Van der Waals' ideal gas equation, inherently involve nonlinearities. This paper initially introduces a two-parameter iterative scheme with a convergence order of two. Building on this, a three-parameter scheme with a convergence order of four is proposed. Then we extend these schemes into higher-order schemes with memory using Newton's interpolation, achieving an upper bound for the efficiency index of <span><math><msup><mrow><mn>7.88748</mn></mrow><mrow><mfrac><mrow><mn>1</mn></mrow><mrow><mn>3</mn></mrow></mfrac></mrow></msup><mo>≈</mo><mn>1.99057</mn></math></span>. Finally, we validate the new schemes by solving various numerical and practical examples, demonstrating their superior efficiency in terms of computational cost, CPU time, and accuracy compared to existing methods.</p></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":null,"pages":null},"PeriodicalIF":1.8000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0885064X24000736/pdfft?md5=6dc221bf6c1e2ffc085c2b830768b4e4&pid=1-s2.0-S0885064X24000736-main.pdf","citationCount":"0","resultStr":"{\"title\":\"High-efficiency parametric iterative schemes for solving nonlinear equations with and without memory\",\"authors\":\"Raziyeh Erfanifar,&nbsp;Masoud Hajarian\",\"doi\":\"10.1016/j.jco.2024.101896\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Many practical problems, such as the Malthusian population growth model, eigenvalue computations for matrices, and solving the Van der Waals' ideal gas equation, inherently involve nonlinearities. This paper initially introduces a two-parameter iterative scheme with a convergence order of two. Building on this, a three-parameter scheme with a convergence order of four is proposed. Then we extend these schemes into higher-order schemes with memory using Newton's interpolation, achieving an upper bound for the efficiency index of <span><math><msup><mrow><mn>7.88748</mn></mrow><mrow><mfrac><mrow><mn>1</mn></mrow><mrow><mn>3</mn></mrow></mfrac></mrow></msup><mo>≈</mo><mn>1.99057</mn></math></span>. Finally, we validate the new schemes by solving various numerical and practical examples, demonstrating their superior efficiency in terms of computational cost, CPU time, and accuracy compared to existing methods.</p></div>\",\"PeriodicalId\":50227,\"journal\":{\"name\":\"Journal of Complexity\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0885064X24000736/pdfft?md5=6dc221bf6c1e2ffc085c2b830768b4e4&pid=1-s2.0-S0885064X24000736-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Complexity\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0885064X24000736\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Complexity","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0885064X24000736","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

许多实际问题,如马尔萨斯人口增长模型、矩阵的特征值计算以及范德瓦耳斯理想气体方程的求解,本质上都涉及非线性问题。本文首先介绍了收敛阶数为 2 的双参数迭代方案。在此基础上,提出了收敛阶数为四的三参数方案。然后,我们利用牛顿插值法将这些方案扩展为具有内存的高阶方案,实现了 7.8874813≈1.99057 的效率指数上限。最后,我们通过求解各种数值和实际例子验证了新方案,证明与现有方法相比,它们在计算成本、CPU 时间和精度方面都具有更高的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
High-efficiency parametric iterative schemes for solving nonlinear equations with and without memory

Many practical problems, such as the Malthusian population growth model, eigenvalue computations for matrices, and solving the Van der Waals' ideal gas equation, inherently involve nonlinearities. This paper initially introduces a two-parameter iterative scheme with a convergence order of two. Building on this, a three-parameter scheme with a convergence order of four is proposed. Then we extend these schemes into higher-order schemes with memory using Newton's interpolation, achieving an upper bound for the efficiency index of 7.88748131.99057. Finally, we validate the new schemes by solving various numerical and practical examples, demonstrating their superior efficiency in terms of computational cost, CPU time, and accuracy compared to existing methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Complexity
Journal of Complexity 工程技术-计算机:理论方法
CiteScore
3.10
自引率
17.60%
发文量
57
审稿时长
>12 weeks
期刊介绍: The multidisciplinary Journal of Complexity publishes original research papers that contain substantial mathematical results on complexity as broadly conceived. Outstanding review papers will also be published. In the area of computational complexity, the focus is on complexity over the reals, with the emphasis on lower bounds and optimal algorithms. The Journal of Complexity also publishes articles that provide major new algorithms or make important progress on upper bounds. Other models of computation, such as the Turing machine model, are also of interest. Computational complexity results in a wide variety of areas are solicited. Areas Include: • Approximation theory • Biomedical computing • Compressed computing and sensing • Computational finance • Computational number theory • Computational stochastics • Control theory • Cryptography • Design of experiments • Differential equations • Discrete problems • Distributed and parallel computation • High and infinite-dimensional problems • Information-based complexity • Inverse and ill-posed problems • Machine learning • Markov chain Monte Carlo • Monte Carlo and quasi-Monte Carlo • Multivariate integration and approximation • Noisy data • Nonlinear and algebraic equations • Numerical analysis • Operator equations • Optimization • Quantum computing • Scientific computation • Tractability of multivariate problems • Vision and image understanding.
期刊最新文献
Stefan Heinrich is the Winner of the 2024 Best Paper Award of the Journal of Complexity Best Paper Award of the Journal of Complexity Matthieu Dolbeault is the winner of the 2024 Joseph F. Traub Information-Based Complexity Young Researcher Award Optimal recovery of linear operators from information of random functions Intractability results for integration in tensor product spaces
×
引用
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