Approximations of fractal sets (Q581901): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 37D45 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65S05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4129691 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fractal sets | |||
| Property / zbMATH Keywords: fractal sets / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Error estimates | |||
| Property / zbMATH Keywords: Error estimates / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
attractors | |||
| Property / zbMATH Keywords: attractors / rank | |||
Normal rank | |||
Revision as of 19:00, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximations of fractal sets |
scientific article |
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
