平衡模型约简的Schur方法

M. Safonov, R. Chiang
{"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}
引用次数: 170

摘要

在Moore的“平衡变换”模型约简过程中,计算所需的平衡变换往往条件很差,特别是对于从模型约简中获益最多的非最小模型。本文证明了摩尔约简模型可以直接计算,而不需要通过任意基定义的与可达性和可控性文法的积PQ的“大”特征值相关的左右特征空间的投影来平衡。提出了两种计算这些基的方法,一种是基于PQ的有序Schur分解,另一种是基于P和q的Cholesky因子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Schur Method for Balanced Model Reduction
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reachable Set Control For Preferred Axis Homing Missiles Parallel Algorithms for Large Scale Power System Dynamic Simulation On the Stability of a Self-Tuning Controller in the Presence of Bounded Disturbances Evaluation and Time-Scaling of Trajectories for Wheeled Mobile Robots Dynamics and Tuning of Systems with Large Delay
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1