Показати скорочений опис матеріалу

dc.contributor.authorCherevko, Ihor
dc.contributor.authorTuzyk, Iryna
dc.date.accessioned2022-11-18T12:02:17Z
dc.date.available2022-11-18T12:02:17Z
dc.date.issued2022-09-26
dc.identifier.isbn978-1-6654-1050-2
dc.identifier.issn2770-5226
dc.identifier.urihttps://archer.chnu.edu.ua/xmlui/handle/123456789/5716
dc.description.abstractIn this paper, an algorithm for researching the stability of linear systems using a computer is proposed. The stability of systems with delay is reduced to finding the limit conditions for the negatives of the real parts of the zeros of the corresponding quasi-polynomials. Verification in practice of such conditions is possible only in the simplest cases. The algorithm proposed in this paper is based on schemes for approximating linear systems with a delay by used sequence special of systems of linear ordinary differential equations. The equivalence of the exponential stability of systems with delay and of the proposed system of ordinary differential equations is established. This allowed us to build an algorithm for studying the location of non-asymptotic roots of quasi-polynomials, which are implemented on a computer.uk_UA
dc.language.isoenuk_UA
dc.publisher12th International Conference on Advanced Computer Information Technologiesuk_UA
dc.subjectapproximation theory , asymptotic stability , differential equations , linear differential equations , linear systems , nonlinear differential equations , polynomials , stabilityuk_UA
dc.titleAlgorithms for studying the stability of linear systems with delayuk_UA
dc.typeArticleuk_UA


Долучені файли

Thumbnail

Даний матеріал зустрічається у наступних фондах

Показати скорочений опис матеріалу