New method for the decomposition of mixed phase systems

K. Estola
{"title":"New method for the decomposition of mixed phase systems","authors":"K. Estola","doi":"10.1109/IECON.1993.339395","DOIUrl":null,"url":null,"abstract":"This paper introduces a new method for finding the minimum and maximum phase subsystems of a mixed phase system. The method can be easily extended to adaptive applications because of its iterative nature. Proposed method has been applied to both real and complex systems with good results. The convergence of the algorithm is determined by the roots lying closest to the unit circle.<<ETX>>","PeriodicalId":132101,"journal":{"name":"Proceedings of IECON '93 - 19th Annual Conference of IEEE Industrial Electronics","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IECON '93 - 19th Annual Conference of IEEE Industrial Electronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IECON.1993.339395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper introduces a new method for finding the minimum and maximum phase subsystems of a mixed phase system. The method can be easily extended to adaptive applications because of its iterative nature. Proposed method has been applied to both real and complex systems with good results. The convergence of the algorithm is determined by the roots lying closest to the unit circle.<>
混合相体系分解的新方法
本文介绍了一种求混合相系统最小和最大相子系统的新方法。由于其迭代特性,该方法可以很容易地扩展到自适应应用中。该方法已在实际系统和复杂系统中得到了较好的应用。算法的收敛性由离单位圆最近的根决定
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信