z-logo
open-access-imgOpen Access
Ways for detection of the exact number of limit cycles of autonomous systems on the cylinder
Author(s) -
A. A. Hryn,
S. V. Rudzevich
Publication year - 2019
Publication title -
vescì nacyânalʹnaj akadèmìì navuk belarusì. seryâ fìzìka-matèmatyčnyh navuk
Language(s) - English
Resource type - Journals
eISSN - 2524-2415
pISSN - 1561-2430
DOI - 10.29235/1561-2430-2019-55-2-182-194
Subject(s) - cylinder , mathematics , limit (mathematics) , sign (mathematics) , divergence (linguistics) , generalization , transversality , constant (computer programming) , limit cycle , differentiable function , mathematical analysis , transversal (combinatorics) , geometry , computer science , philosophy , linguistics , programming language
For real autonomous systems of differential equations with continuously differentiable right-hand sides, the problem of detecting the exact number and localization of the second-kind limit cycles on the cylinder is considered. To solve this problem in the absence of equilibria of the system on the cylinder, we have developed our previously proposed ways consisting in a sequential two-step application of the Dulac – Cherkas test or the Dulac test. Additionally, a new way has been worked out using the generalization of the Dulac – Cherkas or Dulac test at the second step, where the requirement of constant sign for divergence is replaced by the transversality condition of the curves on which the divergence vanishes. With the help of the developed ways, closed transversal curves are found that divide the cylinder into subdomains surrounding it, in each of which the system has exactly one second-kind limit cycle. The practical efficiency of the mentioned ways is demonstrated by the example of a pendulum-type system, for which, in the absence of equilibria, the existence of exactly three second-kind limit cycles on the entire phase cylinder is proved.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here