Abstract
Abstract In this paper, we present results of numerical experiments on chaotic transients in families of the logistic and Henon maps. The duration of chaotic transients (the rambling time) for logistic maps estimated according to a rigorous criterion shows monotonic regularities with respect to both the period and the number of periodic window in a series of a given period. Due to inapplicability of this criterion to multidimensional maps, a more universal, though approximate, criterion is systematically studied on the family of logistic maps to optimize a choice of the free parameter value. The same approximate criterion is used to estimate rambling time for a number of periodic windows for the family of Henon maps. The dependence of the rambling time on the width of periodic windows is tested.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
