Uniqueness of rank-one auto-correlation matrix polynomials factorization - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Uniqueness of rank-one auto-correlation matrix polynomials factorization

Marianne Clausel
David Brie

Résumé

This article characterizes the rank-one factorization of auto-correlation matrix polynomials. We establish a sufficient and necessary uniqueness condition for uniqueness of the factorization based on the greatest common divisor (GCD) of multiple polynomials. In the unique case, we show that the factorization can be carried out explicitly using GCDs. In the non-unique case, the number of non-trivially different factorizations is given and all solutions are enumerated.
Fichier principal
Vignette du fichier
main.pdf (369.94 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04062934 , version 1 (07-04-2023)
hal-04062934 , version 2 (28-08-2023)

Identifiants

  • HAL Id : hal-04062934 , version 1

Citer

Konstantin Usevich, Julien Flamant, Marianne Clausel, David Brie. Uniqueness of rank-one auto-correlation matrix polynomials factorization. 2023. ⟨hal-04062934v1⟩
86 Consultations
48 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More