Estimating the number of limit cycles in polynomial systems (Q973978)
From MaRDI portal
scientific article; zbMATH DE number 6141790
- On the number of limit cycles of polynomial Liénard systems
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimating the number of limit cycles in polynomial systems |
scientific article; zbMATH DE number 6141790 |
|
Statements
Estimating the number of limit cycles in polynomial systems (English)
0 references
On the number of limit cycles of polynomial Liénard systems (English)
0 references
26 May 2010
0 references
6 March 2013
0 references
The authors use algorithms of computational algebra to derive an upper bound for the number of limit cycles bifurcating from a center or a focus of a polynomial vector field. For the cubic system \[ \dot x= x+ ax^2+ bxy+ cy^3,\qquad \dot y= -y+ kxy+ my^2+ lx^3, \] it is proved that, in the generic case, at most six limit cycles can bifurcate from any center or focus at the origin of the system.
0 references
Consider the polynomial Liénard system \[ {dx\over dt}= y,\quad{dy\over dt}= -g(x)-\varepsilon f(x)y,\tag{\(*\)} \] where \(\varepsilon\) is a small parameter, \(f\) and \(g\) are polynomials of degree \(n\) and \(m\), respectively. Let \(H(n,m)\) be the maximum number of limit cycles of system \((*)\) in the phase plane for \(\varepsilon\) sufficiently small. The authors derive new lower bounds for \(H(n,m)\) which improve significantly existing results. In particular, they obtain the following estimates \[ \begin{aligned} H(n,4) &\geq H(n,3)\geq 2\Biggl[{n-1\over 4}\Biggr]+ \Biggl[{n-1\over 2}\Biggr]\quad\text{for }n\geq 3,\\ H(n,6) &\geq 2\Biggl[{n-1\over 3}\Biggr]+ \Biggl[{n-1\over 2}\Biggr]\quad\text{for }n\geq 5,\\ H(n,7) &\geq{3\over 2} n-9\quad\text{for }n\geq 7.\end{aligned} \]
0 references
limit cycles
0 references
bifurcations
0 references
cyclicity
0 references
limit cycle
0 references
polynomial Liénard system
0 references
global bifurcation
0 references
0 references
