Logistic映射分支值的最优化算法  

Optimum Algorithm for Bifurcation of Logistic Mapping

作　　者：刘军[1] 侯祥林[1] 王丹民[1] 王铁光[1] 

机构地区：[1]东北大学理学院,辽宁沈阳110006

出　　处：《东北大学学报（自然科学版）》2000年第5期580-582,共3页Journal of Northeastern University(Natural Science)

基　　金：原冶金工业部"八五"科技攻关项目! (冶 85 80 1 0 4 0 9)

摘　　要：以具有生态特征的代数迭代系统Logistic映射动力系统的倍周期分叉问题为例 ,研究了精确计算迭代系统分支点的方法·以迭代过程关系构成目标函数 ,参数为设计变量 ,迭代变量的边界为约束 ,建立关于分支值计算的新方法含约束条件的最优化程序算法·这种方法将约束转化为惩罚项 ,采用惩罚函数法巧妙地对所建立的最优化问题求解 。The accurate computation for getting ramification of algebra iterated system was studied based on the analyses of the double period bifurcation of Logistic dynamic mapping system with ecological characteristic. Regarding iterated processes as objective function,parameters of algebra iterated system as design variables,and boundary condition of iterated variables as constrains,a new optimum method was proposed,which was used to calculate bifurcation of Logistic mapping. Turning constrains into punishing items,the punishing function method was used to deal with the optimum problem and accurate results were acquired. The Method Solving ramification of algebra iterated system rapidly and exactly is suggested,which is a shortcut to chaos.

关 键 词：LOGISTIC映射 最优化算法 混沌 分支值 代数迭代系统 动力系统 

分 类 号：O19[理学—数学]