A new optimal two-step root-finding algorithm using exponential method

DOI10.5666/KMJ.2026.66.1.117MaRDI QIDQ7232881zbMATH OpenFDO

Authors Srinivasarao Thota, Amir Naseem, Thulasi Bikku

Publication date 23 April 2026

Published in Kyungpook Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5666/KMJ.2026.66.1.117

zbMATH Keywords

implementationpolynomiographyexponential methodroot finding algorithmstwo-step root-finding methods

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cites work

• scientific article; zbMATH DE number 3875911 (Why is no real title available?)
• scientific article; zbMATH DE number 3635377 (Why is no real title available?)
• A New Root–Finding Algorithm Using Exponential Series
• A composite fourth-order iterative method for solving nonlinear equations
• A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography
• A new trigonometrical algorithm for computing real root of non-linear transcendental equations
• An algorithm with guaranteed convergence for finding a zero of a function
• Basin attractors for various methods
• Finding roots of a real polynomial simultaneously by means of Bairstow's method
• Iterative methods for simultaneous inclusion of polynomial zeros
• Modified Chebyshev-Halley methods free from second derivative
• New algorithms for computing a root of non-linear equations using exponential series
• Newton-ellipsoid polynomiography
• ON NEW HYBRID ROOT-FINDING ALGORITHMS FOR SOLVING TRANSCENDENTAL EQUATIONS USING EXPONENTIAL AND HALLEY'S METHODS
• Optimal Order of One-Point and Multipoint Iteration
• Predictor-corrector Halley method for nonlinear equations
• Some new variants of Newton's method.

This page was built for publication: A new optimal two-step root-finding algorithm using exponential method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232881)