• DOI:10.1016/J.JALGEBRA.2012.11.033
Corpus ID: 17516474

Computing the Hermite Form of a Matrix of Ore Polynomials

@article{Giesbrecht2011ComputingTH,
  title={Computing the Hermite Form of a Matrix of Ore Polynomials},
  author={M. Giesbrecht and M. S. Kim},
  journal={ArXiv},
  year={2011},
  volume={abs/1109.3656}
}

M. Giesbrecht, M. S. Kim

Published 2011

Mathematics, Computer Science

ArXiv

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… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed