ON NEW HYBRID ROOT-FINDING ALGORITHMS FOR SOLVING TRANSCENDENTAL EQUATIONS USING EXPONENTIAL AND HALLEY'S METHODS

Q3 Mathematics Ural Mathematical Journal Pub Date : 2023-07-27 DOI:10.15826/umj.2023.1.016
S. Thota, Tekle Gemechu, A. Ayoade
{"title":"ON NEW HYBRID ROOT-FINDING ALGORITHMS FOR SOLVING TRANSCENDENTAL EQUATIONS USING EXPONENTIAL AND HALLEY'S METHODS","authors":"S. Thota, Tekle Gemechu, A. Ayoade","doi":"10.15826/umj.2023.1.016","DOIUrl":null,"url":null,"abstract":"The objective of this paper is to propose two new hybrid root finding algorithms for solving transcendental equations. The proposed algorithms are based on the well-known root finding methods namely the Halley's method, regula-falsi method and exponential method. We show using numerical examples that the proposed algorithms converge faster than other related methods. The first hybrid algorithm consists of regula-falsi method and exponential method (RF-EXP). In the second hybrid algorithm, we use regula falsi method and Halley's method (RF-Halley). Several numerical examples are presented to illustrate the proposed algorithms, and comparison of these algorithms with other existing methods are presented to show the efficiency and accuracy. The implementation of the proposed algorithms is presented in Microsoft Excel (MS Excel) and the mathematical software tool Maple.","PeriodicalId":36805,"journal":{"name":"Ural Mathematical Journal","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ural Mathematical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15826/umj.2023.1.016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 2

Abstract

The objective of this paper is to propose two new hybrid root finding algorithms for solving transcendental equations. The proposed algorithms are based on the well-known root finding methods namely the Halley's method, regula-falsi method and exponential method. We show using numerical examples that the proposed algorithms converge faster than other related methods. The first hybrid algorithm consists of regula-falsi method and exponential method (RF-EXP). In the second hybrid algorithm, we use regula falsi method and Halley's method (RF-Halley). Several numerical examples are presented to illustrate the proposed algorithms, and comparison of these algorithms with other existing methods are presented to show the efficiency and accuracy. The implementation of the proposed algorithms is presented in Microsoft Excel (MS Excel) and the mathematical software tool Maple.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用指数法和HALLEY法求解超越方程的新的混合寻根算法
本文的目的是提出两种新的求解超越方程的混合寻根算法。所提出的算法是基于著名的寻根方法,即Halley方法、regula falsi方法和指数方法。我们通过数值例子表明,所提出的算法比其他相关方法收敛更快。第一种混合算法由正则法和指数法(RF-EXP)组成。在第二个混合算法中,我们使用了regula falsi方法和Halley方法(RF Halley)。给出了几个数值例子来说明所提出的算法,并将这些算法与其他现有方法进行了比较,以表明其有效性和准确性。在Microsoft Excel(MS Excel)和数学软件工具Maple中给出了所提出算法的实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Ural Mathematical Journal
Ural Mathematical Journal Mathematics-Mathematics (all)
CiteScore
1.30
自引率
0.00%
发文量
12
审稿时长
16 weeks
期刊最新文献
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM STATISTICAL CONVERGENCE IN A BICOMPLEX VALUED METRIC SPACE YERS–ULAM–RASSIAS STABILITY OF NONLINEAR DIFFERENTIAL EQUATIONS WITH A GENERALIZED ACTIONS ON THE RIGHT-HAND SIDE ON NEW HYBRID ROOT-FINDING ALGORITHMS FOR SOLVING TRANSCENDENTAL EQUATIONS USING EXPONENTIAL AND HALLEY'S METHODS THE MINIMAL DOMINATING SETS IN A DIRECTED GRAPH AND THE KEY INDICATORS SET OF SOCIO–ECONOMIC SYSTEM
×
引用
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