scientific article; zbMATH DE number 440643
Topological dynamics (37B99) Attractors and repellers of smooth dynamical systems and their topological structure (37C70) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computational methods for sparse matrices (65F50) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Generating fractals from iterated function systems is a time-consuming procedure. In this paper, it is shown that it can become significantly less expensive, when looking at the iteration of a set of affine transformations as a Markov process. Then the fractal image can be seen as the stationary distribution of that stochastic process. Because of the special structure of the sparse state transition matrix, a nested iteration scheme is applied to calculate the stationary distribution. Instead of the traditional smoothing (like in the multigrid method) the author uses the affine transformations to transform the image from coarse to fine grids. The convergence of this nested iteration technique only depends on the contractivity of the affine transformations. For the entire collection see [Zbl 0778.00018].
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140801)