A parameterization method for the computation of invariant tori and their whiskers in quasi-periodic maps: Numerical algorithms

108Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

In this paper we develop several numerical algorithms for the computation of invariant manifolds in quasi-periodically forced systems. The invariant manifolds we consider are invariant tori and the asymptotic invariant manifolds (whiskers) to these tori. The algorithms are based on the parameterization method described in [36], where some rigorous results are proved. In this paper, we concentrate on numerical issues of algorithms. Examples of implementations appear in the companion paper [34]. The algorithms for invariant tori are based essentially on Newton method, but taking advantage of dynamical properties of the torus, such as hyperbolicity or reducibility as well as geometric properties. The algorithms for whiskers are based on power-matching expansions of the parameterizations. Whiskers include as particular cases the usual (strong) stable and (strong) unstable manifolds, and also, in some cases, the slow manifolds which dominate the asymptotic behavior of solutions converging to the torus.

Cite

CITATION STYLE

APA

Haro, À., & De La Llave, R. (2006). A parameterization method for the computation of invariant tori and their whiskers in quasi-periodic maps: Numerical algorithms. Discrete and Continuous Dynamical Systems - Series B, 6(6), 1261–1300. https://doi.org/10.3934/dcdsb.2006.6.1261

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free