📚 Numerical Methods for A-Level Edexcel Maths | A-Level Edexcel 数学：数值方法考点精讲
Numerical methods provide powerful tools for solving mathematical problems that cannot be tackled analytically or where exact solutions are impractical. In A‑Level Edexcel Maths, you need to understand iterative techniques for finding roots, numerical integration and the conditions under which these methods converge. This guide walks you through the essential concepts, techniques and exam tips, helping you master numerical methods with confidence.
数值方法为我们提供了强有力的工具，用于处理那些无法解析求解或精确解不实用的数学问题。在 A‑Level Edexcel 数学中，你需要掌握求根的迭代技巧、数值积分以及这些方法收敛的条件。本指南将带你梳理核心概念、技巧与应试要点，帮助你自信地掌握数值方法。
1. The Need for Numerical Methods | 数值方法的必要性
Many equations, such as x cos x − 2 = 0 or eˣ + x = 0, cannot be rearranged into exact algebraic solutions. Numerical methods give us systematic ways to approximate roots to any desired accuracy. Instead of algebraic manipulation, we rely on iterative processes that gradually home in on the answer.
许多方程，例如 x cos x − 2 = 0 或 eˣ + x = 0，无法通过代数变换得到精确解。数值方法为我们提供了系统化的途径来将根近似到任意所需精度。我们不再依赖代数操作，而是通过迭代过程逐步逼近答案。
These methods are especially important when functions are transcendental, piecewise‑defined or given only by data. They underpin everything from engineering design to financial modelling, making them a key part of the Edexcel syllabus.
这些方法在处理超越函数、分段函数或仅由数据给出的函数时尤为重要。它们支撑着从工程设计到金融建模的各个领域，因此成为 Edexcel 考纲的关键内容。
2. Root Finding and Bracketing Methods | 求根与区间法
A root of an equation f(x) = 0 is a value of x where f(x) = 0. A simple but reliable approach is to find an interval [a, b] where f(a) and f(b) have opposite signs, i.e. f(a) × f(b) < 0. This guarantees at least one root inside if f is continuous.
方程 f(x) = 0 的根是指使得 f(x) = 0 的 x 值。一种简单可靠的方法是找到区间 [a, b]，使得 f(a) 与 f(b) 符号相反，即 f(a) × f(b) < 0。若 f 为连续函数，这保证区间内至少有一个根。
From this starting interval, you can refine the estimate using methods like bisection or linear interpolation. In Edexcel, you are often asked to verify a sign change over an interval to confirm the existence of a root.
基于这个初始区间，你可以用二分法或线性插值等方法不断精确地估计根。在 Edexcel 考试中，经常要求你验证某个区间的符号变化以确认根的存在。
3. The Intermediate Value Theorem | 介值定理
The formal justification for the sign‑change method is the Intermediate Value Theorem: if f is continuous on [a, b] and N is any number between f(a) and f(b), then there exists c in (a, b) such that f(c) = N. For roots, we set N = 0.
符号变化法的形式化依据是介值定理：若 f 在 [a, b] 上连续，且 N 是 f(a) 与 f(b) 之间的任意数，则存在 c ∈ (a, b) 使得 f(c) = N。对于求根，我们取 N = 0。
This theorem is often quoted in exam questions to justify that a root lies in an interval. Remember to state that f is continuous and that f(a) and f(b) have opposite signs.
这个定理在考题中常被引用，用以证明某个区间内存在根。记得要说明 f 是连续的，并且 f(a) 和 f(b) 符号相反。
4. Fixed Point Iteration | 不动点迭代
Fixed point iteration rewrites f(x) = 0 into the form x = g(x). Starting from an initial guess x₀, we generate a sequence using xₙ₊₁ = g(xₙ). A root of f(x) = 0 corresponds to a fixed point where g(x) = x.
不动点迭代将 f(x) = 0 改写成 x = g(x) 的形式。从一个初始猜测值 x₀ 出发，我们通过 xₙ₊₁ = g(xₙ) 生成序列。f(x) = 0 的根对应于 g(x) = x 的不动点。
The iteration is successful if the values settle towards a limit. This happens when |g′(x)| < 1 near the root. An example of a suitable rearrangement for x³ − 4x + 1 = 0 is x = (x³ + 1)/4.
如果迭代值趋向某个极限，则迭代成功。当根附近满足 |g′(x)| < 1 时迭代收敛。对于方程 x³ − 4x + 1 = 0，一个合适的改写是 x = (x³ + 1)/4。
5. The Newton‑Raphson Method | 牛顿‑拉夫森法
The Newton‑Raphson formula is xₙ₊₁ = xₙ − f(xₙ)/f′(xₙ). It uses the tangent line at (xₙ, f(xₙ)) to intercept the x‑axis, often giving very rapid convergence when the initial guess is close enough.
牛顿‑拉夫森公式为 xₙ₊₁ = xₙ − f(xₙ)/f′(xₙ)。它利用点 (xₙ, f(xₙ)) 处的切线与 x 轴的交点来迭代，当初始值足够接近时通常收敛速度极快。
This method requires you to differentiate f correctly and to be careful with the arrangement. In Edexcel exams, you may be given f(x) and asked to apply the formula, often with a specified starting value x₀.
该方法要求你正确地求导 f，并仔细套用公式。在 Edexcel 考试中，可能会给出 f(x)，让你应用公式，通常会指定初始值 x₀。
6. Convergence Conditions | 收敛的条件
Both fixed‑point iteration and Newton‑Raphson need suitable starting points. For fixed‑point iteration, convergence requires |g′(x)| < 1 in an interval around the root. For Newton‑Raphson, the method generally converges if f″(x) does not change sign near the root and the initial guess is sufficiently close.
不动点迭代和牛顿‑拉夫森法都需要合适的初始点。对于不动点迭代，收敛要求在根的某个区间内满足 |g′(x)| < 1。对于牛顿‑拉夫森法，通常若 f″(x) 在根附近不变号且初始值足够接近，则方法收敛。
It is essential to recognise that a poor starting value may cause divergence or oscillation. The Newton‑Raphson method can fail if f′(xₙ) is zero or very small, leading to a huge jump.
必须认识到，一个糟糕的初始值可能导致发散或振荡。如果 f′(xₙ) 为零或非常小，牛顿‑拉夫森法可能会失效，导致大幅跳跃。
7. Error Analysis in Root Finding | 求根中的误差分析
Since we rarely obtain exact roots, it is vital to estimate the error. One practical rule is to iterate until consecutive approximations differ by less than a specified tolerance, e.g. |xₙ₊₁ − xₙ| < 0.0005. This is often used in Edexcel questions to decide when to stop iterating.
由于我们很少得到精确的根，估计误差至关重要。一种实用的规则是迭代直到连续两次近似值之差小于指定容差，例如 |xₙ₊₁ − xₙ| < 0.0005。在 Edexcel 考题中，这常被用来判断何时停止迭代。
Alternatively, the interval length in bracketing methods gives a direct bound on error. For bisection, after n steps the root is known to lie in an interval of length (b − a)/2ⁿ.
另一种方式是，在区间法中区间长度直接给出了误差界限。对于二分法，经过 n 步之后，根必定位于长度为 (b − a)/2ⁿ 的区间内。
8. Numerical Integration: The Trapezium Rule | 数值积分：梯形法则
When an integral cannot be evaluated exactly, we use numerical methods such as the trapezium rule. The rule divides the area under y = f(x) into n equal strips of width h = (b − a)/n, approximating the area with trapezia.
当积分无法精确计算时，我们采用数值方法，如梯形法则。该法则将 y = f(x) 下的区域分成 n 个等宽为 h = (b − a)/n 的条带，并用梯形近似面积。
∫ₐᵇ f(x) dx ≈ h/2 [y₀ + 2(y₁ + y₂ + … + yₙ₋₁) + yₙ]
The accuracy improves as the number of strips increases. In the exam, you are typically asked to calculate the approximation for a given n or to state how the approximation changes with more strips.
精度随条带数量增加而提高。在考试中，通常会要求你计算给定 n 的近似值，或说明条带增加时近似值如何变化。
9. Improving Accuracy in Numerical Integration | 提高数值积分精度
Using more strips reduces the strip width, giving a better approximation to the curve. For Edexcel, you must be comfortable evaluating the trapezium rule for tables of values and understand that the error decreases roughly with h².
使用更多条带会减小条带宽度，从而更好地逼近曲线。对于 Edexcel，你必须能够根据数值表计算梯形法则，并理解误差大致随 h² 减小。
Sometimes you are asked whether the trapezium rule overestimates or underestimates the integral. This depends on the concavity of the function: for curves that are convex, the trapezium rule tends to overestimate; for concave curves, it underestimates.
有时会问梯形法则高估还是低估了积分。这取决于函数的凹凸性：对于下凸的曲线，梯形法则倾向于高估；对于上凸的曲线，则倾向于低估。
10. Choosing the Appropriate Numerical Method | 选择适当的数值方法
In the exam, you will see questions that mix root‑finding and integration. Key decision factors include whether the function is differentiable, whether you can find an interval with a sign change, and the required speed of convergence.
在考试中，你会遇到混合求根和积分的题目。选择的关键因素包括：函数是否可导，能否找到符号变化的区间，以及所需的收敛速度。
Newton‑Raphson is often faster but requires the derivative. Fixed‑point iteration can be simpler but needs careful rearrangement. For integration, the trapezium rule is the standard tool when exact integration is impossible.
牛顿‑拉夫森法通常更快，但需要导数。不动点迭代较为简单，但需要小心地改写方程。对于积分，当无法精确积分时，梯形法则是标准的工具。
11. Common Pitfalls and Exam Advice | 常见误区与考试建议
Many students lose marks by forgetting to show substitution steps in iteration or rounding too early. Always keep full accuracy in intermediate work and only round the final answer to the requested precision. In Newton‑Raphson, ensure you use the derivative correctly—often given in the formula booklet, but you must still differentiate f(x) yourself.
许多学生因忘记展示迭代中的代入步骤或过早舍入而丢分。务必在中间过程中保持完整精度，仅对最终答案按要求的精度舍入。在牛顿‑拉夫森法中，确保正确使用导数——公式手册通常会提供公式，但你仍需自己对 f(x) 求导。
When the question asks you to justify a root exists, explicitly quote the sign‑change rule and the continuity of f. For trapezium rule questions, set out a table of values clearly and check the weighted sum of y‑values.
当题目要求证明根存在时，明确引用符号变化法则和 f 的连续性。在梯形法则题目中，清晰地列出数值表，并检查 y 值的加权和。
12. Summary of Key Formulas | 关键公式总结
Keeping the core formulas at your fingertips is essential for the exam. They are not always provided directly in the question, so you should memorise them and know when to apply each one.
熟记核心公式对考试至关重要。这些公式并非总在题目中直接给出，因此你应该记住它们并知道何时应用。
| Method | 方法 | Formula | 公式 |
| Fixed Point Iteration | 不动点迭代 | xₙ₊₁ = g(xₙ) |
| Newton‑Raphson | 牛顿‑拉夫森 | xₙ₊₁ = xₙ − f(xₙ)/f′(xₙ) |
| Trapezium Rule | 梯形法则 | ∫ₐᵇ f(x) dx ≈ h/2 [y₀ + 2(y₁ + … + yₙ₋₁) + yₙ] |
| Error Term (Trapezium) | 误差项（梯形） | E ≈ −(b − a)h² f″(ξ)/12 |
Understanding these equations and practising them with real data sets will give you a strong advantage. Always label your working clearly and show the formulas you are using.
理解这些方程并通过实际数据集加以练习将使你占据很大优势。始终清晰地标注你的步骤，并展示所使用的公式。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导