On factorization of rank-one auto-correlation matrix polynomials
Numerical Analysis
2023-08-30 v1 Numerical Analysis
Abstract
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.
Cite
@article{arxiv.2308.15106,
title = {On factorization of rank-one auto-correlation matrix polynomials},
author = {Konstantin Usevich and Julien Flamant and Marianne Clausel and David Brie},
journal= {arXiv preprint arXiv:2308.15106},
year = {2023}
}