How to Revise I: Numerical methods — AQA A-Level Mathematics
Numerical methods provide algorithmic techniques to find approximate solutions to mathematical problems that lack analytical or exact solutions, such as finding roots of transcendental equations or evaluating non-elementary integrals. The topic focuses on iterative processes, including the fixed-point iteration x_{n+1} = g(x_n) and the Newton-Raphson method, alongside numerical integration techniques like the Trapezium Rule. Candidates must evaluate the convergence of these methods, understand the geometric interpretations of the algorithms, and determine the accuracy of the resulting approximations relative to a specified tolerance or decimal place requirement.
Examiner Tips for I: Numerical methods
- Always ensure your calculator is in the correct mode (radians vs degrees) before starting
- Show all steps of your iteration clearly to ensure method marks are awarded
- When using the trapezium rule, clearly state the values of h, y_0, y_n, and the sum of intermediate ordinates
- Be prepared to explain why a specific method might fail in a given context
- Use the 'Ans' button on your calculator to perform iterations efficiently and maintain accuracy
Common Mistakes in I: Numerical methods
- Assuming a sign change guarantees a root exists without considering if the function is continuous
- Failing to use radians when applying numerical methods to trigonometric functions
- Incorrectly identifying the number of strips or the width of strips in the trapezium rule
- Misinterpreting the convergence or divergence of iterative sequences
- Rounding errors during intermediate steps of iterative calculations
Key Marking Points
- Correct identification of sign change intervals for root location
- Accurate application of the Newton-Raphson formula x_{n+1} = x_n - f(x_n)/f'(x_n)
- Correct use of the trapezium rule formula for numerical integration
- Clear explanation of why numerical methods may fail (e.g., stationary points, divergence)
- Correct interpretation of cobweb and staircase diagrams for iterative processes