Newton's Method for Root Finding | 牛顿迭代法求根

📚 Newton’s Method for Root Finding | 牛顿迭代法求根

Many equations arising in mathematics cannot be solved exactly using algebraic methods. In IB and CCEA A-level Mathematics, numerical methods provide a powerful toolset for approximating roots to any desired accuracy. Among these, Newton’s method (also called the Newton-Raphson method) stands out for its remarkable speed of convergence when applied under suitable conditions. Understanding its derivation, geometric meaning, and limitations is essential for tackling both calculator-based and theoretical questions on your exams.

在数学中，许多方程无法用代数方法精确求解。在IB和CCEA A-Level数学课程中，数值方法提供了一套强大的工具，可以帮助我们将根逼近到任意精度。其中，牛顿法（也称牛顿-拉弗森法）因在适当条件下具有极快的收敛速度而格外突出。理解它的推导过程、几何意义及其局限性，对于应对考试中基于计算器和理论性的问题至关重要。

1. Introduction to Numerical Root Finding | 数值求根简介

Numerical root-finding algorithms are iterative procedures that produce successively better approximations to the roots of a real-valued function f(x). In syllabuses such as IB Mathematics: Analysis and Approaches and CCEA A2 Mathematics, students are expected to apply Newton’s method, understand its formula, and discuss situations where it may fail. The main advantage of Newton’s method is quadratic convergence near the root, meaning the number of correct digits roughly doubles with each iteration once we are sufficiently close.

数值求根算法是一种迭代过程，能够逐步产生实值函数 f(x) 的根的更优近似值。在IB数学：分析与方法以及CCEA的A2数学课程中，学生需要能够应用牛顿法，理解其公式，并讨论它可能失效的情况。牛顿法的主要优势是在根附近具有二次收敛性，即一旦我们足够接近，每次迭代后正确数字的数量大致会翻倍。

2. The Principle of Newton’s Method | 牛顿法的原理

Newton’s method uses the tangent line at a current approximation xₙ to approximate the function f(x). The x-intercept of this tangent line provides the next approximation xₙ₊₁. Provided f is differentiable and a suitable initial guess x₀ is chosen, the sequence x₀, x₁, x₂, … converges rapidly to a root r of f(x)=0.

牛顿法利用在当前近似值 xₙ 处的切线来近似原函数 f(x)。该切线与 x 轴的交点即为下一个近似值 xₙ₊₁。只要 f 可微并且选取了合适的初始猜测值 x₀，序列 x₀, x₁, x₂, … 就会迅速收敛到方程 f(x)=0 的一个根 r。

The iterative formula is:

迭代公式为：

xₙ₊₁ = xₙ − f(xₙ) / f ‘(xₙ), f ‘(xₙ) ≠ 0

This update rule is derived from the first-order Taylor expansion of f around xₙ. It is the core computational step that you will use repeatedly in exam calculations.

这个更新规则源自 f 在 xₙ 附近的一阶泰勒展开。它是你在考试计算中需要反复使用的核心计算步骤。

3. Derivation of the Iterative Formula | 迭代公式的推导

Start with the linear approximation of f at xₙ: f(x) ≈ f(xₙ) + f ‘(xₙ)(x − xₙ). Setting this approximating line equal to zero to find its root gives 0 ≈ f(xₙ) + f ‘(xₙ)(x − xₙ). Solving for x yields x = xₙ − f(xₙ) / f ‘(xₙ). This suggests the next iterate xₙ₊₁. The derivation requires f ‘(xₙ) to be non-zero; otherwise the tangent is horizontal and the method breaks down.

从 f 在 xₙ 处的线性近似出发：f(x) ≈ f(xₙ) + f ‘(xₙ)(x − xₙ)。令此近似直线等于零以求其根，得到 0 ≈ f(xₙ) + f ‘(xₙ)(x − xₙ)。求解 x 可得 x = xₙ − f(xₙ) / f ‘(xₙ)。这就给出了下一个迭代值 xₙ₊₁。此推导要求 f ‘(xₙ) 不为零；否则切线水平，方法失效。

Understanding this derivation helps you recall the formula correctly under exam pressure and allows you to adapt it to slightly modified scenarios, such as when a second derivative term is included in more advanced numerical schemes.

理解这一推导过程有助于你在考试压力下正确回忆公式，并能将其适应于稍加变化的场景，例如在更高级的数值方法中加入二阶导数项。

4. Geometric Interpretation | 几何解释

Geometrically, Newton’s method replaces the curve y = f(x) with its tangent line at (xₙ, f(xₙ)). The x-coordinate where this tangent intercepts the x-axis becomes the next estimate. This process is repeated, stepping along the tangents towards the root. This visualisation clarifies why the method can struggle near inflection points or where the derivative is very small, as the tangent may shoot far away from the actual root.

从几何上看，牛顿法用曲线 y = f(x) 在点 (xₙ, f(xₙ)) 处的切线代替原曲线。该切线与 x 轴交点的横坐标成为下一个估计值。重复此过程，沿着切线逐步向根靠近。这一可视化过程解释了为什么方法在拐点附近或导数很小的地方会遇到困难，因为切线可能会远离真正的根。

Drawing a simple sketch is often a valuable exam technique to justify your choice of initial guess or to explain why a particular iteration diverges. The tangent line provides an intuitive sense of the method’s efficiency and its potential failures.

画一个简图通常是一种有价值的考试技巧，可以用来证明你选择的初始猜测值合理，或解释为何某次迭代发散。切线提供了一种直观的方法，让你感受到该方法的效率及其潜在的失败可能。

5. Choosing the Initial Guess | 初始值的选择

The success of Newton’s method heavily depends on the starting value x₀. A poor initial guess can lead to convergence to an unwanted root, oscillation, or outright divergence. In IB and CCEA problems, you may be given x₀ or asked to select one by analysing a graph or by using the Intermediate Value Theorem to locate an interval where f changes sign.

牛顿法的成功高度依赖于初始猜测值 x₀。不当的初始猜测值可能导致收敛到非目标根、振荡或完全发散。在IB和CCEA的问题中，你可能会被直接给定 x₀，或被要求通过分析图形或利用介值定理确定 f 变号的区间来选取一个 x₀。

A good strategy is to plot f(x) on a graphing calculator and pick x₀ near the visible root where the function is not too flat. If the derivative f ‘(x₀) is tiny, shift your starting point slightly to avoid a horizontal tangent line.

一个好的策略是在图形计算器上绘制 f(x)，并在可见根附近且函数不太平坦处选取 x₀。如果导数 f ‘(x₀) 非常小，稍微移动起点以避免水平切线。

6. Conditions for Convergence | 收敛条件

Newton’s method converges quadratically if f is continuously differentiable, f ‘(r) ≠ 0, and we start sufficiently close to a simple root r. The error eₙ = xₙ − r satisfies approximately |eₙ₊₁| ≤ M|eₙ|² for some constant M. This means fast, double-digit growth in correct decimal places once near the root. However, for multiple roots or if the initial guess is far away, convergence can be linear or may not occur at all.

如果 f 连续可微，f ‘(r) ≠ 0，且我们从足够接近单根 r 的位置开始，牛顿法会二次收敛。误差 eₙ = xₙ − r 大约满足 |eₙ₊₁| ≤ M|eₙ|²，其中 M 为某常数。这意味着一旦接近根，正确小数位数快速以双倍速度增长。但对于多重根，或者初始猜测值离根较远，收敛可能是线性的，或者根本不收敛。

CCEA exam questions sometimes ask you to show that a rearrangement of Newton’s formula produces quadratic convergence, whereas IB papers may focus more on testing the method with a given function and analysing the number of iterations needed for a specified accuracy.

CCEA的考题有时要求你证明牛顿公式的某种重排能产生二次收敛，而IB试卷可能更侧重于用给定函数测试该方法，并分析达到指定精度所需的迭代次数。

7. Newton’s Method for Systems of Equations (Extension) | 牛顿法求解方程组（拓展）

The one-dimensional Newton’s method extends naturally to systems of nonlinear equations. In higher-level IB and further mathematics, you might encounter the multivariate Newton-Raphson method, where the derivative is replaced by the Jacobian matrix. Although not commonly examined in core units, it demonstrates the versatility of the linearisation idea that underpins the single-variable method.

一维牛顿法可以自然地推广到非线性方程组。在更高级的IB和进阶数学中，你可能会遇到多元牛顿-拉弗森方法，其中导数被雅可比矩阵代替。虽然这在核心模块中不常考查，但它展示了支撑单变量方法的线性化思想的多用性。

8. Common Pitfalls and Failures | 常见陷阱与失效情况

Several classic failures can occur: the derivative f ‘(xₙ) may become zero, leading to division by zero; the sequence may oscillate between two values without settling; or the iterates may diverge to infinity. Another subtle trap is convergence to a different root from the one intended, especially when f has multiple zeros close together.

几种经典的失效可能发生：导数 f ‘(xₙ) 可能变为零，导致除以零；序列可能在两个值之间震荡而不收敛；或者迭代值可能发散到无穷。另一个微妙的陷阱是收敛到非预期的根，尤其是当 f 具有多个邻近的零点时。

In exam contexts, you should always check that f ‘(xₙ) is not too close to zero before performing an iteration step. Also, verify that successive iterations are indeed drawing closer to the root; if they start moving away, reassess your initial guess.

在考试情境中，在执行迭代步骤之前，你应当始终检查 f ‘(xₙ) 是否不太接近零。同时，验证逐次迭代是否确实在靠近根；如果它们开始远离，重新评估你的初始猜测值。

9. Worked Example 1: Basic Polynomial | 例题1：基础多项式

Find the root of f(x) = x³ − 2x − 5 near 2 to 4 decimal places.

求方程 f(x) = x³ − 2x − 5 在 2 附近的根，精确到 4 位小数。

We have f ‘(x) = 3x² − 2. Starting with x₀ = 2:

我们得到 f ‘(x) = 3x² − 2。从 x₀ = 2 开始：

x₀ = 2, f(2)=8−4−5=−1, f ‘(2)=12−2=10 → x₁ = 2 − (−1)/10 = 2.1
x₁ = 2.1, f(2.1)≈9.261−4.2−5=0.061, f ‘(2.1)=13.23−2=11.23 → x₂ = 2.1 − 0.061/11.23 ≈ 2.094568
x₂ = 2.094568, f(x₂)≈9.190−4.189−5=0.001, f ‘(x₂)=13.162−2=11.162 → x₃ ≈ 2.094568 − 0.001/11.162 ≈ 2.094552
x₃ ≈ 2.0946, further iteration gives no change at 4 decimal places.

Thus the root is approximately 2.0946 (to 4 d.p.). This illustrates rapid convergence after just three iterations.

因此根大约为 2.0946（精确至4位小数）。这展示了仅三次迭代后的快速收敛。

10. Worked Example 2: Trigonometric Equation | 例题2：三角方程

Use Newton’s method to approximate the smallest positive root of f(x) = cos x − x. Take x₀ = 0.7 and perform three iterations.

使用牛顿法求 f(x) = cos x − x 的最小正根的近似值。取 x₀ = 0.7 并进行三次迭代。

Here f ‘(x) = −sin x − 1. The iterative formula is xₙ₊₁ = xₙ − (cos xₙ − xₙ) / (−sin xₙ − 1).

这里 f ‘(x) = −sin x − 1。迭代公式为 xₙ₊₁ = xₙ − (cos xₙ − xₙ) / (−sin xₙ − 1)。

x₀ = 0.7, cos0.7≈0.7648, sin0.7≈0.6442 → f=−0.0648, f ‘ ≈ −1.6442 → x₁ = 0.7 − (−0.0648)/(−1.6442) = 0.7 − 0.0394 = 0.6606
x₁ = 0.6606, cos≈0.7890, sin≈0.6135 → f=0.1284, f ‘≈−1.6135 → x₂ = 0.6606 − 0.1284/(−1.6135) = 0.6606 + 0.0796 = 0.7402
x₂ = 0.7402, cos≈0.7385, sin≈0.6743 → f=−0.0017, f ‘≈−1.6743 → x₃ = 0.7402 − (−0.0017)/(−1.6743) = 0.7402 − 0.0010 = 0.7392

After three iterations we obtain approximately 0.7391, which is the Dottie number. This example shows that Newton’s method works equally well for transcendental equations.

三次迭代后我们得到约 0.7391，即 Dottie 数。此例表明牛顿法同样适用于超越方程。

11. Exam Tips and Common Mistakes | 考试技巧与常见错误

Always write down the derivative correctly and double-check your arithmetic at each step. In IB and CCEA exams, marks are awarded for the formula, substitution, and final accuracy. If asked to demonstrate that the root is accurate to a certain number of decimal places, show that successive iterates agree to that precision and that f changes sign around the final value.

始终正确写下导数，并在每一步复核你的算术。在IB和CCEA考试中，公式、代入以及最终精度都会给分。如果要求证明根精确到一定小数位，你需要展示连续迭代值在该精度上一致，并且 f 在最终值附近变号。

A common pitfall is forgetting to work in radians for trigonometric functions. Also, be careful with the negative sign in the formula — it is xₙ minus the quotient, not plus. When the derivative is algebraically messy, leave it in exact form until the final evaluation step to minimise rounding errors.

一个常见的陷阱是忘记三角函数要使用弧度制。此外，注意公式中的负号——是 xₙ 减去商，而不是加。当导数在代数上较为繁琐时，将其保留为精确形式直到最后的求值步骤，以尽量减少舍入误差。

12. Summary | 总结

Newton’s method is an elegant and efficient iterative technique for solving f(x)=0. Its tangent-line derivation provides both a formula and geometric insight. Success depends on a sensible choice of x₀ and awareness of conditions where the derivative vanishes or the function behaves poorly. By mastering these concepts and practising with typical exam-style functions, you will confidently handle any root-finding problem that appears in IB or CCEA Mathematics assessments.

牛顿法是一种优雅且高效的迭代技术，用于求解 f(x)=0。其切线推导不仅提供了公式，还提供了几何直观。成功与否取决于合理选取 x₀，并清楚了解导数消失或函数表现不佳的各种情况。通过掌握这些概念并练习典型的考试题型，你将能够自信地应对IB或CCEA数学评估中出现的任何求根问题。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Newton’s Method for Root Finding | 牛顿迭代法求根