{"title":"广义系统渐近稳定的迭代判据","authors":"","doi":"10.36652/0869-4931-2020-74-5-213-219","DOIUrl":null,"url":null,"abstract":"An iterative criterion for the asymptotic steadiness of a linear descriptor system is considered. The criterion is based on an iterative algorithm for computing a generalized matrix sign-function. As an example, the problem of analyzing the asymptotic steadiness of a large descriptor system is given.\n\nKeywords\nlinear descriptor system; steadiness criterion; matrix sign-function; search algorithm","PeriodicalId":309803,"journal":{"name":"Automation. Modern Techologies","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Iterative criterion of the descriptor system asymptotic steadiness\",\"authors\":\"\",\"doi\":\"10.36652/0869-4931-2020-74-5-213-219\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An iterative criterion for the asymptotic steadiness of a linear descriptor system is considered. The criterion is based on an iterative algorithm for computing a generalized matrix sign-function. As an example, the problem of analyzing the asymptotic steadiness of a large descriptor system is given.\\n\\nKeywords\\nlinear descriptor system; steadiness criterion; matrix sign-function; search algorithm\",\"PeriodicalId\":309803,\"journal\":{\"name\":\"Automation. Modern Techologies\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Automation. Modern Techologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.36652/0869-4931-2020-74-5-213-219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automation. Modern Techologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36652/0869-4931-2020-74-5-213-219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Iterative criterion of the descriptor system asymptotic steadiness
An iterative criterion for the asymptotic steadiness of a linear descriptor system is considered. The criterion is based on an iterative algorithm for computing a generalized matrix sign-function. As an example, the problem of analyzing the asymptotic steadiness of a large descriptor system is given.
Keywords
linear descriptor system; steadiness criterion; matrix sign-function; search algorithm