Further Numerical Methods — AHL 5.10 Further numerical methods (iteration/integration) using technology (HL extension) - IB Mathematics Applications and Interpretation

SECTION 1

Historical Context & Motivation

Most equations you encounter in a math classroom have neat, closed-form solutions — you can rearrange, factor, or apply a formula and arrive at an exact answer. But the real world is not always so tidy. Engineers designing bridges, scientists modeling populations, and economists predicting markets frequently face equations that cannot be solved exactly. Similarly, many integrals arising in physics and statistics have no antiderivative that can be written in terms of elementary functions. Numerical methods were invented precisely to fill this gap — they give us systematic procedures to approximate solutions to any desired degree of accuracy, especially when paired with modern technology.

~250 BCE • Archimedes' Method of Exhaustion

Archimedes approximated the area of a circle by inscribing and circumscribing polygons, effectively performing an early form of numerical integration. His approach foreshadowed the trapezoid-based methods we use today.

1685 • Newton's Iterative Method

Isaac Newton developed an iterative algorithm to find roots of equations by using tangent-line approximations. This became the foundation for Newton-Raphson iteration, one of the most powerful root-finding techniques in mathematics.

1768 • Euler's Numerical ODE Solving

Leonhard Euler published a step-by-step method for approximating solutions to differential equations, establishing Euler's method as a cornerstone technique in applied calculus.

1859 • Simpson's Rule Formalized

Thomas Simpson's parabolic approximation rule was rigorously formalized. By fitting quadratic curves to data intervals, Simpson's rule achieves far greater accuracy than the trapezoidal rule for the same number of intervals.

1960s–present • Computers Transform Numerical Analysis

With the rise of digital computers and graphing calculators (including the GDC used in IB exams), numerical methods became practical for everyday problem-solving. Technology now performs millions of iterations in seconds, making these methods indispensable.

The central question that drives this topic is: When we cannot find an exact analytical answer, how can we systematically approximate one — and how accurate can we make that approximation? In IB Mathematics HL, you will use your GDC (graphing display calculator) and spreadsheet technology to implement these approximation strategies for both solving equations via iteration and evaluating definite integrals numerically.

SECTION 2

Core Principles & Definitions

Before diving into specific algorithms, it helps to understand the foundational ideas that underpin all numerical methods. These methods share a common philosophy: start with a rough guess, then refine it systematically until you reach the desired precision.

Iteration

An iterative process repeats a calculation using each output as the next input. Given a starting value x₀, you generate x₁, x₂, x₃, … where each successive value (ideally) gets closer to the true answer. The sequence is said to converge when it settles toward a fixed value.

Fixed-Point Iteration

To solve f(x) = 0, you rearrange the equation into the form x = g(x). A fixed point is a value where x = g(x). Starting from x₀, the recurrence x_n+1 = g(x_n) may converge to that fixed point.

Newton-Raphson Method

A powerful iterative technique that uses the tangent line at each estimate to leap toward the root. It converges much faster than simple fixed-point iteration when it works, but requires the derivative f'(x).

Numerical Integration

When a definite integral ∫ f(x) dx cannot be evaluated analytically, we approximate the area under the curve by dividing it into simple geometric shapes — trapezoids or parabolic arcs — and summing their areas.

Error and Convergence

Every numerical method introduces some approximation error. The key question is how quickly that error shrinks as we perform more iterations or use more subdivisions. Methods with faster convergence are more efficient and preferred in practice.

✦

KEY TAKEAWAY

Think of numerical methods like GPS navigation. You may not know the exact route from the start, but at each step, the GPS recalculates and sends you closer to your destination. An iterative method works the same way — each cycle of the algorithm corrects your current estimate, bringing you progressively closer to the true answer. The more steps you take, the more precise your result becomes.

SECTION 3

Visual Explanation — Newton-Raphson Iteration

The diagram below illustrates how the Newton-Raphson method zeroes in on a root of f(x) = 0. Starting from an initial guess x₀, you draw the tangent line to the curve at (x₀, f(x₀)). Where that tangent crosses the x-axis becomes your next estimate x₁. The process repeats, and each new tangent brings you dramatically closer to the root.

Starting from x₀ (pink), the tangent line (gold) crosses the x-axis at x₁ (cyan). A new tangent (green) from x₁ gives x₂ (orange), which is already very close to the true root α (red). Each iteration roughly squares the error, producing rapid convergence.

Notice how the distances between successive estimates and the root shrink dramatically. This is a hallmark of quadratic convergence — the number of correct decimal places roughly doubles with each iteration. In practice, three or four iterations often yield an answer accurate to many decimal places. On your GDC, you can set up a recurrence relation and watch the values stabilize before your eyes.

SECTION 4

Mathematical Framework

Iterative Methods for Solving Equations

NEWTON-RAPHSON FORMULA

x_{n+1} = x_n − f(x_n) / f'(x_n)

where $x_n$ is the current estimate, f( $x_n$ ) is the function value at that estimate, and f'( $x_n$ ) is the derivative evaluated at that estimate. The formula finds where the tangent line at $x_n$ crosses the x-axis.

The idea is beautifully geometric: the tangent line at the point (x_n, f(x_n)) has slope f'(x_n). Setting y = 0 and solving for x gives the Newton-Raphson formula above. When the starting guess is close enough to the root and f'(x) ≠ 0 near the root, convergence is extremely rapid.

FIXED-POINT ITERATION

x_{n+1} = g(x_n)

Rearrange f(x) = 0 into the form x = g(x). The iteration converges when |g'(x)| < 1 near the fixed point. A smaller |g'(x)| means faster convergence.

Numerical Integration Methods

TRAPEZOIDAL RULE

∫_a^b f(x) dx ≈ (h/2) [f(a) + 2f(x₁) + 2f(x₂) + … + 2f(x_{n−1}) + f(b)]

where h = (b − a)/n is the width of each strip, n is the number of strips, and x_k = a + kh. Each strip is a trapezoid whose parallel sides are the function values at consecutive x-values.

SIMPSON'S RULE (n EVEN)

∫_a^b f(x) dx ≈ (h/3) [f(a) + 4f(x₁) + 2f(x₂) + 4f(x₃) + … + 4f(x_{n−1}) + f(b)]

Simpson's rule fits parabolic arcs through consecutive triplets of points. The coefficients follow the pattern 1, 4, 2, 4, 2, …, 4, 1. The number of strips n must be even. This method is generally far more accurate than the trapezoidal rule for the same n.

💡

GDC / Technology Tip

On your GDC, you can set up Newton-Raphson iteration using the ANS key. Type your initial guess, press ENTER, then type the iteration formula using ANS in place of x_n. Each press of ENTER generates the next iterate. For numerical integration, most GDCs have a built-in ∫ function that you can use to check your trapezoidal or Simpson's rule answers.

SECTION 5

Numerical Integration — Trapezoids vs. Parabolas

The diagram below compares the two main numerical integration strategies side by side. On the left, the trapezoidal rule approximates the area under the curve using straight-line segments connecting consecutive points, forming trapezoids. On the right, Simpson's rule uses parabolic arcs that hug the curve more closely, resulting in much better accuracy for the same number of function evaluations.

Left: The trapezoidal rule connects sample points with straight lines, forming trapezoids. The gap between the straight edge and the curve creates error. Right: Simpson's rule fits parabolic arcs (dashed pink) through consecutive triplets of points, matching the curve's curvature much more closely.

Feature	Trapezoidal Rule	Simpson's Rule
Shape used	Straight-line segments (trapezoids)	Parabolic arcs through triplets of points
Coefficient pattern	1, 2, 2, 2, …, 2, 1	1, 4, 2, 4, 2, …, 4, 1
Multiplier	h / 2	h / 3
Number of strips	Any positive integer n	Must be even
Error order	O(h²) — error proportional to h²	O(h⁴) — error proportional to h⁴ (much smaller)

Comparison of the two primary numerical integration techniques used in AHL 5.10.

SECTION 6

Worked Examples

Example 1: Newton-Raphson Iteration

Find the root of f(x) = x³ − 2x − 5 near x = 2 using the Newton-Raphson method. Give your answer correct to four decimal places.

Newton-Raphson: Solving x³ − 2x − 5 = 0

1
Step 1 — Identify f(x) and f'(x)

We have f(x) = x³ − 2x − 5. Taking the derivative: f'(x) = 3x² − 2. The Newton-Raphson formula is x_n+1 = x_n − f(x_n) / f'(x_n) = x_n − (x_n³ − 2x_n − 5) / (3x_n² − 2).
2
Step 2 — First Iteration (x₀ = 2)

f(2) = 8 − 4 − 5 = −1. f'(2) = 12 − 2 = 10. So x₁ = 2 − (−1)/10 = 2 + 0.1 = 2.1.

x₁ = 2.1
3
Step 3 — Second Iteration (x₁ = 2.1)

f(2.1) = 9.261 − 4.2 − 5 = 0.061. f'(2.1) = 3(4.41) − 2 = 13.23 − 2 = 11.23. So x₂ = 2.1 − 0.061/11.23 ≈ 2.1 − 0.00543 ≈ 2.09457.

x₂ ≈ 2.0946
4
Step 4 — Third Iteration (x₂ ≈ 2.0946)

f(2.0946) = (2.0946)³ − 2(2.0946) − 5 ≈ 9.1913 − 4.1892 − 5 = 0.0021. f'(2.0946) ≈ 3(4.3874) − 2 = 11.162. x₃ ≈ 2.0946 − 0.0021/11.162 ≈ 2.0946 − 0.000188 ≈ 2.09455.

x₃ ≈ 2.0946
5
Step 5 — Conclusion

Since x₂ and x₃ agree to four decimal places, the root is approximately 2.0946. After just three iterations from x₀ = 2, we have four-decimal-place accuracy — a testament to the speed of the Newton-Raphson method.

Root ≈ 2.0946 (to 4 d.p.)

Example 2: Trapezoidal Rule

Estimate ∫₀² $e^{−x²}$ dx using the trapezoidal rule with n = 4 strips.

Trapezoidal Rule: Estimating ∫₀² $e^{−x²}$ dx

1
Step 1 — Determine h and x-values

h = (b − a)/n = (2 − 0)/4 = 0.5. The x-values are: x₀ = 0, x₁ = 0.5, x₂ = 1.0, x₃ = 1.5, x₄ = 2.0.

h = 0.5
2
Step 2 — Evaluate f(x) = $e^{−x²}$ at each x

f(0) = e⁰ = 1.0000, f(0.5) = $e^{−0.25}$ ≈ 0.7788, f(1.0) = $e^{−1}$ ≈ 0.3679, f(1.5) = $e^{−2.25}$ ≈ 0.1054, f(2.0) = $e^{−4}$ ≈ 0.0183.
3
Step 3 — Apply the trapezoidal formula

T = (h/2)[f(x₀) + 2f(x₁) + 2f(x₂) + 2f(x₃) + f(x₄)] = (0.5/2)[1.0000 + 2(0.7788) + 2(0.3679) + 2(0.1054) + 0.0183] = 0.25 × [1.0000 + 1.5576 + 0.7358 + 0.2108 + 0.0183] = 0.25 × 3.5225.

T ≈ 0.8806
4
Step 4 — Compare with GDC value

Using the GDC's built-in integration function, ∫₀² $e^{−x²}$ dx ≈ 0.8821. Our trapezoidal estimate of 0.8806 is quite close, with an error of about 0.0015 — less than 0.2%. Using more strips would reduce the error further.

Error ≈ 0.17%

SECTION 7

Strengths, Limitations & When to Use Each Method

No single numerical method is universally best. Choosing the right tool depends on what you're trying to solve, how much information you have (can you compute derivatives?), and how accurate you need the answer to be. The table below summarizes the trade-offs.

Method	Strengths	Limitations
Fixed-Point Iteration	Simple to set up; no derivative needed; easy to implement on a GDC using the ANS key.	May diverge if \|g'(x)\| ≥ 1 near the root; convergence can be slow (linear rate); requires careful rearrangement of the equation.
Newton-Raphson	Very fast convergence (quadratic); typically needs only a few iterations; widely applicable.	Requires f'(x) ≠ 0 at the root; can fail or diverge if the initial guess is poor or near a turning point; may cycle for some functions.
Trapezoidal Rule	Easy to apply; works with any number of strips; useful when only tabulated data points are available.	Only O(h²) accuracy; systematically underestimates concave-up regions and overestimates concave-down regions.
Simpson's Rule	O(h⁴) accuracy — far more precise for the same number of evaluations; exact for polynomials up to degree 3.	Requires an even number of strips; slightly more complex coefficient pattern; less intuitive geometrically than trapezoids.

Strengths and limitations of each numerical method in the AHL 5.10 toolkit.

✦

KEY TAKEAWAY

Think of choosing a numerical method like choosing a vehicle for a journey. Fixed-point iteration is like riding a bicycle — simple and reliable, but slow. Newton-Raphson is like driving a sports car — blazingly fast, but you need to handle it carefully (know the derivative, choose a good starting point) or you might spin out. The trapezoidal rule is a reliable family sedan — it always gets you there. Simpson's rule is a high-speed train — far more efficient, but it requires the right infrastructure (an even number of strips). Your GDC is the fuel that powers all of them.

SECTION 8

Connections to Advanced Theory & Euler's Method

The numerical methods in AHL 5.10 connect directly to Euler's method for differential equations (covered in AHL 5.11) and to the broader field of numerical analysis studied at university level. Understanding iteration and numerical integration here lays the groundwork for more sophisticated algorithms like Runge-Kutta methods and adaptive quadrature, which are the workhorses of modern scientific computing.

Concept in AHL 5.10	Advanced Extension
Fixed-point iteration x_n+1 = g(x_n)	Banach fixed-point theorem (contraction mappings); used in economics (equilibrium computation) and computer graphics (fractal generation).
Newton-Raphson method	Generalizes to systems of equations via the Jacobian matrix (Newton's method in ℝⁿ); essential in optimization, machine learning, and engineering simulations.
Trapezoidal rule	Forms the basis for the trapezoidal method in ODE solving (implicit Euler); leads to Romberg integration which extrapolates to higher accuracy.
Simpson's rule	Part of the Newton-Cotes family of quadrature rules; extends to Gaussian quadrature for optimal node placement and maximum accuracy.

How AHL 5.10 concepts connect to university-level numerical analysis.

As you progress to AHL 5.11 and beyond, you'll see that Euler's method is essentially the trapezoidal idea applied to differential equations — instead of approximating the area under a curve, you approximate the trajectory of a solution curve by taking small steps along the tangent. The iterative mindset you develop here — start, refine, converge — is the universal language of computational mathematics.

SECTION 9

Practice Problems

Question 1: CONCEPTUAL

Explain, in your own words, why the Newton-Raphson method converges faster than simple fixed-point iteration. What geometric feature of the algorithm accounts for its speed?

Show answer

Newton-Raphson uses the tangent line at each estimate rather than just plugging into a rearranged equation. Because the tangent line is the best local linear approximation to the curve, the x-intercept of the tangent is typically much closer to the root than a simple substitution would produce. This gives quadratic convergence — meaning the error roughly squares at each step. If your current error is 0.01, the next error is approximately 0.0001. Fixed-point iteration, by contrast, only achieves linear convergence where the error decreases by a constant factor each step, making it significantly slower.

Question 2: BASIC CALCULATION

Use the Newton-Raphson method with x₀ = 1 to find one root of f(x) = x² − 3 correct to three decimal places. Perform at least three iterations.

Show answer

Here f(x) = x² − 3 and f'(x) = 2x. The iteration formula is x_n+1 = x_n − (x_n² − 3)/(2x_n). Starting with x₀ = 1: x₁ = 1 − (1 − 3)/2 = 1 − (−1) = 2. x₂ = 2 − (4 − 3)/4 = 2 − 0.25 = 1.75. x₃ = 1.75 − (3.0625 − 3)/3.5 = 1.75 − 0.01786 ≈ 1.7321. x₄ = 1.7321 − (2.99997 − 3)/3.4642 ≈ 1.7321. The root is √3 ≈ 1.732 to three decimal places, confirmed after just four iterations.

Question 3: INTERMEDIATE

Estimate ∫₁³ (1/x) dx using Simpson's rule with n = 4 strips. Compare your answer to the exact value ln(3) ≈ 1.0986.

Show answer

With a = 1, b = 3, n = 4: h = (3 − 1)/4 = 0.5. The x-values are 1.0, 1.5, 2.0, 2.5, 3.0 with f(x) = 1/x giving values 1.0000, 0.6667, 0.5000, 0.4000, 0.3333. Simpson's formula: S = (h/3)[f(x₀) + 4f(x₁) + 2f(x₂) + 4f(x₃) + f(x₄)] = (0.5/3)[1.0000 + 4(0.6667) + 2(0.5000) + 4(0.4000) + 0.3333] = (0.1667)[1.0000 + 2.6668 + 1.0000 + 1.6000 + 0.3333] = (0.1667)(6.6001) ≈ 1.1000. Comparing with ln(3) ≈ 1.0986, the error is approximately 0.0014 or about 0.13%, which is impressively small for only 4 strips.

Question 4: APPLIED

A biologist models a population P (in thousands) that satisfies dP/dt = 0.3P(1 − P/10). At time t = 0, P = 2. The total population accumulated over the first 5 years is given by ∫₀⁵ P(t) dt. Using the tabulated values P(0) = 2.0, P(1) = 2.9, P(2) = 4.1, P(3) = 5.8, P(4) = 7.3, P(5) = 8.4 (obtained via technology), estimate this integral using the trapezoidal rule. Interpret your answer in context.

Show answer

With n = 5 strips and h = (5 − 0)/5 = 1: T = (h/2)[P(0) + 2P(1) + 2P(2) + 2P(3) + 2P(4) + P(5)] = (0.5)[2.0 + 2(2.9) + 2(4.1) + 2(5.8) + 2(7.3) + 8.4] = (0.5)[2.0 + 5.8 + 8.2 + 11.6 + 14.6 + 8.4] = (0.5)(50.6) = 25.3. This means the total accumulated population over 5 years is approximately 25.3 thousand-years, which represents the total 'population-time' or the area under the population curve. In practical terms, it gives a measure of the overall resource demand or environmental impact accumulated over the 5-year period.

Question 5: CRITICAL THINKING

Consider f(x) = x³ − x − 1. A student tries fixed-point iteration using the rearrangement x = x³ − 1 (i.e., g(x) = x³ − 1) with x₀ = 1.3. They find the iterates diverge wildly. (a) Explain why this rearrangement fails by considering |g'(x)| near the root. (b) Suggest a different rearrangement of f(x) = 0 into x = g(x) that would converge, and justify your choice.

Show answer

(a) The root of x³ − x − 1 = 0 is approximately x ≈ 1.3247. For the rearrangement g(x) = x³ − 1, we have g'(x) = 3x². At x ≈ 1.3247, g'(x) ≈ 3(1.756) ≈ 5.27. Since |g'(x)| = 5.27 >> 1, the convergence condition |g'(x)| < 1 is badly violated, so the iteration diverges. (b) Instead, rearrange as x =

(x + 1)^{1/3}

, so g(x) =

(x + 1)^{1/3}

. Then g'(x) = (1/3)

(x + 1)^{−2/3}

. At x ≈ 1.3247, g'(x) ≈ (1/3)

(2.3247)^{−2/3}

≈ (1/3)(0.575) ≈ 0.192. Since |g'(x)| ≈ 0.19 < 1, this rearrangement satisfies the convergence condition and will converge to the root. The key principle is that for fixed-point iteration to work, you need |g'(x)| < 1 in a neighbourhood of the fixed point.

SUMMARY

Summary — Further Numerical Methods

Summary

In AHL 5.10, you learned two families of numerical techniques. For solving equations, fixed-point iteration uses x_n+1 = g(x_n) and converges when |g'(x)| < 1 near the root, while the Newton-Raphson method uses x_n+1 = x_n − f(x_n)/f'(x_n) and achieves quadratic convergence by exploiting the tangent line at each step.

For numerical integration, the trapezoidal rule approximates the area under a curve using straight-line segments with O(h²) error, while Simpson's rule fits parabolic arcs and achieves O(h⁴) error — far superior accuracy for the same number of strips. Your GDC is your most important tool: use it to perform iterations, evaluate function values, and verify numerical estimates against built-in integration features. Mastering these methods prepares you for Euler's method in AHL 5.11 and for the computational thinking that underlies modern science and engineering.