## Newton's Method by Newton

Around 1670, Newton devised a method to approximate roots of equations using

(1) | x³ - 2x - 5 = 0 |

as an example. Arguing that there is a root near

(2) | p³ + 6p² + 10p - 1 = 0. |

Since p is expected to be small, he find its estimate by dropping the terms p³ and 6p². The resulting equation

What has this to do with Newton's method as we know it today?

The substitution x = 2 + p was a computational device. What Newton actually did was finding the Taylor series of

f(2) = -1, f '(2) = (3x² - 2)|_{x = 2} = 10, _{x = 2} = 12,

f(x) | = -1 + (x - 2)×10 + (x - 2)²×12 / 2 + (x - 3)³×6/3! | |

= -1 + p×10 + p²×6 + p³ |

so that (1) is indeed equivalent to (2). Removing the terms from the Taylor series of orders higher than 2 leaves the first order approximation to the function which is the line tangent to the graph. So Newton was essentially trail blazing for the method now known by his name, however the form of what he did was quite different from what we are doing nowadays. He never presented his method as an iterative process but rather as a procedure for improving already existing approximation.

Joseph Raphson (1648-1715) was the first to describe the process as successive approximations, although his interest was still restricted to polynomial equations. Thomas Simpson

### References

- T. Gowers (ed.),
*The Princeton Companion to Mathematics*, Princeton University Press, 2008, pp. 109-110

## Related material
| |

| |

| |

|Activities| |Contact| |Front page| |Contents| |Algebra| |Store|

Copyright © 1996-2017 Alexander Bogomolny

61261351 |