Abstract
The paper is dedicated to automatization of D-partition analysis. D-partition is one of the most common methods for determination of solution stability in systems with time-delayed feedback control and its dependency on values of control parameters. A transition from analytical form of D-partition to plain graph has been investigated. An algorithm of graph faces determination and calculation of count of characteristic equation roots with positive real part for appropriate area of D-partition has been developed. The algorithm keeps an information about analytical formulas for edges of faces. It allows to make further analytical research based on the results of computer analysis.
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.
