Article ID Journal Published Year Pages File Type
4946008 Journal of Symbolic Computation 2017 14 Pages PDF
Abstract
In this paper, we study the bound of the number of limit cycles by Poincaré bifurcation for a Liénard system of type (4,3). An automatic algorithm is constructed based on the Chebyshev criteria and the tools of regular chain theory in polynomial algebra. We prove the system can bifurcate at most 6 limit cycles from the periodic annulus by this algorithm and at least 4 limit cycles by asymptotic expansions of the related Melnikov functions.
Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Authors
, ,