arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1109.3656cs.SC
收藏

Ore多项式矩阵的Hermite型计算

Computing the Hermite Form of a Matrix of Ore Polynomials

Mark Giesbrecht, Myung Sub Kim

摘要:

设R=F[D; sigma,delta]是域(或斜域)F上的Ore多项式的环,其中sigma是F的自同构,delta是sigma-导子。给定R上一个m × n矩阵A,我们给出了如何计算A的Hermite型H和一个幺模矩阵U使得UA=H。该算法需要F中的多项式数量的操作,这取决于维度m和n以及A中的条目的次数。当F=k(z)时,对于某个域k,它也需要z中次数的时间多项式,并且如果k是有理数Q,它也需要系数的位长的时间多项式。显式分析的复杂性,特别是对重要的情况下,微分和移位多项式在Q(z)。为了实现我们的算法,我们应用Ore多项式环的Dieudonne行列式和拟行列式理论,得到了H和U中元素的次数和大小的显式界。

英文摘要:

Let R=F[D;sigma,delta] be the ring of Ore polynomials over a field (or skew field) F, where sigma is a automorphism of F and delta is a sigma-derivation. Given a an m by n matrix A over R, we show how to compute the Hermite form H of A and a unimodular matrix U such that UA=H. The algorithm requires a polynomial number of operations in F in terms of both the dimensions m and n, and the degree of the entries in A. When F=k(z) for some field k, it also requires time polynomial in the degree in z, and if k is the rational numbers Q, it requires time polynomial in the bit length of the coefficients as well. Explicit analyses are provided for the complexity, in particular for the important cases of differential and shift polynomials over Q(z). To accomplish our algorithm, we apply the Dieudonne determinant and quasideterminant theory for Ore polynomial rings to get explicit bounds on the degrees and sizes of entries in H and U.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑