Approximations of fractal sets

摘要

Five approximations of fractal sets A are compared. The first three were described by Hutchinson, Barnsley-Demko and Williams, respectively. Two new other approximations are still efficient in all circumstances. For any algorithm, error estimates in the approximations are found. Numerical comparisons are also done through classical examples of attractors in the plane.