摘要
利用作者构造的迭代函数给出了一种新的广义Ｍａｎｄｅｌｂｒｏｔ－集与充满的Ｊｕｌｉａ－集的组合加速逃逸时间算法，本算法在迭代点位于广义Ｍａｎｄｅｌｂｒｏｔ－集或充满Ｊｕｌｉａ－集内部时也能很快地被判定，在保持了原算法精度的基础上。
A new escape time algorithm is given by means of the new iterative functions which constructed by the authors.By this new algorithm,the points can be decided quickly when they are in the general Mandelbrotset or the filled Juliaset .Not only it is precise,but also it is quick when constructing fractal sets.
出处
《鞍山钢铁学院学报》
1999年第1期1-4,共4页
Journal of Anshan Institute of Iron and Steel Technology
基金
辽宁省自然科学基金
鞍山钢铁学院董事会基金
