A New Iterative Method for Solving Nonlinear Equations

Authors: Ibrahim Abu-Alshaikh

Abstract:

In this study, a new root-finding method for solving nonlinear equations is proposed. This method requires two starting values that do not necessarily bracketing a root. However, when the starting values are selected to be close to a root, the proposed method converges to the root quicker than the secant method. Another advantage over all iterative methods is that; the proposed method usually converges to two distinct roots when the given function has more than one root, that is, the odd iterations of this new technique converge to a root and the even iterations converge to another root. Some numerical examples, including a sine-polynomial equation, are solved by using the proposed method and compared with results obtained by the secant method; perfect agreements are found.

Keywords: Iterative method, root-finding method, sine-polynomial equations, nonlinear equations.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1057695

References:

[1] J. H. Mathews, Numerical Methods for Mathematics, Science, and Engineering. New Jersey: Printice-Hall , 1987, ch. 2.
[2] S. C. Chapra and R. P. Canale, Numerical Methods for Engineers. New Jersey: McGraw-Hill, 3rd Ed. 1998, ch. 3.
[3] A. Maignan, "On symbolic-numeric solving of sine-polynomial equations," Journal of Complexity, vol. 16, no. 1, pp. 247-285, March 2000.