Shadowing lemma

In the theory of dynamical systems, the shadowing lemma is a lemma describing the behaviour of pseudo-orbits near a hyperbolic invariant set. Informally, the theory states that every pseudo-orbit (which one can think of as a numerically computed trajectory with rounding errors on every step[1]) stays uniformly close to some true trajectory (with slightly altered initial position)—in other words, a pseudo-trajectory is "shadowed" by a true one.[2] This suggests that numerical solutions can be trusted to represent the orbits of the dynamical system. However, caution should be exercised as some shadowing trajectories may not always be physically realizable.[3]

  1. ^ Weisstein, Eric W. "Shadowing Theorem". MathWorld.
  2. ^ Hammel, Stephan M; Yorke, James A; Grebogi, Celso (1988). "Numerical orbits of chaotic processes represent true orbits". Bulletin of the American Mathematical Society. New Series. 19 (2): 465–469. doi:10.1090/S0273-0979-1988-15701-1.
  3. ^ Chandramoorthy, Nisha; Wang, Qiqi (2021). "On the probability of finding nonphysical solutions through shadowing". Journal of Computational Physics. 440: 110389. arXiv:2010.13768. Bibcode:2021JCoPh.44010389C. doi:10.1016/j.jcp.2021.110389. S2CID 225075706.