Calculus I · Unit 2B · exploration

Newton's Method: Convergence and Failure Modes

A Tangent-Line Iteration as a Dynamical System

Newton's iteration is

N(x)=xf(x)f(x).N(x)=x-\frac{f(x)}{f'(x)}.

A root rr is a fixed point because N(r)=rN(r)=r. Near a simple root, Taylor expansion shows

en+1f(r)2f(r)en2,en=xnr.e_{n+1}\approx \frac{f''(r)}{2f'(r)}e_n^2, \qquad e_n=x_n-r.

Squaring the error explains quadratic convergence.

For a well-chosen starting point, the number of correct digits can roughly double from one iteration to the next. The table visualizes this rapid error collapse for x 2-2=0.
Read this graph as text

Near a simple root, Newton's error is approximately squared each step. For a well-chosen starting point, the number of correct digits can roughly double from one iteration to the next. The table visualizes this rapid error collapse for x 2-2=0 . The error does not merely shrink by a fixed percentage. Once the iterates are close to the simple root, an error around 10 -3 is followed by one around 10 -6 , then around 10 -12 . That is the practical signature of quadratic convergence.

Every relationship in near a simple root, newton's error is approximately squared each step is identified with written labels plus distinct solid, dashed, dotted, double, marker, or pattern cues; color is never the only carrier of meaning.

Why it matters: The table makes "quadratic convergence" visible without requiring a full proof. It also creates a benchmark against which slow convergence or failure can be recognized. Students should see that Newton's method is spectacular near a suitable simple root but not universally magical.

Visual study

For a well-chosen starting point, the number of correct digits can roughly double from one iteration to the next. The table visualizes this rapid error collapse for x 2-2=0.

Failure can occur when f(xn)=0f'(x_n)=0, when tangent intercepts jump into a different region, when the starting point lies near a cycle, or when the root has multiplicity greater than one. For a multiple root, the ordinary method often converges only linearly. A modified iteration can restore faster convergence when the multiplicity is known.

Exercise

Apply two Newton steps to f(x)=x22f(x)=x^2-2 from x0=1.5x_0=1.5 and compare the errors with 2\sqrt2.

Answer reveal

Exercise 1 answer

Write a real attempt before opening the supplied answer.

Exercise

Explain why starting Newton's method for f(x)=x1/3f(x)=x^{1/3} near zero is problematic.

Answer reveal

Exercise 2 answer

Write a real attempt before opening the supplied answer.

Exercise

Investigate numerically what happens to f(x)=x32x+2f(x)=x^3-2x+2 from several starting values.

Answer reveal

Exercise 3 answer

Write a real attempt before opening the supplied answer.

After the explanation

Use the section idea

Reading lens

Use local sensitivity, convexity, and convergence results to explain when familiar application methods become reliable global tools.

Mental model

Advanced results connect derivative evidence to error amplification, convergence speed, or global optimality under explicit hypotheses.

Decision

State the hypotheses before the conclusion and test the result on a concrete numerical or graphical example.

Common trap

Quoting elasticity, quadratic convergence, or convexity without checking units, root simplicity, or the relevant domain.

Check yourself

Can you describe both what the theorem guarantees and the failure mode its hypotheses exclude?

Interactive checkadvanced-newton-cycle-01

For f(x)=x32x+2f(x)=x^3-2x+2 and x0=0x_0=0, describe the first two Newton iterates.

Your work stays on this device. No account or AI grader is used.

Show hint

Compute x1x_1 and x2x_2.

Attempt once to unlock the solution

Submit an answer first. The hint is available now.

Source & rights

Original instruction with traceable references.

BetterGrades-original composition declared by source handoff; owner provenance review required before public release

Reference textbooks remain rights-separated and are not published as application assets. Any direct adaptation requires separate identification and attribution.