资 源 简 介
混沌(Chaos),Logistic方程
X(n) = k*X(n-1)*( 1-X(n-1) ),即二次函数
f(x) = k*x(1-x), 选择适当的常数k,选择初始值 x0,迭代计算:
x1=f(x0), x2=f(x1), x3=f(x2),...,
序列{ Xn }的整体"状态",敏感的依赖于常数k和初始值x0, 序列可能收敛,也可能,"乱七八糟"地振荡--产生混沌Chaos!-Chaos (Chaos), the logistic equation X (n) = k* X (n-1)* (1-X (n-1)), that is quadratic function f (x) = k* x (1-x), the election Optional appropriate constants k, the initial value of options x0, iterative calculation : x1 = f (x0), x2 = f (x), x3 = f (x2 ),..., sequence) (Xn the overall "state" sensitive dependence on constants k and initial value x0, convergent sequence may also possible, "mess" to the oscillation-- have Chaotic Chaos!
