A numerical method for computing initial conditions of Lagrangian invariant tori using the frequency map

We present a numerical method for computing initial conditions of Lagrangian quasi-periodic invariant tori of Hamiltonian systems and symplectic maps. Such initial conditions are found by solving, using the Newton method, a nonlinear system obtained by imposing suitable conditions on the frequency m...

Descripción completa

Detalles Bibliográficos
Autores: Villanueva Castelltort, Jordi|||0000-0001-8725-2785, Luque Jiménez, Alejandro
Tipo de recurso: artículo
Fecha de publicación:2016
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/89912
Acceso en línea:https://hdl.handle.net/2117/89912
https://dx.doi.org/10.1016/j.physd.2016.02.014
Access Level:acceso abierto
Palabra clave:Hamiltonian systems
Quasi-periodic Lagrangian tori
Symplectic maps
Derivatives of frequencies
Fourier methods
computation
continuation
families
systems
Sistemes hamiltonians
Àrees temàtiques de la UPC::Matemàtiques i estadística
Descripción
Sumario:We present a numerical method for computing initial conditions of Lagrangian quasi-periodic invariant tori of Hamiltonian systems and symplectic maps. Such initial conditions are found by solving, using the Newton method, a nonlinear system obtained by imposing suitable conditions on the frequency map. The basic tool is a newly developed methodology to perform the frequency analysis of a discrete quasi-periodic signal, allowing to compute frequencies and their derivatives with respect to parameters. Roughly speaking, this method consists in computing suitable weighted averages of the iterates of the signal and using the Richardson extrapolation method. The proposed approach performs with high accuracy at a moderate computational cost. We illustrate the method by considering a discrete FPU model and the vicinity of the point L-4 in a RTBP. (C) 2016 Elsevier B.V. All rights reserved.