Statistics of shadowing time in nonhyperbolic chaotic systems with unstable dimension variability

Younghae Do, Ying-Cheng Lai

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Severe obstruction to shadowing of computer-generated trajectories can occur in nonhyperbolic chaotic systems with unstable dimension variability. That is, when the dimension of the unstable eigenspace changes along a trajectory in the invariant set, no true trajectory of reasonable length can be found to exist near any numerically generated trajectory. An important quantity characterizing the shadowability of numerical trajectories is the shadowing time, which measures for how long a trajectory remains valid. This time depends sensitively on initial condition. Here we show that the probability distribution of the shadowing time contains two distinct scaling behaviors: an algebraic scaling for short times and an exponential scaling for long times. The exponential behavior depends on system details but the small-time algebraic behavior appears to be universal. We describe the computational procedure for computing the shadowing time and give a physical analysis for the observed scaling behaviors.

Original languageEnglish
Article number016213
Number of pages10
JournalPhysical Review. E, Statistical, Nonlinear and Soft Matter Physics
Volume69
Issue number1 Part 2
DOIs
Publication statusPublished - 30 Jan 2004

Keywords

  • on-off intermittency
  • Lyapunov exponents
  • dynamic systems
  • trajectories
  • orbits
  • sets

Cite this

Statistics of shadowing time in nonhyperbolic chaotic systems with unstable dimension variability. / Do, Younghae; Lai, Ying-Cheng.

In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics, Vol. 69, No. 1 Part 2, 016213, 30.01.2004.

Research output: Contribution to journalArticle

@article{c3c950c39f1e4d26894dc8eb98d61af7,
title = "Statistics of shadowing time in nonhyperbolic chaotic systems with unstable dimension variability",
abstract = "Severe obstruction to shadowing of computer-generated trajectories can occur in nonhyperbolic chaotic systems with unstable dimension variability. That is, when the dimension of the unstable eigenspace changes along a trajectory in the invariant set, no true trajectory of reasonable length can be found to exist near any numerically generated trajectory. An important quantity characterizing the shadowability of numerical trajectories is the shadowing time, which measures for how long a trajectory remains valid. This time depends sensitively on initial condition. Here we show that the probability distribution of the shadowing time contains two distinct scaling behaviors: an algebraic scaling for short times and an exponential scaling for long times. The exponential behavior depends on system details but the small-time algebraic behavior appears to be universal. We describe the computational procedure for computing the shadowing time and give a physical analysis for the observed scaling behaviors.",
keywords = "on-off intermittency, Lyapunov exponents, dynamic systems, trajectories, orbits, sets",
author = "Younghae Do and Ying-Cheng Lai",
year = "2004",
month = "1",
day = "30",
doi = "10.1103/PhysRevE.69.016213",
language = "English",
volume = "69",
journal = "Physical Review. E, Statistical, Nonlinear and Soft Matter Physics",
issn = "1539-3755",
publisher = "AMER PHYSICAL SOC",
number = "1 Part 2",

}

TY - JOUR

T1 - Statistics of shadowing time in nonhyperbolic chaotic systems with unstable dimension variability

AU - Do, Younghae

AU - Lai, Ying-Cheng

PY - 2004/1/30

Y1 - 2004/1/30

N2 - Severe obstruction to shadowing of computer-generated trajectories can occur in nonhyperbolic chaotic systems with unstable dimension variability. That is, when the dimension of the unstable eigenspace changes along a trajectory in the invariant set, no true trajectory of reasonable length can be found to exist near any numerically generated trajectory. An important quantity characterizing the shadowability of numerical trajectories is the shadowing time, which measures for how long a trajectory remains valid. This time depends sensitively on initial condition. Here we show that the probability distribution of the shadowing time contains two distinct scaling behaviors: an algebraic scaling for short times and an exponential scaling for long times. The exponential behavior depends on system details but the small-time algebraic behavior appears to be universal. We describe the computational procedure for computing the shadowing time and give a physical analysis for the observed scaling behaviors.

AB - Severe obstruction to shadowing of computer-generated trajectories can occur in nonhyperbolic chaotic systems with unstable dimension variability. That is, when the dimension of the unstable eigenspace changes along a trajectory in the invariant set, no true trajectory of reasonable length can be found to exist near any numerically generated trajectory. An important quantity characterizing the shadowability of numerical trajectories is the shadowing time, which measures for how long a trajectory remains valid. This time depends sensitively on initial condition. Here we show that the probability distribution of the shadowing time contains two distinct scaling behaviors: an algebraic scaling for short times and an exponential scaling for long times. The exponential behavior depends on system details but the small-time algebraic behavior appears to be universal. We describe the computational procedure for computing the shadowing time and give a physical analysis for the observed scaling behaviors.

KW - on-off intermittency

KW - Lyapunov exponents

KW - dynamic systems

KW - trajectories

KW - orbits

KW - sets

U2 - 10.1103/PhysRevE.69.016213

DO - 10.1103/PhysRevE.69.016213

M3 - Article

VL - 69

JO - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

JF - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

SN - 1539-3755

IS - 1 Part 2

M1 - 016213

ER -