广义系统转移矩阵的最小分解

2014 18th International Conference on System Theory, Control and Computing (ICSTCC) Pub Date : 2014-12-15 DOI:10.1109/ICSTCC.2014.6982383

C. Flutur, C. Oara

{"title":"广义系统转移矩阵的最小分解","authors":"C. Flutur, C. Oara","doi":"10.1109/ICSTCC.2014.6982383","DOIUrl":null,"url":null,"abstract":"Given a generalized system whose transfer matrix function may be improper or may be polynomial, we provide necessary and sufficient conditions under which a minimal factorization does exist. The conditions are formulated in terms of deflating subspaces of pencils related to a special type of realisation, called centered, which allows to efficiently cater for poles and/or zeroes at infinity.","PeriodicalId":309866,"journal":{"name":"2014 18th International Conference on System Theory, Control and Computing (ICSTCC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Minimal factorization of transfer matrices for generalized systems\",\"authors\":\"C. Flutur, C. Oara\",\"doi\":\"10.1109/ICSTCC.2014.6982383\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a generalized system whose transfer matrix function may be improper or may be polynomial, we provide necessary and sufficient conditions under which a minimal factorization does exist. The conditions are formulated in terms of deflating subspaces of pencils related to a special type of realisation, called centered, which allows to efficiently cater for poles and/or zeroes at infinity.\",\"PeriodicalId\":309866,\"journal\":{\"name\":\"2014 18th International Conference on System Theory, Control and Computing (ICSTCC)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 18th International Conference on System Theory, Control and Computing (ICSTCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSTCC.2014.6982383\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 18th International Conference on System Theory, Control and Computing (ICSTCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTCC.2014.6982383","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

摘要给出了一类传递矩阵函数为反常函数或多项式函数的广义系统存在最小因数分解的充分必要条件。这些条件是根据铅笔的压缩子空间制定的，这些子空间与一种特殊类型的实现相关，称为居中，它可以有效地满足无穷远处的极点和/或零。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Minimal factorization of transfer matrices for generalized systems

Given a generalized system whose transfer matrix function may be improper or may be polynomial, we provide necessary and sufficient conditions under which a minimal factorization does exist. The conditions are formulated in terms of deflating subspaces of pencils related to a special type of realisation, called centered, which allows to efficiently cater for poles and/or zeroes at infinity.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 18th International Conference on System Theory, Control and Computing (ICSTCC)

自引率

0.00%

发文量