Some modifications of Newton’s method with higher-order convergence for solving nonlinear equations

✍ Scribed by Liang Fang; Guoping He

• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 462 KB
• Volume: 228
• Category: Article
• ISSN: 0377-0427
• DOI: 10.1016/j.cam.2008.09.023

✦ Synopsis

step iterative method Order of convergence a b s t r a c t

In [YoonMee Ham etal., Some higher-order modifications of Newton's method for solving nonlinear equations, J. Comput. Appl. Math., 222 (2008) 477-486], some higher-order modifications of Newton's method for solving nonlinear equations are constructed. But if p = 2, then their main theorem did not hold. In this paper, we first give an example to show that YoonMee Ham etal.'s methods are not always correct in the case p = 2. Then, we present the condition that H(x, y) should satisfy such that the order of convergence increases three or four or five units. Per iteration they only need two additional function evaluations to increase the order. Based on this and multi-step Newton's scheme, we give further modifications of the method to obtain higher-order convergent iterative methods. Finally, several examples are given to demonstrate the efficiency and performance of our modified methods and compare them with some other methods.