Newton's Method for Solving Equations | 牛顿法解方程考点精讲

📚 Newton’s Method for Solving Equations | 牛顿法解方程考点精讲

Newton’s method, also known as the Newton-Raphson method, is a powerful numerical technique used to find approximate solutions to equations of the form f(x) = 0. This guide covers all the essential concepts required for the IGCSE CCEA Mathematics syllabus, including the iterative formula, its geometric meaning, the careful choice of starting values, and common pitfalls that can arise during its application. Mastering this method will equip you with a reliable tool for tackling equations that cannot be solved algebraically, and will deepen your understanding of how calculus connects to practical problem‑solving.

牛顿法，也称牛顿‑拉夫森法，是一种用于求解 f(x) = 0 型方程近似根的强大数值方法。本指南涵盖 IGCSE CCEA 数学大纲中所有核心考点，包括迭代公式、几何意义、初始值的审慎选择以及应用中常见的陷阱。掌握这一方法能让你在面对无法代数求解的方程时拥有一件可靠的工具，并加深你对微积分如何联系实际求解的理解。

1. Why Numerical Methods Are Needed | 为什么需要数值方法

Not every equation can be rearranged to give an exact, closed‑form solution using elementary algebraic techniques.

并非所有方程都能通过初等代数变形求出精确的闭式解。

For example, equations like x³ − 2x − 5 = 0 or cos x = x do not have simple formula‑based roots, yet we often need their solutions to a specified degree of accuracy.

例如 x³ − 2x − 5 = 0 或 cos x = x 这类方程并没有简单的公式化根，但我们又常常需要其具有特定精度的解。

Numerical methods fill this gap by generating a sequence of approximations that converge towards the true root.

数值方法通过生成一串逼近序列来弥补这一空白，这些逼近值会收敛到真实根。

Newton’s method is one of the most efficient of these techniques because it uses the derivative to rapidly home in on a root once a reasonable starting point is chosen.

牛顿法是其中最为高效的技术之一，因为它利用导数，只要选择了合理的初始值，就能快速逼近一个根。

2. The Newton-Raphson Iterative Formula | 牛顿‑拉夫森迭代公式

At the heart of the method lies the simple recurrence relation that generates successive approximations.

该方法的核心是生成逐次逼近的简洁递推关系。

For a differentiable function f(x) whose root we seek, the formula is:

对于要求根的任意可微函数 f(x)，其公式为：

xₙ₊₁ = xₙ − f(xₙ) / f'(xₙ)

Here xₙ is the current estimate of the root, f(xₙ) is the function value at that point, and f'(xₙ) is the value of the derivative at the same point.

这里 xₙ 是当前根的估计值，f(xₙ) 是该点的函数值，而 f'(xₙ) 是该点导数值。

You must be able to differentiate f(x) reliably before applying the method, as an incorrect derivative will corrupt the whole iterative process.

应用此方法前必须准确求出 f(x) 的导数，错误的导数会使整个迭代过程失效。

The new estimate xₙ₊₁ is used as the input for the next iteration until the desired level of accuracy is reached.

新的估计值 xₙ₊₁ 将作为下一次迭代的输入，直到达到所需精度。

3. Geometric Interpretation Using Tangents | 基于切线的几何解释

Newton’s method can be visualised as following the tangent line to the curve at the current guess to where it crosses the x‑axis.

牛顿法可以直观理解为：沿当前猜测点处曲线的切线前行，直至它与 x 轴相交。

At a point (xₙ, f(xₙ)), the tangent to y = f(x) has slope f'(xₙ).

在点 (xₙ, f(xₙ)) 处，曲线 y = f(x) 的切线斜率为 f'(xₙ)。

The x‑intercept of this tangent is precisely the value given by xₙ₊₁ = xₙ − f(xₙ)/f'(xₙ).

这条切线与 x 轴的交点恰好就是 xₙ₊₁ = xₙ − f(xₙ)/f'(xₙ) 给出的值。

If your initial guess is close to a true root and the function behaves smoothly, the intersection will be an even better approximation.

若初始猜测足够靠近真实根且函数性态平滑，该交点将是一个更优的逼近。

This geometric picture explains why the method can converge very quickly: each step effectively replaces the curve with its local linearisation.

这一几何图景解释了该方法能快速收敛的原因：每一步都有效地将曲线替换为其局部线性化。

4. Choosing a Suitable Starting Value x₀ | 选择合适的初始值 x₀

The success of Newton’s method depends heavily on picking a starting value x₀ that is reasonably close to the actual root.

牛顿法的成功在很大程度上依赖于选择一个足够接近真实根的初始值 x₀。

In IGCSE CCEA problems, you will often be given a suggested starting value, or you may need to find one by evaluating f(x) at a few integer points and looking for a sign change.

在 IGCSE CCEA 考题中，通常会给出建议的初始值，或者你需要通过计算若干个整数点处的 f(x) 并寻找变号区间来自行确定一个。

If f(a) and f(b) have opposite signs, there must be at least one root between a and b, and you can choose the midpoint or the endpoint closer to zero as x₀.

若 f(a) 与 f(b) 异号，则在 a 与 b 之间至少存在一个根，你可以取中点或更靠近零的那个端点作为 x₀。

A poor choice, such as a point where the derivative is very small or the function has a turning point, can cause the iterations to diverge or cycle endlessly.

不当的选择（例如在导数极小或函数存在转向点处取值）会导致迭代发散或无限循环。

5. Carrying Out the Iteration Correctly | 正确执行迭代

Once x₀ is chosen, you substitute it into the formula to find x₁, then use x₁ to find x₂, and so on.

一旦选定 x₀，将其代入公式求出 x₁，再用 x₁ 求 x₂，依此类推。

It is essential to work to a consistent degree of accuracy; exam questions typically ask for answers correct to a given number of decimal places or significant figures.

必须保持一致的精度进行计算；考题通常要求将答案保留到指定的小数位数或有效数字。

You should keep intermediate values to at least one extra figure to avoid rounding errors spoiling the final result.

中间值应至少多保留一位数字，以避免舍入误差破坏最终结果。

Stop the iteration when two successive approximations agree to the required accuracy, for example when rounding to 3 decimal places gives the same value for xₙ and xₙ₊₁.

当连续两次逼近在所要求的精度下一致时即可停止迭代，例如当 xₙ 与 xₙ₊₁ 四舍五入到三位小数后结果相同。

In some questions, you may be asked to perform a fixed number of iterations regardless of convergence.

在某些题目中，无论是否收敛，都可能要求你执行固定次数的迭代。

6. Worked Example: Approximating √3 | 示例：逼近 √3

Suppose we wish to find √3 correct to 3 decimal places by solving f(x) = x² − 3 = 0.

假设我们要通过求解 f(x) = x² − 3 = 0 来求 √3 并精确到三位小数。

The derivative is f'(x) = 2x, so the Newton‑Raphson formula becomes xₙ₊₁ = xₙ − (xₙ² − 3) / (2xₙ).

导数为 f'(x) = 2x，因此牛顿‑拉夫森公式化为 xₙ₊₁ = xₙ − (xₙ² − 3) / (2xₙ)。

Taking x₀ = 1.5 (since 1.5² = 2.25, reasonably close):

取 x₀ = 1.5（因 1.5² = 2.25，相当接近）：

x₁ = 1.5 − (2.25 − 3) / 3 = 1.5 − (−0.75)/3 = 1.5 + 0.25 = 1.75.

x₁ = 1.5 − (2.25 − 3) / 3 = 1.5 − (−0.75)/3 = 1.5 + 0.25 = 1.75。

x₂ = 1.75 − (1.75² − 3) / (2 × 1.75) = 1.75 − (3.0625 − 3)/3.5 = 1.75 − 0.0625/3.5 ≈ 1.75 − 0.017857 = 1.732143.

x₂ = 1.75 − (1.75² − 3) / (2 × 1.75) = 1.75 − (3.0625 − 3)/3.5 = 1.75 − 0.0625/3.5 ≈ 1.75 − 0.017857 = 1.732143。

x₃ = 1.732143 − (1.732143² − 3) / (2 × 1.732143). Since 1.732143² ≈ 3.00032, we get x₃ ≈ 1.732143 − 0.00032/3.464286 ≈ 1.73205.

x₃ = 1.732143 − (1.732143² − 3) / (2 × 1.732143)。因为 1.732143² ≈ 3.00032，得 x₃ ≈ 1.732143 − 0.00032/3.464286 ≈ 1.73205。

Rounded to 3 decimal places, x₂ and x₃ both give 1.732, so √3 ≈ 1.732 to 3 d.p.

四舍五入到三位小数后，x₂ 和 x₃ 均给出 1.732，因此 √3 约等于 1.732（精确至三位小数）。

7. Using Your Calculator Efficiently | 高效使用计算器

IGCSE exams allow scientific calculators, and you can speed up Newton’s method by using the ANS or memory function.

IGCSE 考试允许使用科学计算器，你可以利用 ANS 或记忆功能加速牛顿法的计算。

After entering x₀, you can type the formula using ANS for xₙ, then repeatedly press ‘=’ to generate successive approximations.

输入 x₀ 之后，可以用 ANS 代替 xₙ 输入公式，然后反复按下“=”键生成逐次逼近值。

For example, with f(x) = x² − 3, input 1.5 =, then type ANS − (ANS² − 3) ÷ (2 ANS) and press ‘=’ repeatedly.

例如对于 f(x) = x² − 3，输入 1.5 =，然后键入 ANS − (ANS² − 3) ÷ (2 ANS) 并反复按“=”。

Keep a record of the displayed values so you can show the steps in your written solution.

请记录每次显示的值，以便在书面解答中展示步骤。

Watch out for calculators that round intermediate answers; you may need to use the full precision stored internally.

注意有些计算器会对中间结果舍入；你可能需要使用内部存储的全部精度。

8. When Newton’s Method Fails | 牛顿法何时失效

Despite its speed, Newton’s method is not foolproof, and the exam may ask you to explain why an iteration fails.

尽管牛顿法速度很快，但并非万无一失，考试中可能要求你解释为何迭代会失败。

One common failure occurs when the starting value is near a stationary point where f'(x₀) = 0 or very small, causing a hugely large or undefined next guess.

常见的一种失败是初始值靠近驻点，此时 f'(x₀) = 0 或极小，导致下一个猜测值巨大或无定义。

Another problem is oscillation: the iterates can cycle between two values without ever homing in on a root.

另一个问题是振荡：迭代值可能在两个值之间循环，始终无法逼近根。

If the function is not defined for all real numbers (e.g. ln x), an iterate might step outside the domain and produce an error.

若函数并非对所有实数都有定义（如 ln x），迭代值可能会跳出定义域并产生错误。

Recognising these pitfalls helps you diagnose problems and choose better starting values or use an alternative method like interval bisection.

认识这些陷阱有助于你诊断问题，并选择更好的初始值，或改用如二分法等其他方法。

9. Order of Convergence | 收敛阶

Newton’s method typically exhibits quadratic convergence near a simple root, meaning the number of correct decimal places roughly doubles with each step.

牛顿法在单根附近通常表现出二次收敛，即每步正确的小数位数大致翻倍。

This is why a good initial guess can lead to very accurate results after just two or three iterations.

这就是为何良好的初始猜测可在仅两三次迭代后得出非常精确的结果。

In contrast, methods like linear interpolation or bisection converge more slowly, at a linear rate.

相比之下，线性插值或二分法收敛较慢，呈线性速率。

While IGCSE does not require you to prove the order of convergence, it is useful to understand why Newton’s method is so efficient.

虽然 IGCSE 不要求证明收敛阶，但了解它为何如此高效仍然有用。

10. Applying Newton’s Method to Different Types of Equations | 将牛顿法应用于各类方程

The method works for any differentiable f(x), whether polynomial, trigonometric, exponential, or a mixture.

该方法适用于任何可微的 f(x)，无论是多项式、三角函数、指数函数或混合形式。

For example, to solve eˣ = 4 − x, define f(x) = eˣ + x − 4, so that f'(x) = eˣ + 1.

例如要求解 eˣ = 4 − x，可设 f(x) = eˣ + x − 4，从而 f'(x) = eˣ + 1。

Always rewrite the equation in the form f(x) = 0 before differentiating.

务必先将方程写成 f(x) = 0 的形式再进行求导。

If the function involves parameters or coefficients, treat them as constants and differentiate as usual.

若函数含有参数或系数，将其视为常量并正常求导即可。

When asked to find a root to a given accuracy, make sure you clearly state your final approximate value and the number of iterations used.

当被要求将根求至指定精度时，务必清晰地给出最终近似值以及所使用的迭代次数。

11. Common Errors and How to Avoid Them | 常见错误与规避方法

Many candidates lose marks by failing to differentiate correctly, especially when dealing with products, quotients, or chain rule situations.

许多考生因求导错误而失分，尤其是在处理乘法、除法或链式法则情境时。

Double‑check your f'(x) before starting iterations; a small slip here will propagate through the whole calculation.

开始迭代前务必复查 f'(x)；这里的一个小笔误将蔓延至整个计算。

Another common mistake is stopping the iteration too early, when successive values have not yet stabilised to the required accuracy.

另一常见错误是过早停止迭代，此时逐次值在所需精度下尚未稳定。

Also, remember that Newton’s method gives only one root at a time; if the equation has multiple roots, you need different starting values to find each one.

此外，请记住牛顿法一次只求一个根；若方程有多个根，则需要不同的初始值来分别求取。

12. Exam Strategy and Final Tips | 考试策略与最后提醒

In the exam, show your working clearly by writing down x₀, x₁, x₂, … to the required accuracy, and underline or circle your final answer.

考试中要清晰展示解题过程，依次写出 x₀、x₁、x₂……并保留至所要求的精度，并在最终答案下划线或加圈。

If a question asks for an iteration to be performed twice, you must compute x₁ and x₂ explicitly; do not skip any steps.

若题目要求执行两次迭代，则必须显式计算出 x₁ 和 x₂，不可跳过任何步骤。

When explaining why a particular starting value is unsuitable, refer to the derivative being zero or the function not being differentiable at that point.

当解释为何某个初始值不合适时，应提及导数为零或函数在该点不可微。

Practice with a variety of functions and be comfortable reading off values from a calculator display to the correct number of decimal places.

练习时尽量覆盖多种函数，并熟练从计算器显示屏上读出具有正确小数位数的值。

Finally, always check whether your approximate root, when substituted back into the original equation, gives a value near zero as a quick sanity test.

最后，始终将所得近似根代回原方程进行快速验证，看其是否接近零。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Newton’s Method for Solving Equations | 牛顿法解方程考点精讲