📚 IGCSE AQA Mathematics: Numerical Methods Key Points | IGCSE AQA 数学：数值方法 考点精讲
In IGCSE AQA Mathematics, numerical methods provide techniques for finding approximate solutions to problems where exact algebraic methods are not possible or practical. These methods include approximating roots of equations, estimating areas under curves, and solving real-life problems using iteration and other iterative approaches. Understanding these methods is crucial for handling unstructured problems and interpreting results accurately.
在 IGCSE AQA 数学中，数值方法提供了在无法或不便使用精确代数解法时寻找近似解的技巧。这些方法包括近似方程的解、估计曲线下面积，以及通过迭代和其他逐步逼近法解决实际问题。掌握这些方法对于处理非常规问题并准确解释结果至关重要。
1. What Are Numerical Methods? | 数值方法是什么？
Numerical methods are techniques used to find approximate solutions to mathematical problems. They are especially useful when algebraic methods fail or when dealing with continuous data. In IGCSE Mathematics, we focus on solving equations iteratively and estimating areas under curves using the trapezium rule.
数值方法是寻找数学问题近似解的技术。当代数方法无效或处理连续数据时，它们特别有用。在 IGCSE 数学中，我们重点学习通过迭代求解方程，以及使用梯形法则估算曲线下面积。
2. Locating Roots: Sign Change Method | 根的存在性：变号法
If a continuous function f(x) takes opposite signs at two points a and b, i.e., f(a) × f(b) < 0, then there is at least one root in the interval [a, b]. This sign change principle is the basis for verifying the existence and location of a root.
如果连续函数 f(x) 在两点 a 和 b 上的取值符号相反，即 f(a) × f(b) < 0，那么在区间 [a, b] 内至少存在一个根。这种变号原则是验证根的存在性与位置的基础。
3. Rearranging Equations into Iterative Forms | 方程变形为迭代形式
up2; + 1)/3 or x = √(3x − 1). The choice of rearrangement affects convergence.
要使用迭代法求根，我们首先将方程 f(x) = 0 重新排列为 x = g(x) 的形式。例如，对于 x² − 3x + 1 = 0，可能的迭代公式有 x = (x² + 1)/3 或 x = √(3x − 1)。不同的变形会影响收敛性。
4. Iterative Process: Substituting and Improving | 迭代过程：代入与改进
Starting with an initial approximation x₀, we compute x₁ = g(x₀), then x₂ = g(x₁), and so on, using the recurrence xₕ₊₁ = g(x&# epeating this process usually brings us closer to the actual root if the method converges.
从初始近似值 x₀ 开始，我们计算 x₁ = g(x₀)，然后 x₂ = g(x₁)，以此类推，利用递推关系 xₕ₊₁ = g(xₕ)。如果该方法收敛，重复这个过程通常能使我们更接近真实的根。
A table can help track the iterative sequence.
| n | xₕ | xₕ₊₁ = g(xₕ) | Comment |
| 0 | 2 | 1.666... | starting value |
| 1 | 1.666... | 1.539... | getting closer |
| 2 | 1.539... | 1.488... | converging |
用表格记录迭代序列非常有用，可以清晰地观察数值的变化趋势。
5. Trial and Improvement Approach | 试错改进法
p2; = 10.24 (too high), then trying 3.16, and so on, until reaching the required accuracy.
正规迭代的另一种替代方法是试错改进法。我们测试数值，观察 f(x) 的符号，并缩小所在区间。例如，通过测试 3.1² = 9.61（太小）和 3.2² = 10.24（太大）来求 √10，然后尝试 3.16，以此类推，直至达到所需精度。
6. Checking Convergence and Divergence | 收敛与发散的检验
An iterative sequence converges if the values approach a fixed number; otherwise, it diverges. A good indicator is that |g'(x)| < 1 near the root. In exam questions, you may need to comment on whether the iterations are getting closer or spiralling away.
如果迭代序列的值趋近于某一个固定数值，则该序列收敛；否则发散。一个好的判别标准是在根附近 |g'(x)| < 1。在考试题目中，你可能需要评论迭代是否越来越接近，还是偏离。
7. Estimating Area Using the Trapezium Rule | 梯形法则估算面积
of equal width h = (b − a)/n. The area is approximated by A ≈ h/2 × [y₀ + 2(y₁ + y₂ + … + yₕ₋₁) + yₕ], where yᵢ = f(xᵢ).
梯形法则将曲线 y = f(x) 下 x = a 到 x = b 之间的区域分割成 n 个等宽条，带宽 h = (b − a)/n。面积近似公式为 A ≈ h/2 × [y₀ + 2(y₁ + y₂ + … + yₕ₋₁) + yₕ]，其中 yᵢ = f(xᵢ)。
A ≈ (h/2)[y₀ + 2(y₁ + y₂ + … + yₕ₋₁) + yₕ]
8. Improving Area Approximations with More Strips | 增加梯形条数提高面积近似
As n increases, the strip width h decreases, and the trapezium rule becomes more accurate, approaching the exact integral. This illustrates how numerical methods can be refined to achieve greater precision.
随着 n 的增加，条带宽度 h 减小，梯形法则变得更加精确，趋近于精确的积分值。这体现了数值方法可以通过细化来提高精度。
9. Numerical Methods in Exam Questions | 考试中的数值方法题型
Typical IGCSE AQA questions ask you to show that a root lies between two numbers using sign change, perform a given number of iterations, use the trapezium rule with a given number of strips, and interpret the results in context, such as finding displacement from velocity.
典型的 IGCSE AQA 考题要求你利用符号变化法证明根位于两个数之间，进行给定次数的迭代，使用指定条带数的梯形法则，并结合情境解释结果，例如从速度函数求位移。
10. Tips for Success | 应试技巧
Always write the rearrangement before iterating, keep full calculator accuracy until the final rounding, label each iterative step clearly, and remember to state the units when the trapezium rule is used in a real-life context. Check that the sign change confirms the root location.
在迭代前务必写出变形后的公式，在最终四舍五入之前保持完整的计算器精度，清楚地标注每一步迭代，在梯形法则应用于现实情境时记得标明单位。确保符号变化确认了根的位置。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图