Processing math: 100%
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

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+1xn)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=xnf(xn)f(xn)

Starting Newton’s Method requires a guess for x0, hopefully close to the root x=r.


This page titled 2.2: Newton's Method is shared under a CC BY 3.0 license and was authored, remixed, and/or curated by Jeffrey R. Chasnov via source content that was edited to the style and standards of the LibreTexts platform.

Support Center

How can we help?