Algorithm for Studying the Stability of Linear Systems with Many Delays

I. Tuzyk, I. Cherevko
{"title":"Algorithm for Studying the Stability of Linear Systems with Many Delays","authors":"I. Tuzyk, I. Cherevko","doi":"10.1109/ACIT54803.2022.9912755","DOIUrl":null,"url":null,"abstract":"In 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.","PeriodicalId":431250,"journal":{"name":"2022 12th International Conference on Advanced Computer Information Technologies (ACIT)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 12th International Conference on Advanced Computer Information Technologies (ACIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACIT54803.2022.9912755","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In 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.
研究多时滞线性系统稳定性的算法
本文提出了一种用计算机研究线性系统稳定性的算法。将时滞系统的稳定性问题简化为求相应拟多项式零点实部负的极限条件。只有在最简单的情况下才有可能在实践中验证这些条件。本文提出的算法是基于利用线性常微分方程系统的序列特殊逼近具有时滞的线性系统的格式。建立了时滞系统的指数稳定性与所提常微分方程组的指数稳定性的等价性。这使我们能够建立一个算法来研究拟多项式的非渐近根的位置,这是在计算机上实现的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信