Consider a 2D (or a higher dimension) chaotic map like Tinkerbell map:

x(n+1) = x(n)2 -y(n)2 +a x(n) +b y(n)

y(n+1) = 2x(n)y(n) +c x(n) +d y(n)

Suppose that we don’t know the above equations and we only have access to the time series of “x” (long enough, clean). Can we calculate the Largest Lyapunov Exponent?

In addition:

Can we calculate the all of the Lyapunov Exponents?

What is the effect of noise?

What is the effect of short time series?

I appreciate any references, codes, and comments.

Thank you in advance

More Sajad Jafari's questions See All
Similar questions and discussions