{"title":"相对素数多项式矩阵:算法","authors":"E. Emre, L. Silverman","doi":"10.1109/CDC.1975.270676","DOIUrl":null,"url":null,"abstract":"In this paper, the problem of obtaining a pair of relatively prime polynomial matrices from two given polynomial matrices is considered. A method to check relative primeness, in the form of a rank condition on a constant matrix, as well as an algorithm to obtain relatively polynomial matrices is developed.","PeriodicalId":164707,"journal":{"name":"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes","volume":"121 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1975-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Relatively prime polynomial matrices: Algorithms\",\"authors\":\"E. Emre, L. Silverman\",\"doi\":\"10.1109/CDC.1975.270676\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the problem of obtaining a pair of relatively prime polynomial matrices from two given polynomial matrices is considered. A method to check relative primeness, in the form of a rank condition on a constant matrix, as well as an algorithm to obtain relatively polynomial matrices is developed.\",\"PeriodicalId\":164707,\"journal\":{\"name\":\"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes\",\"volume\":\"121 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1975-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1975.270676\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1975.270676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, the problem of obtaining a pair of relatively prime polynomial matrices from two given polynomial matrices is considered. A method to check relative primeness, in the form of a rank condition on a constant matrix, as well as an algorithm to obtain relatively polynomial matrices is developed.