enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Poincaré recurrence theorem - Wikipedia

    en.wikipedia.org/wiki/Poincaré_recurrence_theorem

    The theorem is commonly discussed in the context of ergodic theory, dynamical systems and statistical mechanics. Systems to which the Poincaré recurrence theorem applies are called conservative systems. The theorem is named after Henri Poincaré, who discussed it in 1890.

  3. List of chaotic maps - Wikipedia

    en.wikipedia.org/wiki/List_of_chaotic_maps

    In mathematics, a chaotic map is a map (an evolution function) that exhibits some sort of chaotic behavior.Maps may be parameterized by a discrete-time or a continuous-time parameter.

  4. List of dynamical systems and differential equations topics

    en.wikipedia.org/wiki/List_of_dynamical_systems...

    Examples of differential equations; Autonomous system (mathematics) Picard–Lindelöf theorem; Peano existence theorem; Carathéodory existence theorem; Numerical ordinary differential equations; Bendixson–Dulac theorem; Gradient conjecture; Recurrence plot; Limit cycle; Initial value problem; Clairaut's equation; Singular solution ...

  5. Poincaré theorem - Wikipedia

    en.wikipedia.org/wiki/Poincaré_theorem

    Poincaré recurrence theorem, on sufficient conditions for recurrence to take place in dynamical systems; Poincaré-Bendixson theorem, on the existence of attractors for two-dimensional dynamical systems; Poincaré–Birkhoff–Witt theorem, concerning lie algebras and their universal envelopes; Poincaré lemma

  6. Tent map - Wikipedia

    en.wikipedia.org/wiki/Tent_map

    Graph of tent map function Example of iterating the initial condition x 0 = 0.4 over the tent map with μ = 1.9. In mathematics, the tent map with parameter μ is the real-valued function f μ defined by ():= {,}, the name being due to the tent-like shape of the graph of f μ.

  7. Linear recurrence with constant coefficients - Wikipedia

    en.wikipedia.org/wiki/Linear_recurrence_with...

    In mathematics (including combinatorics, linear algebra, and dynamical systems), a linear recurrence with constant coefficients [1]: ch. 17 [2]: ch. 10 (also known as a linear recurrence relation or linear difference equation) sets equal to 0 a polynomial that is linear in the various iterates of a variable—that is, in the values of the elements of a sequence.

  8. Duffing equation - Wikipedia

    en.wikipedia.org/wiki/Duffing_equation

    The number of parameters in the Duffing equation can be reduced by two through scaling (in accord with the Buckingham π theorem), e.g. the excursion and time can be scaled as: [2] = and = /, assuming is positive (other scalings are possible for different ranges of the parameters, or for different emphasis in the problem studied).

  9. Conservative system - Wikipedia

    en.wikipedia.org/wiki/Conservative_system

    This is effectively the modern statement of the Poincaré recurrence theorem. A sketch of a proof of the equivalence of these four properties is given in the article on the Hopf decomposition . Suppose that μ ( X ) < ∞ {\displaystyle \mu (X)<\infty } and τ {\displaystyle \tau } is measure-preserving.