Abstract
The computational convergence problem of chaotic orbits is discussed for nonintegrable dissipative dynamical systems. It is demonstrated that although the detailed convergence has been lost, the asymptotic global behaviors generated by chaotic orbits are numerically convergent if computational round-off and truncation errors are decreased.
Sign-in/Register to access full text options 
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.
