Computing Popov and Hermite forms of rectangular polynomial matrices - Université de Limoges Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2018

Computing Popov and Hermite forms of rectangular polynomial matrices

Résumé

We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are known. Here, we present deterministic, fast algorithms for rectangular input matrices. The obtained cost bound for the Popov form matches the previous best known randomized algorithm, while the cost bound for the Hermite form improves on the previous best known ones by a factor which is at least the largest dimension of the input matrix.
Fichier principal
Vignette du fichier
rectangular_polmat_forms.pdf (798.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01701867 , version 1 (06-02-2018)
hal-01701867 , version 2 (17-05-2018)

Identifiants

  • HAL Id : hal-01701867 , version 1

Citer

Vincent Neiger, Johan Rosenkilde, Grigory Solomatov. Computing Popov and Hermite forms of rectangular polynomial matrices. 2018. ⟨hal-01701867v1⟩
196 Consultations
266 Téléchargements

Partager

Gmail Facebook X LinkedIn More