📚 A-Level Mathematics: Numerical Methods in Modelling | A-Level 数学：数值方法在建模中的应用
Many mathematical models in science and engineering cannot be solved exactly using algebra alone. Differential equations, complicated equations, and integrals often have no closed-form solution. Numerical methods provide a practical way to approximate solutions with high precision, enabling us to analyse and predict real-world behaviour.
在科学与工程中，许多数学模型无法仅靠代数手段精确求解。微分方程、复杂方程和积分往往不存在解析解。数值方法提供了一种实用途径，能够以较高精度逼近解，从而使我们能够分析与预测现实世界的行为。
1. The Need for Numerical Methods in Real-World Modelling | 1. 现实建模中对数值方法的需求
When a model is built from physical laws, it often produces an equation such as f(x) = 0, an integral, or a differential equation. For linear and some simple nonlinear cases, analytical formulas exist. However, for most real-world models, these formulas are impossible to derive. Numerical methods step in to approximate the required values.
当模型由物理定律构建时，通常会得到形如 f(x) = 0 的方程、积分或微分方程。对于线性以及某些简单非线性情形，存在解析公式。然而，在大多数现实模型中，这些公式难以推导。数值方法此时用于逼近所需数值。
Common situations include population growth with limited resources, radioactive decay, cooling rates, motion under variable forces, and economic forecasting. In each case, we can set up an equation or a rate of change, but solving it exactly is often not feasible.
常见情形包括有限资源下的种群增长、放射性衰变、冷却速率、变力作用下的运动以及经济预测。在这类情形中，我们可以建立方程或变化率，但精确求解往往并不可行。
2. The Bisection Method for Root-Finding | 2. 二分法求根
The bisection method solves an equation of the form f(x) = 0 on an interval [a, b] where f(a) and f(b) have opposite signs. The intermediate value theorem guarantees at least one root between a and b. We repeatedly bisect the interval and select the subinterval that contains a sign change.
二分法用于求解区间 [a, b] 上形如 f(x) = 0 的方程，其中 f(a) 与 f(b) 异号。中值定理保证 a 与 b 之间至少存在一个根。我们不断将区间二等分，并保留出现符号变化的子区间。
Let c₁ = (a + b) / 2. If f(c₁) = 0, c₁ is an exact root. Otherwise, if f(a) and f(c₁) have opposite signs, the root lies in [a, c₁]; otherwise it lies in [c₁, b]. Repeat until the interval width is smaller than a chosen tolerance.
令 c₁ = (a + b) / 2。若 f(c₁) = 0，则 c₁ 为精确根；否则，若 f(a) 与 f(c₁) 异号，则根位于 [a, c₁] 内；若不然，则根位于 [c₁, b] 内。重复此过程直到区间宽度小于选定容差。
cₙ = (aₙ + bₙ) / 2
The method is robust because it only requires f(x) to be continuous. The error halves after every iteration, giving a predictable linear rate of convergence: the absolute error is approximately (b − a) / 2ⁿ after n iterations.
该方法十分稳健，因为它仅要求 f(x) 连续。每迭代一次误差减半，呈现出可预测的线性收敛速度：经过 n 次迭代后，绝对误差约为 (b − a) / 2ⁿ。
3. The Newton–Raphson Method | 3. 牛顿–拉弗森方法
Newton–Raphson is an iterative method that uses tangents to superlinearly converge to a root. Starting from an initial guess x₀, the next approximation is given by the x-intercept of the tangent to f at x₀.
牛顿–拉弗森方法是一种利用切线进行超线性收敛的迭代方法。从初始猜测 x₀ 出发，下一个近似值由 f 在 x₀ 处切线的 x 轴截距给出。
xₙ₊₁ = xₙ − f(xₙ) / f ′(xₙ)
For example, to solve x² − 2 = 0, we set f(x) = x² − 2 and f ′(x) = 2x. Starting with x₀ = 1, we obtain x₁ = 1.5, x₂ = 1.416667, x₃ = 1.414216, which quickly approaches √2 = 1.414214.
例如，求解 x² − 2 = 0，设 f(x) = x² − 2，f ′(x) = 2x。从 x₀ = 1 出发，得到 x₁ = 1.5，x₂ = 1.416667，x₃ ≈ 1.414216，快速逼近 √2 = 1.414214。
The method requires calculating the derivative f ′(x). It may fail if f ′(x) is zero or very close to zero near the root, or if the initial guess is far from the root, causing divergence.
该法需要计算导数 f ′(x)。当根附近 f ′(x) 为零或极接近零，或者初始猜测远离根时，可能导致迭代发散。
4. Comparing Root-Finding Methods | 4. 求根方法的比较
In an exam or a real modelling task, choosing between bisection and Newton–Raphson depends on the situation. Bisection is reliable but slow, requiring many iterations for high accuracy. Newton–Raphson is fast when it converges, but it can be sensitive to the initial estimate and needs the derivative.
在考试或实际建模任务中，选择二分法还是牛顿–拉弗森方法取决于具体情形。二分法可靠但慢，达到高精度需要较多迭代；牛顿–拉弗森法在收敛时速度快，但对初值敏感，且需要导数。
| Feature | Bisection | Newton–Raphson |
| Guaranteed convergence | Yes, if sign change exists | Not always |
| Derivative required | No | Yes |
| Error behaviour | Error halves each step | Roughly quadratic near root |
| Typical use | Robust bracketing | Fast local refinement |
Sometimes a hybrid strategy is used: start with bisection to guarantee a narrow interval, then switch to Newton–Raphson for fast convergence. This is a common approach in numerical analysis software.
有时会采用混合策略：先用二分法确保得到一个较窄的区间，再切换到牛顿–拉弗森法以快速收敛。这是数值分析软件中的常见做法。
5. The Trapezium Rule for Numerical Integration | 5. 梯形法则数值积分
Many integrals arising from models cannot be evaluated using standard antiderivatives. The trapezium rule approximates the area under a curve by dividing the interval [a, b] into n strips of equal width h = (b − a) / n, and approximating each strip by a trapezium.
许多由模型产生的积分无法用标准原函数求出。梯形法则将区间 [a, b] 分成 n 条等宽为 h = (b − a) / n 的条带，并用每个条带中的梯形来逼近曲线下的面积。
∫ₐᵇ y dx ≈ ½ h [y₀ + yₙ + 2(y₁ + y₂ + … + yₙ₋₁)]
For example, to approximate ∫₀¹ e^(x²) dx, there is no elementary antiderivative. With n = 4, h = 0.25, compute y at x = 0, 0.25, 0.5, 0.75, 1, then apply the formula. The result is an approximation whose accuracy improves as n increases.
例如，近似计算 ∫₀¹ e^(x²) dx，该积分不存在初等原函数。取 n = 4，h = 0.25，计算 x = 0、0.25、0.5、0.75、1 处的 y 值，然后套用公式。所得为近似值，且随着 n 增大精度提高。
The error of the trapezium rule is proportional to h² times the maximum magnitude of f ″(x) on the interval. Therefore, doubling n divides the error by approximately 4.
梯形法则的误差与区间上 |f ″(x)| 最大值乘以 h² 成正比。因此，n 加倍时误差约缩小为原来的 1/4。
6. Simpson’s Rule for Greater Accuracy | 6. 辛普森法则：更高的精度
Simpson’s rule uses parabola segments rather than straight lines to approximate the curve. It requires an even number of strips, n. With h = (b − a) / n, the formula is
辛普森法则使用抛物线段而非直线段来逼近曲线。它要求 n 为偶数。设 h = (b − a) / n，公式为
∫ₐᵇ y dx ≈ (h/3) [y₀ + yₙ + 4(y₁ + y₃ + …) + 2(y₂ + y₄ + …)]
The error in Simpson’s rule is proportional to h⁴ times the maximum magnitude of f ⁗(x) (the fourth derivative) on the interval. This makes it significantly more accurate than the trapezium rule for smooth functions, often allowing fewer strips for the same desired accuracy.
辛普森法则的误差与区间上 |f⁗(x)|（四阶导数）最大值乘以 h⁴ 成正比。对于光滑函数，这比梯形法则精确得多，达到相同精度所需条带通常更少。
In modelling, Simpson’s rule is useful for computing total quantities from sampled data, such as storm discharge over time or the work done by a non-constant force when only discrete measurements are available.
在建模中，辛普森法则用于由采样数据计算总量，例如随时间变化的暴雨水流量，或仅有离散测量数据时变力所做的功。
7. Euler’s Method for Differential Equations | 7. 欧拉法求解微分方程
Many models are described by a first-order differential equation dy/dx = f(x, y), with an initial condition. Euler’s method uses a step size h to march forward from the initial point, approximating the derivative as constant over each small step.
许多模型由一阶微分方程 dy/dx = f(x, y) 及初始条件描述。欧拉法使用步长 h 从初始点向前推进，在每个小步中将导数近似视为常数。
yₙ₊₁ = yₙ + h · f(xₙ, yₙ)
For example, consider dy/dx = x + y with y(0) = 1. Taking h = 0.1, we compute x₁ = 0.1, y₁ = 1 + 0.1·(0+1) = 1.1, then x₂ = 0.2, y₂ = 1.1 + 0.1·(0.1+1.1) = 1.22, and so on. The accuracy improves as h is reduced.
例如，考虑 dy/dx = x + y，y(0) = 1。取 h = 0.1，计算 x₁ = 0.1，y₁ = 1 + 0.1·(0+1) = 1.1；再 x₂ = 0.2，y₂ = 1.1 + 0.1·(0.1+1.1) = 1.22，依此类推。h 越小，精度越高。
Euler’s method is simple and easy to program, but the global error is proportional to h. This means that for high accuracy, a very small h is needed, which can be computationally expensive. For many practical models, more sophisticated methods such as the Runge–Kutta family are preferred, but Euler’s method is a fundamental concept in numerical analysis and is often examined at A-Level.
欧拉法简单、易于编程，但整体误差与 h 成正比。这意味着若需较高精度，需要非常小的 h，可能造成计算开销较大。在许多实际模型中，人们更倾向使用龙格–库塔族等更精细的方法，但欧拉法是数值分析的基础概念，也常见于 A-Level 考试。
8. Practical Modelling: Population and Cooling | 8. 实际建模：种群增长与冷却
Exponential growth models, such as the population of a species with unlimited resources, are easy to solve analytically. But when resources are limited, the logistic equation dP/dt = rP(1 − P/K) is nonlinear and often requires numerical treatment.
指数增长模型，例如资源无限时物种的种群规模，容易解析求解。但当资源有限时，逻辑斯蒂方程 dP/dt = rP(1 − P/K) 是非线性的，往往需要数值处理。
Suppose a population starts at P₀ = 100, with r = 0.2 per year and carrying capacity K = 1000. Using Euler’s method with h = 1 year, the first step gives P₁ = 100 + 1·0.2·100·(1 − 100/1000) = 118. Repeating this over many years gives a discrete approximation to the logistic curve.
假设种群初始 P₀ = 100，r = 0.2/年，环境容纳量 K = 1000。使用欧拉法，取 h = 1 年，第一步：P₁ = 100 + 1·0.2·100·(1 − 100/1000) = 118。逐年重复即可得到逻辑斯蒂曲线的离散近似。
Newton’s law of cooling states that dT/dt = −k(T − Tₐ), where Tₐ is the ambient temperature. The analytical solution is T(t) = Tₐ + (T₀ − Tₐ)e^(−kt). If k itself varies with temperature or if Tₐ is not constant, numerical methods become necessary to simulate the cooling process.
牛顿冷却定律给出 dT/dt = −k(T − Tₐ)，其中 Tₐ 为环境温度。解析解为 T(t) = Tₐ + (T₀ − Tₐ)e^(−kt)。若 k 随温度变化，或 Tₐ 不是常数，就需要用数值方法模拟冷却过程。
9. Error, Convergence and Efficiency | 9. 误差、收敛与效率
Every numerical method introduces an error. Two common categories are truncation error, caused by stopping an infinite process, and rounding error, caused by limited precision in calculators or computers. A good method balances these errors and is stable across many iterations.
每种数值方法都会引入误差。两大常见类别为：截断误差（由于终止无穷过程引起）和舍入误差（由于计算器或计算机精度有限引起）。好的方法能平衡这些误差，并在多次迭代中保持稳定。
Convergence describes how quickly the error decreases as step size decreases or iterations increase. For the bisection method, the error decreases by a constant factor of ½. Newton–Raphson has quadratic convergence in the neighbourhood of a simple root: the number of correct digits roughly doubles with each iteration.
收敛性描述了当步长减小或迭代次数增加时误差降低的速度。二分法的误差以常数因子 ½ 递减。牛顿–拉弗森法在单根附近具有二次收敛性：每一步正确的数字约翻倍。
Efficiency is also important. A method may converge, but if it requires too many function evaluations or a very tiny step size, it may be impractical for large models. Numerical modellers must consider both accuracy and computational cost.
效率同样关键。某方法可能收敛，但若需要大量函数求值或极小的步长，则对大型模型可能不实用。数值建模人员必须兼顾精度与计算成本。
10. Choosing and Applying Numerical Methods in Modelling | 10. 建模中的数值方法选择与应用
When solving a mathematical model, a structured approach helps. First, identify the type of problem: root-finding, integration, or differential equation. Second, decide on a suitable method based on available data, differentiability, and desired precision. Third, choose step sizes or tolerances appropriately. Finally, interpret the numerical results in the context of the original model.
求解数学模型时，结构化的方法很有帮助。首先识别问题类型：求根、积分还是微分方程。其次，根据可得数据、可微性与期望精度选择合适的方法。第三，合理选择步长或容差。最后，结合原始模型解释数值结果。
For example, in a physics project about projectile motion with air resistance proportional to speed squared, the acceleration equation may not be solvable analytically. Using Euler’s method or a Runge–Kutta approximation, one can predict the trajectory and landing point accurately.
例如，在关于空气阻力与速度平方成正比的抛体运动物理项目中，加速度方程可能无法解析求解。使用欧拉法或龙格–库塔近似，可以准确预测轨迹与落点。
In economic modelling, integro-differential equations for capital growth under stochastic shocks may lack closed-form solutions. Numerical integration and difference equations are routinely used to simulate scenarios and help decision-making.
在经济建模中，描述随机冲击下资本增长的积分微分方程往往缺少闭式解。数值积分与差分方程常被用来模拟情景并辅助决策。
11. Conclusion | 11. 结论
Numerical methods are not just exam topics; they are essential tools for turning mathematical models into practical predictions. The bisection method and Newton–Raphson method solve equations, the trapezium rule and Simpson’s rule evaluate integrals, and Euler’s method approximates solutions to differential equations.
数值方法不仅仅是考试主题，它们是把数学模型转化为实际预测的重要工具。二分法与牛顿–拉弗森法求解方程，梯形法则与辛普森法则计算积分，欧拉法则逼近微分方程的解。
Understanding the strengths, limitations, and error behaviour of each method allows a modeler to choose the most appropriate technique. In this way, numerical methods bridge the gap between abstract mathematics and the complex behaviour of the real world.
理解每种方法的优势、局限与误差行为，使建模者能够选择最恰当的技术。由此，数值方法在抽象数学与现实世界的复杂行为之间架起了桥梁。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply