CS3343/3341
 Analysis of Algorithms 
Weird Topic
  Newton's Method  


Links Explaining the Theory of Newton's Method:

Newton's method is amazing because each iteration (each loop) doubles the number of correct digits of the answer.

Newton's Method is used to find successive approximations to the roots of a function. If the function is y = f(x) and x0 is close to a root, then we usually expect the formula below to give x1 as a better approximation. Then you plug the x1 back in as x0 and iterate.

Here's an illustration of the method:


(click image for another illustration)

Following the link above (or here) illustrates another problem: Newton's method doesn't necessarily work well, or even work at all, unless you get to an initial guess that is close to the root.

A number of web pages explain how the above formula for Newton's method is derived. For example:

  1. Newton's method (Wikipedia). Long complex article.
  2. Newton's method. Simple pictorial explanation using Flash.
  3. Newton's method (MIT course). Explanation in PDF.
  4. Newton's method. Explanation and source for the illustration above.

Revision date: 2012-09-02. (Please use ISO 8601, the International Standard Date and Time Notation.)