| 组合加速逃逸时间法构造M—集和充满的J—集 |
| |
| 引用本文： | 刘向东,朱伟勇.组合加速逃逸时间法构造M—集和充满的J—集[J].东北大学学报(自然科学版),1997,18(4):413-416. |
| |
| 作者姓名： | 刘向东 朱伟勇 |
| |
| 作者单位： | 东北大学信息科学与工程学院 |
| |
| 基金项目： | 国家“八六三”高科技基金,辽宁省自然科学基金 |
| |
| 摘 要： | 利用作者构造的迭代函数给出了一种新的组合加速逃逸时间算法。本算法在迭代点位于Ｍａｎｄｅｌｂｒｏｔ－集或充满的Ｊｕｌｉａ－集内部时也能很快地被判定，在保持了原算法精度的基础上，大大地加快了构造分形集的速度。
|
| 关 键 词： | 逃逸时间算法 分形集 Mandelbrot集 Julia集 |
Constructed M Set and Filled J Set By Accelerative Escape Time Algorithm of Combination |
| |
| Liu Xiangdong,Zhu Weiyong.Constructed M Set and Filled J Set By Accelerative Escape Time Algorithm of Combination[J].Journal of Northeastern University(Natural Science),1997,18(4):413-416. |
| |
| Authors: | Liu Xiangdong Zhu Weiyong |
| |
| Abstract: | A new escape time algorithm is given by means of new iteration functions the author gave. By this new algorithm,the points can be decided quickly when they are in the Mandelbrot Set or the filled Julia Set. Not only it is presice,but also it is quick when constructing fractal sets. |
| |
| Keywords: | escape time algorithm Mandelbrot Set Julia Set |
| 本文献已被 CNKI 维普 等数据库收录！ |
