Research Library

open-access-imgOpen AccessNumerical computation of high-order expansions of invariant manifolds of high-dimensional tori
Author(s)
Joan Gimeno,
Àngel Jorba,
Begoña Nicolás,
Estrella Olmedo
Publication year2024
Publication title
siam journal on applied dynamical systems
Resource typeJournals
PublisherSociety for Industrial and Applied Mathematics
In this paper we present a procedure to compute reducible invariant tori andtheir stable and unstable manifolds in stroboscopic Poincar\'e maps. The methodhas two steps. In the first step we compute, by means of a quadraticallyconvergent scheme, the Fourier series of the torus, its Floquet transformation,and its Floquet matrix. If the torus has stable and/or unstable directions, inthe second step we compute the Taylor-Fourier expansions of the correspondinginvariant manifolds up to a given order. The paper also discusses the case inwhich the torus is highly unstable so that a multiple shooting strategy isneeded to compute the torus. If the order of the Taylor expansion of themanifolds is fixed and N is the number of Fourier modes, the wholecomputational effort (torus and manifolds) increases as O(N log N) q and thememory required behaves as O(N). This makes the algorithm very suitable tocompute high-dimensional tori for which a huge number of Fourier modes areneeded. Besides, the algorithm has a very high degree of parallelism. The paperincludes examples where we compute invariant tori (of dimensions up to 5) ofquasi-periodically forced ODEs. The computations are run in a parallel computerand its efficiency with respect to the number of processors is also discussed.
Subject(s)algorithm , computation , economics , finance , geometry , invariant (physics) , invariant manifold , mathematical analysis , mathematical physics , mathematics , order (exchange) , pure mathematics , torus
Language(s)English
ISSN1536-0040
DOI10.1137/21m1458363

Seeing content that should not be on Zendy? Contact us.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here