Optimal partition choice for invariant measure approximation for one-dimensional maps (Q4667969)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2158136
Language Label Description Also known as
default for all languages
No label defined
    English
    Optimal partition choice for invariant measure approximation for one-dimensional maps
    scientific article; zbMATH DE number 2158136

      Statements

      Optimal partition choice for invariant measure approximation for one-dimensional maps (English)
      0 references
      0 references
      0 references
      18 April 2005
      0 references
      quadratic maps
      0 references
      numerical approximation
      0 references
      logistic maps
      0 references
      Ulam approximations
      0 references
      invariant measure
      0 references
      The paper describes an approach to numerically approximate absolutely continuous invariant measures for certain one-dimensional maps. The basic idea is to use an adaptive partition selection scheme to attempt to optimize the choice of Ulam approximations (approximating measures, each of which is generated by a function that constant on each element of some finite partition of the interval). Example calculations with maps from the logistic family are summarized. The problem of the behavior of the algorithm when the map involved does not have an absolutely continuous invariant measure is discussed, and results of calculations attempting to estimate the Lebesgue measure of the set of parameters in the quadratic family that have such a measure are given (this Lebesgue measure is positive by Jakobson's theorem).
      0 references

      Identifiers