| English | 释义 | 拼音 |
|---|---|---|
| root/ruːt/ | 根 | gēn |
| numerical method/njuːˈmerɪkl ˈmeθəd/ | 数值方法 | shù zhí fāng fǎ |
| accuracy/ˈækjʊrəsi/ | 精度 | jīng dù |
| sign change/saɪn tʃeɪndʒ/ | 变号 | biàn hào |
| iteration/ˌɪtəˈreɪʃn/ | 迭代 | dié dài |
| converge/kənˈvɜːdʒ/ | 收敛 | shōu liǎn |
| iterative formula/ˈɪtərətɪv ˈfɔːmjʊlə/ | 迭代公式 | dié dài gōng shì |
| rearrangement/ˌriːəˈreɪndʒmənt/ | 重新排列 | chóng xīn pái liè |
| diverge/daɪˈvɜːdʒ/ | 发散 | fā sàn |
The root 根 you can't see
- Some equations have no neat algebraic solution. $x^3 + x - 1 = 0$ can't be factorised.
- But you know a root exists between $0$ and $1$ because the function changes sign. Numerical methods 数值方法 let you find it to any accuracy 精度.
Locating a root
- Many equations can't be solved exactly. A root is a solution.
- Sign change 变号: if $f(a)$ and $f(b)$ have opposite signs (and no break between them), a root lies between $a$ and $b$.
Worked example. $f(x) = x^3 + x - 1$. $f(0) = -1$ (negative), $f(1) = 1$ (positive). Sign change → root between $0$ and $1$.
Sign change doesn't guarantee exactly one root. There could be 3 roots (or any odd number) between $a$ and $b$. The sign change only tells you there's at least one.

Iteration 迭代: step up to the curve and across to y = x; the steps converge 收敛 to a root
根在哪里?
y = ax³ + bx² + cx + d
一个根是曲线穿过零的地方。f(x) 的一个符号改变把一个根困在两个 x 值之间。
如果 f(a) 和 f(b) 有相反的符号(且 f 在它们之间连续),那么在 a 和 b 之间有:
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
一个连续函数的符号改变保证在 a 和 b 之间有一个根。
f(x) = x³ + x − 1。f(0) = −1 而 f(1) = 1。根在哪两个整数之间?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
在 0 和 1 之间符号改变(f(0) < 0, f(1) > 0),因此根位于 0 和 1 之间。
Iteration
- Rearrange the equation into the form $x = F(x)$.
- Use the iterative formula 迭代公式 $x_{n+1} = F(x_n)$ from a first guess $x_0$.
- If the values settle, they converge to a root. Keep going until steady to the asked accuracy.

Iteration: starting from $x_0$, each step applies $F$ and reflects in $y = x$. The cobweb spirals into the fixed point — the root.
一个迭代公式有这个形式:
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
迭代从一个初始猜测反复应用 x_{n+1} = F(x_n)。
如果迭代的值稳定到一个固定的数,它们已经收敛到一个根。
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
收敛意味着序列接近一个固定的值——方程的一个根。
用 x_{n+1} = ∛(1 − x_n),x₀ = 0,x₁ 是多少(2 位小数)?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
x₁ = ∛(1 − 0) = ∛1 = 1.
Worked example — iteration
- Solve $x^3 + x - 1 = 0$ using $x_{n+1} = \sqrt[3]{1 - x_n}$, starting from $x_0 = 0.5$.
- $x_1 = \sqrt[3]{0.5} = 0.794$, $x_2 = \sqrt[3]{0.206} = 0.591$, $x_3 = \sqrt[3]{0.409} = 0.742$, ...
- The values converge to $x \approx 0.682$.
一个迭代 x_{n+1} = F(x_n) 无论起始值如何总是收敛。
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
收敛要求在根附近 |F′(x)| < 1。差的重排或起始值可能发散。
Choosing a rearrangement 重新排列
- Not all rearrangements converge. The iteration $x_{n+1} = F(x_n)$ converges when $|F'(x)| < 1$ near the root.
- If it diverges 发散 (values move away), try a different rearrangement.
You've got it
- a sign change of $f$ between $a$ and $b$ traps a root in between
- iteration: $x_{n+1} = F(x_n)$ from a starting guess
- if the values converge (settle), they approach a root
- convergence requires $|F'(x)| < 1$ near the root
Write from the data given
- f(x) = x cubed minus 7.
- Use a sign change to locate a root.
对于 f(x) = x 的三次方减 7,证明在 1 和 2 之间存在一个根。
连续函数若发生符号变化,则在区间内存在根。
x 的三次方减 7 的根位于何处?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
f(1)为负,f(2)为正,因此根位于两者之间。其他选项——在0和1之间(课程区间);恰好为2(因为f(2)的值很小)。