Nonlinear Sciences – Chaotic Dynamics
Scientific paper
2002-03-07
Nonlinear Sciences
Chaotic Dynamics
14pages, 6figures
Scientific paper
This paper is devoted to a discussion of the Discrete Fourier Transform (DFT) representation of a chaotic finite-duration sequence. This representation has the advantage that is itself a finite-duration sequence corresponding to samples equally spaced in the frequency domain. The Fast Fourier Transform (FFT) algoritm allows us an effective computation, and it can be applied to a relatively short time series. DFT representation requirements were analized and applied for determining the order-chaos transition in a nonlinear system described by the equation $x[n+1]=rx[n](1-x[n])$. Its effectiveness was demonstrated by comparing the results with those obtained by calculating the largest Lyapounov exponent for the time series set, obtained from the logistic equation.
Fadragas Carlos R.
Lorenzo-Ginori Juan V.
Orozco-Morales Ruben
No associations
LandOfFree
Possibilities of the Discrete Fourier Transform for Determining the Order-Chaos Transition in a Dynamical System does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Possibilities of the Discrete Fourier Transform for Determining the Order-Chaos Transition in a Dynamical System, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Possibilities of the Discrete Fourier Transform for Determining the Order-Chaos Transition in a Dynamical System will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-583298