Approximations of fractal sets (Q581901)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:581901 |
scientific article; zbMATH DE number 4129691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximations of fractal sets |
scientific article; zbMATH DE number 4129691 |
Statements
Approximations of fractal sets (English)
0 references
1990
0 references
Five algorithms are presented for the approximation of fractal sets. The first three were proposed by Williams, Hutchison and Barnsley Demko. The latter two by the authors, one of which is a graphics algorithm. Error estimates are made for all the algorithms and numerical comparisons are done using classical examples of attractors in the plane.
0 references
fractal sets
0 references
Error estimates
0 references
attractors
0 references
0.850200891494751
0 references
0.8401685953140259
0 references
0.8401685953140259
0 references
