Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/93145
Title: A New Root–Finding Algorithm Using Exponential Series
Authors: Thota, S.
Issue Date: 2019
Publisher: N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of Russian Academy of Sciences
Ural Federal University named after the first President of Russia B.N. Yeltsin
Citation: Thota S. A New Root–Finding Algorithm Using Exponential Series / S. Thota. — DOI 10.15826/umj.2019.1.008. — Text : electronic // Ural Mathematical Journal. — 2019. — Volume 5. — № 1. — P. 83-90.
Abstract: In this paper, we present a new root-finding algorithm to compute a non-zero real root of the transcendental equations using exponential series. Indeed, the new proposed algorithm is based on the exponential series and in which Secant method is special case. The proposed algorithm produces better approximate root than bisection method, regula-falsi method, Newton-Raphson method and secant method. The implementation of the proposed algorithm in Matlab and Maple also presented. Certain numerical examples are presented to validate the efficiency of the proposed algorithm. This algorithm will help to implement in the commercial package for finding a real root of a given transcendental equation.
Keywords: ALGEBRAIC EQUATIONS
TRANSCENDENTAL EQUATIONS
EXPONENTIAL SERIES
SECANT METHOD
URI: http://elar.urfu.ru/handle/10995/93145
Access: Creative Commons Attribution License
License text: https://creativecommons.org/licenses/by/4.0/
ISSN: 2414-3952
DOI: 10.15826/umj.2019.1.008
Sponsorship: The author is thankful to the editor and reviewers for providing valuable inputs to improve the present format of manuscript.
Origin: Ural Mathematical Journal. 2019. Volume 5. № 1
Appears in Collections:Ural Mathematical Journal

Files in This Item:
File Description SizeFormat 
umj_2019_5_1_83-90.pdf338,68 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons