2008
DOI: 10.1142/s0218127408022226
|View full text |Cite
|
Sign up to set email alerts
|

Limit Cycle Bifurcations in Near-Hamiltonian Systems by Perturbing a Nilpotent Center

Abstract: As we know, Hopf bifurcation is an important part of bifurcation theory of dynamical systems. Almost all known works are concerned with the bifurcation and number of limit cycles near a nondegenerate focus or center. In the present paper, we study a general near-Hamiltonian system on the plane whose unperturbed system has a nilpotent center. We obtain an expansion for the first order Melnikov function near the center together with a computing method for the first coefficients. Using these coefficients, we obta… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 28 publications
(7 citation statements)
references
References 21 publications
0
7
0
Order By: Relevance
“…In the second case, the origin is called a nilpotent center. Limit cycle bifurcations near a nilpotent center and a cuspidal loop for general plane system were studied in [7] and [10] respectively. For the perturbation of a cuspidal loop of non-Hamiltonian systems, see [5] and the references therein.…”
Section: Consider a Planar Near-hamiltonian Systeṁmentioning
confidence: 99%
“…In the second case, the origin is called a nilpotent center. Limit cycle bifurcations near a nilpotent center and a cuspidal loop for general plane system were studied in [7] and [10] respectively. For the perturbation of a cuspidal loop of non-Hamiltonian systems, see [5] and the references therein.…”
Section: Consider a Planar Near-hamiltonian Systeṁmentioning
confidence: 99%
“…There are many works discussing bifurcations relating to nilpotent singular point, see [6,14,15,17,24,31,50]. Assume that (1.2) has a nilpotent singular point at the origin, that is to say, the function H satisfies H x (0, 0) =H y (0, 0) = 0, and…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…The algorithm was implemented in the computer algebra system Maple. Earlier, Han, Jiang & Zhu [2008] proved Theorem 2 for p > 1. Then following Han, Yang & Yu [2009], Han [2012] gave a new proof.…”
Section: Proof Of Theoremmentioning
confidence: 96%
“…Obviously, for small ε system (1) has a limit cycle near the origin if and only if the function F (h, ε, δ) has an isolated positive zero in h near h = 0. Based on the analytical property of the Melnikove function M(h, δ) and the number of limit cycles near the origin by the function, we have the following theorems (see Han, Jiang & Zhu [2008]). …”
mentioning
confidence: 99%