logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A New Optimal Two-Step Root-Finding Algorithm Using Exponential Method

delete2026-03-01
delete0
PRE
AI
T
Thota, Srinivasarao *
N
Naseem, Amir
B
Bikku, Thulasi
DOI：10.5666/KMJ.2026.66.1.117delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
. This paper presents a novel fourth-order two-step iterative method for solving nonlinear equations f (x) = 0, derived by optimizing a key parameter in a combination of established third-order methods. The proposed method enhances efficiency and accuracy, outperforming existing iterative techniques. Extensive numerical experiments on diverse polynomial and transcendental functions demonstrate superior convergence speed and precision. Additionally, the method shows significant promise for applications in polynomiography and broader mathematical analysis, as evidenced by its robust performance in visualization and root-finding tasks.
Keywords:
Root finding algorithms
implementation
exponential method
two-step root-finding methods
polynomiography

Journal

K
Kyungpook Mathematical Journal
IF:
0.2
Papers:
26
Citations:
0

Organization

No organization information available