首页> 外文会议>International Conference on Computer Science Education >An Accelerated Algorithm of Constructing General High-order Mandelbrot and Julia Sets
【24h】

An Accelerated Algorithm of Constructing General High-order Mandelbrot and Julia Sets

机译:一种加速算法构建一般高阶Mandelbrot和Julia集的算法

获取原文

摘要

A series of high order Mandelbrot and Julia fractal images of complex map f: z ← zn +c(n > 2, n∈N) are constructed by using escape time algorithm. Topology invariance and the relation between period bud distribution and map orders are found through lots of computer-mathematic experiments.The escape time algorithm is improved on basis of the rotation symmetric property of Mandelbrot and Julia sets, and then a rotation escape time algorithm is established. The high-order Mandelbrot and Julia sets fractal images are generated by using Web oriented Java Applet. Therefore the complexity of computer simulation under complex conditions is greatly reduced. The application of Java technology provides an Internet-based distribution platform for chaos-fractal theory study.
机译:通过使用逃生时间算法构建了复杂地图F:Z←Zn + C(N> 2,N∈N)的一系列高阶Mandelbrot和Julia分形图像。通过大量计算机数学实验发现拓扑不变性和周期芽分布和地图订单之间的关系。基于Mandelbrot和Julia集的旋转对称性,改进了逃生时间算法,然后建立了旋转转义时间算法。高阶Mandelbrot和Julia通过使用Web Dioreded Java Applet生成分数形图像。因此,在复杂条件下计算机模拟的复杂性大大降低。 Java技术的应用为混沌分形理论研究提供了基于互联网的分发平台。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号