Pith. sign in

REVIEW

Numerical computation of high-order expansions of invariant manifolds of high-dimensional tori

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.05003 v1 pith:ZAYY5TQE submitted 2024-01-10 math.DS physics.class-ph

classification math.DSphysics.class-ph
keywords computemanifoldstorusinvarianttorifouriernumberunstable
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this paper we present a procedure to compute reducible invariant tori and their stable and unstable manifolds in stroboscopic Poincar\'e maps. The method has two steps. In the first step we compute, by means of a quadratically convergent scheme, the Fourier series of the torus, its Floquet transformation, and its Floquet matrix. If the torus has stable and/or unstable directions, in the second step we compute the Taylor-Fourier expansions of the corresponding invariant manifolds up to a given order. The paper also discusses the case in which the torus is highly unstable so that a multiple shooting strategy is needed to compute the torus. If the order of the Taylor expansion of the manifolds is fixed and N is the number of Fourier modes, the whole computational effort (torus and manifolds) increases as O(N log N) q and the memory required behaves as O(N). This makes the algorithm very suitable to compute high-dimensional tori for which a huge number of Fourier modes are needed. Besides, the algorithm has a very high degree of parallelism. The paper includes examples where we compute invariant tori (of dimensions up to 5) of quasi-periodically forced ODEs. The computations are run in a parallel computer and its efficiency with respect to the number of processors is also discussed.

Discussion (0). Continue with ORCID to comment.

Pith tools