摘要
An improved algorithm for calculating the largest Lyapunov exponents (λ1) is presented based on Kantz algorithm. The presented algorithm can select a neighborhood in a certain extent according to the variety of the curves for calculating the largest Lyapunov exponent. And it can determine the linear zone based on the curves where branch is generated, thus, the largest Lyapunov exponent is obtained. The numerical experiments for the Hénon map prove that the proposed method is a direct method to identify whether a linear envelope to the curves exists in distinguishing chaos from noise, and it is superior to the Kantz algorithm.
An improved algorithm for calculating the largest Lyapunov exponents （λ1） is presented based on Kantz algorithm. The presented algorithm can select a neighborhood in a certain extent according to the variety of the curves for calculating the largest Lyapunov exponent. And it can determine the linear zone based on the curves where branch is generated, thus, the largest Lyapunov exponent is obtained. The numerical experiments for the Hénon map prove that the proposed method is a direct method to identify whether a linear envelope to the curves exists in distinguishing chaos from noise, and it is superior to the Kantz algorithm.
