Quadratic Convergence Iterative Algorithms of Taylor Series for Solving Non-linear Equations
Solving the root of algebraic and transcendental nonlinear equation f' (x) = 0 is a classical problem which has many interesting applications in computational mathematics and various branches of science and engineering. This paper examines the quadratic convergence iterative algorithms for solving a single root nonlinear equation which depends on the Taylor’s series and backward difference method. It is shown that the proposed iterative algorithms converge quadratically. In order to justify the results and graphs of quadratic convergence iterative algorithms, C++/MATLAB and EXCELL are used. The efficiency of the proposed iterative algorithms in comparison with Newton Raphson method and Steffensen method is illustrated via examples. Newton Raphson method fails if f' (x) = 0, whereas Steffensen method fails if the initial guess is not close enough to the actual solution. Furthermore, there are several other numerical methods which contain drawbacks and possess large number of evolution; however, the developed iterated algorithms are good in these conditions. It is found out that the quadratic convergence iterative algorithms are good achievement in the field of research for computing a single root of nonlinear equations.
Copyright (c) This is an open access article published by QUEST Research Journal. QUEST Research Journal holds the rights of all the published articles. Authors are required to transfer copyrights to journal to make sure that the article is solely published in QUEST Research Journal; however, the authors and readers may freely read, download, copy, distribute, print, search, or link to the full texts of the articles without asking prior permission from the publisher or the author.
This work is licensed under a Creative Commons Attribution 4.0 International License.