期刊文献+

Icon对称群映射的广义M集与混沌吸引子的研究 被引量:4

Research on General M Set and Chaotic Attractor from Icon Symmetric Group
下载PDF
导出
摘要 目的旨在解决构造Icon对称群映射广义M集计算量大,耗时长的问题.方法运用无约束最优化理论中的单纯形替换算法,求解使其雅科比矩阵行列式为零的点集作为选定参数下动力平面上的初始点集,考察这个初始点集中轨道有界的点的李雅谱诺夫指数值,构造Dn或Zn对称模型的广义M集.结果运用新算法大大降低了广义M集的构造时间,通过在参数断面λ与ω上构造的Icon对称群广义M集,生成了内部结构完全不同的具有Z5对称的混沌吸引子.结论通过提出新的构造M集的方法更好地描述了I con对称群映射的动力学特性,提高了作图效率. With the purpose of reducing the calculating time and improve the efficiency for constructing M sets, the research applies the simplex method of the unbound optimization theory for the set of initial iterating points, which make the determinant of Jacobin matrix of the mapping equal to zero. The solution set is the set of initial points with selected parameter on the dynamic plane. According to the Lyapunov exponent of some points in the set, whose orbits are bounded, the general M sets of symmetry mappings Dn or Zn are constructed. The result shows that the new method can greatly decrease the drawing time, and chaotic attractors with the symmetry of Z5 that have different inner structure are created by the parameters chosen from the general M sets, which is constructed on the parameter sectional plane. The authors therefore draw the conclusion that the new method can better describe the dynamic characteristics of the mapping, and greatly improve the efficiency for constructing M sets.
出处 《沈阳建筑大学学报(自然科学版)》 EI CAS 2005年第1期51-55,共5页 Journal of Shenyang Jianzhu University:Natural Science
基金 辽宁省自然科学基金(20032005) 沈阳市科技局基金(200143-01)
关键词 Icon对称群映射 广义M集 混沌吸引子 计算机图形 Calculations Chaos theory Lyapunov methods Mapping Optimization
  • 相关文献

参考文献7

  • 1杜利明,陈宁.D_4平面排列映射的混沌吸引子与广义充满J集[J].沈阳建筑工程学院学报(自然科学版),2003,19(1):57-60. 被引量:1
  • 2Chung K W, Chan H S Y, Chen Ning. General Mandelbrot Sets and Julia Sets with color symmetry from equivariant Mappings of the modular Group[J]. Computers &Graphics, 2000, 24(6) :911 - 918.
  • 3Clifford R A. Attractors with dueling symmetry[ J ]. Computers & Graphics, 1997, 21(2) :263 - 271.
  • 4Reiter Clifford A. Chaotic attractors with the symmetry of the dodecahedron [ J ]. The visual computer, 1995 ( 15 ):211-215.
  • 5Brisson G, Cartz. K, McCune. B. Symmetric attractors in three-dimensional space [ J ]. Chaos Solitons&Fractals,1996(7): 1033 - 1057.
  • 6Clifford R A. Attractors with the symmetry of the n-cube [J]. Eexperimental Mathematics, 1996(5) :327 - 336.
  • 7Field M, Martin G. Symmetry In Chaos[ M]. New York:Oxford University Press, 1992.

二级参考文献9

  • 1CHEN Ning, ZHU Weiyong. Bud-sequence conjectureon M fractal inmage and M - J conjecture between Cand Z planes from z←a^w+c(w=a+iβ)[Jl.Computers &: Graphics, 1998, 22(4) :537 - 546.
  • 2CHUNG K W, CHAN H S Y, and CHEN Ning. General Mandelbrot Set and Julia Set with Color Symmetryfrom Modular Group-Equivariant Mapping [ J ] . Computers & Graphics, 2000, 24(6) :911 - 918,
  • 3CHEN Ning, ZHU X L and CHUNG K W. M and J sets from Newton's Transformation of the Transcendental Mapping F (z) = e^zw= +c with VCPS[J]. Computers & Graphics, 2002, 26 (2) : 371 - 383,
  • 4FIELD Michael, GOLUBITSKY Martin. Symmetry InChaos [M]. Oxford University Press, 1992.
  • 5REITER Clifford A . Chaotic Attractors with the Symmetry of a tetrahedron[J]. Computers & Graphics, 1997, 21(6) :841 - 848.
  • 6RE ITER Clifford A.Chaotic attractors with symmetry of the dodecahedron [J]. The Visual Computer, 1999,15(4):211- 215,
  • 7JONES Kevin C, REITER Clifford A. Chaotic attractors with cyclic symmetry revisited [ J ]. Computers & Graphics, 2000, 24( 1 ) :271 - 282.
  • 8DUMONT Jeffrey P, HEISS Flynn J, JONES Kevin C, etc. n-Dimensional chaotic attractors with crystallographic symmetry [ J ]. Chaos, Solitons and Fractals,2001, 12(5) :761 - 784,
  • 9陈宁,朱晓玲.可数无穷多极值点复映射族计算机图形化研究[J].计算机研究与发展,2001,38(12):1512-1519. 被引量:2

同被引文献20

引证文献4

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部