Characterizing Chaos through Lyapunov Metrics

  • Authors:
  • W. Kinsner

  • Affiliations:
  • -

  • Venue:
  • ICCI '03 Proceedings of the 2nd IEEE International Conference on Cognitive Informatics
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Science, engineering, medicine, biology and many other areas deal with signals acquired in the form of time series from different dynamical systems for the purpose of analysis, diagnosis and control of the systems. The signals are often mixed with noise. Separating the noise from the signal may be very difficult if both the signal and the noise are broadband. The problem becomes inherently difficult when the signal is chaotic because its power spectrum is indistinguishable from a broadband noise. This paper describes how to measure and analyze chaos using Lyapunov metrics. The principle of characterizing strange attractors by the divergence and folding of trajectories is studied. A practical approach to evaluating the largest local and global Lyapunov exponents by rescaling and renormalization leads to calculating the m Lyapunov exponents for m-dimensional strange attractors either modelled explicitly (analytically), or reconstructed from experimental time-series data. Several practical algorithms for calculating Lyapunov exponents are summarized. The Lyapunov fractal dimension andKolmogorov-Sinai and Rényi entropies are also described as they are related to the Lyapunov exponents.