How to estimate the number of limit cycles in Liénard systems with a small parameter (Q641965)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to estimate the number of limit cycles in Liénard systems with a small parameter |
scientific article; zbMATH DE number 5963548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to estimate the number of limit cycles in Liénard systems with a small parameter |
scientific article; zbMATH DE number 5963548 |
Statements
How to estimate the number of limit cycles in Liénard systems with a small parameter (English)
0 references
25 October 2011
0 references
Consider the Liénard systems \[ {dx\over dt}= y-F(x),\quad{dy\over dt}=-\mu g(x),\tag{1} \] \[ {dx\over dt}= y-\varepsilon F(x),\quad {dy\over dt}=-g(x),\tag{2} \] where \(\mu\) and \(\varepsilon\) are small parameters, \(F\) and \(g\) are polynomials satisfying \[ xg(x)> 0\quad\text{for }x\neq 0,\quad g(0)= F(0)= 0. \] The authors are interested in approximating the limit cycles of (1) and (2) located in the strip \(-p\leq x\leq q\). For this purpose, they use the inverse integrating factor and the generalized Dulac function (the so-called Dulac-Cherkas function). These functions are considered as polynomials in \(y\) of degree \(n-1\) whose coefficients depend on some constants \(C_1,\dotsc, C_n\), \(x\) and on some small parameter. By means of linear programming, approximations of the functions under consideration are constructed. Examples illustrate the idea and usefulness of the suggested procedure.
0 references
0.8444803357124329
0 references
0.8318271636962891
0 references
0.8247237205505371
0 references
0.8208200335502625
0 references