📚 IGCSE CCEA Mathematics: Numerical Methods Revision | IGCSE CCEA 数学：数值方法 考点精讲
Numerical methods provide systematic techniques to solve mathematical problems that cannot be tackled by exact algebraic methods alone. In the CCEA IGCSE Mathematics specification, you are expected to apply iterative formulas, interval bisection, linear interpolation and the trapezium rule to find approximate solutions and areas. Mastering these methods will boost your confidence when dealing with equations that do not factorise neatly and with curves where integration is not straightforward.
数值方法提供了一整套系统技术，用来解决那些无法仅凭精确代数方法处理的问题。在 CCEA IGCSE 数学大纲中，你需要运用迭代公式、二分法、线性插值法和梯形法则来求近似解和近似面积。熟练掌握这些方法，将大大增强你处理那些不能简单因式分解的方程，以及不易直接积分的曲线问题的信心。
1. What Are Numerical Methods? | 什么是数值方法？
Numerical methods are procedures that use repeated arithmetic operations to produce an approximate answer to a problem. Instead of finding an exact root or a precise area, you generate a sequence of values that get closer and closer to the true solution. In the CCEA IGCSE exam, you will be tested on your ability to follow a given iterative process, to choose an appropriate interval for a root, and to apply the trapezium rule for area approximation.
数值方法是利用重复的算术运算得出问题近似解的过程。我们不求出精确的根或精确面积，而是生成一串越来越接近真值的数值。在 CCEA IGCSE 考试中，会考查你能否按照给定的迭代过程运算、能否为根选择合适的区间，以及能否使用梯形法则估算面积。
Typical applications in the syllabus include solving f(x)=0 by locating where the graph crosses the x-axis, refining a root using bisection or linear interpolation, and estimating the area under a curve using a succession of trapeziums. Understanding the balance between accuracy and efficiency is key.
大纲中常见的应用包括：通过寻找图像与 x 轴交点的位置解 f(x)=0、用二分法或线性插值法精确化根、以及利用一系列梯形估计曲线下的面积。理解精确度与效率之间的平衡是关键。
2. Locating Roots by Change of Sign | 通过符号变化锁定根的位置
If a continuous function f(x) changes sign over an interval [a,b], then there is at least one root in that interval. This simple principle underpins both the graphical approach and the bisection method. In an exam, you may be asked to show that a root lies between two integer values by evaluating f(a) and f(b) and noting that f(a) × f(b) < 0.
如果连续函数 f(x) 在区间 [a,b] 上符号发生变化，那么该区间内至少存在一个根。这一简单原理是图解法和二分法的基础。在考试中，可能会要求你通过计算 f(a) 和 f(b) 并指出 f(a) × f(b) < 0 来证明根在两个整数值之间。
For example, to locate a root of x³ − 2x − 5 = 0, compute f(2) = 2³ − 2×2 − 5 = −1 and f(3) = 3³ − 2×3 − 5 = 16. Because f(2) is negative and f(3) is positive, a root lies between 2 and 3. This step is always the starting point for numerical root‑finding.
例如，要定位 x³ − 2x − 5 = 0 的根，可计算 f(2) = 2³ − 2×2 − 5 = −1 和 f(3) = 3³ − 2×3 − 5 = 16。由于 f(2) 为负而 f(3) 为正，所以 2 和 3 之间存在一个根。这一步永远是数值求根法的起点。
3. Bisection Method (Interval Halving) | 二分法（区间半分法）
The bisection method repeatedly halves the interval containing the root. At each step, calculate the midpoint c = (a+b)/2 and evaluate f(c). If f(c) has the same sign as f(a), replace a with c; otherwise replace b with c. The sequence of midpoints converges to the root, and the process stops when the interval width is smaller than the required tolerance.
二分法不断将包含根的区间对半分。每一步计算中点 c = (a+b)/2 并求 f(c)。若 f(c) 与 f(a) 同号，就用 c 取代 a；否则用 c 取代 b。中点的序列会收敛到根，当区间宽度小于要求的容许误差时，过程停止。
Consider f(x) = x³ − 2x − 5 with initial interval [2,3]. The first midpoint is 2.5: f(2.5) = 2.5³ − 2×2.5 − 5 = 5.625. Since f(2.5) is positive and f(2) is negative, the new interval is [2, 2.5]. The second midpoint is 2.25: f(2.25) = 1.890625. Now the interval becomes [2, 2.25] because f(2.25) is still positive. Repeating the process yields an approximate root of about 2.094 after several iterations.
以 f(x) = x³ − 2x − 5 和初始区间 [2,3] 为例。第一个中点是 2.5：f(2.5) = 2.5³ − 2×2.5 − 5 = 5.625。因为 f(2.5) 为正而 f(2) 为负，新区间变为 [2, 2.5]。第二个中点是 2.25：f(2.25) = 1.890625。由于 f(2.25) 仍然为正，区间变为 [2, 2.25]。反复进行多次迭代后，可得到约 2.094 的近似根。
In CCEA IGCSE, you often work to a specified number of decimal places. Always keep a clear record of a, b, c and the signs of f(c). An organised table helps avoid arithmetic errors.
在 CCEA IGCSE 考试中，通常要求精确到指定的小数位数。请始终清晰地记录 a、b、c 以及 f(c) 的符号。一张条理清晰的表格有助于避免计算错误。
4. Linear Interpolation (Regula Falsi) | 线性插值法（试位法）
Linear interpolation, also known as the method of false position, uses a straight line connecting the points (a, f(a)) and (b, f(b)). The root is approximated by the x‑intercept of this line. The formula is derived from similar triangles and gives a weighted estimate that usually converges faster than bisection.
线性插值法，也称试位法，它利用连接点 (a, f(a)) 和 (b, f(b)) 的直线。根的近似值就是这条直线与 x 轴交点的横坐标。该公式由相似三角形推导得出，通常比二分法收敛得更快。
c = a − f(a) × (b − a) / (f(b) − f(a))
After calculating c, you check f(c) and replace whichever endpoint has the same sign. Using the same example, a=2, f(a)=−1, b=3, f(b)=16. The formula gives c = 2 − (−1)×(3−2)/(16−(−1)) = 2 + 1/17 ≈ 2.0588. Since f(2.0588) is negative, the new interval becomes [2.0588, 3]. The process repeats until sufficient accuracy is reached.
计算出 c 后，检查 f(c) 的符号，并替换与之同号的端点。沿用前面的例子，a=2, f(a)=−1, b=3, f(b)=16。公式给出 c = 2 − (−1)×(3−2)/(16−(−1)) = 2 + 1/17 ≈ 2.0588。因为 f(2.0588) 为负，新区间变为 [2.0588, 3]。重复这一过程，直至达到足够的精度。
In the IGCSE exam, you may be given the formula and asked to perform one or two steps. Make sure you substitute correctly and retain enough decimal figures to avoid rounding errors.
在 IGCSE 考试中，题目可能会给出这个公式并要求执行一至两步。确保代入正确，并保留足够的小数位，以避免舍入误差。
5. Introduction to Iteration | 迭代法简介
Iteration involves using an initial guess x₀ to generate a sequence x₁, x₂, x₃, … by repeatedly applying a formula of the form xₙ₊₁ = g(xₙ). If the sequence converges, the limit is a solution to x = g(x), which is equivalent to the original equation f(x)=0 after a suitable rearrangement.
迭代法指的是用初始猜想值 x₀，通过反复应用形如 xₙ₊₁ = g(xₙ) 的公式生成序列 x₁, x₂, x₃, …。如果序列收敛，其极限就是方程 x = g(x) 的解，而这等价于经过适当重新排列后的原方程 f(x)=0。
Rearranging f(x)=0 into the form x = g(x) is not unique. The choice of g(x) greatly affects whether the iteration converges and how quickly. In CCEA IGCSE, you are usually given the iterative formula directly, but you should be able to verify that it comes from the original equation.
将 f(x)=0 重组为 x = g(x) 的形式不是唯一的。g(x) 的选择会显著影响迭代是否收敛以及收敛的快慢。在 CCEA IGCSE 考试中，通常会直接给出迭代公式，但你应该能够验证它是由原方程推导而来。
6. Performing Iteration Step by Step | 逐步执行迭代
To carry out an iteration, start with a suitable initial value x₀, often taken from a graph or a sign‑change interval. Use the recurrence xₙ₊₁ = g(xₙ) to compute successive values. You are expected to record results to the required degree of accuracy, usually displayed in a table showing the iteration number and the value of xₙ.
执行迭代时，从合适的初始值 x₀ 开始，该值通常来自图形或符号变化区间。使用递推公式 xₙ₊₁ = g(xₙ) 逐次计算。你需要按要求的精度记录结果，通常会以表格形式展示迭代次数和 xₙ 的值。
For instance, to solve x² − 2x − 1 = 0, one possible rearrangement is x = √(2x + 1). With x₀ = 2, we obtain:
x₁ = √(2×2 + 1) = √5 ≈ 2.2361
x₂ = √(2×2.2361 + 1) = √5.4722 ≈ 2.3393
x₃ = √(2×2.3393 + 1) = √5.6786 ≈ 2.3831
After several more steps the values approach roughly 2.414. This matches the exact root 1+√2.
例如，要解 x² − 2x − 1 = 0，一种重组方式是 x = √(2x + 1)。取 x₀ = 2，我们得到：
x₁ = √(2×2 + 1) = √5 ≈ 2.2361
x₂ = √(2×2.2361 + 1) = √5.4722 ≈ 2.3393
x₃ = √(2×2.3393 + 1) = √5.6786 ≈ 2.3831
经过更多步后，数值趋近于约 2.414，与精确根 1+√2 吻合。
Always use at least one more decimal place in your working than the final answer requires, and then round only at the end. This prevents premature rounding from contaminating the iteration.
在计算过程中，始终比最终答案要求多保留至少一位小数，最后再进行舍入。这样可以防止过早舍入影响迭代的质量。
7. Convergence and Divergence of Iteration | 迭代的收敛与发散
An iteration xₙ₊₁ = g(xₙ) converges if successive values settle down to a fixed point. Graphically, convergence can be illustrated by staircase or cobweb diagrams. Whether an iteration converges often depends on the gradient of g(x) near the root: if |g'(x)| < 1 in the vicinity, the iteration usually converges.
当相邻的数值逐渐趋近于一个不动点时，迭代 xₙ₊₁ = g(xₙ) 就收敛。在图形上，收敛可用阶梯图或蛛网图来说明。迭代是否收敛往往取决于 g(x) 在根附近的梯度：如果在根附近 |g'(x)| < 1，迭代通常收敛。
In CCEA IGCSE, you may be asked to comment on whether an iterative process is converging or diverging by looking at the outputs. If the terms grow larger without approaching a limit, the iteration diverges. In such cases, a different rearrangement of the original equation is needed.
在 CCEA IGCSE 考试中，可能会要求你通过观察输出数值来评价迭代过程是收敛还是发散。如果各项数值越来越大而没有趋近某个极限，迭代就发散。这时就需要对原方程进行另一种方式的重组。
If |g'(α)| < 1, the iteration converges locally to the root α.
8. Using Graphs to Support Numerical Methods | 利用图形辅助数值方法
Graphs play an important role in understanding numerical methods. A sketch of y = f(x) helps identify intervals where roots lie. When an equation is given as f(x) = h(x), you can also find approximate roots from the points of intersection of y = f(x) and y = h(x). The graph provides a visual check that your iterative values are heading towards the correct root.
图形在理解数值方法中起着重要作用。画出 y = f(x) 的草图有助于确定根所在的区间。当方程以 f(x) = h(x) 的形式给出时，也可以从 y = f(x) 与 y = h(x) 图像的交点找到近似根。图形能为你的迭代值是否朝着正确的根移动提供直观的检验。
In an exam, you might be given a graph and asked to read off an initial guess for an iterative formula, or to explain why an iteration starting at x = 1.5 gives a particular root rather than another. Always link graphical observations to the algebraic steps.
在考试中，可能会给出一张图，要求你从中读出迭代公式的初始值，或者解释为什么从 x = 1.5 开始的迭代会得到某个特定的根而非另一个。始终要将图形观察与代数步骤联系起来。
9. The Trapezium Rule for Area Approximation | 梯形法则估算面积
When you cannot integrate a function exactly, the trapezium rule provides a way to estimate the area under a curve. The interval [a,b] is divided into n equal strips of width h = (b − a)/n. The area is approximated by summing the areas of trapeziums that fit between the curve and the x‑axis.
当你无法精确积分一个函数时，梯形法则提供了一种估计曲线下面积的方法。将区间 [a,b] 分成 n 个等宽的小段，宽度 h = (b − a)/n。通过将每个小曲边梯形近似为直边梯形来求和，即可估算出面积。
Area ≈ h/2 [y₀ + yₙ + 2(y₁ + y₂ + … + yₙ₋₁)]
Here y₀ = f(x₀), y₁ = f(x₁), …, yₙ = f(xₙ) are the function values at the endpoints of each strip. CCEA IGCSE questions typically ask for the trapezium rule with a specific number of strips, e.g. with 4 strips between x = 0 and x = 2.
其中 y₀ = f(x₀), y₁ = f(x₁), …, yₙ = f(xₙ) 是每个小区间端点的函数值。CCEA IGCSE 题目通常会指定条数，例如在 x = 0 到 x = 2 之间用 4 个梯形条。
Example: Estimate ∫ from 0 to 2 of x² dx with 4 strips. h = (2−0)/4 = 0.5. Tabulate x and y = x²: (0,0), (0.5,0.25), (1,1), (1.5,2.25), (2,4). Then area ≈ 0.5/2 × [0 + 4 + 2(0.25 + 1 + 2.25)] = 0.25 × [4 + 2(3.5)] = 0.25 × 11 = 2.75. The exact area is 8/3 ≈ 2.6667, so the estimate is reasonably close.
示例：用 4 个梯形条估算 ∫₀² x² dx。h = (2−0)/4 = 0.5。列表记录 x 和 y = x²：(0,0), (0.5,0.25), (1,1), (1.5,2.25), (2,4)。面积 ≈ 0.5/2 × [0 + 4 + 2(0.25 + 1 + 2.25)] = 0.25 × [4 + 2(3.5)] = 0.25 × 11 = 2.75。精确面积为 8/3 ≈ 2.6667，因此估算值相当接近。
10. Accuracy, Decimal Places and Significant Figures | 精确度、小数位数与有效数字
Numerical methods produce approximations, so you must report answers to the accuracy requested. The examination may ask for a root correct to 2 decimal places or an area to 3 significant figures. In iterative processes, you continue until two successive approximations agree to the required number of decimal places.
数值方法产生的是近似值，因此必须按要求的精度给出答案。考试可能要求根精确到 2 位小数，或面积精确到 3 位有效数字。在迭代过程中，需一直计算到连续两次近似值在要求的小数位数上一致为止。
For the bisection method, a common stopping criterion is when the interval width is less than 0.0005 to provide an answer correct to 2 decimal places. For iteration, you check whether |xₙ₊₁ − xₙ| < 0.0005. Always state the final answer clearly after proper rounding.
对二分法而言，常见的停止标准是区间宽度小于 0.0005，从而确保答案精确到 2 位小数。对于迭代法，则检查 |xₙ₊₁ − xₙ| < 0.0005。在恰当舍入后，务必清晰地写出最终答案。
Keep in mind the difference between decimal places and significant figures: 0.00235 to 2 decimal places is 0.00, but to 2 significant figures it is 0.0024. This distinction is frequently tested in CCEA IGCSE.
注意小数位数与有效数字的区别：0.00235 保留 2 位小数是 0.00，但保留 2 位有效数字是 0.0024。CCEA IGCSE 经常考查这一区别。
11. Common Pitfalls and How to Avoid Them | 常见陷阱与规避方法
One common mistake is using an incorrect initial interval or guess. Always check f(a)×f(b) < 0 before using bisection or linear interpolation. Another error is rounding intermediate values too early, which can cause the iteration to stall or drift. Use the full calculator display for each recurrence and only round at the end.
一个常见错误是使用了错误的初始区间或初始值。在使用二分法或线性插值法之前，务必检查 f(a)×f(b) < 0。另一个错误是过早舍入中间值，这会导致迭代停滞或偏移。每次递推都使用计算器的完整显示值，只在最后一步进行舍入。
When applying the trapezium rule, double-check the number of strips and ensure you calculate h correctly. The most frequent error is forgetting the multiplier 2 for the interior ordinates or mixing up y₀ and yₙ. A well‑organised table of x and y values prevents confusion.
使用梯形法则时，要仔细核对梯形条的个数，并确保正确计算 h。最常见的错误是忘了给内部纵坐标乘以 2，或者混淆了 y₀ 与 yₙ。制作一张排版整齐的 x 和 y 值表格可以避免这些混淆。
For iteration, some students stop too early or too late. Follow the stopping condition given in the question. If none is specified, iterate until the value settles to the required accuracy, which usually means two consecutive values agree to one more decimal place than the desired accuracy.
对于迭代法，有些学生停止得过早或过晚。应遵循题目给出的停止条件。若题目未指定，可迭代到数值稳定在要求的精度为止，这通常意味着连续两个值在比期望精度多一位小数上保持一致。
12. Exam Technique and Final Advice | 考试技巧与最终建议
In CCEA IGCSE numerical methods questions, you are often guided step‑by‑step. Read the entire question before you start, as later parts may hint at the rearrangement needed or the accuracy to maintain. Write down your substitutions clearly, and never skip a table or a line of working – method marks are generously awarded.
在 CCEA IGCSE 数值方法题目中，通常会一步步引导你。动笔前通读全题，因为后面的部分可能会提示你需要的重组方式或应维持的精度。清晰地写下代入过程，绝不要跳过表格或任何一行计算步骤——过程分的给分很慷慨。
Practice with past papers, paying special attention to the wording ‘show that a root lies between a and b’, ‘use the iterative formula to find the root correct to 2 decimal places’, and ‘estimate the area using the trapezium rule’. Familiarise yourself with the expected layout for the iterative tables and the trapezium rule table.
使用历年真题进行练习，特别注意类似“证明根在 a 和 b 之间”、“使用迭代公式求根，精确到 2 位小数”、“用梯形法则估算面积”这样的表述。熟悉迭代表格和梯形法则表格的常用格式。
Remember, numerical methods are robust tools that turn a seemingly unsolvable equation into a series of manageable calculations. Stay patient, keep your work organised, and you will secure excellent marks on this topic.
请记住，数值方法是将看似无法求解的方程转化成一连串可管理运算的可靠工具。保持耐心，书写工整，你就能在这一专题上取得优异成绩。
Published by TutorHao | IGCSE CCEA Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导