Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9662380 | Computers & Mathematics with Applications | 2005 | 10 Pages |
Abstract
In this paper, the number of limit cycles in a family of polynomial systems was studied by the bifurcation methods. With the help of a computer algebra system (e.g., Maple 7.0), we obtain that the least upper bound for the number of limit cycles appearing in a global bifurcation of systems (2.1) and (2.2) is 5n + 5 + (1 â (â1)n)/2 for c â 0 and n for c â¡ 0.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Guanghui Xiang, Maoan Han, Tonghua Zhang,