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… (More)
DOI: 10.1109/CAMSAP.2017.8313113


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.