Polynomial Procrustes problem : paraunitary approximation of matrices of analytic functions

Tools

Weiss, Stephan and Schlecht, Sebastian J. and Das, Orchisama and de Sena, Enzo (2023) Polynomial Procrustes problem : paraunitary approximation of matrices of analytic functions. In: 31st European Signal Processing Conference, 2023-09-04 - 2023-09-08.

[thumbnail of Weiss-etal-EUSIPCO-2023-Polynomial-procrustes-problem-paraunitary-approximation-of-matrices-of-analytic-functions]
Preview
 Text. Filename: Weiss_etal_EUSIPCO_2023_Polynomial_procrustes_problem_paraunitary_approximation_of_matrices_of_analytic_functions.pdf
Accepted Author Manuscript
License: Strathprints license 1.0
Download (1MB)| Preview

Abstract

In the narrowband case, the best least squares approximation of a matrix by a unitary one is given by the Procrustes problem. In this paper, we expand this idea to matrices of analytic functions, and characterise a broadband equivalent to the narrowband case: the polynomial Procrustes problem. Its solution is based on an analytic singular value decomposition, and for the case of spectrally majorised, distinct singular values, we demonstrate the application of a suitable algorithm to three problems — time delay estimation, paraunitary matrix completion, and general paraunitary approximations — in simulations.

ORCID iDs

Weiss, Stephan ORCID logoORCID: https://orcid.org/0000-0002-3486-7206, Schlecht, Sebastian J., Das, Orchisama and de Sena, Enzo;
CORE (COnnecting REpositories)