Shadowing
From Scholarpedia
| Ernest Barreto (2008), Scholarpedia, 3(1):2243. | revision #31239 [link to/cite this article] | |||||||||||||||||||
Revision as of 19:23, 22 January 2008; view current revision
←Older revision | Newer revision→
Curator: Dr. Ernest Barreto, George Mason University
Shadowing refers to the relationship between the mathematical solutions of a differential equation (or map) and approximate solutions obtained in the presence of noise or round-off error. A mathematical solution is said to shadow a noisy solution if it stays close to the noisy solution for some amount of time.
Contents |
Round-off errors
Consider a mathematical solution to a deterministic chaotic system with an initial condition
Because numbers are represented in computers with finite precision, there will typically be a small difference between
and how
is registered on a computer. As the system is evolved forward in time, this difference will be amplified exponentially due to the chaotic nature of the system. Round-off error at each step in a numerical calculation further compounds the problem. The question therefore arises as to whether or not computer-generated solutions to chaotic systems are related to their true mathematical solutions.
The existence of arbitrarily long shadowing solutions has been proven for invertible hyperbolic maps by Anosov (1967) and Bowen (1970, 1978). For non-hyperbolic systems, it is often possible to estimate the length of time for which a noisy trajectory is shadowed by a mathematical solution (Grebogi, Hammel, Yorke and Sauer (1990), Sauer, Grebogi and Yorke (1997)).
Shadowing lemma
The following lemma is due to Bowen (1970, 1978).
Definition: A sequence
is an
-pseudo-orbit
for
if
for all
. See Fig.1.
Definition: The point
-shadows
if
for
. See Fig.2.
Shadowing Lemma: Let
be a hyperbolic invariant set. Then for every
,
there is an
such that every
-pseudo-orbit
in
is
-shadowed
by a point
.
Alternative definitions
The following definitions are also encountered in the literature.
Definition:
is a
-pseudotrajectory
for
if
for
,
where
is the noise amplitude and
is an integer.
Definition:
is a true trajectory if it satisfies
for
.
Definition of shadowing: The true trajectory
-shadows
the pseudotrajectory
on
if
for
.
Estimating shadowing times
In some systems, shadowing times (meaning the amount of time a mathematical solution shadows a noisy one) can be very short. Sauer, Grebogi, and Yorke (1997) estimate shadowing times for chaotic systems that exhibit unstable dimension variability as follows:
where
is the one-step error (noise), and
and
are the mean and standard deviation of the finite-time Lyapunov exponent closest to zero, respectively.
References
- D.V. Anosov, Proc. Steklov Inst. Math. 90, 1 (1967).
- R. Bowen, American Journal of Mathematics 92, 725 (1970).
- R. Bowen, CBMS Regional Conference Series in Mathematics, Vol. 35. AMS Publications: Providence.
- C. Grebogi, S.M. Hammel, J.A. Yorke, and T. Sauer, Physical Review Letters 65, 1527 (1990).
- J. Guckenheimer and P. Holmes, Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields, Springer-Verlag, New York, 1983.
- T. Sauer, C. Grebogi, and J.A. Yorke, Physical Review Letters 79, 59 (1997).
See also
Chaos, Dynamical Systems, Numerical Analysis, Trajectory
| Ernest Barreto (2008) Shadowing. Scholarpedia, 3(1):2243, (go to the first approved version) Created: 19 October 2006, reviewed: 23 January 2008, accepted: 24 January 2008 |
| Action editor: | Dr. Eugene M. Izhikevich, Editor-in-Chief of Scholarpedia, the peer-reviewed open-access encyclopedia |
