scholarly journals On the speed of convergence of Newton’s method for complex polynomials

2015 ◽  
Vol 85 (298) ◽  
pp. 693-705 ◽  
Author(s):  
Todor Bilarev ◽  
Magnus Aspenberg ◽  
Dierk Schleicher
2001 ◽  
Vol 146 (1) ◽  
pp. 1-33 ◽  
Author(s):  
John Hubbard ◽  
Dierk Schleicher ◽  
Scott Sutherland

2020 ◽  
Vol 22 (3) ◽  
pp. 333-338
Author(s):  
Gani Gunawan

Abstract. Newton's method is one of the numerical methods used in finding polynomial roots. This method will be very effective to use, if the initial estimate of the roots for the Newton iteration function satisfies sufficient Newtonian convergence, [11]. In this article we will analyze the efficacy of this method by looking at the relationship between the fixed point method and Newton's iteration function. When the iteration of the function converges to the root, the velocity of convergence can also be determined. In terms of the speed of convergence, it turns out to be very dependent on the multiplicity of Newton's method itself.     


2012 ◽  
Vol 3 (2) ◽  
pp. 167-169
Author(s):  
F.M.PATEL F.M.PATEL ◽  
◽  
N. B. PANCHAL N. B. PANCHAL

2012 ◽  
Vol 220-223 ◽  
pp. 2585-2588
Author(s):  
Zhong Yong Hu ◽  
Fang Liang ◽  
Lian Zhong Li ◽  
Rui Chen

In this paper, we present a modified sixth order convergent Newton-type method for solving nonlinear equations. It is free from second derivatives, and requires three evaluations of the functions and two evaluations of derivatives per iteration. Hence the efficiency index of the presented method is 1.43097 which is better than that of classical Newton’s method 1.41421. Several results are given to illustrate the advantage and efficiency the algorithm.


Sign in / Sign up

Export Citation Format

Share Document