Compound orbits break-up in constituents: an algorithm
From MaRDI portal
Publication:4968002
Abstract: In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system , being an unimodal function. We proof a theorem which states the necessary and sufficient conditions for the break-up of compound orbits in their simpler constituents. A corollary to this theorem provides an algorithm for the computation of those orbits. This process closes the theoretical framework initiated in (Physica D, 239:1135--1146, 2010).
Recommendations
Cites work
- scientific article; zbMATH DE number 3647217 (Why is no real title available?)
- scientific article; zbMATH DE number 4086578 (Why is no real title available?)
- scientific article; zbMATH DE number 193491 (Why is no real title available?)
- scientific article; zbMATH DE number 3197700 (Why is no real title available?)
- Chaos in classical and quantum mechanics
- Composition law of cardinal ordering permutations
- Conjugation of cascades
- Controlling chaos
- Intermittency cascade
- On finite limit sets for transformations on the unit interval
- Periodic Orbits and Kneading Invariants
- Quantitative universality for a class of nonlinear transformations
- Recycling of strange sets: I. Cycle expansions
- The universal cardinal ordering of fixed points
- The universal metric properties of nonlinear transformations
- Topological Semiconjugacy of Piecewise Monotone Maps of the Interval
This page was built for publication: Compound orbits break-up in constituents: an algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968002)