Abstract.
An efficient algorithm is developed for the numerical computation of normally hyperbolic invariant manifolds, based on the graph transform and Newton's method. It fits in the perturbation theory of discrete dynamical systems and therefore allows application to the setting of continuation. A convergence proof is included. The scope of application is not restricted to hyperbolic attractors, but extends to normally hyperbolic manifolds of saddle type. It also computes stable and unstable manifolds. The method is robust and needs only little specification of the dynamics, which makes it applicable to e.g. Poincaré maps. Its performance is illustrated on examples in 2D and 3D, where a numerical discussion is included.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Author information
Authors and Affiliations
Additional information
Received: December 20, 1995; revised July 2, 1996
Rights and permissions
About this article
Cite this article
Broer;, H., Osinga;, H. & Vegter;, G. Algorithms for computing normally hyperbolic invariant manifolds. Z. angew. Math. Phys. 48, 480–524 (1997). https://doi.org/10.1007/s000330050044
Issue Date:
DOI: https://doi.org/10.1007/s000330050044