Searching for cycles in non-linear autonomous discrete dynamical systems
From MaRDI portal
Publication:2329067
Orbit growth in dynamical systems (37C35) Computational methods for invariant manifolds of dynamical systems (37M21) Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Trigonometric polynomials, inequalities, extremal problems (42A05) Numerical chaos (65P20) Discrete-time control/observation systems (93C55) Stabilization of systems by feedback (93D15)
Abstract: We construct a family of polynomials with real coefficients that contains as a particular case the Fej'er and Suffridge polynomials. These polynomials allow us to suggest a robust algorithm to search for cycles of arbitrary length in non-linear autonomous discrete dynamical systems. Numeric examples are included.
Recommendations
- Finding Cycles in Nonlinear Autonomous Discrete Dynamical Systems
- A new method for finding cycles by semilinear control
- On cycles and other geometric phenomena in phase portraits of some nonlinear dynamical systems
- Search for periodic solutions of highly nonlinear dynamical systems
- A statistical method for detecting cycles in discrete dynamical systems
Cited in
(6)- Symmetrization of Suffridge polynomials and approximation of \(T\)-symmetric Koebe functions
- Some extremal problems for trinomials with fold symmetry
- A new method for finding cycles by semilinear control
- A statistical method for detecting cycles in discrete dynamical systems
- Finding Cycles in Nonlinear Autonomous Discrete Dynamical Systems
- Univalence of T -symmetric Suffridge type polynomials of degree 3 T + 1
This page was built for publication: Searching for cycles in non-linear autonomous discrete dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329067)