节点文献

复映射族f(z,c)=z-2+c的Julia集

Julia Set of Complex Mapping f(z,c)=z-2+c

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 邓学工宋春林李志勇朱伟勇

【Author】 DENG Xuegong1, SONG Chunlin2, LI Zhiyong2, ZHU Weiyong2(1.?School of Science, Northeastern University, Shenyang 110004, China;?2.?Computer Center, Northeastern University, Shenyang 110004, China.Correspondent: SONG Chunlin, Email: songchunlin?@?yahoo.com.cn)

【机构】 东北大学理学院东北大学计算中心东北大学计算中心 辽宁沈阳 110004辽宁沈阳 110004辽宁沈阳 110004

【摘要】 给出了周期点分类构造Julia集的算法,克服用逃逸时间算法和反函数迭代法构造复映射族f(z,c)=z-2+cJulia集收敛不均匀的问题·研究了z-2+c不同参数对应Julia集的拓扑结构的演变规律,发现了不同性质的周期芽苞的点对应的Julia集的不同属性,给出了通过Julia集判断参数类型和通过参数位置预知Julia集拓扑结构的方法·提出了关于Julia集的连通性的一个猜想,并用大量计算机实验支持了这一猜想·

【Abstract】 ?A new method,periodclassification algorithm,to get a better graphic of Julia sets of complex mapping z-2+c was given. Comparing with other algorithms such as escape time algorithm and inverse function algorithm, the periodclassification algorithm provides a better understanding of the dynamics of the complex mapping z-2+c. A large numbers of Julia sets of z-2+c were exhibited by use of a computer. Periodbuds were classified and the difference of the Julia sets in deferent periodbuds was studied. The period of the Julia set can be found and also the topological structure of the Julia set can be predicted by observing the position of the periodbud. A conjecture that all the Julia sets with 2 or higher periods are connected is presented. The conjecture is proved by lots of computer experiments.

【基金】 国家自然科学基金资助项目(69974008);教育部博士学科点专项科研基金资助项目(2000014512)
  • 【文献出处】 东北大学学报 ,JOURNAL OF NORTHEASTERN UNIVERSITY , 编辑部邮箱 ,2003年05期
  • 【分类号】O193
  • 【被引频次】7
  • 【下载频次】134
节点文献中: 

本文链接的文献网络图示:

本文的引文网络