Dong Lu , Dingkang Wang , Fanghui Xiao , Xiaopeng Zheng
{"title":"Equivalence and reduction of bivariate polynomial matrices to their Smith forms","authors":"Dong Lu , Dingkang Wang , Fanghui Xiao , Xiaopeng Zheng","doi":"10.1016/j.jsc.2023.01.001","DOIUrl":null,"url":null,"abstract":"<div><p><span>This paper is concerned with Smith forms of bivariate<span> polynomial matrices. For a bivariate polynomial </span></span>square matrix<span> with the determinant being the product of two distinct and irreducible univariate polynomials<span>, we prove that it is equivalent to its Smith form. We design an algorithm to reduce this class of bivariate polynomial matrices to their Smith forms, and an example is given to illustrate the algorithm. Furthermore, we extend the above class of matrices to a more general case, and derive a necessary and sufficient condition for the equivalence of a matrix and one of its all possible existing Smith forms.</span></span></p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"118 ","pages":"Pages 1-16"},"PeriodicalIF":0.6000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717123000019","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1
Abstract
This paper is concerned with Smith forms of bivariate polynomial matrices. For a bivariate polynomial square matrix with the determinant being the product of two distinct and irreducible univariate polynomials, we prove that it is equivalent to its Smith form. We design an algorithm to reduce this class of bivariate polynomial matrices to their Smith forms, and an example is given to illustrate the algorithm. Furthermore, we extend the above class of matrices to a more general case, and derive a necessary and sufficient condition for the equivalence of a matrix and one of its all possible existing Smith forms.
期刊介绍:
An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects.
It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.