Uniqueness of rank-one auto-correlation matrix polynomials factorization
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.
Domaines
Analyse numérique [math.NA]Origine | Fichiers produits par l'(les) auteur(s) |
---|