2.2: Newton's Method
( \newcommand{\kernel}{\mathrm{null}\,}\)
This is the fastest method, but requires analytical computation of the derivative of f(x). Also, the method may not always converge to the desired root.
We can derive Newton’s Method graphically, or by a Taylor series. We again want to construct a sequence x0,x1,x2,… that converges to the root x=r. Consider the xn+1 member of this sequence, and Taylor series expand f(xn+1) about the point xn. We have
f(xn+1)=f(xn)+(xn+1−xn)f′(xn)+….
To determine xn+1, we drop the higher-order terms in the Taylor series, and assume f(xn+1)=0. Solving for xn+1, we have
xn+1=xn−f(xn)f′(xn)
Starting Newton’s Method requires a guess for x0, hopefully close to the root x=r.