{"title":"连续时间系统的最优逼近","authors":"M. Bettayeb, L. Silverman, M. Safonov","doi":"10.1109/CDC.1980.271777","DOIUrl":null,"url":null,"abstract":"In [1], the problem of optimally approximating a discrete-time system by a lower-order system was solved based on a remarkable theoretical result of Adamjan, Arov and Krein [2]. In this paper, we derive similar reduced models for continuous-time systems using a new approach based on the system structure of the finite dimensional model. Concrete algorithms are developed for finding approximations of any specified order. These approximations are optimal in a well defined sense.","PeriodicalId":332964,"journal":{"name":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1980-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"67","resultStr":"{\"title\":\"Optimal approximation of continuous-time systems\",\"authors\":\"M. Bettayeb, L. Silverman, M. Safonov\",\"doi\":\"10.1109/CDC.1980.271777\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In [1], the problem of optimally approximating a discrete-time system by a lower-order system was solved based on a remarkable theoretical result of Adamjan, Arov and Krein [2]. In this paper, we derive similar reduced models for continuous-time systems using a new approach based on the system structure of the finite dimensional model. Concrete algorithms are developed for finding approximations of any specified order. These approximations are optimal in a well defined sense.\",\"PeriodicalId\":332964,\"journal\":{\"name\":\"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"67\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1980.271777\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1980.271777","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In [1], the problem of optimally approximating a discrete-time system by a lower-order system was solved based on a remarkable theoretical result of Adamjan, Arov and Krein [2]. In this paper, we derive similar reduced models for continuous-time systems using a new approach based on the system structure of the finite dimensional model. Concrete algorithms are developed for finding approximations of any specified order. These approximations are optimal in a well defined sense.