• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Stable iterated function systems

Gadde, Erland January 1992 (has links)
The purpose of this thesis is to generalize the growing theory of iterated function systems (IFSs). Earlier, hyperbolic IFSs with finitely many functions have been studied extensively. Also, hyperbolic IFSs with infinitely many functions have been studied. In this thesis, more general IFSs are studied. The Hausdorff pseudometric is studied. This is a generalization of the Hausdorff metric. Wide and narrow limit sets are studied. These are two types of limits of sequences of sets in a complete pseudometric space. Stable Iterated Function Systems, a kind of generalization of hyperbolic IFSs, are defined. Some different, but closely related, types of stability for the IFSs are considered. It is proved that the IFSs with the most general type of stability have unique attractors. Also, invariant sets, addressing, and periodic points for stable IFSs are studied. Hutchinson’s metric (also called Vaserhstein’s metric) is generalized from being defined on a space of probability measures, into a class of norms, the £-norms, on a space of real measures (on certain metric spaces). Under rather general conditions, it is proved that these norms, when they are restricted to positive measures, give rise to complete metric spaces with the metric topology coinciding with the weak*-topology. Then, IFSs with probabilities (IFSPs) are studied, in particular, stable IFSPs. The £-norm-results are used to prove that, as in the case of hyperbolic IFSPs, IFSPs with the most general kind of stability have unique invariant measures. These measures are ”attractive”. Also, an invariant measure is constructed by first ”lifting” the IFSP to the code space. Finally, it is proved that the Random Iteration Algorithm in a sense will ”work” for some stable IFSPs. / <p>Diss. Umeå : Umeå universitet, 1992</p> / digitalisering@umu

Page generated in 0.1379 seconds