Innovative Genetic Algorithmic Approach to Select Potential Patches Enclosing Real and Complex Zeros of Nonlinear Equation

V. Nadimpalli, R. Wankar, C. R. Rao
{"title":"Innovative Genetic Algorithmic Approach to Select Potential Patches Enclosing Real and Complex Zeros of Nonlinear Equation","authors":"V. Nadimpalli, R. Wankar, C. R. Rao","doi":"10.4018/IJNCR.2017070102","DOIUrl":null,"url":null,"abstract":"In this article, an innovative Genetic Algorithm is proposed to find potential patches enclosing roots of real valued function f:R→R. As roots of f can be real as well as complex, the function is reframed on to complex plane by writing it as f(z). Thus, the problem now is transformed to finding potential patches (rectangles in C) enclosing z such that f(z)=0, which is resolved into two components as real and imaginary parts. The proposed GA generates two random populations of real numbers for the real and imaginary parts in the given regions of interest and no other initial guesses are needed. This is the prominent advantage of the method in contrast to various other methods. Additionally, the proposed ‘Refinement technique' aids in the exhaustive coverage of potential patches enclosing roots and reinforces the selected potential rectangles to be narrow, resulting in significant search space reduction. The method works efficiently even when the roots are closely packed. A set of benchmark functions are presented and the results show the effectiveness and robustness of the new method.","PeriodicalId":369881,"journal":{"name":"Int. J. Nat. Comput. Res.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Nat. Comput. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJNCR.2017070102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this article, an innovative Genetic Algorithm is proposed to find potential patches enclosing roots of real valued function f:R→R. As roots of f can be real as well as complex, the function is reframed on to complex plane by writing it as f(z). Thus, the problem now is transformed to finding potential patches (rectangles in C) enclosing z such that f(z)=0, which is resolved into two components as real and imaginary parts. The proposed GA generates two random populations of real numbers for the real and imaginary parts in the given regions of interest and no other initial guesses are needed. This is the prominent advantage of the method in contrast to various other methods. Additionally, the proposed ‘Refinement technique' aids in the exhaustive coverage of potential patches enclosing roots and reinforces the selected potential rectangles to be narrow, resulting in significant search space reduction. The method works efficiently even when the roots are closely packed. A set of benchmark functions are presented and the results show the effectiveness and robustness of the new method.
非线性方程实零和复零潜在补块选择的创新遗传算法
本文提出了一种寻找实值函数f:R→R的根的潜在补块的遗传算法。由于f的根可以是实数,也可以是复数,因此在复平面上将函数重新构造为f(z)。因此,现在的问题是寻找潜在的补丁(C中的矩形)包围z使f(z)=0,它被分解成两个分量作为实部和虚部。所提出的遗传算法在给定的感兴趣区域为实部和虚部生成两个实数随机总体,并且不需要其他初始猜测。这是该方法相对于其他各种方法的突出优点。此外,提出的“细化技术”有助于彻底覆盖包围根的潜在斑块,并加强所选潜在矩形的窄性,从而显著减少搜索空间。这种方法即使在根很密的情况下也能有效地工作。给出了一组基准函数,结果表明了该方法的有效性和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信