The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2014
DOI: 10.1007/s10884-014-9367-0
|View full text |Cite
|
Sign up to set email alerts
|

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

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 NewtonKantorovich 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
66
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
3

Relationship

2
4

Authors

Journals

citations
Cited by 47 publications
(66 citation statements)
references
References 37 publications
0
66
0
Order By: Relevance
“…Other studies which utilize high order expansions of stable/unstable manifolds in order to study connecting orbits between fixed points and equilibria of discrete time dynamical systems and differential equations are found in [56,57]. This idea can also be exploited in order to obtain computer assisted proof of the existence of connecting orbits [60,63,61]. In this section we discuss some numerical computations for homoclinic connections of periodic orbits exploiting the high order parameterization of the present work.…”
Section: Preconditioning the Methods Of Projected Boundarymentioning
confidence: 99%
See 4 more Smart Citations
“…Other studies which utilize high order expansions of stable/unstable manifolds in order to study connecting orbits between fixed points and equilibria of discrete time dynamical systems and differential equations are found in [56,57]. This idea can also be exploited in order to obtain computer assisted proof of the existence of connecting orbits [60,63,61]. In this section we discuss some numerical computations for homoclinic connections of periodic orbits exploiting the high order parameterization of the present work.…”
Section: Preconditioning the Methods Of Projected Boundarymentioning
confidence: 99%
“…A useful feature of methods based on Parameterization is that they admit natural a-posteriori error indicators. This notion can be used in order to obtain mathematically rigorous error bounds on the numerical approximation of the invariant manifolds by computer assisted analysis [63,60,61].…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations