A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials
We present a new algorithm to compute the Jacobson form of a matrix A of polynomials over the Ore domain F(z)[x;σ,δ] n×n , for a field F. The algorithm produces unimodular U, V and the diagonal Jacobson form J such that UAV = J. It requires time polynomial in deg x (A), deg z (A) and n. We also present tight bounds on the degrees of entries in U, V and J. The algorithm is probabilistic of the Las Vegas type: we assume we are able to generate random elements of F at unit cost, and will always produces correct output within the expected time. The main idea is that a randomized, unimodular, preconditioning of A will have a Hermite form whose diagonal is equal to that of the Jacobson form. From this the reduction to the Jacobson form is easy. Polynomial-time algorithms for the Hermite form have already been established.
KeywordsNormal Form Hermite Form Degree Bound Principal Ideal Domain Unimodular Matrix
Unable to display preview. Download preview PDF.
- Giesbrecht, M., Kim, M.: Computing the Hermite form of a matrix of Ore polynomials, (submitted for publication, 2012), ArXiv: 0906.4121Google Scholar
- Jacobson, N.: The Theory of Rings. American Math. Soc., New York (1943)Google Scholar
- Levandovskyy, V., Schindelar, K.: Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases. Journal of Symbolic Computation (in press, 2012)Google Scholar
- Middeke, J.: A polynomial-time algorithm for the Jacobson form for matrices of differential operators. Technical Report 08-13, Research Institute for Symbolic Computation (RISC), Linz, Austria (2008)Google Scholar
- Middeke, J.: A computational view on normal forms of matrices of Ore polynomials. PhD thesis, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria (2011)Google Scholar