{"title":"平衡模型约简的Schur方法","authors":"M. Safonov, R. Chiang","doi":"10.23919/ACC.1988.4789873","DOIUrl":null,"url":null,"abstract":"The calculation of the balancing transformation required in Moore's \"balanced-transformation\" model reduction procedure tends to be badly conditioned, especially for non-minimal models that stand to benifit the most from model reduction. In this paper it is shown that the Moore reduced model can be computed directly without balancing via projections defined in terms of arbitary bases for the left and right eigenspaces associated with the \"large\" eigenvalues of the product PQ of the reachability and controllablility grammians. Two methods for computing these bases are proposed, one based on the ordered Schur decomposition of PQ and the other based on the Cholesky factors of P and Q. The algorithms perform reliably even for non-minimal models.","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":"34 1","pages":"1036-1040"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"170","resultStr":"{\"title\":\"A Schur Method for Balanced Model Reduction\",\"authors\":\"M. Safonov, R. Chiang\",\"doi\":\"10.23919/ACC.1988.4789873\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The calculation of the balancing transformation required in Moore's \\\"balanced-transformation\\\" model reduction procedure tends to be badly conditioned, especially for non-minimal models that stand to benifit the most from model reduction. In this paper it is shown that the Moore reduced model can be computed directly without balancing via projections defined in terms of arbitary bases for the left and right eigenspaces associated with the \\\"large\\\" eigenvalues of the product PQ of the reachability and controllablility grammians. Two methods for computing these bases are proposed, one based on the ordered Schur decomposition of PQ and the other based on the Cholesky factors of P and Q. The algorithms perform reliably even for non-minimal models.\",\"PeriodicalId\":6395,\"journal\":{\"name\":\"1988 American Control Conference\",\"volume\":\"34 1\",\"pages\":\"1036-1040\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"170\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1988 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ACC.1988.4789873\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1988 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ACC.1988.4789873","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The calculation of the balancing transformation required in Moore's "balanced-transformation" model reduction procedure tends to be badly conditioned, especially for non-minimal models that stand to benifit the most from model reduction. In this paper it is shown that the Moore reduced model can be computed directly without balancing via projections defined in terms of arbitary bases for the left and right eigenspaces associated with the "large" eigenvalues of the product PQ of the reachability and controllablility grammians. Two methods for computing these bases are proposed, one based on the ordered Schur decomposition of PQ and the other based on the Cholesky factors of P and Q. The algorithms perform reliably even for non-minimal models.