{"title":"Computation of zeros: a decomposition algorithm for large scale systems","authors":"F. Svaricek","doi":"10.1109/CACSD.1994.288932","DOIUrl":null,"url":null,"abstract":"In this paper a new graph-theoretic decomposition algorithm for the computation of zeros of large scale systems is presented. If such a decomposition exists, the algorithm divides the computation of zeros in at least m subproblems, where m is equal to the number of inputs and outputs of a square, invertible system. Several examples illustrate the advantages of the proposed algorithm.<<ETX>>","PeriodicalId":197997,"journal":{"name":"Proceedings of IEEE Symposium on Computer-Aided Control Systems Design (CACSD)","volume":"337 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE Symposium on Computer-Aided Control Systems Design (CACSD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CACSD.1994.288932","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper a new graph-theoretic decomposition algorithm for the computation of zeros of large scale systems is presented. If such a decomposition exists, the algorithm divides the computation of zeros in at least m subproblems, where m is equal to the number of inputs and outputs of a square, invertible system. Several examples illustrate the advantages of the proposed algorithm.<>