Numerical Methods for IGCSE OCR Mathematics | IGCSE OCR 数学：数值方法考点精讲

📚 Numerical Methods for IGCSE OCR Mathematics | IGCSE OCR 数学：数值方法考点精讲

Numerical methods are essential tools for solving mathematical problems where exact algebraic solutions are either impossible or very time-consuming to find. In the IGCSE OCR Mathematics syllabus, you will be expected to locate roots of equations, use iterative processes to refine approximations, and estimate areas under curves. This article provides a complete breakdown of the key concepts, with step-by-step explanations and exam-focused tips.

数值方法是解决某些数学问题的重要工具，当精确的代数解无法求得或非常费时时，数值方法尤其有用。在 IGCSE OCR 数学考试大纲中，你需要确定方程的根的位置、使用迭代过程逼近解、以及估算曲线下的面积。本文将全面梳理这些核心概念，提供分步解析和应试技巧。

1. Introduction to Numerical Methods | 数值方法简介

Unlike solving an equation by factorising or using the quadratic formula, numerical methods give approximate solutions. They rely on a systematic approach to ‘home in’ on a root through repeated calculations. In OCR IGCSE, you will meet three main types: methods for finding roots of equations (change of sign, trial and improvement, iteration), and a method for finding approximate areas (the trapezoidal rule).

与通过因式分解或使用二次公式求解方程不同，数值方法给出的是近似解。它们依赖于系统化的计算来不断“逼近”一个根。在 OCR IGCSE 中，你会遇到三种主要类型：求解方程根的方法（符号变化法、试值改进法、迭代法），以及求近似面积的方法（梯形法则）。

2. Locating Roots: Change of Sign | 确定根的位置：符号变化法

If a continuous function f(x) changes sign between x = a and x = b, then there is at least one root in the interval [a, b]. For example, if f(1) = -2 and f(2) = 3, the sign changes from negative to positive, so a root lies between x = 1 and x = 2. This method does not give the exact root; it just tells you where to start looking.

如果一个连续函数 f(x) 在 x = a 和 x = b 之间符号发生改变，那么在区间 [a, b] 内至少存在一个根。例如，若 f(1) = -2 且 f(2) = 3，符号由负变正，因此 x = 1 与 x = 2 之间有一个根。这种方法并不给出精确根，它只是告诉你从哪里开始寻找。

3. Trial and Improvement Method | 试值改进法

The trial and improvement method (also called the ‘decimal search’) involves substituting values into the equation and using the change of sign to narrow down the interval. You systematically test values to one decimal place, then two, until you reach the required accuracy. For instance, to solve x³ – x = 5, you might find f(1.8) < 0 and f(1.9) > 0, so the root lies between 1.8 and 1.9. You then try 1.85, and so on.

试值改进法（也称为“小数搜索法”）需要将数值代入方程，利用符号变化来缩小区间。你系统地尝试一位小数、两位小数的值，直到达到要求的精度。例如，要解 x³ – x = 5，你可能发现 f(1.8) < 0 且 f(1.9) > 0，因此根位于 1.8 和 1.9 之间。然后你再试 1.85，依此类推。

4. Iterative Methods: Fixed Point Iteration | 迭代法：不动点迭代

An iterative formula rewrites the equation f(x) = 0 in the form x = g(x). Starting from an initial guess x₀, you generate a sequence: x₁ = g(x₀), x₂ = g(x₁), and so on. For example, the equation x² – 3x + 1 = 0 can be rearranged to x = (x² + 1)/3, giving the iteration xn+1 = (xn² + 1)/3. By repeatedly applying the formula, the sequence may converge to a root.

迭代公式将方程 f(x) = 0 改写为 x = g(x) 的形式。从初始猜测值 x₀ 出发，你生成序列：x₁ = g(x₀)，x₂ = g(x₁)，依此类推。例如，方程 x² – 3x + 1 = 0 可改写为 x = (x² + 1)/3，得到的迭代公式为 xn+1 = (xn² + 1)/3。通过反复使用该公式，序列可能会收敛到某个根。

5. Convergence of Iterative Sequences | 迭代序列的收敛性

An iteration may converge if |g'(x)| < 1 near the root. You can check convergence by looking at how the values of xn change. If they are getting closer together, the method is likely working. Exam questions might ask you to show that a particular rearrangement will converge, or to use a given iteration until the values stabilise to a specified number of decimal places.

如果在根附近满足 |g'(x)| < 1，迭代就可能收敛。你可以通过观察 xn 的值如何变化来判断收敛性。如果它们越来越接近，那么这个方法很可能有效。考试题目可能会要求你证明某个特定的重组形式能够收敛，或者使用给定的迭代公式，直到数值稳定到指定的小数位数。

6. Newton-Raphson Method (Extension) | 牛顿-拉弗森法（拓展）

The Newton-Raphson method uses the derivative of the function to find increasingly accurate approximations very quickly. The formula is xn+1 = xn – f(xn)/f'(xn). While this is more commonly taught at A Level, some high-tier IGCSE papers may introduce the idea of using a tangent to improve an estimate. It is especially useful for solving equations like cos x = x.

牛顿-拉弗森法利用函数的导数，能非常迅速地求得越来越精确的近似值。公式为 xn+1 = xn – f(xn)/f'(xn)。虽然该方法更常见于 A Level 课程，但有些 IGCSE 高阶试卷可能会引入利用切线改进估计值的概念。它在求解诸如 cos x = x 的方程时特别有用。

7. Estimating Areas: The Trapezoidal Rule | 面积估算：梯形法则

When a function is difficult to integrate exactly, the trapezoidal rule gives an approximate area under the curve. With n strips of equal width h, the area is approximately (h/2)[y₀ + 2(y₁ + y₂ + … + yn-1) + yn]. The more strips you use, the more accurate the estimate. In IGCSE, n is usually 2, 4, or 5 and the y-values are taken from a table of function values.

当函数难以精确积分时，梯形法则可以给出曲线下面积的近似值。若使用 n 个等宽为 h 的条带，面积约等于 (h/2)[y₀ + 2(y₁ + y₂ + … + yn-1) + yn]。使用的条带越多，估计值越精确。在 IGCSE 中，n 通常为 2、4 或 5，并且 y 值取自函数值表格。

8. Accuracy and Error Bounds | 精度与误差限

Numerical solutions are always approximations, so you must understand how to express the precision of an answer. For example, if an iteration gives 1.265 and 1.267, the root correct to two decimal places is 1.27. You might also be asked to find upper and lower bounds of an interval where a root lies, based on change of sign correct to a given number of decimal places.

数值解永远都是近似值，因此你必须懂得如何表示答案的精确程度。例如，如果迭代得到 1.265 和 1.267，那么根精确到两位小数就是 1.27。你也可能被要求根据符号变化找到根所在区间的上下界，并精确到指定的小数位数。

9. Rearranging Equations for Iteration | 方程的迭代重排

To use fixed point iteration, you must be able to rearrange an equation into a suitable form x = g(x). Sometimes multiple rearrangements are possible, but not all will converge. For example, x² – 4x + 1 = 0 can become x = 4 – 1/x, giving xn+1 = 4 – 1/xn, or x = (x² + 1)/4. You may need to demonstrate that your chosen rearrangement has the convergence property near the root.

要使用不动点迭代，你必须能将方程重排为合适的 x = g(x) 形式。有时可以有多种重排方式，但并非所有都会收敛。例如，x² – 4x + 1 = 0 可以变成 x = 4 – 1/x，得到 xn+1 = 4 – 1/xn，或者 x = (x² + 1)/4。你可能需要证明所选择的重排形式在根附近具有收敛性。

10. Exam Techniques and Common Pitfalls | 考试技巧与常见误区

Always write down the full calculator display at each step before rounding to the required accuracy. If an iterative sequence diverges, check your starting value or the rearrangement. With the trapezoidal rule, remember that the multiplier of interior y-values is 2. A common mistake is to forget to halve the sum or to miscount the number of ordinates. Practice reading questions carefully to know whether you are asked for a change of sign interval or an approximate value.

在每一步中，务必先写下计算器完整显示的值，再根据需要舍入到指定精度。如果迭代序列发散，检查你的初始值或重排方式。在使用梯形法则时，记住内部 y 值的乘数是 2。常见错误包括忘记将总和除以 2，或数错纵坐标的个数。仔细读题，明确题目是要求符号变化区间还是近似值。

11. Worked Example: Iteration in Action | 实例解析：迭代实战

Problem: Show that a root of x² – 3x + 1 = 0 lies between 0 and 1. Use the iterative formula xn+1 = (xn² + 1)/3 with x₀ = 0.5 to find the root correct to two decimal places.

英文解答: f(0) = 1 > 0, f(1) = -1 < 0, so a root lies in [0, 1]. Starting x₀ = 0.5, we get x₁ = (0.25 + 1)/3 ≈ 0.4167, x₂ ≈ 0.3912, x₃ ≈ 0.3844, x₄ ≈ 0.3822, x₅ ≈ 0.3815, x₆ ≈ 0.3813. The values stabilise to 0.38, so the root is 0.38 to two decimal places.

问题： 证明 x² – 3x + 1 = 0 的一个根在 0 和 1 之间。使用迭代公式 xn+1 = (xn² + 1)/3，以 x₀ = 0.5 为初始值，求得精确到两位小数的根。

中文解答： f(0) = 1 > 0，f(1) = -1 < 0，因此 [0, 1] 区间内有一根。从 x₀ = 0.5 开始，得到 x₁ = (0.25 + 1)/3 ≈ 0.4167，x₂ ≈ 0.3912，x₃ ≈ 0.3844，x₄ ≈ 0.3822，x₅ ≈ 0.3815，x₆ ≈ 0.3813。数值稳定在 0.38，因此所求根精确到两位小数为 0.38。

12. Summary and Final Tips | 总结与最后提示

Numerical methods are a practical part of mathematics that will appear regularly in your IGCSE OCR exam. Make sure you are confident with rearranging equations, using the ANS key on your calculator for iteration, and writing out results to the correct degree of accuracy. Always check for the required number of decimal places or significant figures, and decide whether a solution is suitable by testing the sign of f(x) at the boundaries.

数值方法是数学中非常实用的一部分，会经常出现在你的 IGCSE OCR 考试中。请确保你熟练掌握方程重排、使用计算器的 ANS 键进行迭代，以及按照正确的精度写出结果。始终检查题目要求的小数位数或有效数字，并通过检验边界处 f(x) 的符号来判断所得解是否合适。

Published by TutorHao | Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）

Numerical Methods for IGCSE OCR Mathematics | IGCSE OCR 数学：数值方法考点精讲