≥Better Grades
Menu

Calculus I · Unit 2B · lesson

Newton's Method

Concept

Learning objectives

Derive and execute Newton's method; recognize common failure modes.

Use Tangent Lines to Find Roots

Explanation

Before the formulas

Newton's method in Newton's Method repeatedly uses local linearity to solve a nonlinear equation. Each tangent line supplies an easier zero, which becomes the next estimate. The method can be spectacularly fast near a suitable root and unreliable from a poor starting point.

Record the iteration formula and a table of estimates. Check the function value as well as the digits of xnx_n. A sequence that appears stable on a calculator display may still have converged to the wrong root, entered a cycle, or encountered a nearly horizontal tangent.

At each estimate, the tangent line is easier to solve than the curve. Its x-intercept becomes the next estimate. Repeating the construction can converge rapidly to a root.
Read this graph as text

Newton's method turns tangent lines into improved root estimates. At each estimate, the tangent line is easier to solve than the curve. Its x -intercept becomes the next estimate. Repeating the construction can converge rapidly to a root. The first tangent begins at (2,2) and crosses the axis at x 1=1.5 . The next tangent begins on the curve at x 1 and crosses near x 2=1.4167 . The intercepts move toward 2 . Each step uses x n+1 =x n-f(x n)/f'(x n) .

Every relationship in newton's method turns tangent lines into improved root estimates 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 visual should make the iteration formula geometrically inevitable. Students should see that -f(x n)/f'(x n) is the horizontal correction obtained from the tangent line, not an arbitrary numerical recipe.

Visual study

At each estimate, the tangent line is easier to solve than the curve. Its x-intercept becomes the next estimate. Repeating the construction can converge rapidly to a root.

Explanation

Newton's method repeatedly replaces a curve by its tangent line

To solve f(x)=0f(x)=0, start with a guess xnx_n, draw the tangent line there, and use the tangent's xx-intercept as the next guess. Algebraically this gives xn+1=xn−f(xn)/f′(xn)x_{n+1}=x_n-f(x_n)/f'(x_n).

The method can converge astonishingly fast near a well-behaved root, but it is not infallible. A poor starting value, a nearly horizontal tangent, or a complicated graph can send the iterates away from the desired root. A graph and a reasoned initial guess are part of the method, not optional decoration.

Newton's method turns tangent lines into an iterative root finder. Starting from a guess, move to the xx-intercept of the tangent line, draw a new tangent, and repeat. When the geometry is favorable, the approximations improve with startling speed.

The method is powerful, not magical. A poor starting value, a nearly horizontal tangent, or a function with awkward geometry can send the iteration away from the desired root. Numerical methods require both calculation and supervision.

To solve f(x)=0f(x)=0, start with an estimate xnx_n. The tangent line at (xn,f(xn))(x_n,f(x_n)) crosses the xx-axis at a usually improved estimate xn+1x_{n+1}.

The tangent line is

y−f(xn)=f′(xn)(x−xn).y-f(x_n)=f'(x_n)(x-x_n).

Set y=0y=0 and solve for xx:

xn+1=xn−f(xn)f′(xn).\boxed{x_{n+1}=x_n-\frac{f(x_n)}{f'(x_n)}}.
Guided walkthrough

Approximate 2\sqrt2

Solve x2−2=0x^2-2=0 using x0=1.5x_0=1.5.

Answer reveal

Worked solution

Write a real attempt before opening the supplied answer.

Common mistake

Newton's method can fail

Failure can occur when f′(xn)=0f'(x_n)=0, when the tangent jumps far from the desired root, when iterates cycle, or when the initial guess lies in a bad region. A graph and a bracketing argument remain useful. Numerical methods are tools, not divine revelation from a calculator display.

Newton iteration tool
Read this graph as text

Newton iteration tool. A coordinate graph shows a function, the current iterate, its tangent line, and the next x-intercept. A synchronized table lists each iterate, residual, and error when a reference root is known. Previous steps remain as a light trail. Controls allow step, undo, reset, and starting-value changes. Failure states such as a nearly horizontal tangent, divergence, or a two-cycle are explained in text and equations.

Every relationship in newton iteration tool 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: Turn Newton’s method into an inspectable tangent-line iteration, including convergence, divergence, derivative-zero warnings, and cycles.

Visual study

Newton iteration tool

Modeling lab

Find a break-even production level

Suppose profit is

P(q)=−0.01q2+18q−5000.P(q)=-0.01q^2+18q-5000.

To locate a break-even point, solve P(q)=0P(q)=0 with

qn+1=qn−P(qn)P′(qn),P′(q)=−0.02q+18.q_{n+1}=q_n-\frac{P(q_n)}{P'(q_n)}, \qquad P'(q)=-0.02q+18.

Starting from q0=300q_0=300 generates a sequence of improving production estimates. A business interpretation still requires choosing the economically relevant positive root and checking whether the model is credible at that output.

Optional advanced note

Why Newton's method can become spectacularly fast

Near a simple root rr with f′(r)≠0f'(r)\ne0, Newton's method often has quadratic convergence: once an approximation is sufficiently close, the number of correct digits roughly doubles with each step. This follows because the next error is approximately a constant times the square of the current error. Multiple roots, small derivatives, or poor starting values weaken that behavior.

After the explanation

Use the section idea

Reading lens

A differentiable curve behaves like its tangent line over a small enough neighborhood, with concavity explaining the direction of error.

Mental model

Linearization, differentials, and Newton's method reuse one local line for estimation, uncertainty, or a better root guess.

Decision

Choose a nearby easy input, record the local slope, and state why the requested change is small enough for the model.

Common trap

Presenting a tangent estimate as exact or running Newton iterations without checking residuals and failure modes.

Check yourself

Can you give the estimate, error direction, units, and a reason the local line is trustworthy here?

Interactive checknewton-extra-01

For f(x)=x2−2f(x)=x^2-2 and x0=2x_0=2, compute x1x_1.

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

Show hint

x1=2−(4−2)/4x_1=2-(4-2)/4.

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.

Vocab
Mean value theorem
Math glossaryMean value theorem
f′(c)=f(b)−f(a)b−af'(c)=\frac{f(b)-f(a)}{b-a}

Guarantees an instantaneous rate equal to an interval's average rate.

Learn more
Critical number
Math glossaryCritical number
f′(c)=0 or undefinedf'(c)=0\ \text{or undefined}

A domain input where the derivative is zero or does not exist.

Learn more
Local maximum
Math glossaryLocal maximum
f(c)≥f(x)f(c)\ge f(x)

A function value at least as large as nearby values.

Learn more
Concavity
Math glossaryConcavity
f′′(x)>0⇒concave upf''(x)>0\Rightarrow\text{concave up}

Describes whether graph slopes are increasing or decreasing.

Learn more
Linearization
Math glossaryLinearization
L(x)=f(a)+f′(a)(x−a)L(x)=f(a)+f'(a)(x-a)

A tangent-line approximation near a chosen input.

Learn more
Math glossary