UWSpace will be migrating to a new version of its software from July 29th to August 1st. UWSpace will be offline for all UW community members during this time.
Hermite form computation of matrices of differential polynomials
Abstract
Given a matrix A in F(t)[D;\delta]^{n\times n} over the ring of differential polynomials, we first prove the existence of the Hermite form H of A over this ring. Then we determine degree bounds on U and H such that UA=H. Finally, based on the degree bounds on U and H, we compute the Hermite form H of A by reducing the problem to solving a linear system of equations over F(t). The algorithm requires a polynomial number of operations in F in terms of the input sizes: n, deg_{D} A, and deg_{t} A. When F=Q it requires time polynomial in the bit-length of the rational coefficients as well.
Collections
Cite this version of the work
Myung Sub Kim
(2009).
Hermite form computation of matrices of differential polynomials. UWSpace.
http://hdl.handle.net/10012/4626
Other formats