Computation of maximal local (un)stable manifold patches by the parameterization method
Maxime Breden, Jean-Philippe Lessard, Jason D. Mireles James

TL;DR
This paper introduces automated methods for computing high-order polynomial approximations of local (un)stable manifolds in differential equations, incorporating validated error bounds and eigenvector scaling effects, with applications to dynamical systems.
Contribution
It develops automatic procedures that optimize the size of polynomial manifold approximations by analyzing eigenvector scalings and validated error bounds.
Findings
Validated truncation error bounds improve approximation accuracy.
Eigenvector scaling significantly affects the size of computed manifolds.
Applications include visualization and continuation of invariant manifolds in complex systems.
Abstract
In this work we develop some automatic procedures for computing high order polynomial expansions of local (un)stable manifolds for equilibria of differential equations. Our method incorporates validated truncation error bounds, and maximizes the size of the image of the polynomial approximation relative to some specified constraints. More precisely we use that the manifold computations depend heavily on the scalings of the eigenvectors: indeed we study the precise effects of these scalings on the estimates which determine the validated error bounds. This relationship between the eigenvector scalings and the error estimates plays a central role in our automatic procedures. In order to illustrate the utility of these methods we present several applications, including visualization of invariant manifolds in the Lorenz and FitzHugh-Nagumo systems and an automatic continuation scheme for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
