Paraunitary approximation of matrices of analytic functions - the polynomial Procrustes problem
Weiss S, Schlecht SJ, Das O, De Sena E (2024)
Publication Type: Journal article
Publication year: 2024
Journal
Book Volume: 10
Pages Range: 100318
Article Number: 100318
DOI: 10.1016/j.sctalk.2024.100318
Abstract
The best least squares approximation of a matrix, typically e.g. characterising gain factors in narrowband problems, by a unitary one is addressed by the Procrustes problem. Here, we extend this idea to the case of matrices of analytic functions, and characterise a broadband equivalent to the narrowband approach which we term the polynomial Procrustes problem. Its solution relies 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 via simulations: (i) time delay estimation, (ii) paraunitary matrix completion, and (iii) general paraunitary approximations.
Authors with CRIS profile
Involved external institutions
University of Surrey
United Kingdom (GB)
University of Strathclyde
United Kingdom (GB)
Aalto University Espoo
Finland (FI)
United Kingdom (GB)
University of Strathclyde
United Kingdom (GB)
Aalto University Espoo
Finland (FI)
How to cite
APA:
Weiss, S., Schlecht, S.J., Das, O., & De Sena, E. (2024). Paraunitary approximation of matrices of analytic functions - the polynomial Procrustes problem. Science Talks, 10, 100318. https://doi.org/10.1016/j.sctalk.2024.100318
MLA:
Weiss, Stephan, et al. "Paraunitary approximation of matrices of analytic functions - the polynomial Procrustes problem." Science Talks 10 (2024): 100318.
BibTeX: Download