论文信息 - On the numerical computation of orbits of dynamical systems: The higher dimensional case

On the numerical computation of orbits of dynamical systems: The higher dimensional case

A finite time version of the shadowing theorem is used to develop a procedure to determine the accuracy of numerically computed orbits of one-dimensional maps. The procedure works forward. After any given number of iterates, we can decide whether our theorem applies and, if it does, we can estimate how far the computed orbit is from a true orbit.

Shui-Nee Chow | Kenneth J. Palmer

[1] Kenneth J. Palmer,et al. Exponential Dichotomies, the Shadowing Lemma and Transversal Homoclinic Points , 1988 .

[2] James A. Yorke,et al. Shadowing trajectories of dynamical systems , 1991 .

[3] James A. Yorke,et al. Rigorous verification of trajectories for the computer simulation of dynamical systems , 1991 .

[4] Shui-Nee Chow,et al. On the numerical computation of orbits of dynamical systems: The one-dimensional case , 1991 .

[5] James Hardy Wilkinson,et al. Rounding errors in algebraic processes , 1964, IFIP Congress.

[6] Celso Grebogi,et al. Do numerical orbits of chaotic dynamical processes represent true orbits? , 1987, J. Complex..

[7] Celso Grebogi,et al. Numerical orbits of chaotic processes represent true orbits , 1988 .