← 返回资讯屏轩教育 · 行业资讯

Discrete Systems | 离散系统

2026-08-03 02:39 · 本文部分内容由AI辅助创作

📚 Discrete Systems | 离散系统

Discrete systems are mathematical models describing quantities that change in distinct, separate steps, rather than continuously. In the IB Mathematics curriculum, discrete systems appear through sequences, recurrence relations, difference equations, Markov chains, and matrix models such as Leslie matrices. These systems are essential for modelling population dynamics, financial growth, the spread of information, and many real‑world processes where change happens at definite time intervals.

离散系统是描述量按离散、分开的步长变化而非连续变化的数学模型。在 IB 数学课程中,离散系统以数列、递推关系、差分方程、马尔可夫链及莱斯利矩阵等形式出现。这类系统在种群动态建模、金融增长、信息传播以及许多现实世界按固定时间间隔变化的过程中至关重要。


1. Understanding Discrete Systems | 理解离散系统

ate is often represented by a variable xₙ. The rule that relates the current state to the next is called a recurrence relation or difference equation. Unlike differential equations, which describe continuous change, difference equations capture step‑by‑step evolution.

离散系统按整数时间步 n = 0, 1, 2, ... 演化,其状态通常用变量 xₙ 表示。将当前状态与下一状态联系起来的规则称为递推关系或差分方程。与描述连续变化的微分方程不同,差分方程捕捉的是逐步演化过程。

Common notations include uₙ, aₙ, or Pₙ. An example of a simple discrete system is a savings account where the balance at the end of year n+1 depends on the balance of year n plus interest. Such systems often lead to linear recurrence relations, which can be solved explicitly or analysed for long‑term behaviour.

常见的表示法有 uₙ、aₙ 或 Pₙ。简单离散系统的一个例子是储蓄账户,其中第 n+1 年末的余额取决于第 n 年的余额加上利息。这类系统通常导出线性递推关系,可以显式求解或分析其长期行为。


2. Sequences and Recurrence Relations | 数列与递推关系

th given initial conditions, it defines a sequence. In IB Mathematics, you will meet first‑order linear recurrences frequently, such as uₙ₊₁ = a uₙ + b, with u₀ known.

k 阶递推关系将项 xₙ 用前 k 项表示:xₙ = f(xₙ₋₁, xₙ₋₂, ..., xₙ₋ₖ)。给定初始条件后,它便定义一个数列。在 IB 数学中,你会经常遇到一阶线性递推,如 uₙ₊₁ = a uₙ + b,其中 u₀ 已知。

+ b, and so on. Recognising the type of recurrence is vital because it determines the solution method and the behaviour of the sequence—whether it converges, diverges, or oscillates.

要生成各项,只需迭代此关系:u₁ = a u₀ + b,u₂ = a u₁ + b,依此类推。识别递推类型至关重要,因为它决定了求解方法及数列的行为——收敛、发散还是振荡。


3. First‑Order Linear Difference Equations | 一阶线性差分方程

The general first‑order linear difference equation with constant coefficients is written as:

常系数一阶线性差分方程的一般形式为:

xₙ₊₁ = a xₙ + b

es a homogeneous part and a particular constant solution x* = b / (1 − a), provided a ≠ 1.

这里 a 与 b 为常数。若 b = 0,方程变为齐次:xₙ₊₁ = a xₙ,其解显然为 xₙ = aⁿ x₀。当 b ≠ 0 时,解由齐次部分与一个常数特解 x* = b / (1 − a) 组合而成,前提是 a ≠ 1。

giving an arithmetic sequence: xₙ = x₀ + n b. The explicit solution formula for a ≠ 1 is:

若 a = 1,方程简化为 xₙ₊₁ = xₙ + b,得到等差数列:xₙ = x₀ + n b。a ≠ 1 时的显式解公式为:

xₙ = aⁿ x₀ + b · (1 − aⁿ)/(1 − a)


4. Solving by Iteration | 迭代法求解

When an explicit formula is not required, or to discover a pattern, iteration is a straightforward technique. Start from the initial value x₀ and repeatedly apply the recurrence. This builds the sequence term‑by‑term and often reveals whether it stabilises, grows, or cycles.

当不需要显式公式或为了发现规律时,迭代是一种直接的技巧。从初始值 x₀ 开始,反复应用递推关系。这样逐项构造数列,通常能揭示系统是稳定、增长还是循环。

s easily carried out on a calculator using the Ans function, a skill emphasised in IB examinations.

例如,对于 xₙ₊₁ = 0.8 xₙ + 20 且 x₀ = 10,迭代得到 x₁ = 28,x₂ = 42.4,x₃ ≈ 53.92,缓慢趋向不动点 x* = 100。该过程可借助计算器的 Ans 功能轻松完成,这是 IB 考试中强调的一项技巧。


5. Modelling Population Growth | 种群增长建模

owth rate per period. This gives exponential growth when r > 0. To reflect limited resources, a density‑dependent variant can be introduced, such as the discrete logistic equation:

最简单的离散种群增长模型是马尔萨斯模型:Pₙ₊₁ = (1 + r) Pₙ,其中 r 为每期净增长率。当 r > 0 时,该模型呈现指数增长。为反映有限资源,可引入密度制约变体,例如离散逻辑斯谛方程:

Pₙ₊₁ = Pₙ + r Pₙ (1 − Pₙ / K)

Here K is the carrying capacity. Unlike the continuous logistic model, this difference equation can produce complex dynamics, including cycles and chaos for certain r values. IB questions often focus on building recurrence relations from word problems and interpreting the parameters in a real‑world context.

这里 K 为环境容纳量。与连续逻辑斯谛模型不同,该差分方程对于特定 r 值可能产生复杂动力学,包括周期与混沌。IB 题目通常侧重于从文字题建立递推关系,并在实际情境中解读参数。


6. Financial Applications | 金融应用

ts or withdrawals modify it to Aₙ₊₁ = (1 + i) Aₙ + D, where D can be positive or negative.

离散系统能优雅地为复利、贷款和年金建模。若本金 Aₙ 每期按利率 i 生息,则一期后余额为 Aₙ₊₁ = (1 + i) Aₙ。定期存入或取出会将此关系修改为 Aₙ₊₁ = (1 + i) Aₙ + D,其中 D 可为正或负。

ar payment D can be expressed using the earlier explicit formula with a = 1 + i and b = D.

通过求解相应的差分方程,我们可得年金的终值或贷款的月度还款额。例如,初始存入 P 并定期支付 D 后 n 期余额,可用前文 a = 1 + i、b = D 的显式公式表示。


7. Equilibrium and Stability of Fixed Points | 不动点的平衡与稳定性

a x* + b, giving x* = b / (1 − a) when a ≠ 1. The stability of this equilibrium depends on |a|. If |a| < 1, the system converges to x* from any initial condition; if |a| > 1, it diverges; if |a| = 1, the sequence either stays constant or oscillates without convergence.

不动点 x* 满足 x* = a x* + b,当 a ≠ 1 时给出 x* = b / (1 − a)。此平衡点的稳定性取决于 |a|。若 |a| < 1,系统从任何初始条件收敛到 x*;若 |a| > 1,则发散;若 |a| = 1,数列要么保持不变,要么振荡而不收敛。

int, vertical and horizontal segments generate the orbit, showing monotonic or oscillatory approach to equilibrium.

蛛网图是一种可视化迭代 xₙ₊₁ = f(xₙ) 和趋向不动点收敛性的图形工具。画出曲线 y = f(x) 和直线 y = x;从初始点出发,纵横向线段生成轨道,展示单调或振荡趋近均衡的过程。


广告 / Sponsored

8. Second‑Order Linear Homogeneous Difference Equations | 二阶线性齐次差分方程

A second‑order linear homogeneous difference equation has the form:

二阶线性齐次差分方程具有如下形式:

xₙ₊₂ + p xₙ₊₁ + q xₙ = 0

ential equations: assume xₙ = rⁿ, leading to the characteristic equation r² + p r + q = 0.

这在 IB HL 中出现,用于具有两个初始条件的系统建模。求解方法类似于微分方程:假设 xₙ = rⁿ,导出特征方程 r² + p r + q = 0。

. Complex conjugate roots require writing the solution in terms of trigonometric functions, though IB typically restricts this to real‑root cases.

相异实根 r₁ 和 r₂ 给出通解 xₙ = C₁ r₁ⁿ + C₂ r₂ⁿ。重根 r 给出 xₙ = (C₁ + C₂ n) rⁿ。共轭复根需要用三角函数写出解,不过 IB 通常将该情形限制在实根范围内。


9. Markov Chains as Discrete Systems | 作为离散系统的马尔可夫链

es), the update rule is vₙ₊₁ = vₙ P, where P is the transition matrix whose rows sum to 1.

马尔可夫链描述一个系统每步在有限个状态之间转移,且转移概率仅取决于当前状态。若第 n 步的状态向量为 vₙ(概率行向量),更新规则为 vₙ₊₁ = vₙ P,其中 P 为转移矩阵,各行之和为 1。

Repeated multiplication gives vₙ = v₀ Pⁿ. Long‑term behaviour is studied by finding a steady‑ the condition that the components sum to 1. IB AI HL questions commonly ask for the steady‑state distribution or the probability of being in a certain state after k steps.

反复相乘得 vₙ = v₀ Pⁿ。通过寻找满足 π = π P 的稳态向量 π 来研究长期行为。这需要求解线性方程组,通常附加各分量之和为 1 的条件。IB AI HL 试题常要求计算稳态分布或 k 步后处于某状态的概率。

Example: for a two‑state weather model with transition matrix

示例:一个两状态天气模型,转移矩阵为

0.7 0.3
0.4 0.6

= [4/7, 3/7], found by solving π₁ = 0.7π₁ + 0.4π₂ and π₂ = 0.3π₁ + 0.6π₂ with π₁ + π₂ = 1.

稳态为 π = [4/7, 3/7],通过求解 π₁ = 0.7π₁ + 0.4π₂、π₂ = 0.3π₁ + 0.6π₂ 以及 π₁ + π₂ = 1 得出。


10. Leslie Matrix Models | 莱斯利矩阵模型

The Leslie model is a discrete age‑ rix containing fertility rates on the first row and survival probabilities on the subdiagonal.

莱斯利模型是一种离散的年龄结构种群模型,广泛应用于生态学。种群向量 nₜ 列出时刻 t 各年龄段个体数。投影公式为 nₜ₊₁ = L nₜ,其中 L 是莱斯利矩阵,第一行包含生育率,次对角线为存活概率。

This is a first‑order system of difference equations, whose long‑term growth rate is the dominant eigenvalue λ₁ of L. The stable age distribution is the corresponding eigenvector. IB AI HL exams may ask students to interpret the entries of L, compute population vectors over time, or use dominant eigenvalue analysis to determine population growth or decline.

这是一个一阶差分方程组,其长期增长率即 L 的主特征值 λ₁。稳定年龄分布为对应特征向量。IB AI HL 考试可能要求学生解释 L 的条目、计算不同时间的种群向量,或使用主特征值分析判断种群增长或衰退。

For instance, a Leslie matrix with first row [0, 4, 2] and subdiagonal [0.5, 0.3] projects a population with three age classes, where juveniles do not reproduce, adults produce 4 offspring, and seniors produce 2, while 50% of juveniles survive to adulthood and 30% of adults survive to the next age class.

例如,一个第一行为 [0, 4, 2] 且次对角线为 [0.5, 0.3] 的莱斯利矩阵对三个年龄段的种群进行投影,其中幼体不繁殖,成体产生 4 个后代,老体产生 2 个后代,同时 50% 幼体存活至成体,30% 成体存活至下一龄级。


11. Long‑Term Behaviour and Steady‑State Analysis | 长期行为与稳态分析

Analysing the long‑term behaviour of discrete systems answers critical questions: will the system stabilise, grow without bound, or oscillate? For linear difference equations, this is determined by the magnitude of the coefficient a or the dominant eigenvalue. In non‑linear systems, linearisation near fixed points can be used.

分析离散系统的长期行为可以回答关键问题:系统会稳定、无界增长还是振荡?对于线性差分方程,这取决于系数 a 或主特征值的模。对于非线性系统,可在不动点附近进行线性化处理。

In Markov chains and Leslie models, raising the matrix to a large power or finding eigenvectors reveals the limit distribution or growth factor. Understanding these limits allows you to interpret models correctly, for example predicting whether a population will be sustainable or a market share will reach equilibrium.

在马尔可夫链和莱斯利模型中,将矩阵乘至高次幂或求特征向量可揭示极限分布或增长因子。理解这些极限能让你正确解读模型,例如预测一个种群是否可持续或市场份额是否会达到均衡。


12. Exam Tips and Common Pitfalls | 考试技巧与常见误区

s defined over n = 0, 1, 2, ... or n = 1, 2, ... . Misalignment of indices can lead to off‑by‑ initial conditions clearly and check your explicit formula against a few iterated values.

在 IB 考试中处理离散系统问题时,务必注意递推关系是基于 n = 0, 1, 2, ... 还是 n = 1, 2, ... 。下标错位会导致差一错误。清晰标注初始条件,并用几步迭代值检验你的显式公式。

e matrix multiplication or solving systems for steady states. When a question asks for the "long‑term" e fixed point, provided you justify the convergence. Watch out for the stability condition |a| < 1 in first‑ ions and do not forget to check whether a = 1 separately, as it changes the solution form.

充分利用图形计算器进行重复矩阵乘法或求解稳态方程组。当题目要求“长期”值时,通常可以将矩阵乘至高次幂(例如 50 次)或计算不动点,只要你能说明收敛性。注意一阶方程中的稳定性条件 |a| < 1,并不要忘记单独检查 a = 1 的情形,因为这会改变解的形式。

Finally, interpret your mathematical results in the context of the problem. Whether it is a declining population, a limiting probability, or a future balance, a sentence linking your numbers to the real‑world scenario is often required for full marks.

最后,将数学结果置于问题情境中解读。无论是种群下降、极限概率,还是未来余额,通常都需要用一句话将数字与实际情境联系起来才能拿到满分。


Published by TutorHao | Mathematics Revision Series | aleveler.com

广告 / Sponsored
IBDP国际文凭计算机科学学生用书 高级及标准水平 Computer Science for the IB Diplo…
计算机 备考教辅 · 正版现货 · 与本文内容相关
查看详情 / View on Taobao参考价 ¥524.0

更多咨询请联系16621398022(同微信)

备考资讯每日更新,关注不错过
考纲变化 · 科目分析 · 学习方法
扫码关注公众号 tutorhao
在微信里长按二维码识别关注
或截图后用「扫一扫 → 相册」选择本图
公众号:tutorhao