Mathematics · Year 13

Active learning ideas

Applications and Limitations of Numerical Methods

This topic uncovers the powerful algorithms that drive modern computation, showing students how to solve problems that are impossible to tackle with traditional analytical methods.

• National Curriculum Attainment Targets
• DfE Subject Content for Mathematics: I5 - Use numerical methods to solve problems in context.

• 30–60 min
• Pairs → Whole Class
• 3 activities

Activity 01

• Decision Matrix
• 45 min · Small Groups

The Root-Finding Race

Students are given a function and a required level of accuracy. In small groups, they use different numerical methods (e.g., Newton-Raphson, linear interpolation, bisection) to find the root, comparing the number of iterations each method requires to converge.

Analyse a real-world problem that requires a numerical method for its solution.

Facilitation Tip

Provide a graphical representation of the function so students can make an informed initial guess.

What to look for

Ask students to sketch a graph and, for a given starting value, draw the first two iterations of the Newton-Raphson method to demonstrate their geometric understanding.

• Analyze
• Evaluate
• Create
• Decision-Making
• Self-Management

Activity 02

• Decision Matrix
• 30 min · Pairs

Breaking the Method

Present pairs of students with functions specifically chosen to cause certain numerical methods to fail, for example, a root near a stationary point for the Newton-Raphson method. Students must investigate graphically and algebraically why the method fails and propose a more suitable alternative.

Compare the suitability of different numerical methods for solving a given problem.

Facilitation Tip

Encourage the use of graphing software to visualise the iterative steps and pinpoint the exact cause of failure.

What to look for

A multi-part exam question requiring students to first show a root exists in an interval, then apply a specified numerical method for a number of iterations, and finally comment on the accuracy or limitations of their result.

• Analyze
• Evaluate
• Create
• Decision-Making
• Self-Management

Activity 03

• Decision Matrix
• 60 min · Individual

Modelling Projectile Motion with Drag

Students model the trajectory of a projectile, but this time including air resistance, which makes an analytical solution for quantities like range or maximum height intractable. They must formulate a differential equation and use a numerical method, like Euler's method, to approximate the solution.

Evaluate the limitations of the numerical methods studied in this unit and discuss when an analytical solution would be preferable.

Facilitation Tip

Scaffold the initial setup of the model, allowing students to focus on applying and interpreting the numerical method.

What to look for

Students use a spreadsheet or graphing software to implement an iterative method, allowing them to check their manual calculations and explore how changing the initial value affects the outcome.

• Analyze
• Evaluate
• Create
• Decision-Making
• Self-Management

A few notes on teaching this unit

Start by demonstrating the methods visually using graphing software like Desmos or GeoGebra to build intuition. Use 'staircase' and 'cobweb' diagrams to make the abstract concepts of convergence and divergence tangible. Frame the methods as algorithms: a clear, repeatable recipe for finding a solution, which helps connect to computer science principles.

By the end of this unit, students will be able to confidently select and apply appropriate numerical methods and, crucially, evaluate the validity and limitations of their results.

---

Watch Out for These Misconceptions

• Numerical methods provide the exact answer, just in a different way.

  Numerical methods provide approximations, not exact solutions. The accuracy of the approximation depends on the method used, the number of steps or iterations, and the nature of the function itself.

• More iterations always lead to a more accurate answer.

  While often true for converging processes, it is not a guarantee. For some functions or poor starting values, a method may diverge, with successive iterations moving further from the true root. Furthermore, computational rounding errors can accumulate and limit the achievable accuracy.

• The Newton-Raphson method is always the best because it converges the fastest.

  The Newton-Raphson method can converge very quickly, but it is not always the best choice. It requires the derivative of the function, and it can fail to find a root if the initial guess is poor or if the derivative is close to zero near the root.

---

Methods used in this brief

• Decision Matrix