2000 character limit reached
On Minor Left Prime Factorization Problem for Multivariate Polynomial Matrices
Published 14 Oct 2020 in cs.SC | (2010.06998v1)
Abstract: A new necessary and sufficient condition for the existence of minor left prime factorizations of multivariate polynomial matrices without full row rank is presented. The key idea is to establish a relationship between a matrix and its full row rank submatrix. Based on the new result, we propose an algorithm for factorizing matrices and have implemented it on the computer algebra system Maple. Two examples are given to illustrate the effectiveness of the algorithm, and experimental data shows that the algorithm is efficient.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.