{"title":"从状态方程中获得多项式表示的计算程序","authors":"F. Brasch, J. V. Van Ness","doi":"10.1109/CDC.1975.270575","DOIUrl":null,"url":null,"abstract":"This paper presents a new procedure for determining, from the state equations, the factored matrix form of the transfer matrix of a linear time-invariant system given in state variable form. The procedure is conceptually straightforward and demonstrates a connection between the desired representation and the representation of a lower order imbedded subsystem. Applying the basic procedure recursively leads to a computational algorithm for determining the desired representation. The algorithm differs from those presented previously in that explicit computation of a controllabillty or observability matrix is not required.","PeriodicalId":164707,"journal":{"name":"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes","volume":"749 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1975-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A computational procedure for obtaining a polynomial representation from state equations\",\"authors\":\"F. Brasch, J. V. Van Ness\",\"doi\":\"10.1109/CDC.1975.270575\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new procedure for determining, from the state equations, the factored matrix form of the transfer matrix of a linear time-invariant system given in state variable form. The procedure is conceptually straightforward and demonstrates a connection between the desired representation and the representation of a lower order imbedded subsystem. Applying the basic procedure recursively leads to a computational algorithm for determining the desired representation. The algorithm differs from those presented previously in that explicit computation of a controllabillty or observability matrix is not required.\",\"PeriodicalId\":164707,\"journal\":{\"name\":\"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes\",\"volume\":\"749 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1975-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1975.270575\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1975.270575","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A computational procedure for obtaining a polynomial representation from state equations
This paper presents a new procedure for determining, from the state equations, the factored matrix form of the transfer matrix of a linear time-invariant system given in state variable form. The procedure is conceptually straightforward and demonstrates a connection between the desired representation and the representation of a lower order imbedded subsystem. Applying the basic procedure recursively leads to a computational algorithm for determining the desired representation. The algorithm differs from those presented previously in that explicit computation of a controllabillty or observability matrix is not required.