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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
