06.09.2021 Views

First Semester in Numerical Analysis with Julia, 2020a

First Semester in Numerical Analysis with Julia, 2020a

First Semester in Numerical Analysis with Julia, 2020a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

CHAPTER 2. SOLUTIONS OF EQUATIONS: ROOT-FINDING 61<br />

by<br />

This is called Newton’s method.<br />

p n = p n−1 − f(p n−1)<br />

,n≥ 1. (2.6)<br />

f ′ (p n−1 )<br />

Graphical <strong>in</strong>terpretation:<br />

Start <strong>with</strong> p 0 . Draw the tangent l<strong>in</strong>e at (p 0 ,f(p 0 )) and approximate p by the <strong>in</strong>tercept p 1<br />

of the l<strong>in</strong>e:<br />

f ′ (p 0 )= 0 − f(p 0)<br />

p 1 − p 0<br />

⇒ p 1 − p 0 = − f(p 0)<br />

f ′ (p 0 ) ⇒ p 1 = p 0 − f(p 0)<br />

f ′ (p 0 ) .<br />

Now draw the tangent at (p 1 ,f(p 1 )) and cont<strong>in</strong>ue.<br />

Remark 31. 1. Clearly Newton’s method will fail if f ′ (p n )=0for some n. Graphically<br />

this means the tangent l<strong>in</strong>e is parallel to the x-axis so we cannot get the x-<strong>in</strong>tercept.<br />

2. Newton’s method may fail to converge if the <strong>in</strong>itial guess p 0 is not close to p. In Figure<br />

(2.3), either choice for p 0 results <strong>in</strong> a sequence that oscillates between two po<strong>in</strong>ts.<br />

1<br />

p0<br />

p0<br />

0<br />

Figure 2.3: Non-converg<strong>in</strong>g behavior for Newton’s method<br />

3. Newton’s method requires f ′ (x) is known explicitly.<br />

Exercise 2.3-1:<br />

f(x) =0?<br />

Sketch the graph for f(x) =x 2 −1. What are the roots of the equation

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!