东北大学学报(自然科学版) ›› 2003, Vol. 24 ›› Issue (5): 457-459.DOI: -

• 论著 • 上一篇    下一篇

代数迭代映射分支值的优化算法

李永强;刘杰;侯祥林   

  1. 东北大学机械工程与自动化学院;东北大学机械工程与自动化学院;东北大学理学院 辽宁沈阳 110004;东北大学理学院;辽宁沈阳 110004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2003-05-15 发布日期:2013-06-24
  • 通讯作者: Li, Y.-Q.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金重点资助项目(59835050)

Optimum algorithm for bifurcation of algebra iterated mapping

Li, Yong-Qiang (1); Liu, Jie (1); Hou, Xiang-Lin (2)   

  1. (1) Sch. of Mech. Eng. and Automat., Northeastern Univ., Shenyang 110004, China; (2) Sch. of Sci., Northeastern Univ., Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2003-05-15 Published:2013-06-24
  • Contact: Li, Y.-Q.
  • About author:-
  • Supported by:
    -

摘要: 以代数迭代映射动力系统的倍周期分叉问题为背景,研究出较精确计算代数迭代系统分支值的优化方法·以分支值为设计变量,映射点的最大开口量为目标函数,以映射点周期关系为等式约束和分支值分布范围为不等式约束,建立了关于分支值计算的新方法·通过两个代数迭代系统分支值实例分析计算,获得较高精度的结果·

关键词: 代数迭代映射, 分支值, 优化算法, 混沌, 开口函数

Abstract: The accurate computation for getting ramification of algebra iterated system was studied by the analysis 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. The method was used to calculate bifurcation algebra iterated 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 can solve ramification of algebra iterated system rapidly and exactly.

中图分类号: