Newton’s Method: Quadratic Convergence Explained with Worked Examples

Near a simple root , Newton's method satisfies : the error is roughly squared at each step, so the number of correct digits about doubles.

Write 2x or 2*x to multiply, ^ for powers, and ; between simultaneous equations. You can also type factor, expand, derivative of, integrate … from a to b, limit … as x->0 or 15% of 80.

Try an example

Before you start

This page is easier if you are comfortable with:

What Newton’s method: quadratic convergence means

For , : . Starting at (error ): , error . The ratio , close to the predicted constant 0.3536. The next error is about , then .

The formula comes from the Taylor expansion of about the root (Taylor's theorem with the Lagrange remainder): . Compare linear convergence of bisection (bisection error bound) and the secant method (the secant method) of order 1.618; Newton is the case of fixed-point convergence (fixed-point convergence).

The convergence is quadratic only for simple roots and sufficiently good starting values. For a repeated root it falls back to linear convergence. The method itself is in Newton–Raphson, and in optimisation it appears as Newton's method for optimisation.

What is it used for?

Newton's method roughly doubles the number of correct digits at each step near a simple root.

How to use newton’s method: quadratic convergence

  1. Compute the constant .
  2. Estimate the next error as .
  3. Check against the actual iterates.
  4. Expect the digits of accuracy to double.

Graph

Newton iterates for x² − 2 from 1.5: errors 0.0858, 0.00245, 0.0000021e0 = 0.0858e1 = 0.0024500.511.522.533.5400.020.040.060.080.1Newton iterates for x² − 2 from 1.5: errors 0.0858, 0.00245, 0.0000021step + 1yGraph with x from 0 to 4 and y from 0 to 0.1. Shows bars (3); point e0 = 0.0858 at (1, 0.0858); point e1 = 0.00245 at (2, 0.00245).

The errors fall far faster than a fixed ratio.

Worked examples

These examples are worked by hand, step by step, so you can compare your own working.

Example 1: the constant

Find for at .

Worked example
Answer
0.353550.35355
  1. Formula

Example 2: one Newton step

Find from for .

Worked example
Answer
1.4166671.416667
  1. Formula

Example 3: the new error

Find .

Worked example
Answer
0.0024530.002453
  1. Value

Special cases

A few situations come up again and again. Knowing them saves time and helps you spot answers that cannot be right.

x² − 2 from 1.5

x₁ = 1.5 − 0.25/3 = 1.416667

xₙ₊₁ = xₙ − f/f′.

Next step

x₂ = 1.414216

Error ≈ 2 × 10⁻⁶.

Error squaring

e₁ = 0.00245, e₀ = 0.0858: e₁/e₀² ≈ 0.33

Constant ≈ f″/(2f′).

Constant

f″/(2f′) = 2/(2 × 2.828) ≈ 0.3536

At the root.

Word problems

Newton’s method xₙ₊₁ = xₙ − f(xₙ)/f′(xₙ) converges quadratically near a simple root: eₙ₊₁ ≈ (f″/2f′) eₙ², so the number of correct digits roughly doubles each step.

First step

Apply Newton to x² − 2 from x₀ = 1.5.

  1. f0.25
  2. f′3
  3. x₁1.5 − 0.0833
  4. Check: 1.416667 ✓1.416667.

Error after one step

Find |x₁ − √2| to 5 decimal places.

  1. x₁1.416667
  2. √21.414214
  3. Check: ✓0.00245.

Error ratio Higher

Find e₁/e₀² to 2 decimal places.

  1. e₀0.0858
  2. e₁0.00245
  3. Check: close to 0.3536 ✓0.33.

Predict Higher

If e = 0.0025, estimate the next error using 0.3536 e².

  1. 0.3536 × 6.25 × 10⁻⁶
  2. Check: 2.2 × 10⁻⁶ ✓2.2 × 10⁻⁶.

Common mistakes

Starting at f′ = 0

x₀ = 0 for x² − 2 ✗

f′(0) = 0 ✓

Division by zero.

Expecting linear error halving

error halves ✗

error squares ✓

Quadratic convergence.

Wrong derivative

f′ = x for x² − 2 ✗

f′ = 2x ✓

Differentiate carefully.

Multiple roots

quadratic at a double root ✗

only linear ✓

Convergence slows.

Exam tips

  1. xₙ₊₁ = xₙ − f/f′.
  2. Digits double.
  3. Good start needed.
  4. f′ ≠ 0.
  5. Check f(xₙ) ≈ 0.

Practice questions

Try each one on paper, then open the answer. Use the solver above to see the full working.

1. f = x² − 9 from 4: x₁ Foundation

3.125

2. f = x² − 2 from 2: x₁ Foundation

1.5

3. f = x² − 2 from 1.4: x₁ to 5 d.p. Foundation

1.41429

4. f = x³ − 8 from 3: x₁ Higher

2.2963

5. f′ for x² − 2 at 1.5 Higher

3

6. 0.3536 × 0.01² to 7 d.p. Higher

0.0000354

Practice generator

Unlimited fresh questions with instant marking. Choose a level, work it out on paper, then type your answer.

Solve: …

Key terms

Newton’s method
Tangent-based root finding.
Quadratic convergence
Error squares each step.
Simple root
f′(root) ≠ 0.
Iterate
Successive approximation.
Tangent
Line touching the curve.
Error
xₙ − root.

Frequently asked questions

What is quadratic convergence?

The error is roughly squared each step.

What is Newton’s formula?

xₙ₊₁ = xₙ − f(xₙ)/f′(xₙ).

When does it fail?

When f′ = 0 or the start is poor.

What is the error constant?

About f″/(2f′).

Which page covers fixed points?

fixed-point iteration.

Which page covers the secant method?

secant method.

More in Numerical methods and optimisation and the formula sheets.