Abstract
To reduce the error caused by the human factor, this paper proposes a modification of a well-known small data method to obtain the largest Lyapunov exponent more accurately, which is based on machine learning for better identification of linear region. Firstly, we use the k-d tree neighborhood search algorithm to improve the computational efficiency of the average divergence index data. Secondly, the unsaturated data are obtained by the density peak based clustering algorithm from the average divergence index data. Thirdly, we use the density peak based clustering algorithm to identify the linear region from the first-order difference curve of the retained data. Finally, the largest Lyapunov exponent is obtained by using the least squares method to fit the linear region. Our method is applied to simulate five famous theoretical chaotic systems, the results show that the proposed method can automatically identify the linear region, which is more accurate than the small data method for the largest Lyapunov exponent calculation and the effectiveness of our method is verified through the simulation of two real-world time series.
Published Version
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 callMore From: Chaos: An Interdisciplinary Journal of Nonlinear Science
Disclaimer: 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.
