Paraunitary approximation of matrices of analytic functions - the polynomial Procrustes problem

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.