一种求解非线性方程组的改进花授粉算法

Mohamed Abdel-Basset, Yongquan Zhou, S. Zaki, A. H. Zaied
{"title":"一种求解非线性方程组的改进花授粉算法","authors":"Mohamed Abdel-Basset, Yongquan Zhou, S. Zaki, A. H. Zaied","doi":"10.1504/ijcsm.2021.116759","DOIUrl":null,"url":null,"abstract":"It is difficult to solve a system of nonlinear equations, especially for higher-order nonlinear equations when we do not have an efficient and reliable algorithm, even though much work has been done in this area. Newton's method and its improved form are widely used at present, but their convergence and performance characteristics can be highly sensitive to the initial guess of the solution, and the methods fail if the initial guess of the solution is inopportune. It is difficult to select a good initial guess for most systems of nonlinear equations. For this reason, it is necessary to find an efficient algorithm for systems of nonlinear equations. Metaheuristic optimisation algorithms have been proposed by many researchers to solve systems of nonlinear equations. The flower pollination algorithm (FPA) is a novel metaheuristic optimisation algorithm with quick convergence, but its population diversity and convergence precision can be limited in some applications. To enhance its exploitation and exploration abilities, in this paper, an elite opposition-based flower pollination algorithm (EFPA) has been applied for solving systems of nonlinear equations. The results show that the proposed algorithm is robust, has high convergence rate and precision, and can give satisfactory solutions of nonlinear equations.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improved flower pollination algorithm for solving nonlinear system of equations\",\"authors\":\"Mohamed Abdel-Basset, Yongquan Zhou, S. Zaki, A. H. Zaied\",\"doi\":\"10.1504/ijcsm.2021.116759\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is difficult to solve a system of nonlinear equations, especially for higher-order nonlinear equations when we do not have an efficient and reliable algorithm, even though much work has been done in this area. Newton's method and its improved form are widely used at present, but their convergence and performance characteristics can be highly sensitive to the initial guess of the solution, and the methods fail if the initial guess of the solution is inopportune. It is difficult to select a good initial guess for most systems of nonlinear equations. For this reason, it is necessary to find an efficient algorithm for systems of nonlinear equations. Metaheuristic optimisation algorithms have been proposed by many researchers to solve systems of nonlinear equations. The flower pollination algorithm (FPA) is a novel metaheuristic optimisation algorithm with quick convergence, but its population diversity and convergence precision can be limited in some applications. To enhance its exploitation and exploration abilities, in this paper, an elite opposition-based flower pollination algorithm (EFPA) has been applied for solving systems of nonlinear equations. The results show that the proposed algorithm is robust, has high convergence rate and precision, and can give satisfactory solutions of nonlinear equations.\",\"PeriodicalId\":399731,\"journal\":{\"name\":\"Int. J. Comput. Sci. Math.\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Comput. Sci. Math.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijcsm.2021.116759\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Comput. Sci. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijcsm.2021.116759","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

尽管在这方面已经做了很多工作,但当我们没有一个有效可靠的算法时,求解非线性方程组,特别是求解高阶非线性方程组是很困难的。牛顿方法及其改进形式目前被广泛使用,但其收敛性和性能特性对解的初始猜测高度敏感,如果解的初始猜测不合适,该方法就会失败。对于大多数非线性方程组,选择一个好的初始猜想是困难的。为此,有必要寻找一种求解非线性方程组的有效算法。许多研究者提出了元启发式优化算法来求解非线性方程组。花授粉算法(FPA)是一种收敛速度快的新型元启发式优化算法,但其种群多样性和收敛精度在某些应用中受到限制。为了提高其开发和探索能力,本文将基于精英对立的传粉算法(EFPA)应用于求解非线性方程组。结果表明,该算法具有较好的鲁棒性,具有较高的收敛速度和精度,并能给出满意的非线性方程解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved flower pollination algorithm for solving nonlinear system of equations
It is difficult to solve a system of nonlinear equations, especially for higher-order nonlinear equations when we do not have an efficient and reliable algorithm, even though much work has been done in this area. Newton's method and its improved form are widely used at present, but their convergence and performance characteristics can be highly sensitive to the initial guess of the solution, and the methods fail if the initial guess of the solution is inopportune. It is difficult to select a good initial guess for most systems of nonlinear equations. For this reason, it is necessary to find an efficient algorithm for systems of nonlinear equations. Metaheuristic optimisation algorithms have been proposed by many researchers to solve systems of nonlinear equations. The flower pollination algorithm (FPA) is a novel metaheuristic optimisation algorithm with quick convergence, but its population diversity and convergence precision can be limited in some applications. To enhance its exploitation and exploration abilities, in this paper, an elite opposition-based flower pollination algorithm (EFPA) has been applied for solving systems of nonlinear equations. The results show that the proposed algorithm is robust, has high convergence rate and precision, and can give satisfactory solutions of nonlinear equations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信