1999
DOI: 10.1017/s0305004199003795
|View full text |Cite
|
Sign up to set email alerts
|

The number of limit cycles due to polynomial perturbations of the harmonic oscillator

Abstract: We consider arbitrary polynomial perturbationsformula hereof the harmonic oscillator. In (1), f and g are polynomials of x, y with coefficients depending analytically on the small parameter ε. Let us denote n = max (deg f, deg g), H = ½(x2 + y2). Using the energy level H = h as a parameter, we can express the first return mapping of (1) in terms of h and ε. For the corresponding displacement function d(h, ε) = [Pscr ](h, ε)−h we obtain the following representation as a power series in ε:formula here… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

3
50
0

Year Published

2006
2006
2017
2017

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 44 publications
(53 citation statements)
references
References 3 publications
(4 reference statements)
3
50
0
Order By: Relevance
“…It is well known that, up to a first order analysis in ε, perturbing the linear center with arbitrary polynomials of degree n, we can only obtain [(n−1)/2] limit cycles for the perturbed system, where [·] denotes the integer part function, see [16]. On the other hand but in the same class of systems, in [20] it is proved that the maximum number of limit cycles is lower or equal than [N (n − 1)/2]. This upper bound, in general, is reached when n is large enough and N = 2.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…It is well known that, up to a first order analysis in ε, perturbing the linear center with arbitrary polynomials of degree n, we can only obtain [(n−1)/2] limit cycles for the perturbed system, where [·] denotes the integer part function, see [16]. On the other hand but in the same class of systems, in [20] it is proved that the maximum number of limit cycles is lower or equal than [N (n − 1)/2]. This upper bound, in general, is reached when n is large enough and N = 2.…”
Section: Introductionmentioning
confidence: 99%
“…, 10. In [20], considering perturbations of a linear center by quadratic polynomials, it is shown that when N = 1, . .…”
Section: Introductionmentioning
confidence: 99%
“…Following the ideas of Iliev, in [2] the authors study the number of zeros of the Melnikov function at any order for system (2) in the case in which G = (x 2 + y 2 ) m−1 . Our system (2) generalizes the systems studied in [8] and [2] because the unperturbed part is taken to be more general and we extend their results to this more general situation.…”
Section: Introduction and Statement Of The Main Resultsmentioning
confidence: 86%
“…The first one goes back to Iliev [8] were he was the first one in doing so. Due to the fact that this is an extremely hard problem involving very difficult computations, he started with the linear center, i.e., system (2) with G = 1.…”
Section: Introduction and Statement Of The Main Resultsmentioning
confidence: 99%
“…Iliev [19] in 1999 considered the polynomial vector fields X (x, y) = − y + εP (x, y, ε), x + εQ(x, y, ε) , of degree n > 1 (i.e. the maximum of the degrees of polynomials P and Q is n), which depend analytically on the small parameter ε, and he studied how many limit cycles can bifurcate from the periodic orbits of the linear centerẋ = −y,ẏ = x when ε > 0 is sufficiently small.…”
Section: Introduction and Statement Of The Main Resultsmentioning
confidence: 99%