Journal of Dynamics and Differential Equations

, Volume 26, Issue 2, pp 267–313

Computer Assisted Proof of Transverse Saddle-to-Saddle Connecting Orbits for First Order Vector Fields

  • Jean-Philippe Lessard
  • Jason D. Mireles James
  • Christian Reinhardt
Article

DOI: 10.1007/s10884-014-9367-0

Cite this article as:
Lessard, JP., Mireles James, J.D. & Reinhardt, C. J Dyn Diff Equat (2014) 26: 267. doi:10.1007/s10884-014-9367-0

Abstract

In this paper we introduce a computational method for proving the existence of generic saddle-to-saddle connections between equilibria of first order vector fields. The first step consists of rigorously computing high order parametrizations of the local stable and unstable manifolds. If the local manifolds intersect, the Newton–Kantorovich theorem is applied to validate the existence of a so-called short connecting orbit. If the local manifolds do not intersect, a boundary value problem with boundary values in the local manifolds is rigorously solved by a contraction mapping argument on a ball centered at the numerical solution, yielding the existence of a so-called long connecting orbit. In both cases our argument yields transversality of the corresponding intersection of the manifolds. The method is applied to the Lorenz equations, where a study of a pitchfork bifurcation with saddle-to-saddle stability is done and where several proofs of existence of short and long connections are obtained.

Keywords

Computer assisted proofInvariant manifoldsParameterization methodConnecting orbitsContraction mappingTransversality

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Jean-Philippe Lessard
    • 1
  • Jason D. Mireles James
    • 2
  • Christian Reinhardt
    • 3
  1. 1.Département de Mathématiques et de StatistiqueUniversité LavalQuébecCanada
  2. 2.Department of MathematicsRutgers UniversityPiscatawayUSA
  3. 3.Technische Universität MünchenGarchingGermany