Answers are grounded in this paper and cite their sources.
An algorithm for computing the eigenvalue decomposition of a para-Hermitian polynomial matrix is described. This amounts to diagonalizing the polynomial matrix by means of a paraunitary "similarity" transformation. The algorithm makes use of "elementary paraunitary transformations" and constitutes a generalization of the classical Jacobi algorithm for conventional Hermitian matrix diagonalization. A proof of convergence is presented. The application to signal processing is highlighted in terms of strong decorrelation and multichannel data compaction. Some simulated results are presented to demonstrate the capability of the algorithm
No takes yet. Share an insight, caveat, or question.
McWhirter et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: