2021
DOI: 10.3934/jcd.2021004
|View full text |Cite
|
Sign up to set email alerts
|

A general framework for validated continuation of periodic orbits in systems of polynomial ODEs

Abstract: In this paper a parametrized Newton-Kantorovich approach is applied to continuation of periodic orbits in arbitrary polynomial vector fields. This allows us to rigorously validate numerically computed branches of periodic solutions. We derive the estimates in full generality and present sample continuation proofs obtained using an implementation in Matlab. The presented approach is applicable to any polynomial vector field of any order and dimension. A variety of examples is presented to illustrate the efficac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 26 publications
(71 reference statements)
0
4
0
Order By: Relevance
“…On the other hand, mathematically rigorous computer-assisted methods for studying continuous branches of periodic orbits are by now quite advanced. This is true even in the case of DDEs, and we refer for example to the work of [41,42,43,44,45,46]. Moreover, methods of computer-assisted proof have been developed for proving the existence of, and continuing through, a number of infinite dimensional bifurcations.…”
Section: Discussionmentioning
confidence: 99%
“…On the other hand, mathematically rigorous computer-assisted methods for studying continuous branches of periodic orbits are by now quite advanced. This is true even in the case of DDEs, and we refer for example to the work of [41,42,43,44,45,46]. Moreover, methods of computer-assisted proof have been developed for proving the existence of, and continuing through, a number of infinite dimensional bifurcations.…”
Section: Discussionmentioning
confidence: 99%
“…Orbits can be proven in the vicinity of (and at) Hopf bifurcations, whether these are non-degenerate or degenerate. The first major release of the library BiValVe (Bifurcation Validation Venture, [4]) is being made in conjunction with the present work, and builds on an earlier version of the code associated to the work [29,30]. Some non-polynomial delay differential equations can be handled using the polynomial embedding technique.…”
Section: Contributions and Applicationsmentioning
confidence: 99%
“…• in the 1 ν (C n+m ) components: convolution polynomials of the form (29) involving Fourier components coming from the set…”
Section: The Bound Z 21mentioning
confidence: 99%
“…The first extension is to let the vector field explicitly depend on a parameter and to perform rigorous (pseudo-arclength) continuation of connecting orbits. This involves a relatively straightforward application of the uniform contraction principle and a slight modification of the estimates developed in this paper (see [7,25,28,31] for instance). Furthermore, in order to carry out continuation efficiently, we need to develop algorithms (heuristics) which automatically determine near-optimal parameter values for the validation of the charts on the local (un)stable manifolds and the connecting orbit.…”
Section: Extensions and Future Workmentioning
confidence: 99%