Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Complexity Year : 2017

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix

Abstract

Given a nonsingular $n \times n$ matrix of univariate polynomials over a field $\mathbb{K}$, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use $\widetilde{\mathcal{O}}(n^\omega \lceil s \rceil)$ operations in $\mathbb{K}$, where $s$ is bounded from above by both the average of the degrees of the rows and that of the columns of the matrix and $\omega$ is the exponent of matrix multiplication. The soft-$O$ notation indicates that logarithmic factors in the big-$O$ are omitted while the ceiling function indicates that the cost is $\widetilde{\mathcal{O}}(n^\omega)$ when $s = o(1)$. Our algorithms are based on a fast and deterministic triangularization method for computing the diagonal entries of the Hermite form of a nonsingular matrix.
Fichier principal
Vignette du fichier
determinant_hermite_polmat.pdf (389.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01345627 , version 1 (14-07-2016)
hal-01345627 , version 2 (29-03-2017)

Identifiers

Cite

George Labahn, Vincent Neiger, Wei Zhou. Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. Journal of Complexity, 2017, ⟨10.1016/j.jco.2017.03.003⟩. ⟨hal-01345627v2⟩
249 View
544 Download

Altmetric

Share

Gmail Facebook X LinkedIn More