A comparison of iterative and DFT-based polynomial matrix eigenvalue decompositions

A variety of algorithms have been developed to compute an approximate polynomial matrix eigenvalue decomposition (PEVD). As an extension of the ordinary EVD to polynomial matrices, the PEVD will generate paraunitary matrices that diagonalise a parahermitian matrix. This paper compares the decomposition accuracies of two fundamentally different methods capable of computing an approximate PEVD. The first of these --- sequential matrix diagonalisation (SMD) --- iteratively decomposes a parahermitian matrix, while the second DFT-based algorithm computes a pointwise in frequency decomposition. We demonstrate through the use of examples that both algorithms can achieve varying levels of decomposition accuracy, and provide results that indicate the type of broadband multichannel problems that are better suited to each algorithm. It is shown that iterative methods, which generate paraunitary eigenvectors, are suited for general applications with a low number of sensors, while a DFT-based approach is useful for fixed, finite order decompositions with a small number of lags