Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Recolector de Cienci...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2022
Data sources: zbMATH Open
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
SIAM Journal on Applied Dynamical Systems
Article . 2022 . Peer-reviewed
Data sources: Crossref
https://dx.doi.org/10.48550/ar...
Article . 2024
License: CC BY
Data sources: Datacite
DBLP
Article . 2023
Data sources: DBLP
versions View all 11 versions
addClaim

Numerical Computation of High-Order Expansions of Invariant Manifolds of High-Dimensional Tori

Numerical computation of high-order expansions of invariant manifolds of high-dimensional tori
Authors: Joan Gimeno; Àngel Jorba; Begoña Nicolás; Estrella Olmedo;

Numerical Computation of High-Order Expansions of Invariant Manifolds of High-Dimensional Tori

Abstract

In this paper we present a procedure to compute reducible invariant tori and their stable and unstable manifolds in stroboscopic Poincaré 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.

Country
Spain
Keywords

Parallel computing, Quasi-periodic motions and invariant tori for nonlinear problems in mechanics, FOS: Physical sciences, Physics - Classical Physics, Dynamical Systems (math.DS), parametrization method, FOS: Mathematics, Differentiable dynamical systems, Mathematics - Dynamical Systems, Computational methods for invariant manifolds of dynamical systems, jet transport, Quasi-periodic Floquet theory, Jet transport, Anàlisi numèrica, Parallel processing (Electronic computers), parallel computing, Parametrization method, Processament en paral·lel (Ordinadors), Classical Physics (physics.class-ph), Sistemes dinàmics diferenciables, quasi-periodic Floquet theory, Parallel algorithms in computer science, Numerical analysis

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    3
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 104
    download downloads 131
  • 104
    views
    131
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
3
Top 10%
Average
Average
104
131
Green