Introduction - If you have any usage issues, please Google them yourself
Newton iterative method, similar to the traditional iterative method, only f (x) expansion of the Taylor series, only retain the first two terms, and then iterative. The iterative equation is x_ (k+1) =x_k- (f (x_k) (f^') / (x_k)).
From the programming of speaking, in the above equation in the complex domain to a fixed range of each point as the starting point for each iteration will converge to a solution of the equation, to apply different colors to different solution, you will see that the convergence range. If we want to get the exact location of the solution, we can judge by the number of iterations to the given precision, because the closer the point is to the exact solution, the faster the iteration rate is. The following provides a comparison between the program provided by the teacher and the program written by himself, and the equation is: y=x^d-1. Among them, d=3.