2018
DOI: 10.1016/j.jde.2017.11.011
|View full text |Cite
|
Sign up to set email alerts
|

Continuation of homoclinic orbits in the suspension bridge equation: A computer-assisted proof

Abstract: In this paper, we prove existence of symmetric homoclinic orbits for the suspension bridge equation u + βu + e u − 1 = 0 for all parameter values β ∈ [0.5, 1.9]. For each β, a parameterization of the stable manifold is computed and the symmetric homoclinic orbits are obtained by solving a projected boundary value problem using Chebyshev series. The proof is computer-assisted and combines the uniform contraction theorem and the radii polynomial approach, which provides an efficient means of determining a set, c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
7
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 21 publications
(7 citation statements)
references
References 28 publications
0
7
0
Order By: Relevance
“…Let us mention that this is far from being the first time that rigorous numerics are used to study connecting orbits, and that there is a rapidly growing literature on the subject, see e.g. [2,15,22,54,61,67,77].…”
Section: Rigorous A-posteriori Validation Methodsmentioning
confidence: 99%
“…Let us mention that this is far from being the first time that rigorous numerics are used to study connecting orbits, and that there is a rapidly growing literature on the subject, see e.g. [2,15,22,54,61,67,77].…”
Section: Rigorous A-posteriori Validation Methodsmentioning
confidence: 99%
“…However, when searching for periodic orbits, adding these new constraints comes with the risk of creating an overdetermined system of equations. The content of the next lemma shows, in the spirit of the discussion in [15], how one can add unfolding parameters to balance the system of equations.…”
Section: A Field (E ∂mentioning
confidence: 99%
“…Over the following decades, this argument has been used in various contexts (cf. [13,10,11,12,5,4,7] for ODE, [9,8] for computer-assisted proofs in ODE and [15] for computer-assisted proofs in DDE).…”
mentioning
confidence: 99%
“…Such approach is already well known and had been the object of several studies. The interested reader can see for example [39,62,63,99,100,101].…”
Section: Chebyshev Discretization Of the Bvpmentioning
confidence: 99%