{"title":"描述系统:基本矩阵,可达性和可观察性矩阵,子空间","authors":"Frank L. Lewis","doi":"10.1109/CDC.1984.272360","DOIUrl":null,"url":null,"abstract":"This paper uses the fundamental matrix of a regular discrete descriptor system to derive expressions for descriptor reachability and observability matrices. Reachable and unobservable subspaces and a subspace of admissible boundary conditions are defined. It is shown that the natural space for analyzing descriptor system properties seems to be R2n (where n is the dimension of the system), not Rn as is the case for state-space systems. Solutions are provided for the descriptor open-loop control and estimation problems.","PeriodicalId":269680,"journal":{"name":"The 23rd IEEE Conference on Decision and Control","volume":"263 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Descriptor systems: Fundamental matrix, reachability and observability matrices, subspaces\",\"authors\":\"Frank L. Lewis\",\"doi\":\"10.1109/CDC.1984.272360\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper uses the fundamental matrix of a regular discrete descriptor system to derive expressions for descriptor reachability and observability matrices. Reachable and unobservable subspaces and a subspace of admissible boundary conditions are defined. It is shown that the natural space for analyzing descriptor system properties seems to be R2n (where n is the dimension of the system), not Rn as is the case for state-space systems. Solutions are provided for the descriptor open-loop control and estimation problems.\",\"PeriodicalId\":269680,\"journal\":{\"name\":\"The 23rd IEEE Conference on Decision and Control\",\"volume\":\"263 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 23rd IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1984.272360\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 23rd IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1984.272360","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Descriptor systems: Fundamental matrix, reachability and observability matrices, subspaces
This paper uses the fundamental matrix of a regular discrete descriptor system to derive expressions for descriptor reachability and observability matrices. Reachable and unobservable subspaces and a subspace of admissible boundary conditions are defined. It is shown that the natural space for analyzing descriptor system properties seems to be R2n (where n is the dimension of the system), not Rn as is the case for state-space systems. Solutions are provided for the descriptor open-loop control and estimation problems.