A projective algorithm for approximation of fractal sets

摘要

A new projective algorithm on approximation of fractal sets is described in this paper. Compared with five other algorithms, the projective algorithm is efficient in all circumstances. Error estimates are obtained in the approximation process in this algorithm. Numerical comparisons are done through classical examples of attractors in the plane.