{"title":"不确定离散时间系统的H/sub / 2/和/或H/sub /spl -范数模型约简","authors":"E. Assunção, P. Peres","doi":"10.1109/ACC.1999.786428","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of model reduction for uncertain discrete-time systems with convex bounded (polytope type) uncertainty. A reduced order precisely known model is obtained in such a way that the H/sub 2/ and/or the H/sub /spl infin// guaranteed norm of the error between the original (uncertain) system and the reduced one is minimized. The optimization problems are formulated in terms of coupled (nonconvex) linear matrix inequalities, being solved through iterative algorithms. Examples illustrate the results.","PeriodicalId":441363,"journal":{"name":"Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"H/sub 2/ and/or H/sub /spl infin//-norm model reduction of uncertain discrete-time systems\",\"authors\":\"E. Assunção, P. Peres\",\"doi\":\"10.1109/ACC.1999.786428\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of model reduction for uncertain discrete-time systems with convex bounded (polytope type) uncertainty. A reduced order precisely known model is obtained in such a way that the H/sub 2/ and/or the H/sub /spl infin// guaranteed norm of the error between the original (uncertain) system and the reduced one is minimized. The optimization problems are formulated in terms of coupled (nonconvex) linear matrix inequalities, being solved through iterative algorithms. Examples illustrate the results.\",\"PeriodicalId\":441363,\"journal\":{\"name\":\"Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACC.1999.786428\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACC.1999.786428","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
H/sub 2/ and/or H/sub /spl infin//-norm model reduction of uncertain discrete-time systems
This paper addresses the problem of model reduction for uncertain discrete-time systems with convex bounded (polytope type) uncertainty. A reduced order precisely known model is obtained in such a way that the H/sub 2/ and/or the H/sub /spl infin// guaranteed norm of the error between the original (uncertain) system and the reduced one is minimized. The optimization problems are formulated in terms of coupled (nonconvex) linear matrix inequalities, being solved through iterative algorithms. Examples illustrate the results.