Papers
Topics
Authors
Recent
Search
2000 character limit reached

Homoclinic points of 2-D and 4-D maps via the Parametrization Method

Published 18 May 2016 in math.DS and nlin.CD | (1605.05521v2)

Abstract: An interesting problem in solid state physics is to compute discrete breather solutions in $\mathcal{N}$ coupled 1--dimensional Hamiltonian particle chains and investigate the richness of their interactions. One way to do this is to compute the homoclinic intersections of invariant manifolds of a saddle point located at the origin of a class of $2\mathcal{N}$--dimensional invertible maps. In this paper we apply the parametrization method to express these manifolds analytically as series expansions and compute their intersections numerically to high precision. We first carry out this procedure for a 2--dimensional (2--D) family of generalized Henon maps ($\mathcal{N}$=1), prove the existence of a hyperbolic set in the non-dissipative case and show that it is directly connected to the existence of a homoclinic orbit at the origin. Introducing dissipation we demonstrate that a homoclinic tangency occurs beyond which the homoclinic intersection disappears. Proceeding to $\mathcal{N}=2$, we use the same approach to determine the homoclinic intersections of the invariant manifolds of a saddle point at the origin of a 4--D map consisting of two coupled 2--D cubic H\'enon maps. In dependence of the coupling the homoclinic intersection is determined, which ceases to exist once a certain amount of dissipation is present. We discuss an application of our results to the study of discrete breathers in two linearly coupled 1--dimensional particle chains with nearest--neighbor interactions and a Klein--Gordon on site potential.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.