Summary.
The existence of a true orbit near a numerically computed approximate orbit -- shadowing -- of autonomous system of ordinary differential equations is investigated. A general shadowing theorem for finite time, which guarantees the existence of shadowing in ordinary differential equations and provides error bounds for the distance between the true and the approximate orbit in terms of computable quantities, is proved. The practical use and the effectiveness of this theorem is demonstrated in the numerical computations of chaotic orbits of the Lorenz equations.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received December 15, 1993
Rights and permissions
About this article
Cite this article
Coomes, B., Ko\c cak, H. & Palmer, K. Rigorous computational shadowing of orbits of ordinary differential equations . Numer. Math. 69, 401–421 (1995). https://doi.org/10.1007/s002110050100
Issue Date:
DOI: https://doi.org/10.1007/s002110050100