矩阵方程AX - XB = C在整数环上的可解性

Modeling, Control and Information Technologies Pub Date : 2019-11-05 DOI:10.31713/mcit.2019.04

V. Prokip

{"title":"矩阵方程AX - XB = C在整数环上的可解性","authors":"V. Prokip","doi":"10.31713/mcit.2019.04","DOIUrl":null,"url":null,"abstract":"In this communication we present conditions ofsolvability of Sylvester matrix equation AX – XB = C over integerdomains. The necessary and sufficient conditions of solvability ofSylvester equation in term of columns equivalence of matricesconstructed in a certain way by using the coefficients of thisequation are proposed","PeriodicalId":275585,"journal":{"name":"Modeling, Control and Information Technologies","volume":"04 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Solvability of the Matrix Equation AX – XB = C over Integer Rings\",\"authors\":\"V. Prokip\",\"doi\":\"10.31713/mcit.2019.04\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this communication we present conditions ofsolvability of Sylvester matrix equation AX – XB = C over integerdomains. The necessary and sufficient conditions of solvability ofSylvester equation in term of columns equivalence of matricesconstructed in a certain way by using the coefficients of thisequation are proposed\",\"PeriodicalId\":275585,\"journal\":{\"name\":\"Modeling, Control and Information Technologies\",\"volume\":\"04 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Modeling, Control and Information Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31713/mcit.2019.04\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Modeling, Control and Information Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31713/mcit.2019.04","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文给出了积分域上Sylvester矩阵方程AX - XB = C的可解性条件。利用sylvester方程的系数，给出了sylvester方程可解的充分必要条件，即以一定方式构造的矩阵的列等价

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

查看原文本刊更多论文

On Solvability of the Matrix Equation AX – XB = C over Integer Rings

In this communication we present conditions ofsolvability of Sylvester matrix equation AX – XB = C over integerdomains. The necessary and sufficient conditions of solvability ofSylvester equation in term of columns equivalence of matricesconstructed in a certain way by using the coefficients of thisequation are proposed

求助全文

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

来源期刊

Modeling, Control and Information Technologies

自引率

0.00%

发文量